id stringlengths 1 6 | url stringlengths 16 1.82k | content stringlengths 37 9.64M |
|---|---|---|
14100 | https://maths.dur.ac.uk/stats/stats2/practical_1-4.html | Practical 1-4: Bayesian analysis of Poisson data
1 The Data
2 Conjugate analysis with the Gamma-Poisson model
2.1 The Theory
2.2 The prior
2.3 The likelihood
2.4 The posterior
3 Further Exercises: Exploring the effects of prior choice and sample size
3.1 Changing the prior parameters
3.2 Updating beliefs with large samples
Statistical Inference 2
Home
Term 1
Practical 1 - Introduction to R
Practical 2 - Sampling and Simulation
Practical 3 - Likelihood Inference
Practical 4 - Bayesian Inference
Term 2
Practical 1
Practical 2
Practical 3
Practical 4
Practical 5
Install
R Help
1. Getting Started
2. Variables
3. Functions
4. Vectors
5. Standard statistical functions
6. Matrices and data frames
7. Plots
8. Advanced Plots
9. Programming
10. Statistical methods
Cheatsheet: RStudio infterface
Cheatsheet: Base R
Practical 1-4: Bayesian analysis of Poisson data
In this practical we use R to investigate the conjugate Bayesian analysis for Poisson data. We will also investigate using the effects of the prior distribution on the posterior, and the situation where our sample size grows large.
Download the R Script - right click, and Save As
You will need the following skills from previous practicals:
Creating vectors with seq
Drawing a plot of a known function using curve
Using additional graphical parameters to customise plots with colour (col), line type (lty), axis range (xlim and ylim) etc
Adding simple straight lines to plots with abline
Writing your own functions with function
New R techniques:
Using plot to draw plots of general data, and lines and point to add additional data
Using R’s built-in functions to evaluate a standard pdf, e.g.dgamma and dnorm
Using the quantile functions, e.g.qgamma, to produce exact credible intervals using standard distributions
Using sapply to evaluate a function with different arguments specified by the element of a vector
1 The Data
Our dataset concerns the number of volcanoes that erupted each year from 2000 to 2018, taken from here. The data are given in the table below, where each volcanic eruption is counted in the year that the eruption started. Volcanic eruptions are split into groups depending on the severity of the eruption, as measured on the logarithmically-scaled Volcanic Explosivity Index (VEI). For example, the 2010 eruption of Eyjafjallajökull in Iceland had a VEI of 4, whereas the eruption of Krakatoa in 1883 was VEI6.
The eruptions are loosely classified as Small (VEI≤2≤2), Medium (2<2< VEI <4<4), and Large (VEI ≥4≥4).
Year 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009
Small 30 25 30 32 29 29 34 29 25 28
Medium 6 6 5 5 8 4 3 3 7 2
Large 0 0 0 2 1 1 1 3 2 1
Year 2010 2011 2012 2013 2014 2015 2016 2017 2018
Small 39 30 40 40 41 26 37 30 34
Medium 6 6 4 7 7 5 4 6 4
Large 3 0 1 0 1 0 2 0 1
Run the R code below to input the data, and create a new data frame called volcano, with columns Year, Small, Medium, and Large.
volcano <- data.frame(Year = 2000:2018,
Small = c(30, 25, 30, 32, 29, 29, 34, 29, 25, 28, 39, 30,
40, 40, 41, 26, 37, 30, 34),
Medium = c(6, 6, 5, 5, 8, 4, 3, 3, 7, 2, 6, 6, 4, 7, 7,
5, 4, 6, 4),
Large = c(0, 0, 0, 2, 1, 1, 1, 3, 2, 1, 3, 0, 1, 0, 1,
0, 2, 0, 1))
Plot, points, and lines
The plot function produces a scatterplot of its two arguments. Suppose we have saved our x x coordinates in a vector a, and our y y coordinates in a vector b, then to draw a scatterplot of (x,y)(x,y) we type
plot(x=a, y=b)
If the argument labels x and y are not supplied, R will assume the first argument is x and the second is y. If only one vector of data is supplied, this will be taken as the y y value and will be plotted against the integers 1:length(y), i.e.in the sequence in which they appear in the data.
All of the standard plot functions can be customised by passing additional arguments to the function. For instance, we can add a plot title and axis labels by supplying optional arguments:
type - determines the type of plot to draw. Possible types are:
“p” for points
“l” for lines
“b” for both (points connected by lines)
“h” for histogram-like vertical lines
“s” for step lines
xlab, ylab - provides a label for the horizontal and vertical axes
xlim, ylim - allows for specification of a minimum and maximum value of the corresponding axis limits, e.g.xlim=c(0,10) will set the horizontal axis limits to be [0,10][0,10].
col - can be specified to use colour for drawing
For example,
plot(x=-10:10,y=sin((-10:10)/(2pi)), type="b", xlab='A', ylim=c(-1.5,1))
Note: Once a plot has been drawn, it is not possible to erase any features from it - we can only add extra lines or points to it. So, if you make a mistake drawing your plot then you’ll need to start over with a fresh one by calling plot again.
After creating a plot, we can add additional points to the plot by calling the points function which draws additional points at the specified x and y values. Similarly, the lines function will draw connected lines between its x and y arguments.
plot the number of Small eruptions against the year using a vertical axis range (ylim) of [0,50][0,50].
Experiment with the plot types to see how the different plots represent the data.
Redraw the data as a line plot, and add lines of different colours to the same plot for the other two groups of eruptions.
Do you see any apparent relationship between time and number of eruptions?
Now plot the histogram of the number of Medium eruptions - does it look like it could follow a Poisson distribution? How else could you quickly assess this?
2 Conjugate analysis with the Gamma-Poisson model
2.1 The Theory
A Poisson distribution is often used to model the counts of random events occurring within a fixed period of time at some rate λ λ. For such a random variable X X where X∼Po(λ)X∼Po(λ) , a Bayesian analysis will require a prior distribution for the unknown Poisson parameter λ λ. We have seen that the Gamma distribution provides a conjugate prior for this particular problem. Therefore, if our data X 1,…,X n X 1,…,X n are Po(λ)Po(λ), and our prior distribution for λ λ is Ga(a,b)Ga(a,b). Then the posterior distribution for λ|X 1,…,X n λ|X 1,…,X n is given by:
λ|X 1,…,X n∼Ga(a+T,b+n),λ|X 1,…,X n∼Ga(a+T,b+n),
where T=∑n i=1 X i=n X¯¯¯¯T=∑i=1 n X i=n X¯.
2.2 The prior
First, let’s use the Gamma distribution to identify an appropriate prior for our Poisson count data.
Standard density functions in R
R provides built-in functions to evaluate the PDF of standard distributions. The density function for a Gamma distribution Ga(a,b)Ga(a,b) is used as follows
dgamma(x, shape=a, rate=b)
where x is the point (or vector of points) where we want to evaluate the PDF, and a and b are the usual Gamma parameter values.
Create a vector containing a sequence of 500 equally-spaced values over the interval [0,10][0,10]. Call this lambdavals.
Evaluate the Ga(1,1)Ga(1,1) pdf at each of the values of λ λ in lambdavals using the gamma PDF dgamma.
Make a plot of the pdf against λ λ as a solid black line.
An expert vulcanologist believes that the unknown rate of Medium eruptions, λ λ, is such that a range of [1,6][1,6] would be plausible.
You may need to use a pen and paper to do some maths to answer some of the following exercise!
Interpret the expert’s given interval as corresponding to a statement of E(λ)±2 sd(λ)E(λ)±2 sd(λ). Using this statement and the expert’s interval given above, find the value of the mean (E(λ)E(λ)) and variance (V ar(λ)=sd(λ)2 V ar(λ)=sd(λ)2) of the prior distribution for λ λ.
Equate the prior mean and variance you have just found to the theoretical values for the expectation (a/b a/b) and variance (a/b 2 a/b 2) of a Gamma pdf. Solve these two equations to find the expert’s corresponding values of the parameters a a and b b.
Evaluate the expert’s prior pdf for λ λ at each of lambdavals, and save it as cnjPrior.
For plotting purposes, we need to normalise the values of cnjPrior so that they sum (integrate) to 1. Divide the values of cnjPrior by the sum of the values in cnjPrior, and replace cnjPrior by these normalised values.
Produce a fresh plot of the expert’s prior pdf for λ λ as a solid red curve. Ensure your vertical axis covers [0,0.02][0,0.02].
Add a vertical red and dashed line (abline using the v argument) at the location of the prior expectation for λ λ.
Quantiles of standard densities
In addition to built-in functions for PDFs of standard distributions, R also provides the quantile function for a pdf. The quantile function evaluates the inverse of the cumulative distribution function, F−1 X(u)F X−1(u). Given a probability value u∈[0,1]u∈[0,1], the quantile function returns the value x x of X X for which P[X≤x]=u P[X≤x]=u, and so the quantile functions are particularly useful for finding critical values of distributions and for finding exact credible intervals.
The quantile function for a Gamma density X∼Ga(a,b)X∼Ga(a,b) is used as follows
qgamma(alpha, shape=a, rate=b)
where alpha is the lower tail probability (or vector of lower-tail probabilities) for which we want the corresponding value(s) of X X, and a and b are the usual Gamma parameter values.
Use the qgamma function to find a 95% equal-tailed prior credible interval for λ λ using the expert’s prior distribution above. Hint: find the values of λ λ with lower and upper tail probabilities of 2.5%2.5%.
How does this compare to the expert’s original interval?
2.3 The likelihood
The next ingredient in the Bayesian calculation requires us to capture the information contained in the data via the likelihood. In a Bayesian context, the likelihood is the conditional distribution of the data X 1,…,X n X 1,…,X n given the parameter λ.λ.
Let’s compute the likelihood given our data on Medium volcanic eruptions, and add it to the plot.
Write a function poisLike that computes the Poisson likelihood for the sample of Medium volcano eruptions. Your function should:
Take one argument lambda
Compute the Poisson probability for each data point in volcano$Medium given the value of lambda. Hint: the dpois function evaluates Poisson probabilities for a vector of values x and parameter lambda. Or you can use your own function from last time.
Combine the probabilities to find the likelihood of the entire sample, and return it.
If your function is working correctly, you should agree with the output below.
poisLike(5)``## 4.225604e-17
Using sapply to repeat calculations over a vector
We have seen previously that we can use the replicate to repeatedly call a function with no arguments. For functions which do take an argument, we often want to call that function at many different values. To do this, we use sapply to apply a specified function to every element of a vector as its argument, and then return a vector formed from the results.
sapply(x, fun)
applies the function fun to every element of the vector x it then returns a vector containing the values of fun(x), fun(x), and so on. So, to compute the square-root of the integers 1 1 to 10 10, we would write
sapply(1:10, FUN=sqrt)
or alternatively
which applies the square root function to each of the integers 1 to 10.
There are other variations of apply which work with matrices and other data structures, and we will see those in later practicals.
Use sapply to evaluate the Poisson likelihood (poisLike) for each of the values of λ λ in lambdavals. Save this as like.
Normalise like so that its values sum to 1 1.
Add the likelihood to your plot of the prior distribution as connected blue lines.
Add the maximum likelihood estimate of λ λ as a vertical dashed blue line.
Your plot should look like the one below
2.4 The posterior
We can apply Bayes rule directly, given the prior and likelihood, and numerically compute the posterior density for all of the values of λ λ.
Directly compute the posterior for λ λ by Bayes theorem, and save these values as postDirect. Normalise the postDirect so that it sums to 1 1. Hint: Posterior∝Likelihood×Prior Posterior∝Likelihood×Prior.
Add the posterior to your plot as a solid green curve.
However, we also know that we’re using the conjugate Gamma prior with a Poisson likelihood, so our posterior distribution for λ λ will also be a Gamma with parameter values as above. Let’s verify that this is the case, and add the resulting density function to our plot.
Now use conjugacy to evaluate the conjugate Gamma posterior distribution.
First find the posterior values of the Gamma parameters a a and b b, save these as aPost and bPost.
Now use dgamma with the posterior parameter values to evaluate the posterior Gamma density at each of lambdavals. Save these values to postConjugate and normalise to sum to 1 1.
Draw the conjugate posterior on your plot as a dashed purple curve.
What do you see? Do the results agree with each other? How has the prior changed?
Add the posterior mean as a vertical green line.
What do you notice about the relationship between the posterior mean, the prior mean, and the maximum likelihood estimate?
Use the exact Gamma posterior to find a 95% posterior credible interval for λ λ.
Compare the posterior interval with the prior interval you found earlier. What has changed?
3 Further Exercises: Exploring the effects of prior choice and sample size
3.1 Changing the prior parameters
To investigate how sensitive our results are to our choices for a a and b b in the prior Gamma distribution, we’re going to want to repeat our previous calculations for different values of the prior parameters. To make this easier, let’s wrap those calculations and plots in a new function that finds and draws the Gamma posterior for a given prior and data set:
Write a function called gammaPoisson which:
Takes four arguments: the prior Gamma parameters a and b, and the summary statistics T and n.
Computes the Ga(a,b)Ga(a,b) prior and the Ga(a+T,b+n)Ga(a+T,b+n) posterior over the sequence of values in lambdavals.
Plots the (normalised) prior and posterior Gamma distributions as coloured curves on one plot.
Adds the MLE as a dashed vertical line.
Check your function by evaluating it with the values of a,b,T, and n we used for the Medium volcano data above.
Investigate what happens as you change a and b.
How does the shape of the prior change? What impact does this have on the posterior distribution?
What happens for large values of a and b? How does this affect your results?
3.2 Updating beliefs with large samples
In Lecture 26, we will see that show that as the sample size grows large, the posterior distribution tends towards a Normal distribution and the posterior distribution becomes progressively less affected by the choice of prior distribution.
Let’s expand our data with the records of volcanic eruptions for the entire 20th century. As records are slightly incomplete, only the counts of Large eruptions over this period can be considered trustworthy. For the entire 100 years, a total of 64 Large (VEI≥4≥4) eruptions were recorded
Combine the 20th century data with the data from 2000-2018 and compute new summary statistics for the Large volcanic eruptions from 1900-2018. Save these as Tbig and Nbig.
Use a prior of λ∼Ga(2,2)λ∼Ga(2,2), and plot the posterior given the combined data. What happens to the posterior?
The large sample of data is clearly very informative for λ λ, resulting in a posterior distribution that is concentrated over a small range of possible λ λ values. Let’s refocus our plot on that sub-interval:
By modifying your Gamma-Poisson function, redraw the same plot to zoom in on the interval λ∈[0.25,1.25]λ∈[0.25,1.25]. Hint: you’ll need to set the xlim argument to plot (or add it as an argument to your function).
What do you notice about the shape of the Gamma posterior distribution?
3.2.1 Theory: Limiting posterior distribution
If we suppose that X=(X 1,…,X n)X=(X 1,…,X n) are an i.i.d. sample of size n n from a distribution with pdf f(x|θ)f(x|θ) where X i⊥X j|θ X i⊥X j|θ and f(x|θ)f(x|θ) is twice differentiable, then for n n ‘large enough’ the posterior distribution for θ|x θ|x is approximately
f(θ|x)≈N⎛⎝⎜θ ˆ,1 I(θ ˆ)⎞⎠⎟,f(θ|x)≈N(θ^,1 I(θ^)),
where θ ˆ θ^ is the MLE of the parameter θ θ, and I(θ ˆ)I(θ^) is the observed Fisher information for a sample of size 1.
For a Poisson distribution, we have:
λ ˆ=∑i x i n λ^=∑i x i n
L′′(λ)=−∑i x i λ 2 L″(λ)=−∑i x i λ 2.
Using the results above, compute the mean and variance of the limiting posterior distribution for the Large volcano eruption data.
Using dnorm, evaluate the Normal approximation to the posterior pdf for λ λ over lambdavals. Normalise it again to sum to one, and add it to your plot using a thick dashed line.
Is the limiting normal distribution in agreement with the Gamma posterior? If it differs, how does it differ and to what extent?
Do the values of the Gamma prior parameters a a and b b affect the quality of the approximation? |
14101 | https://ddjudge.com/assets/mean%2C-median%2C-and-mode-ti-84.pdf | Mean, Median, and Mode Using the TI-84 Plus CE Calculator How many pets do you have? 3,2,0,1,0,2,0,4,1,2 You will need to enter these data values into the TI-84 Plus CE calculator as a list named 𝐿! by following the procedures below. TI-84 Plus CE 1. Click on STAT and Edit then Enter This will get you to the list called 𝐿! 2. Enter your data set. TI-84 Plus CE 1. Click on STAT and Edit 2. Click STAT move the cursor to CALC. 3. Click on 1-Var-Stats 4. Make sure List is on 𝑳𝟏 then Calculate The mean and median are indicated in the TI-84 Plus CE calculator 𝑥̅ = 1.5 median = 1.5 To get the mode, you will need to follow the instructions below. TI-84 Plus CE 1. Click on STAT and SortA( then Enter This will need to enter 𝐿! 2. Press 2nd and then the 1 key and ) press enter. What you have done is sorted your data from smallest to largest. You will now want to view the data list called 𝐿! to visually determine the mode. TI-84 Plus CE 1. Click on STAT and Edit then Enter Visually, we can identify the mode by observing the data value(s) with the highest frequency. Mode = 0 and 2 |
14102 | https://www.calctool.org/fluid-mechanics/poise-stokes-converter | Poise-Stokes Converter
We’re hiring!
Share via
Hello!
This is the Poise-Stokes Converter. Start by entering some numbers.
Tip: You don't need to go from the top to the bottom.
You can calculate anything, in any order.
×
Poise-Stokes Converter
Created by Luis Hoyos
Last updated: Jul 06, 2022
0.5 Stars 1 Star 1.5 Stars 2 Stars 2.5 Stars 3 Stars 3.5 Stars 4 Stars 4.5 Stars 5 Stars
Table of contents:
Kinematic and dynamics viscosity
How to convert centistokes to centipoise (cSt to cP)
If you need a tool to convert kinematic viscosity to dynamic viscosity, this poise stokes converter is for you!
To convert from centistokes to centipoise (cP to cSt), you need to know the density of the fluid. You can look it up with our density calculator (we have predefined density values for many materials).
Once you've mastered this poise stokes converter, you can learn more about water viscosity and how temperature affects it by checking out our water viscosity calculator.
Kinematic and dynamics viscosity
In one-dimensional shear flow on Newtonian fluids, viscosity is a fluid property that relates the fluid shear stress to its strain rate:
τ=η(d u/d y)\tau = \eta(\text{d}u/\text{d}y)τ=η(d u/d y)
where:
τ\tau τ - Shear stress;
η\eta η - Dynamic viscosity; and
d u/d y\text{d}u/\text{d}y d u/d y - Shear strain.
Kinematic viscosity is simply dynamic viscosity divided by density:
ν=η/ρ ν = η/ρ ν=η/ρ
where:
ν ν ν - Kinematic viscosity;
η η η - Dynamic viscosity; and
ρ ρ ρ - Fluid density.
The importance of this new type of viscosity is because, in fluid mechanics, the ratio of dynamic viscosity to density often arises.
How to convert centistokes to centipoise (cSt to cP)
To convert kinematic viscosity to dynamic viscosity (centistokes to centipoise):
The first step to converting cSt to cP is determining the fluid density in kg/m³. If your density is not in kg/m³, you can use our density converter or:
If the density is in g/cm³, multiply it by 1000 to convert it to kg/m³.
If the density is in on/in³, multiply it by 1730.
If it is in lb/ft³, multiply it by 16.02.
Multiply the kinematic viscosity (in cSt) by the density.
Divide the previous result by 1000.
That's it. Alternatively, you can use our poise stokes converter and do it faster.
Instead of following the previous steps or using the poise stokes converter, you can use the following formula:
η(in cP)=ρ(in kg/m³)×ν(in cSt)1000 η\ (\text{in cP}) = \frac{ρ\ (\text{in kg/m³}) × ν\ (\text{in cSt})}{1000}η(in cP)=1000 ρ(in kg/m³)×ν(in cSt)
where:
η(in cP)η (\text{in cP})η(in cP) — Dynamic viscosity, in centipoise;
ρ(in kg/m³)ρ (\text{in kg/m³})ρ(in kg/m³) — Density, in kg/m³;
ν(in cSt)ν (\text{in cSt})ν(in cSt) — Kinematic viscosity, centistoke.
Luis Hoyos
ν = η/ρ
Density (ρ)
lb/cu ft
Dynamic viscosity (η)
cP
Kinematic viscosity (ν)
cSt
People also viewed…
Orifice flow
Determine the flow rate of liquid through an orifice using the orifice flow calculator.
Orifice Flow Calculator
Schwarzschild radius
Discover the fundamental of black hole physics with our Schwarzschild radius calculator.
Schwarzschild Radius Calculator
Water viscosity
This water viscosity calculator finds water's dynamic or kinematic viscosity at any temperature.
Water Viscosity Calculator
Other fluid-mechanics calculators
CalcTool
About us
All calculators
Contact
We’re hiring!
Copyright by Omni Calculator sp. z o.o.
Privacy policy & cookies
Astrophysics (17)
Atmospheric thermodynamics (11)
Continuum mechanics (21)
Conversion (15)
Dynamics (20)
Electrical energy (12)
Electromagnetism (18)
Electronics (34)
Fluid mechanics (29)
Kinematics (21)
Machines and mechanisms (20)
Math and statistics (34)
Optics (15)
Physical chemistry (15)
Quantum mechanics (14)
Relativity (9)
Rotational and periodic motion (17)
Thermodynamics (31)
Waves (14)
Other (33) |
14103 | https://synonymbox.com/synonyms-of-friendship/ | 30 Synonyms of Friendship – From Camaraderie to Fellowship
synonymbox.com
Home
About Us
Contact Us
synonyms with examples
Archives
September 2025
August 2025
July 2025
June 2025
May 2025
Categories
synonyms with examples
synonymbox.com
Home
About Us
Contact Us
synonyms with examples
synonymbox.com
What are You Looking For?
Search
Home » 30 Synonyms of Friendship – From Camaraderie to Fellowship
Toni Morison
on June 14, 2025
30 Synonyms of Friendship – From Camaraderie to Fellowship
synonyms with examples
4 min read
Synonyms of friendship, such as companionship, camaraderie, and fellowship, capture the warmth and trust that true relationships bring into our lives. For example, when describing the bond between childhood friends who’ve grown up together, “camaraderie” might express their playful closeness better than the word “friendship” alone.
These alternatives help you express bonds that are built on loyalty, support, and shared moments. From casual connections to deep, lifelong ties, each word adds nuance to how we talk about relationships.
In this guide, we’ll explore different words that convey the essence of friendship, each with its unique shade of meaning and context. Let’s dive into the language of connection and closeness.
What Does Friendship Mean?
At its heart, friendship is a close and voluntary relationship between people who care for and support one another. Unlike family ties, friendship is chosen, which often makes it feel extra special. It’s often characterized by trust, affection, and a sense of belonging.
But friendship can also be playful, casual, or professional. The word itself can sound formal or intimate depending on context, so exploring synonyms helps you express exactly the kind of bond you mean.
30 Synonyms of Friendship (with Descriptions & Examples)
1. Companionship
Definition: The enjoyment of spending time with someone.
Best For: Warm, ongoing presence.
Example:Their companionship made long journeys feel short.
2. Amity
Definition: A friendly relationship, often formal or diplomatic.
Best For: Formal or historical contexts.
Example:The two nations maintained amity despite their differences.
3. Fellowship
Definition: A group sharing common interests or activities.
Best For: Community or religious settings.
Example:The fellowship of writers met every month to share ideas.
4. Closeness
Definition: Emotional intimacy between people.
Best For: Personal, heartfelt connections.
Example:Their closeness grew stronger after years of trust.
5. Camaraderie
Definition: Mutual trust and friendship, often among coworkers or teammates.
Best For: Casual or professional relationships.
Example:The team’s camaraderie helped them win the championship.
6. Bond
Definition: A strong connection based on shared feelings or experiences.
Best For: Deep emotional ties.
Example:A bond of friendship formed over childhood adventures.
7. Affinity
Definition: A natural liking or sympathy for someone.
Best For: Subtle or emerging friendships.
Example:She felt an immediate affinity with her new colleague.
8. Allegiance
Definition: Loyalty or commitment, often in a group context.
Best For: Strong loyalty among friends or groups.
Example:Their allegiance to each other never wavered.
9. Warmth
Definition: Friendly and affectionate behavior or feelings.
Best For: Emotional tone emphasizing kindness.
Example:There was a warmth between them that words couldn’t capture.
10. Sociability
Definition: Enjoyment of social interaction.
Best For: Outgoing, casual friendships.
Example:Her sociability made her the heart of every gathering.
11. Togetherness
Definition: The feeling of being close and united.
Best For: Emotional or communal contexts.
Example:The festival inspired a wonderful sense of togetherness.
12. Intimacy
Definition: Close familiarity and emotional connection.
Best For: Deep, personal friendships.
Example:Their intimacy was built on years of shared secrets.
13. Brotherhood
Definition: A close bond like that between brothers; strong loyalty.
Best For: Male friendships or group solidarity.
Example:The firefighters shared a brotherhood forged in danger.
14. Sisterhood
Definition: Similar to brotherhood but among women.
Best For: Female friendships or activist groups.
Example:The sisterhood in the club empowered every member.
15. Chumminess
Definition: Informal, friendly closeness.
Best For: Casual, playful friendships.
Example:Their chumminess was obvious at every school reunion.
16. Partnership
Definition: A relationship where two or more people work together.
Best For: Collaborative or business friendships.
Example:Their partnership went beyond business to real friendship.
17. Affection
Definition: Fondness or tenderness for someone.
Best For: Emotional, loving friendships.
Example:Her affection for her childhood friend never faded.
18. Alliance
Definition: A union for mutual benefit.
Best For: Political or strategic friendships.
Example:The alliance between the two families was unbreakable.
19. Connection
Definition: A link or relationship between people.
Best For: General or new friendships.
Example:There was an instant connection at the conference.
20. Rapport
Definition: A harmonious and friendly relationship.
Best For: Professional or casual settings.
Example:She built a quick rapport with her new teammates.
21. Amigoship
Definition: Informal word for friendship, often used humorously.
Best For: Casual or playful conversations.
Example:Their amigoship was celebrated with weekly game nights.
22. Kinship
Definition: A feeling of closeness, like family ties.
Best For: Deep emotional or spiritual friendships.
Example:Their kinship felt like an unspoken promise.
23. Palship
Definition: Informal friendship, often lighthearted.
Best For: Childhood or youthful friendships.
Example:Their palship started in kindergarten and lasted decades.
24. Sympathy
Definition: Understanding and care for someone’s feelings.
Best For: Emotional support friendships.
Example:Her sympathy was a balm during tough times.
25. Comradeship
Definition: Fellowship, especially in shared struggles or goals.
Best For: Military or activist contexts.
Example:The comradeship among the volunteers was inspiring.
26. Intimateness
Definition: Another word for closeness and deep understanding.
Best For: Emotional and personal bonds.
Example:Their intimateness was evident in every conversation.
27. Networking
Definition: Building professional or social contacts.
Best For: Business or casual acquaintances.
Example:She excelled at networking, turning contacts into friendships.
28. Warm-heartedness
Definition: Kindness and friendliness.
Best For: Highlighting personality in friendships.
Example:His warm-heartedness made everyone feel welcome.
29. Mutuality
Definition: Shared feelings or actions.
Best For: Balanced, reciprocal friendships.
Example:Their mutuality ensured the friendship lasted through ups and downs.
30. Confidantship
Definition: The relationship of trusted friends who share secrets.
Best For: Close, private friendships.
Example:She was his confidant, the keeper of his deepest thoughts.
How to Choose the Perfect Synonym for Friendship
Want a formal tone? Use amity, allegiance, or alliance.
Going for warmth and emotion? Try closeness, intimacy, or affection.
For casual or playful vibes? Use chumminess, palship, or amigoship.
Need something professional? Choose partnership, rapport, or networking.
To emphasize solidarity or shared struggle? Pick comradeship or brotherhood/sisterhood.
Cultural and situational context also shapes your choice. For example:
Brotherhood often appears in male bonding or military groups, while sisterhood is common in women’s groups or feminist contexts.
Fellowship carries spiritual or academic connotations.
Kinship evokes a deep, almost familial connection beyond biology.
Conclusion:
In the end, synonyms offriendshipoffer more than just variety—they give you the tools to express connection, loyalty, and shared experience in a more meaningful way. From camaraderie to companionship, each word brings its nuance, helping you communicate the depth of your relationships.
If you’re describing lifelong bonds or everyday support, these alternatives enrich your expression. Use synonyms of friendship thoughtfully to reflect the true nature of your connections.
Words may change, but the heart of friendship stays the same, rooted in trust, care, and genuine connection.
Toni Morison
Toni Morison
on June 14, 2025
synonyms with examples
Share
Previous Article
Synonyms of Calm: 30 Alternatives That Bring Peace
Next Article
30 Synonyms of Destiny – From Fate to Fortune and Beyond
Write a Comment
Leave a Comment Cancel
Your email address will not be published.Required fields are marked
Your Comment
Name
Email
[x] Save my name and email in this browser for the next time I comment.
Submit Comment
Search
Search
Recent Posts
Synonyms of Convection: Key Terms and Clear Examples
Synonyms of Drastically: Bold Alternatives for Clear Impact
Synonyms of Rhyme Scheme to Elevate Your Writing
Synonyms of Nascent: Words for Something Just Beginning
Synonyms for a Lot Of: 30 Alternatives
Featured Posts
30 Powerful Synonyms of Bar with Meanings and Examples
Toni Morison
on August 31, 2025
30 Powerful Synonyms of Interplay to Elevate Your Writing
Brandon Taylor
on September 4, 2025
30 Synonyms of Ace to Boost Your Vocabulary
Toni Morison
on June 10, 2025
Read Next
synonyms with examples
5 Min Read
Toni Morison
on June 14, 2025
30 Synonyms of Destiny – From Fate to Fortune and Beyond
Synonyms of destiny, such as fate, fortune, and calling, offer powerful ways to express the idea of a predetermined path or life’s greater…
synonyms with examples
4 Min Read
Toni Morison
on June 22, 2025
Synonyms for Because of This: 30 Alternatives with Examples
Synonyms for because of this can make your writing smoother, clearer, and more professional. Whether you’re drafting an essay, email, or…
synonyms with examples
4 Min Read
Toni Morison
on June 22, 2025
30 Synonyms of Including with Examples
Synonyms of including refer to alternative words or phrases that can be used in place of “including” to introduce examples, elements, or parts…
synonymbox.com
Welcome to our site synonymbox.com
About Us
Contact Us |
14104 | https://dictionary.cambridge.org/da/ordbog/engelsk/prosecution?a=british | PROSECUTION | Engelsk betydning – Cambridge Dictionary
Ordbog
Oversæt
Grammatik
Synonymordbog
+Plus Cambridge Dictionary +Plus
Games
Shop
Cambridge Dictionary +Plus
Min profil
Hjælp til +Plus
Log ud
{{userName}}
Cambridge Dictionary +Plus
Min profil
Hjælp til +Plus
Log ud
Log ind / Tilmeld
Dansk
Engelsk
{{word}} {{#beta}} Beta{{/beta}}
Grammatik engelsk-spansk spansk-engelsk
Betydning af prosecution på engelsk
prosecution
noun
uk
Your browser doesn't support HTML5 audio
/ˌprɒs.ɪˈkjuː.ʃ ə n/us
Your browser doesn't support HTML5 audio
/ˌprɑː.səˈkjuː.ʃ ə n/
prosecution noun (LEGAL)
Føj til ordlisteFøj til ordliste
C2[ C or U ]
the act of prosecuting someone:
A number of the cases have resulted in successful prosecution.
Doctors guilty of neglect are liable to prosecution.
the prosecution[ S, + sing/pl verb ]
C2
the lawyers in a courtcase who represent the side that accuses someone of committing a crime:
His plea of guilty to manslaughter was not accepted by the prosecution.
The prosecution alleged that he lured the officer to his death by making an emergencycall.
Flere eksempler Færre eksempler
The prosecution has to establish his guilt beyond reasonabledoubt.
Her lawyeraccused the prosecution of foundingitscase on insufficientevidence.
This afternoon the prosecution will callitsstarwitness.
During the trial, the prosecution was accused of withholdingcrucialevidence from the defence.
The keywitness for the prosecution was offeredpoliceprotection after she receiveddeaththreats.
Flere eksempler Færre eksempler
The loophole has allowed hundreds of drink-drivers to avoid prosecution.
Those kids were lucky, they only narrowlyescaped prosecution.
SMART Vocabulary: relaterede ord og vendinger
Taking legal action
abatement order
ambulance chasing
appear for someone phrasal verb
bring
bring an action
complainant
enter
indemnification
indemnify
indict
indict someone for something/doing something
indictable
indictable offence
lawfare
petitioner
proceed against someone phrasal verb
proceedings
promisee
promisor
prosecute
Se flere resultater »
Du kan også finde relaterede ord, vendinger og synonymer i emnerne:
Lawyers & legal officials
prosecution noun (ACTIVITIES)
[ U ]formal
the act of taking part in a planned set of activities, especially a war
SMART Vocabulary: relaterede ord og vendinger
Continue & last
all day
bash on phrasal verb
bubble away
carry (something) on phrasal verb
cease
echo
holdover
hour
immortality
immortally
in the making idiom
prolongation
prosecute
protract
protraction
push ahead phrasal verb
soldier
span
spin
stretch
Se flere resultater »
(Definition af prosecution fra Cambridge Advanced Learner's Dictionary & Thesaurus © Cambridge University Press)
prosecution | Amerikansk ordbog
prosecution
noun[ C/U ]
us
Your browser doesn't support HTML5 audio
/ˌprɑs·ɪˈkju·ʃən/
Føj til ordlisteFøj til ordliste
the act of officiallyaccusing someone of committing an illegalact, esp. by bringing a case against that person in a court of law:
[ U ]She was grantedfullimmunity from prosecution by the state in return for her testimony.
law The prosecution refers to the lawyers in a trial who try to prove that a personaccused of committing a crime is guilty of that crime.
(Definition af prosecution fra Cambridge Academic Content Dictionary © Cambridge University Press)
prosecution | Erhvervsengelsk
prosecution
noun
LAW uk
Your browser doesn't support HTML5 audio
/ˌprɒsɪˈkjuːʃ ə n/us
Your browser doesn't support HTML5 audio
Føj til ordlisteFøj til ordliste
[ C or U ]
the process of officiallyaccusing someone in a court of law of committing a crime:
face prosecution (for sth)The companyfaces prosecution for breaches of safetyregulations.
bring a prosecution against sb They decided to bring a private prosecution against the boy's allegedkillers.
S
the lawyers who try to prove that a personaccused of committing a crime is guilty:
The prosecution claims that the companytried to misleadinvestigators by lying under oath.
Sammenlign
defence
(Definition af prosecution fra Cambridge Business English Dictionary © Cambridge University Press)
Eksempler på prosecution
prosecution
There have been no prosecutions or investigations of individuals that have precipitated or instigated the violence.
Fra Cambridge English Corpus
Relative to the size of the populations involved, prosecutions by provincial excise departwas 866 or one to only 6,160 persons.
Fra Cambridge English Corpus
In order to maintain credibility, informers had to pass information to agencies of sufficient quality to ensure successful conversion into prosecutions.
Fra Cambridge English Corpus
In policy terms low prosecutions are most likely when the judicial system is in need of institutional reform.
Fra Cambridge English Corpus
The statistics are limited in that they do not indicate the outcomes of prosecutions or proceedings.
Fra Cambridge English Corpus
Criminal prosecutions at the assizes almost invariably began by the submitting of bills of indictment, and supporting depositions, to the grand jury.
Fra Cambridge English Corpus
Strong resistance and threats of legal prosecutions thus characterized the process of adaptation.
Fra Cambridge English Corpus
The aim of presenting the evidence is to corroborate the prosecution's theory of the crime.
Fra Cambridge English Corpus
On an ideological level, prosecutions may be difficult to achieve.
Fra Cambridge English Corpus
Unsurprisingly, prosecutions for poaching plummeted precisely in areas of the country where the late nineteenth-century revolution in food supply and diet was most evident.
Fra Cambridge English Corpus
The pattern is even more clearly demonstrated when domestic violence and the - frequently studied - prosecutions for witchcraft are considered.
Fra Cambridge English Corpus
Data on crimes and population refer to areas policed by county constabularies; prosecutions in boroughs were minimal.
Fra Cambridge English Corpus
In this respect, the outcomes of these cases may be contrasted with the much less forgiving reactions of juries in livestock theft prosecutions.
Fra Cambridge English Corpus
Most of these prosecutions were aimed at a handful of publications, so at any given time a great deal of arguably seditious material circulated freely.
Fra Cambridge English Corpus
Just over half of the libel prosecutions of 1819-20 ended in some sort of sentence for the defendant, usually a few months in gaol.
Fra Cambridge English Corpus
Se alle eksempler på prosecution
Disse eksempler er fra korpusser og fra kilder på nettet. Eventuelle holdninger i eksemplerne repræsenterer ikke holdningen blandt Cambridge Dictionary-redaktørerne eller Cambridge University Press eller deres licensgivere.
Kollokationer med prosecution
prosecution
Disse ord bruges ofte i kombination med prosecution.
Klik på en kollokation for at se flere eksempler på den.
criminal prosecution
The dancing girls, however, have contrived to carry out their object without rendering themselves amenable to criminal prosecution.
Fra Cambridge English Corpus
fear of prosecution
Free from fear of prosecution, former military officers were active in business and held elected office.
Fra Cambridge English Corpus
malicious prosecution
The third consequence that we must consider touches on cases such as false imprisonment and malicious prosecution which are tried by jury.
Fra
Hansard archive
Eksempel fra Hansard-arkivet. Indeholder parlamentarisk information, der er licenseret under Open Parliament License v3.0
Disse eksempler er fra korpusser og fra kilder på nettet. Eventuelle holdninger i eksemplerne repræsenterer ikke holdningen blandt Cambridge Dictionary-redaktørerne eller Cambridge University Press eller deres licensgivere.
Se alle kollokationer med prosecution
Hvordan udtales prosecution?
Oversættelser af prosecution
på kinesisk (traditionelt)
法律, （被）起訴, （被）檢舉…
Se mere
på kinesisk (forenklet)
法律, （被）起诉, （被）检举…
Se mere
på spansk
proceso, enjuiciamiento, acusación [feminine…
Se mere
på portugisisk
processo criminal, processo [masculine]…
Se mere
på dansk
sagsanlæg, anklager, anklagemyndighed…
Se mere
på flere sprog
in Marathi
på japansk
på tyrkisk
på fransk
på catalansk
på hollandsk
in Tamil
in Hindi
in Gujarati
in Swedish
på malajisk
på tysk
på norsk
in Urdu
på ukrainsk
på russisk
in Telugu
på arabisk
på bengali
på tjekkisk
på indonesisk
på thailandsk
på vietnamesisk
på polsk
på koreansk
på italiensk
खटला, एखाद्यावर खटला चालवण्याची कृती…
Se mere
起訴, 訴訟, 告訴（こくそ）…
Se mere
kovuşturma, dava, davacı…
Se mere
poursuite [feminine] en justice, poursuites judiciaires, plaignant(s)…
Se mere
processament, enjudiciament…
Se mere
gerechtelijke vervolging, eisende partij…
Se mere
ஒருவர் மீது வழக்குத் தொடுக்கும் செயல்…
Se mere
अभियोग प्रक्रिया…
Se mere
ખટલો, મુકદ્દમો, કાનૂની કાર્યવાહી…
Se mere
åtal, åklagar-, kärandesidan…
Se mere
membuat dakwaan, pihak pendakwa…
Se mere
strafrechtliche Verfolgung, die Staatsanwaltschaft…
Se mere
søksmål [masculine], straffeforfølgelse [masculine], tiltale [masculine]…
Se mere
استغاثہ, قانونی کارروائی…
Se mere
судове переслідування, обвинувачення…
Se mere
судебное преследование…
Se mere
ఎవరినైనా విచారించే చర్య…
Se mere
مُحاكَمة…
Se mere
বিচার…
Se mere
obžaloba, žalobce…
Se mere
tuntutan, penuntut…
Se mere
การดำเนินคดีตามกฎหมาย, โจทก์…
Se mere
sự truy tố, bên nguyên…
Se mere
oskarżenie, sprawa sądowa, oskarżyciel…
Se mere
기소…
Se mere
processo penale, procedimento giudiziario, processo…
Se mere
Har du brug for en oversætter?
Få en hurtig, gratis oversættelse!
Oversætterværktøj
Gennemse
prosector
prosecute
prosecuted
prosecuting
prosecution
prosecutor
prosecutorial
proselyte
proselytize
Test dit ordforråd med vores sjove billedquizzer
Prøv en quiz nu
Dagens ord
Victoria sponge
UK
Your browser doesn't support HTML5 audio
/vɪkˌtɔː.ri.ə ˈspʌndʒ/
US
Your browser doesn't support HTML5 audio
/vɪkˌtɔːr.i.ə ˈspʌndʒ/
a soft cake made with eggs, sugar, flour, and a type of fat such as butter. It is made in two layers with jam or cream, or both, between them
Om dette
Blog
Calm and collected (The language of staying calm in a crisis)
September 24, 2025
Læs mere
Nye ord
lawnmower poetry
September 29, 2025
Flere nye ord
er føjet til list
Til toppen
Indhold
EngelskAmerikanskErhvervEksemplerKollokationerOversættelser
© Cambridge University Press & Assessment 2025
Læring
LæringLæringNye ordHjælpPå trykWord of the Year 2021Word of the Year 2022Word of the Year 2023Word of the Year 2024
Udvikl
UdviklUdviklDictionary APIOpslag med dobbeltklikSøgewidgetsLicensdata
Om
OmOmTilgængelighedCambridge EnglishCambridge University Press & AssessmentCookies SettingsCookies og privatlivCorpusBrugsvilkår
© Cambridge University Press & Assessment 2025
Cambridge Dictionary +Plus
Min profil
Hjælp til +Plus
Log ud
Ordbog
Definitioner
Klare forklaringer af naturligt skrevet og talt engelsk
Engelsk
Learner’s Dictionary
Essential British English
Essential American English
Oversættelser
Klik på pilene for at ændre oversættelsesretningen.
Tosprogede ordbøger
engelsk-kinesisk (forenklet)kinesisk (forenklet)-engelsk
engelsk-kinesisk (traditionelt)kinesisk (traditionelt)-engelsk
engelsk-hollandskhollandsk-engelsk
engelsk-franskfransk-engelsk
engelsk-tysktysk-engelsk
engelsk-indonesiskindonesisk-engelsk
engelsk-italienskitaliensk-engelsk
engelsk-japanskjapansk-engelsk
engelsk-norsknorsk-engelsk
engelsk-polskpolsk-engelsk
engelsk-portugisiskportugisisk-engelsk
engelsk-spanskspansk-engelsk
engelsk-svensksvensk-engelsk
Semitosprogede ordbøger
engelsk-arabisk
engelsk-bengali
engelsk-catalansk
engelsk-tjekkisk
engelsk-dansk
engelsk-gujarati
engelsk-hindi
engelsk-koreansk
engelsk-malajisk
engelsk-marathi
engelsk-russisk
engelsk-tamilsk
engelsk-telugu
engelsk-thailandsk
engelsk-tyrkisk
engelsk-ukrainsk
engelsk-urdu
engelsk-vietnamesisk
Oversæt
Grammatik
Synonymordbog
Udtale
Cambridge Dictionary +Plus
Games
Shop
{{userName}}
Cambridge Dictionary +Plus
Min profil
Hjælp til +Plus
Log ud
Log ind / Tilmeld
Dansk Change
English (UK)English (US)EspañolPortuguês中文 (简体)正體中文 (繁體)DanskDeutschFrançaisItalianoNederlandsNorskPolskiРусскийTürkçeTiếng ViệtSvenskaУкраїнська日本語한국어ગુજરાતીதமிழ்తెలుగుবাঙ্গালিमराठीहिंदी
Følg os
Close the sidebar
Vælg en ordbog
Seneste og anbefalede Engelsk Grammatik engelsk-spansk spansk-engelsk
Definitioner Klare forklaringer af naturligt skrevet og talt engelsk Engelsk Learner’s Dictionary Essential British English Essential American English
Grammatik og synonymordbog Brugsforklaringer af naturligt skrevet og talt engelsk Grammatik Synonymordbog
Udtale Britiske og amerikanske udtaler med lyd Engelsk udtale
Oversættelse
Klik på pilene for at ændre oversættelsesretningen. Tosprogede ordbøger
engelsk-kinesisk (forenklet)kinesisk (forenklet)-engelsk
engelsk-kinesisk (traditionelt)kinesisk (traditionelt)-engelsk
engelsk-hollandsk hollandsk-engelsk
engelsk-fransk fransk-engelsk
engelsk-tysk tysk-engelsk
engelsk-indonesisk indonesisk-engelsk
engelsk-italiensk italiensk-engelsk
engelsk-japansk japansk-engelsk
engelsk-norsk norsk-engelsk
engelsk-polsk polsk-engelsk
engelsk-portugisisk portugisisk-engelsk
engelsk-spansk spansk-engelsk
engelsk-svensk svensk-engelsk
Semitosprogede ordbøger
engelsk-arabisk engelsk-bengali engelsk-catalansk engelsk-tjekkisk engelsk-dansk engelsk-gujarati engelsk-hindi engelsk-koreansk engelsk-malajisk engelsk-marathi engelsk-russisk engelsk-tamilsk engelsk-telugu engelsk-thailandsk engelsk-tyrkisk engelsk-ukrainsk engelsk-urdu engelsk-vietnamesisk
Dictionary +Plus Ordlister
Close the sidebar
Vælg dit sprog
Dansk
English (UK)English (US)EspañolPortuguês中文 (简体)正體中文 (繁體)DeutschFrançaisItalianoNederlandsNorskPolskiРусскийTürkçeTiếng ViệtSvenskaУкраїнська日本語한국어ગુજરાતીதமிழ்తెలుగుবাঙ্গালিमराठीहिंदी
Close the sidebar
Indhold
Engelsk
Noun
prosecution(LEGAL)
the prosecution
prosecution(ACTIVITIES)
Amerikansk Noun
Erhverv Noun
Eksempler
Kollokationer
Translations
Grammatik
Alle oversættelser
Close the sidebar
Mine ordlister
To add prosecution to a word list please sign up or log in.
Tilmeld eller Log ind
Mine ordlister
Føj prosecution til en af dine lister nedenfor, eller opret en ny.
{{#verifyErrors}}
{{message}}
{{/verifyErrors}} {{^verifyErrors}} {{#message}}
{{message}}
{{/message}} {{^message}}
Noget gik galt.
{{/message}} {{/verifyErrors}}
{{name}}
Mere
Gå til dine ordlister
{{#verifyErrors}}
{{message}}
{{/verifyErrors}} {{^verifyErrors}} {{#message}}
{{message}}
{{/message}} {{^message}}
Noget gik galt.
{{/message}} {{/verifyErrors}}
Close the sidebar
Fortæl os om denne eksempelsætning:
Ordet i eksempelsætningen matcher ikke det indtastede ord.
Sætningen har stødende indhold.
Annuller Indsend
Thanks! Your feedback will be reviewed.
{{#verifyErrors}}
{{message}}
{{/verifyErrors}} {{^verifyErrors}} {{#message}}
{{message}}
{{/message}} {{^message}}
Der opstod et problem med at sende din rapport.
{{/message}} {{/verifyErrors}}
Ordet i eksempelsætningen matcher ikke det indtastede ord.
Sætningen har stødende indhold.
Annuller Indsend
Thanks! Your feedback will be reviewed.
{{#verifyErrors}}
{{message}}
{{/verifyErrors}} {{^verifyErrors}} {{#message}}
{{message}}
{{/message}} {{^message}}
Der opstod et problem med at sende din rapport.
{{/message}} {{/verifyErrors}}
Close the sidebar
By clicking “Accept All Cookies”, you agree to the storing of cookies on your device to enhance site navigation, analyze site usage, and assist in our marketing efforts. Privacy and Cookies Policy
Cookies Settings Accept All Cookies |
14105 | https://math.stackexchange.com/questions/3415894/find-n-points-on-a-circle-with-integer-distances | number theory - Find $n$ points on a circle with integer distances. - Mathematics Stack Exchange
Join Mathematics
By clicking “Sign up”, you agree to our terms of service and acknowledge you have read our privacy policy.
Sign up with Google
OR
Email
Password
Sign up
Already have an account? Log in
Skip to main content
Stack Exchange Network
Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Visit Stack Exchange
Loading…
Tour Start here for a quick overview of the site
Help Center Detailed answers to any questions you might have
Meta Discuss the workings and policies of this site
About Us Learn more about Stack Overflow the company, and our products
current community
Mathematics helpchat
Mathematics Meta
your communities
Sign up or log in to customize your list.
more stack exchange communities
company blog
Log in
Sign up
Home
Questions
Unanswered
AI Assist Labs
Tags
Chat
Users
Teams
Ask questions, find answers and collaborate at work with Stack Overflow for Teams.
Try Teams for freeExplore Teams
3. Teams
4. Ask questions, find answers and collaborate at work with Stack Overflow for Teams. Explore Teams
Teams
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
Learn more about Teams
Hang on, you can't upvote just yet.
You'll need to complete a few actions and gain 15 reputation points before being able to upvote. Upvoting indicates when questions and answers are useful. What's reputation and how do I get it?
Instead, you can save this post to reference later.
Save this post for later Not now
Thanks for your vote!
You now have 5 free votes weekly.
Free votes
count toward the total vote score
does not give reputation to the author
Continue to help good content that is interesting, well-researched, and useful, rise to the top! To gain full voting privileges, earn reputation.
Got it!Go to help center to learn more
Find n n points on a circle with integer distances.
Ask Question
Asked 5 years, 11 months ago
Modified5 years, 5 months ago
Viewed 758 times
This question shows research effort; it is useful and clear
4
Save this question.
Show activity on this post.
Let n n be a positive integer, prove that it is possible to put n n points on a circle so that the distances among them are all integers.
For n≤3 n≤3 this is trivial. I have shown it for n=4 n=4 by considering a rectangle. I don't know how to do it for larger numbers though.
number-theory
euclidean-geometry
circles
plane-geometry
geometry-of-numbers
Share
Share a link to this question
Copy linkCC BY-SA 4.0
Cite
Follow
Follow this question to receive notifications
edited Apr 28, 2020 at 12:27
Batominovski
50.4k 4 4 gold badges 59 59 silver badges 141 141 bronze badges
asked Oct 31, 2019 at 0:38
mtheorylordmtheorylord
4,350 18 18 silver badges 45 45 bronze badges
2
How do you do it with a rhombus? Vertices of a rhombus lie on a circle only if the rhombus is a square, and then the diagonals divided by the sides is not a rational number. Maybe you meant a rectangle?Oscar Lanzi –Oscar Lanzi 2019-10-31 00:42:49 +00:00 Commented Oct 31, 2019 at 0:42
1 yes, my bad, rectangle mtheorylord –mtheorylord 2019-10-31 00:47:39 +00:00 Commented Oct 31, 2019 at 0:47
Add a comment|
2 Answers 2
Sorted by: Reset to default
This answer is useful
7
Save this answer.
Show activity on this post.
This is easier than it looks. All you need to do is use Pythagorean triples in the appropriate way.
Draw a circle with a diameter of five units. Select any point on the circle and generate other points from it by drawing chords with length three units joined end to end. All chords being congruent, they intercept congruent arcs and the arcs add together. Therefore the distance between any two points will have the form
|5 sin(k θ/2)||5 sin(k θ/2)|
where k k is a whole number and θ θ is the minor arc intercepted by a chord. The multiple angle identities then guarantee that sin(k θ/2)sin(k θ/2) will be rational given the rational values sin(θ/2)=3/5 sin(θ/2)=3/5 and cos(θ/2)=4/5 cos(θ/2)=4/5. So all point-to-point distances are rational and they may be converted to integers by scaling appropriately. Since the value of θ θ as constructed here is not a rational number times 2 π 2 π, an unlimited number of distinct points may be identified, so there is no limit on n n.
Share
Share a link to this answer
Copy linkCC BY-SA 4.0
Cite
Follow
Follow this answer to receive notifications
edited Apr 29, 2020 at 22:01
answered Oct 31, 2019 at 0:58
Oscar LanziOscar Lanzi
50.2k 2 2 gold badges 55 55 silver badges 135 135 bronze badges
2
Alright, I drew your picture as an answer. It appears the final pair of points also have rational distance with an odd number of points, I'm not sure how well this works with even number of edges. I suppose in that case you don't go for exact n,n, solve the problem for a larger, but odd, number of points.Will Jagy –Will Jagy 2019-10-31 19:46:26 +00:00 Commented Oct 31, 2019 at 19:46
You get rational distances for all n. With two chords for n=3 you get 5 sin(2 θ/2)5 sin(2 θ/2) when sin(θ/2)=3/5 sin(θ/2)=3/5 and cos(θ/2)=4/5 cos(θ/2)=4/5, thus 24/5 24/5. Compare with another Pythagorean triple, 7−24−25 7−24−25.Oscar Lanzi –Oscar Lanzi 2019-10-31 20:04:18 +00:00 Commented Oct 31, 2019 at 20:04
Add a comment|
This answer is useful
2
Save this answer.
Show activity on this post.
This is with radius 5 and edge length 6. It appears that the final edge (not drawn in) also has rational length since it is vertical and both endpoints have rational coordinates
Share
Share a link to this answer
Copy linkCC BY-SA 4.0
Cite
Follow
Follow this answer to receive notifications
answered Oct 31, 2019 at 19:43
Will JagyWill Jagy
147k 8 8 gold badges 156 156 silver badges 285 285 bronze badges
1
this is what I am doing (except my circle has half the radius of yours). The distance between pairs of points is rational because it's related to trig functions that are themselves rational (sin(θ/2)=3/5,cos(θ/2)=4/5 sin(θ/2)=3/5,cos(θ/2)=4/5) through polynomial functions derived from multiple angle formulas.Oscar Lanzi –Oscar Lanzi 2019-10-31 19:49:54 +00:00 Commented Oct 31, 2019 at 19:49
Add a comment|
You must log in to answer this question.
Start asking to get answers
Find the answer to your question by asking.
Ask question
Explore related questions
number-theory
euclidean-geometry
circles
plane-geometry
geometry-of-numbers
See similar questions with these tags.
Featured on Meta
Introducing a new proactive anti-spam measure
Spevacus has joined us as a Community Manager
stackoverflow.ai - rebuilt for attribution
Community Asks Sprint Announcement - September 2025
Report this ad
Linked
6How to construct six points A B C D E F A B C D E F on a plane so that the distance between any two of them is an integer, and no three are collinear?
Related
35 points on a plane with rational distances
1Locus problem: 4 points on a segment with particular distances between them
4A set of points in a plane such that for each subset of 3 there is a circle surrounding them
2Shortest maximum pairwise distance of points in a circle of radius R
2Sum of squared distances between points on a unit circle
9Given a k 2 k 2-membered set S S of points with coordinates (x,y)∈{1,2,...,k}(x,y)∈{1,2,...,k}, prove that some 4 4 points in S′S′ lie on a circle.
0How do I approximate a circle with a series of line segments?
2Sum of powers of distances between points in concentric circles
Hot Network Questions
Does a Linux console change color when it crashes?
Do we need the author's permission for reference
Origin of Australian slang exclamation "struth" meaning greatly surprised
Can a cleric gain the intended benefit from the Extra Spell feat?
Determine which are P-cores/E-cores (Intel CPU)
Analog story - nuclear bombs used to neutralize global warming
A time-travel short fiction where a graphologist falls in love with a girl for having read letters she has not yet written… to another man
Do we declare the codomain of a function from the beginning, or do we determine it after defining the domain and operations?
If Israel is explicitly called God’s firstborn, how should Christians understand the place of the Church?
ConTeXt: Unnecessary space in \setupheadertext
My dissertation is wrong, but I already defended. How to remedy?
In Dwarf Fortress, why can't I farm any crops?
Xubuntu 24.04 - Libreoffice
How different is Roman Latin?
How to home-make rubber feet stoppers for table legs?
RTC battery and VCC switching circuit
Direct train from Rotterdam to Lille Europe
Does the mind blank spell prevent someone from creating a simulacrum of a creature using wish?
Do sum of natural numbers and sum of their squares represent uniquely the summands?
Gluteus medius inactivity while riding
On being a Maître de conférence (France): Importance of Postdoc
Should I let a player go because of their inability to handle setbacks?
With with auto-generated local variables
How can the problem of a warlock with two spell slots be solved?
Question feed
Subscribe to RSS
Question feed
To subscribe to this RSS feed, copy and paste this URL into your RSS reader.
Why are you flagging this comment?
It contains harassment, bigotry or abuse.
This comment attacks a person or group. Learn more in our Code of Conduct.
It's unfriendly or unkind.
This comment is rude or condescending. Learn more in our Code of Conduct.
Not needed.
This comment is not relevant to the post.
Enter at least 6 characters
Something else.
A problem not listed above. Try to be as specific as possible.
Enter at least 6 characters
Flag comment Cancel
You have 0 flags left today
Mathematics
Tour
Help
Chat
Contact
Feedback
Company
Stack Overflow
Teams
Advertising
Talent
About
Press
Legal
Privacy Policy
Terms of Service
Your Privacy Choices
Cookie Policy
Stack Exchange Network
Technology
Culture & recreation
Life & arts
Science
Professional
Business
API
Data
Blog
Facebook
Twitter
LinkedIn
Instagram
Site design / logo © 2025 Stack Exchange Inc; user contributions licensed under CC BY-SA. rev 2025.9.26.34547
By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.
Accept all cookies Necessary cookies only
Customize settings
Cookie Consent Preference Center
When you visit any of our websites, it may store or retrieve information on your browser, mostly in the form of cookies. This information might be about you, your preferences, or your device and is mostly used to make the site work as you expect it to. The information does not usually directly identify you, but it can give you a more personalized experience. Because we respect your right to privacy, you can choose not to allow some types of cookies. Click on the different category headings to find out more and manage your preferences. Please note, blocking some types of cookies may impact your experience of the site and the services we are able to offer.
Cookie Policy
Accept all cookies
Manage Consent Preferences
Strictly Necessary Cookies
Always Active
These cookies are necessary for the website to function and cannot be switched off in our systems. They are usually only set in response to actions made by you which amount to a request for services, such as setting your privacy preferences, logging in or filling in forms. You can set your browser to block or alert you about these cookies, but some parts of the site will not then work. These cookies do not store any personally identifiable information.
Cookies Details
Performance Cookies
[x] Performance Cookies
These cookies allow us to count visits and traffic sources so we can measure and improve the performance of our site. They help us to know which pages are the most and least popular and see how visitors move around the site. All information these cookies collect is aggregated and therefore anonymous. If you do not allow these cookies we will not know when you have visited our site, and will not be able to monitor its performance.
Cookies Details
Functional Cookies
[x] Functional Cookies
These cookies enable the website to provide enhanced functionality and personalisation. They may be set by us or by third party providers whose services we have added to our pages. If you do not allow these cookies then some or all of these services may not function properly.
Cookies Details
Targeting Cookies
[x] Targeting Cookies
These cookies are used to make advertising messages more relevant to you and may be set through our site by us or by our advertising partners. They may be used to build a profile of your interests and show you relevant advertising on our site or on other sites. They do not store directly personal information, but are based on uniquely identifying your browser and internet device.
Cookies Details
Cookie List
Clear
[x] checkbox label label
Apply Cancel
Consent Leg.Interest
[x] checkbox label label
[x] checkbox label label
[x] checkbox label label
Necessary cookies only Confirm my choices |
14106 | https://fiveable.me/key-terms/principles-macroeconomics/potential-gdp | printables
💵principles of macroeconomics review
key term - Potential GDP
Citation:
MLA
Definition
Potential GDP, also known as the full-employment level of GDP, represents the maximum sustainable level of output that an economy can produce when all available resources, including labor and capital, are fully utilized at their most efficient levels. It is the level of real GDP that an economy would achieve if it was operating at full employment without any inflationary pressures.
5 Must Know Facts For Your Next Test
Potential GDP is an important concept in macroeconomics as it helps policymakers assess the economy's productive capacity and identify any gaps between actual and potential output.
The difference between actual GDP and potential GDP is known as the output gap, which can be either positive (when actual GDP exceeds potential GDP) or negative (when actual GDP falls short of potential GDP).
Factors that can affect potential GDP include the size and quality of the labor force, the stock of physical capital, the level of technology, and the efficiency with which resources are utilized.
Potential GDP growth is influenced by the rate of growth in the labor force, capital accumulation, and technological progress, which are the key determinants of long-run economic growth.
Policymakers can use the concept of potential GDP to guide their decisions on fiscal and monetary policies, as they aim to keep the economy operating at or near its full-employment level.
Review Questions
Explain how the concept of potential GDP is used to track real GDP over time.
Potential GDP represents the maximum sustainable level of output that an economy can produce when all resources are fully utilized. By comparing actual real GDP to potential GDP, economists can assess whether the economy is operating below, at, or above its full-employment level. This helps policymakers identify periods of economic expansion, recession, or inflationary pressures, and guide their decisions on fiscal and monetary policies to stabilize the economy and promote sustainable growth.
Describe how the AD/AS model incorporates the concept of potential GDP to explain changes in unemployment over the long run.
In the AD/AS model, potential GDP is represented by the vertical, long-run aggregate supply (LRAS) curve, which indicates the economy's maximum sustainable output level. When actual GDP is below potential GDP, there is a negative output gap, which corresponds to a higher unemployment rate as the economy operates below full employment. Conversely, when actual GDP exceeds potential GDP, there is a positive output gap, leading to inflationary pressures and a lower unemployment rate. The AD/AS model thus demonstrates how the relationship between actual and potential GDP is a key determinant of changes in unemployment over the long run.
Analyze how the concept of potential GDP is used in the Neoclassical model to explain the long-run relationship between economic growth, unemployment, and inflation.
In the Neoclassical model, potential GDP is the central concept that determines the long-run equilibrium of the economy. The model assumes that the economy will naturally gravitate towards its potential GDP, which is determined by the supply-side factors of the labor force, capital stock, and technological progress. Any deviations of actual GDP from potential GDP will be temporary, as the economy will self-correct through adjustments in prices and wages to restore full employment. This means that in the long run, the economy will operate at its potential GDP, with unemployment at the natural rate and inflation at a stable, low level. The Neoclassical model thus emphasizes the importance of potential GDP in understanding the fundamental relationships between economic growth, unemployment, and inflation.
Related terms
Real GDP:
Real GDP is the total value of all final goods and services produced within a country in a given year, adjusted for inflation to reflect changes in the purchasing power of the currency.
Full Employment:
Full employment is a situation where everyone who is willing and able to work at the prevailing wage rate is employed, with only frictional and structural unemployment remaining.
Aggregate Demand:
Aggregate demand is the total demand for all final goods and services in an economy at a given time and price level.
"Potential GDP" also found in:
Subjects (1)
Principles of Economics |
14107 | https://askfilo.com/user-question-answers-smart-solutions/what-is-the-mass-in-grams-of-1-atom-of-al-3138393134333235 | Question asked by Filo student
What is the mass in grams of 1 atom of Al?
Views: 5,615 students
Updated on: Jan 8, 2025
Text SolutionText solutionverified iconVerified
Concepts:
Atomic mass, Mole concept, Avogadro's number
Explanation:
To find the mass of 1 atom of aluminum (Al), we need to use the atomic mass of Al and Avogadro's number. The atomic mass of Al is approximately 26.98 g/mol. Avogadro's number is 6.022×1023 atoms/mol. We can find the mass of 1 atom by dividing the atomic mass by Avogadro's number.
Step by Step Solution:
Step 1
Find the atomic mass of Al: 26.98 g/mol.
Step 2
Use Avogadro's number: 6.022×1023 atoms/mol.
Step 3
Calculate the mass of 1 atom of Al: mass of 1 atom=6.022×1023 atoms/mol26.98 g/mol=4.48×10−23 g.
Final Answer:
The mass of 1 atom of Al is approximately 4.48×10−23 grams.
Students who ask this question also asked
Views: 5,570
Topic:
Smart Solutions
View solution
Views: 5,512
Topic:
Smart Solutions
View solution
Views: 5,456
Topic:
Smart Solutions
View solution
Views: 5,718
Topic:
Smart Solutions
View solution
Stuck on the question or explanation?
Connect with our tutors online and get step by step solution of this question.
| | |
--- |
| Question Text | What is the mass in grams of 1 atom of Al? |
| Updated On | Jan 8, 2025 |
| Topic | All topics |
| Subject | Smart Solutions |
| Class | Grade 12 |
| Answer Type | Text solution:1 |
Are you ready to take control of your learning?
Download Filo and start learning with your favorite tutors right away!
Questions from top courses
Explore Tutors by Cities
Blog
Knowledge
© Copyright Filo EdTech INC. 2025 |
14108 | https://www.totallylegal.com/article/barrister-job-description | Barrister Job Description
Consent
Details
[#IABV2SETTINGS#]
About
This website uses cookies
At Reach and across our entities we use cookies to provide the best experience for our users. They help our site to work effectively and allow us to offer candidates a more personalised and relevant job search by understanding your interests and preferences. Please 'Accept all' or 'Manage preferences'.
Consent Selection
Necessary
[x]
Preferences
[x]
Statistics
[x]
Marketing
[x]
Show details
Details
Necessary 27- [x] Necessary cookies help make a website usable by enabling basic functions like page navigation and access to secure areas of the website. The website cannot function properly without these cookies.
Cookiebot 1Learn more about this providerCookieConsentStores the user's cookie consent state for the current domainMaximum Storage Duration: 1 yearType: HTTP Cookie
Filechooser 2Learn more about this providerCompatibilityCheckPendingMaximum Storage Duration: 1 dayType: HTTP Cookie SESS#Preserves users states across page requests.Maximum Storage Duration: SessionType: HTTP Cookie
Google 11Learn more about this providerSome of the data collected by this provider is for the purposes of personalization and measuring advertising effectiveness.
test_cookieUsed to check if the user's browser supports cookies.Maximum Storage Duration: 1 dayType: HTTP Cookie _GRECAPTCHAThis cookie is used to distinguish between humans and bots. This is beneficial for the website, in order to make valid reports on the use of their website.Maximum Storage Duration: 180 daysType: HTTP Cookie rc::eThis cookie is used to distinguish between humans and bots. Maximum Storage Duration: SessionType: HTML Local Storage rc::aThis cookie is used to distinguish between humans and bots. This is beneficial for the website, in order to make valid reports on the use of their website.Maximum Storage Duration: PersistentType: HTML Local Storage rc::bThis cookie is used to distinguish between humans and bots. Maximum Storage Duration: SessionType: HTML Local Storage rc::cThis cookie is used to distinguish between humans and bots. Maximum Storage Duration: SessionType: HTML Local Storage rc::d-15#This cookie is used to distinguish between humans and bots. Maximum Storage Duration: PersistentType: HTML Local Storage rc::fThis cookie is used to distinguish between humans and bots. Maximum Storage Duration: PersistentType: HTML Local Storage __eoiUsed in order to detect spam and improve the website's security. Maximum Storage Duration: 180 daysType: HTTP Cookie _MadgexTrackingPendingMaximum Storage Duration: 2 yearsType: HTTP Cookie _MadgexTracking_gidPendingMaximum Storage Duration: 1 dayType: HTTP Cookie
LinkedIn 2Learn more about this providerbcookiePendingMaximum Storage Duration: 1 yearType: HTTP Cookie li_gcPendingMaximum Storage Duration: 180 daysType: HTTP Cookie
Vimeo 2Learn more about this provider__cf_bmPendingMaximum Storage Duration: 1 dayType: HTTP Cookie _cfuvidPendingMaximum Storage Duration: SessionType: HTTP Cookie
www.filechooser.com www.totallylegal.com 4AWSALB[x2]Registers which server-cluster is serving the visitor. This is used in context with load balancing, in order to optimize user experience. Maximum Storage Duration: 7 daysType: HTTP Cookie AWSALBCORS[x2]Registers which server-cluster is serving the visitor. This is used in context with load balancing, in order to optimize user experience. Maximum Storage Duration: 7 daysType: HTTP Cookie
www.totallylegal.com 5csrfTokenHelps prevent Cross-Site Request Forgery (CSRF) attacks.Maximum Storage Duration: SessionType: HTTP Cookie FixedFacetDefaultsPendingMaximum Storage Duration: SessionType: HTTP Cookie JobSearchCriteriaPendingMaximum Storage Duration: SessionType: HTTP Cookie JobSearchResultIdsPendingMaximum Storage Duration: SessionType: HTTP Cookie MdgxArticlesLastSearchParamsPendingMaximum Storage Duration: SessionType: HTTP Cookie
Preferences 1- [x] Preference cookies enable a website to remember information that changes the way the website behaves or looks, like your preferred language or the region that you are in.
LinkedIn 1Learn more about this providerlidcPendingMaximum Storage Duration: 1 dayType: HTTP Cookie
Statistics 21- [x] Statistic cookies help website owners to understand how visitors interact with websites by collecting and reporting information anonymously.
Google 5Learn more about this providerSome of the data collected by this provider is for the purposes of personalization and measuring advertising effectiveness.
collectUsed to send data to Google Analytics about the visitor's device and behavior. Tracks the visitor across devices and marketing channels.Maximum Storage Duration: SessionType: Pixel Tracker _gaRegisters a unique ID that is used to generate statistical data on how the visitor uses the website.Maximum Storage Duration: 2 yearsType: HTTP Cookie ga#Used by Google Analytics to collect data on the number of times a user has visited the website as well as dates for the first and most recent visit. Maximum Storage Duration: 2 yearsType: HTTP Cookie _gatUsed by Google Analytics to throttle request rateMaximum Storage Duration: 1 dayType: HTTP Cookie _gidRegisters a unique ID that is used to generate statistical data on how the visitor uses the website.Maximum Storage Duration: 1 dayType: HTTP Cookie
Squeezely 3Learn more about this provider_gd#[x2]PendingMaximum Storage Duration: SessionType: HTTP Cookie sqzl_vwThis cookie is used by the website’s operator in context with multi-variate testing. This is a tool used to combine or change content on the website. This allows the website to find the best variation/edition of the site. Maximum Storage Duration: 1 yearType: HTTP Cookie
Vimeo 1Learn more about this providervuidCollects data on the user's visits to the website, such as which pages have been read.Maximum Storage Duration: 2 yearsType: HTTP Cookie
cdn.amplitude.com 5AMP_unsent_#Registers statistical data on users' behaviour on the website. Used for internal analytics by the website operator. Maximum Storage Duration: PersistentType: HTML Local Storage AMP_#Registers statistical data on users' behaviour on the website. Used for internal analytics by the website operator. Maximum Storage Duration: 1 yearType: HTTP Cookie AMP_MKTG_#Registers statistical data on users' behaviour on the website. Used for internal analytics by the website operator. Maximum Storage Duration: 1 yearType: HTTP Cookie AMP_TLDTESTRegisters statistical data on users' behaviour on the website. Used for internal analytics by the website operator. Maximum Storage Duration: SessionType: HTTP Cookie AMP_TESTRegisters statistical data on users' behaviour on the website. Used for internal analytics by the website operator. Maximum Storage Duration: SessionType: HTTP Cookie
cdn.jsdelivr.net 1gbFeaturesCacheThis cookie is used by the website’s operator in context with multi-variate testing. This is a tool used to combine or change content on the website. This allows the website to find the best variation/edition of the site.Maximum Storage Duration: PersistentType: HTML Local Storage
www.totallylegal.com 6_dd_sRegisters the website's speed and performance. This function can be used in context with statistics and load-balancing.Maximum Storage Duration: 1 dayType: HTTP Cookie AnonymousUserIdPendingMaximum Storage Duration: 400 daysType: HTTP Cookie BrowserSessionPendingMaximum Storage Duration: 1 dayType: HTTP Cookie dd_cookie_test_#Registers data on visitors' website-behaviour. This is used for internal analysis and website optimization. Maximum Storage Duration: 1 dayType: HTTP Cookie DoubleSubmit_TotallyLegal_ResponsiveJobSeekerPendingMaximum Storage Duration: SessionType: HTTP Cookie JSMRIPendingMaximum Storage Duration: 1 yearType: HTTP Cookie
Marketing 50- [x] Marketing cookies are used to track visitors across websites. The intention is to display ads that are relevant and engaging for the individual user and thereby more valuable for publishers and third party advertisers.
Google 12Learn more about this providerSome of the data collected by this provider is for the purposes of personalization and measuring advertising effectiveness.
_GESPSK-crwdcntrl.netThis cookie registers data on the visitor. The information is used to optimize advertisement relevance. Maximum Storage Duration: PersistentType: HTML Local Storage goog:cached:topicsPendingMaximum Storage Duration: PersistentType: HTML Local Storage NIDRegisters a unique ID that identifies a returning user's device. The ID is used for targeted ads.Maximum Storage Duration: 6 monthsType: HTTP Cookie pagead/1p-user-list/#Tracks if the user has shown interest in specific products or events across multiple websites and detects how the user navigates between sites. This is used for measurement of advertisement efforts and facilitates payment of referral-fees between websites.Maximum Storage Duration: SessionType: Pixel Tracker rc::hThis cookie is used to distinguish between humans and bots. Maximum Storage Duration: PersistentType: HTML Local Storage pagead/gen_204Collects data on visitor behaviour from multiple websites, in order to present more relevant advertisement - This also allows the website to limit the number of times that they are shown the same advertisement. Maximum Storage Duration: SessionType: Pixel Tracker pcs/activeviewUsed by DoubleClick to determine whether website advertisement has been properly displayed - This is done to make their marketing efforts more efficient. Maximum Storage Duration: SessionType: Pixel Tracker pcs/viewPendingMaximum Storage Duration: SessionType: Pixel Tracker simgad/#PendingMaximum Storage Duration: SessionType: Pixel Tracker csiCollects data on visitors' preferences and behaviour on the website - This information is used make content and advertisement more relevant to the specific visitor. Maximum Storage Duration: SessionType: Pixel Tracker _gcl_auUsed by Google AdSense for experimenting with advertisement efficiency across websites using their services. Maximum Storage Duration: 3 monthsType: HTTP Cookie _gcl_lsTracks the conversion rate between the user and the advertisement banners on the website - This serves to optimise the relevance of the advertisements on the website. Maximum Storage Duration: PersistentType: HTML Local Storage
Microsoft 8Learn more about this provider_uetsidUsed to track visitors on multiple websites, in order to present relevant advertisement based on the visitor's preferences. Maximum Storage Duration: PersistentType: HTML Local Storage _uetsid_expContains the expiry-date for the cookie with corresponding name. Maximum Storage Duration: PersistentType: HTML Local Storage _uetvidUsed to track visitors on multiple websites, in order to present relevant advertisement based on the visitor's preferences. Maximum Storage Duration: PersistentType: HTML Local Storage _uetvid_expContains the expiry-date for the cookie with corresponding name. Maximum Storage Duration: PersistentType: HTML Local Storage MSPTCThis cookie registers data on the visitor. The information is used to optimize advertisement relevance. Maximum Storage Duration: 1 yearType: HTTP Cookie MUIDUsed widely by Microsoft as a unique user ID. The cookie enables user tracking by synchronising the ID across many Microsoft domains.Maximum Storage Duration: 1 yearType: HTTP Cookie _uetsidCollects data on visitor behaviour from multiple websites, in order to present more relevant advertisement - This also allows the website to limit the number of times that they are shown the same advertisement. Maximum Storage Duration: 1 dayType: HTTP Cookie _uetvidUsed to track visitors on multiple websites, in order to present relevant advertisement based on the visitor's preferences. Maximum Storage Duration: 1 yearType: HTTP Cookie
Squeezely 6Learn more about this providersqzl_session_idCollects data on visitors. This information is used to assign visitors into segments, making website advertisement more efficient. Maximum Storage Duration: PersistentType: HTML Local Storage sqzl_vwCollects data on visitors. This information is used to assign visitors into segments, making website advertisement more efficient. Maximum Storage Duration: PersistentType: HTML Local Storage sqzllocalCollects data related to the user's visits to the website, such as the number of visits, average time spent on the website and what pages have been loaded, with the purpose of displaying targeted ads.Maximum Storage Duration: PersistentType: HTML Local Storage tPendingMaximum Storage Duration: SessionType: Pixel Tracker sqzl_session_idCollects data on visitors. This information is used to assign visitors into segments, making website advertisement more efficient. Maximum Storage Duration: 1 dayType: HTTP Cookie sqzllocalCollects visitor data related to the user's visits to the website, such as the number of visits, average time spent on the website and what pages have been loaded, with the purpose of displaying targeted ads.Maximum Storage Duration: 30 yearsType: HTTP Cookie
YouTube 21Learn more about this provider#-#Used to track user’s interaction with embedded content.Maximum Storage Duration: SessionType: HTML Local Storage __Secure-ROLLOUT_TOKENPendingMaximum Storage Duration: 180 daysType: HTTP Cookie iU5q-!O9@$Registers a unique ID to keep statistics of what videos from YouTube the user has seen.Maximum Storage Duration: SessionType: HTML Local Storage LAST_RESULT_ENTRY_KEYUsed to track user’s interaction with embedded content.Maximum Storage Duration: SessionType: HTTP Cookie LogsDatabaseV2:V#||LogsRequestsStoreUsed to track user’s interaction with embedded content.Maximum Storage Duration: PersistentType: IndexedDB nextIdUsed to track user’s interaction with embedded content.Maximum Storage Duration: SessionType: HTTP Cookie remote_sidNecessary for the implementation and functionality of YouTube video-content on the website. Maximum Storage Duration: SessionType: HTTP Cookie requestsUsed to track user’s interaction with embedded content.Maximum Storage Duration: SessionType: HTTP Cookie ServiceWorkerLogsDatabase#SWHealthLogNecessary for the implementation and functionality of YouTube video-content on the website. Maximum Storage Duration: PersistentType: IndexedDB TESTCOOKIESENABLEDUsed to track user’s interaction with embedded content.Maximum Storage Duration: 1 dayType: HTTP Cookie VISITOR_INFO1_LIVETries to estimate the users' bandwidth on pages with integrated YouTube videos.Maximum Storage Duration: 180 daysType: HTTP Cookie YSCRegisters a unique ID to keep statistics of what videos from YouTube the user has seen.Maximum Storage Duration: SessionType: HTTP Cookie ytidb::LAST_RESULT_ENTRY_KEYStores the user's video player preferences using embedded YouTube videoMaximum Storage Duration: PersistentType: HTML Local Storage YtIdbMeta#databasesUsed to track user’s interaction with embedded content.Maximum Storage Duration: PersistentType: IndexedDB yt-remote-cast-availableStores the user's video player preferences using embedded YouTube videoMaximum Storage Duration: SessionType: HTML Local Storage yt-remote-cast-installedStores the user's video player preferences using embedded YouTube videoMaximum Storage Duration: SessionType: HTML Local Storage yt-remote-connected-devicesStores the user's video player preferences using embedded YouTube videoMaximum Storage Duration: PersistentType: HTML Local Storage yt-remote-device-idStores the user's video player preferences using embedded YouTube videoMaximum Storage Duration: PersistentType: HTML Local Storage yt-remote-fast-check-periodStores the user's video player preferences using embedded YouTube videoMaximum Storage Duration: SessionType: HTML Local Storage yt-remote-session-appStores the user's video player preferences using embedded YouTube videoMaximum Storage Duration: SessionType: HTML Local Storage yt-remote-session-nameStores the user's video player preferences using embedded YouTube videoMaximum Storage Duration: SessionType: HTML Local Storage
googlesyndication.com ep1.adtrafficquality.google 2pagead/sodar[x2]PendingMaximum Storage Duration: SessionType: Pixel Tracker
www.totallylegal.com 1m_tempUsrIdPendingMaximum Storage Duration: SessionType: HTTP Cookie
Unclassified 7 Unclassified cookies are cookies that we are in the process of classifying, together with the providers of individual cookies.
Appcast 4Learn more about this providercc_utPendingMaximum Storage Duration: 1 yearType: HTTP Cookie _ccidPendingMaximum Storage Duration: PersistentType: HTML Local Storage madgex-te8/a31.pngPendingMaximum Storage Duration: SessionType: Pixel Tracker _ccidPendingMaximum Storage Duration: 1 yearType: HTTP Cookie
Cloudflare 1Learn more about this providercf.turnstile.uPendingMaximum Storage Duration: PersistentType: HTML Local Storage
www.totallylegal.com 2jobIdPendingMaximum Storage Duration: SessionType: HTML Local Storage timeOfLastActionExecutionPendingMaximum Storage Duration: PersistentType: HTML Local Storage
Cross-domain consent[#BULK_CONSENT_DOMAINS_COUNT#] [#BULK_CONSENT_TITLE#]
List of domains your consent applies to: [#BULK_CONSENT_DOMAINS#]
Cookie declaration last updated on 6/21/25 by Cookiebot
[#IABV2_TITLE#]
[#IABV2_BODY_INTRO#]
[#IABV2_BODY_LEGITIMATE_INTEREST_INTRO#]
[#IABV2_BODY_PREFERENCE_INTRO#]
[#IABV2_LABEL_PURPOSES#]
[#IABV2_BODY_PURPOSES_INTRO#]
[#IABV2_BODY_PURPOSES#]
[#IABV2_LABEL_FEATURES#]
[#IABV2_BODY_FEATURES_INTRO#]
[#IABV2_BODY_FEATURES#]
[#IABV2_LABEL_PARTNERS#]
[#IABV2_BODY_PARTNERS_INTRO#]
[#IABV2_BODY_PARTNERS#]
About
Cookies are small text files that can be used by websites to make a user's experience more efficient.
The law states that we can store cookies on your device if they are strictly necessary for the operation of this site. For all other types of cookies we need your permission.
This site uses different types of cookies. Some cookies are placed by third party services that appear on our pages.
You can at any time change or withdraw your consent from the Cookie Declaration on our website.
Learn more about who we are, how you can contact us and how we process personal data in our Privacy Notice and Cookie Notice.
[x] Do not sell or share my personal information
Deny Allow selection Manage preferences Accept all
Skip to main content
Skip to main menu
Skip to user menu
Sign in|
Create account
Recruiters
Find a job
Job alerts
Search recruiters
Careers advice
Upload CV
Find a job
Job alerts
CV upload
More Results
Previous articleOptimising your Job Search: Best...
How Lawyers can Build Their Personal...Next article
Barrister Job Description
Written by: Evie Courtier
Last updated: 15 Jan 2024
Category:
Job Descriptions
Within this Barrister job description, we will dive into commonly asked questions about the role of a Barrister, including: ‘what does a Barrister do?’, and ‘how much does a Barrister earn?’, discovering the requirements and rewards of Barrister jobs in further detail.
What is a Barrister?
What does a Barrister do?
How to become a Barrister
What’s the typical Barrister career path
How much does a Barrister earn?
Barrister jobs on TotallyLegal
What is a Barrister?
Barristers specialise in courtroom advocacy, drafting legal documents and providing independent legal advice for their clients. Barristers have a distinctive role in the legal system, often focusing on presenting cases in court, offering expert legal opinions, and advising clients on different aspects of the law.
Barristers are most commonly self-employed, operating from chambers, (the shared office spaces where groups of Barristers work). Those in Barrister jobs may also work in government departments or agencies such as the Crown Prosecution Service or the Government Legal Profession, or alternatively, within private organisations such as in-house legal departments of charities and companies.
In many legal systems, including the UK jurisdiction, the process of hiring a Barrister involves a Solicitor instructing the Barrister on behalf of the client. In this case, as described in our Solicitor Job Description, the Solicitor handles the initial client contact, gathers evidence, and provides instructions to the Barrister. The Barrister then prepares the case for trial, presents arguments in court, and provides legal opinions.
Barristers are often recognisable from their traditional court attire, wearing a wig and gown, when working in high courts. The legal profession in a myriad of jurisdictions, like England and Wales, maintains a traditional separation between those in Solicitor jobsand Barristers, each specialising in different aspects of legal practice. For more information of the formalities of working as a Solicitor, see our ‘Solicitor Job Description’.
What does a Barrister do?
The daily duties of a Barrister will naturally be determined by the case they're working on at the time. However as a common overview, responsibilities will include:
•Courtroom advocacy: the primary role of a Barrister is to represent clients in court. This involves presenting legal arguments, examining and cross-examining witnesses, and making submissions to the judge or jury.
•Legal advice: Barristers provide expert legal advice to Solicitors, other legal professionals, and directly to clients. This advice may cover a wide range of issues, including the merits of a case, potential legal strategies, and the interpretation of laws.
•Legal research: Barristers conduct extensive legal research to prepare their cases thoroughly. This involves analysing statutes, case law, and legal precedents to support their arguments and provide well-founded advice.
•Drafting legal documents: Barristers are often responsible for drafting legal documents such as pleadings, briefs, and opinions. These documents are crucial in presenting a case coherently and persuasively.
•Negotiation: while Barristers are primarily known for their courtroom work, they may also engage in negotiations to settle cases out of court. This involves discussions with opposing parties to reach mutually agreeable solutions.
•Representation in tribunals: in addition to higher courts, Barristers may represent clients in various tribunals and quasi-judicial bodies, depending on the nature of the legal issue.
•Continuing education: Barristers must stay abreast of developments in the law, attending legal seminars, and engaging in continuing education to maintain their professional competence.
How to become a Barrister
The process of becoming a Barrister involves a dedicated and extensive combination of education, practical training, and meeting specific professional requirements. The path to becoming a Barrister can vary by jurisdiction, but here's a general overview of the steps involved:
Educational Qualifications:
•Undergraduate degree: first things first, you must obtain an undergraduate degree in law or a related field. In some jurisdictions, a non-law degree may be acceptable, with the addition of a conversion course, such as the Graduate Diploma in Law (GDL).
Complete the Bar:
•The Bar Course is a postgraduate qualification that individuals must complete to become qualified as a Barrister. The Bar Course is a one-year, full-time course (or two years if taken part-time), offering a practical and vocational training programme designed to equip expectant Barristers with the skills and knowledge necessary for practice at the Bar.
•Assessment methods include written exams, practical advocacy assessments, and professional skills assessments. Successful completion of the Bar Course, along with pupillage, allows individuals to be “called to the Bar”.
Inns of Court (England and Wales):
•In England and Wales, aspiring Barristers must join one of the four Inns of Court (Lincoln's Inn, Gray's Inn, Inner Temple, or Middle Temple). These institutions provide dining, education, and support services for Barristers.
•Prospective Barristers usually join one of the Inns during their undergraduate law studies or before commencing the Bar Professional Training Course (BPTC).
Call to the Bar:
•After completing the Bar Course, Barristers are eligible to be “called to the Bar” by their Inn, officially allowing them to practise as Barristers. This celebration involves an admission ceremony and the taking of certain oaths or affirmations.
Pupillage or Training Contract:
•The next stage for an aspiring Barrister, is to complete a period of practical training, known as pupillage (in England and Wales) or a training contract (in some other jurisdictions). During this time, individuals work under the supervision of an experienced Barrister or in a legal environment to gain practical skills.
•The process typically lasts for one year, and is divided into two parts: the first six months (non-practicing or "non-practicing period") and the second six months (practising or "practising period").
•The application process for pupillage positions is highly competitive. It usually involves submitting applications to Barristers' chambers, attending interviews, and potentially participating in an assessment process.
Professional Skills Course (PSC):
•In some jurisdictions, Barristers are required to complete a Professional Skills Course (PSC) to develop additional practical skills necessary for legal practice.
What’s the typical Barrister career path
It’s important to note that across the dynamic legal profession, Barristers may choose to navigate their careers based on personal interests, professional opportunities, and changes in the legal landscape. Upon qualification as a Barrister, they may conduct:
Tenancy or Practise as a Sole Practitioner:
•Following successful completion of pupillage, Barristers may either join a set of chambers (tenancy) or choose to practise as sole practitioners. Tenancy decisions are typically based on the individual's performance during pupillage.
Ongoing Professional Development:
•Barristers engage in continuous professional development (CPD) throughout their careers to stay updated on changes in the law, develop new skills, and maintain their professional competence.
Specialisation:
•Barristers often choose to focus on specific areas of law, such as criminal law, family and matrimonial law, commercial litigation, or human rights law. Their expertise allows them to provide focused and knowledgeable representation in their chosen field.
Advancement and Recognition:
•As you accrue experience, you may achieve recognition for your expertise, taking on more complex cases. With progression, comes the opportunity to become King’s Counsel (KC), (formally, Queen’s Counsel), a prestigious designation recognising outstanding advocacy skills and legal knowledge.
Leadership and Advocacy Roles:
•Senior Barristers may take on leadership roles within chambers or the legal profession. They may also become involved in advocacy outside the courtroom, such as contributing to legal reforms, serving on professional bodies, or becoming judges.
How much does a Barrister earn?
As detailed within our latest salary survey, those in Barrister jobs earn a starting salary of £65,277 per annum. Working as a Barrister presents great earning potential, with roles often offering salaries within the six figure region. It’s important to note here that salaries and benefits will adhere to certain practice areas, location, and seniority.
56% of Barristers on site saw a pay rise this year, compared to 14% in 2022. Additionally, 89% conducted a hybrid working arrangement, and 22% received a bonus.
Barrister jobs on TotallyLegal
Ready to apply for the latest Barrister jobs? Reach out and apply at TotallyLegal; the UK’s leading site for legal jobs.
Looking to recruit a Barrister? Advertise with us - discover more with TotallyLegal Recruiter Services.
Related links
Solicitor Job Description
Lawyer Job Description
CV Tips for Training Contract Applications
Share this article
Email this
Facebook
Twitter
LinkedIn
Pinterest
Reddit
Related articles
Legal Practice Manager Job Description
Paralegal Job Description
Legal Associate Job Description
Latest articles
ILSPA Enhances Legal Secretary Training with Insight into AI
Interview with Ella Watts, founder of Ladies of Law
Why construction law jobs are on the rise
Back to top
Facebook
Twitter
LinkedIn
Instagram
About Us
Contact Us
Terms & Conditions
Privacy Policy
Cookie Notice
Newsletter Sign Up
Salary Survey
Accessibility
Advertise with us
Events
Partnerships
© 2014 - 2025 Reach Work Ltd. Powered by Madgex Job Board Platform |
14109 | https://open.oregonstate.education/anatomy2e/chapter/acid-base-balance/ | Skip to content
26.4 Acid-Base Balance
Learning Objectives
By the end of this section, you will be able to:
Identify the most powerful buffer system in the body
Identify the most rapid buffer system in the body
Describe the protein buffer systems.
Explain the way in which the respiratory system affects blood pH
Describe how the kidney affects acid-base balance
Proper physiological functioning depends on a very tight balance between the concentrations of acids and bases in the blood. Acid-balance balance is measured using the pH scale, as shown in Figure 26.4.1. A variety of buffering systems permits blood and other bodily fluids to maintain a narrow pH range, even in the face of perturbations. A buffer is a chemical system that prevents a radical change in fluid pH by dampening the change in hydrogen ion concentrations in the case of excess acid or base. Most commonly, the substance that absorbs the ions is either a weak acid, which takes up hydroxyl ions, or a weak base, which takes up hydrogen ions.
Buffer Systems in the Body
The buffer systems in the human body are extremely efficient, and different systems work at different rates. It takes only seconds for the chemical buffers in the blood to make adjustments to pH. The respiratory tract can adjust the blood pH upward in minutes by exhaling CO2 from the body. The renal system can also adjust blood pH through the excretion of hydrogen ions (H+) and the conservation of bicarbonate, but this process takes hours to days to have an effect.
The buffer systems functioning in blood plasma include plasma proteins, phosphate, and bicarbonate and carbonic acid buffers. The kidneys help control acid-base balance by excreting hydrogen ions and generating bicarbonate that helps maintain blood plasma pH within a normal range. Protein buffer systems work predominantly inside cells.
Protein Buffers in Blood Plasma and Cells
Nearly all proteins can function as buffers. Proteins are made up of amino acids, which contain positively charged amino groups and negatively charged carboxyl groups. The charged regions of these molecules can bind hydrogen and hydroxyl ions, and thus function as buffers. Buffering by proteins accounts for two-thirds of the buffering power of the blood and most of the buffering within cells.
Hemoglobin as a Buffer
Hemoglobin is the principal protein inside of red blood cells and accounts for one-third of the mass of the cell. During the conversion of CO2 into bicarbonate, hydrogen ions liberated in the reaction are buffered by hemoglobin, which is reduced by the dissociation of oxygen. This buffering helps maintain normal pH. The process is reversed in the pulmonary capillaries to re-form CO2, which then can diffuse into the air sacs to be exhaled into the atmosphere. This process is discussed in detail in the chapter on the respiratory system.
Phosphate Buffer
Phosphates are found in the blood in two forms: sodium dihydrogen phosphate (Na2H2PO4−), which is a weak acid, and sodium monohydrogen phosphate (Na2HPO42-), which is a weak base. When Na2HPO42- comes into contact with a strong acid, such as HCl, the base picks up a second hydrogen ion to form the weak acid Na2H2PO4− and sodium chloride, NaCl. When Na2HPO42− (the weak acid) comes into contact with a strong base, such as sodium hydroxide (NaOH), the weak acid reverts back to the weak base and produces water. Acids and bases are still present, but they hold onto the ions.
Bicarbonate-Carbonic Acid Buffer
The bicarbonate-carbonic acid buffer works in a fashion similar to phosphate buffers. The bicarbonate is regulated in the blood by sodium, as are the phosphate ions. When sodium bicarbonate (NaHCO3), comes into contact with a strong acid, such as HCl, carbonic acid (H2CO3), which is a weak acid, and NaCl are formed. When carbonic acid comes into contact with a strong base, such as NaOH, bicarbonate and water are formed.
As with the phosphate buffer, a weak acid or weak base captures the free ions, and a significant change in pH is prevented. Bicarbonate ions and carbonic acid are present in the blood in a 20:1 ratio if the blood pH is within the normal range. With 20 times more bicarbonate than carbonic acid, this capture system is most efficient at buffering changes that would make the blood more acidic. This is useful because most of the body’s metabolic wastes, such as lactic acid and ketones, are acids. Carbonic acid levels in the blood are controlled by the expiration of CO2 through the lungs. In red blood cells, carbonic anhydrase forces the dissociation of the acid, rendering the blood less acidic. Because of this acid dissociation, CO2 is exhaled (see equations above). The level of bicarbonate in the blood is controlled through the renal system, where bicarbonate ions in the renal filtrate are conserved and passed back into the blood. However, the bicarbonate buffer is the primary buffering system of the IF surrounding the cells in tissues throughout the body.
Respiratory Regulation of Acid-Base Balance
The respiratory system contributes to the balance of acids and bases in the body by regulating the blood levels of carbonic acid (Figure 26.4.2). CO2 in the blood readily reacts with water to form carbonic acid, and the levels of CO2 and carbonic acid in the blood are in equilibrium. When the CO2 level in the blood rises (as it does when you hold your breath), the excess CO2 reacts with water to form additional carbonic acid, lowering blood pH. Increasing the rate and/or depth of respiration (which you might feel the “urge” to do after holding your breath) allows you to exhale more CO2. The loss of CO2 from the body reduces blood levels of carbonic acid and thereby adjusts the pH upward, toward normal levels. As you might have surmised, this process also works in the opposite direction. Excessive deep and rapid breathing (as in hyperventilation) rids the blood of CO2 and reduces the level of carbonic acid, making the blood too alkaline. This brief alkalosis can be remedied by rebreathing air that has been exhaled into a paper bag. Rebreathing exhaled air will rapidly bring blood pH down toward normal.
Figure 26.4.2 – Respiratory Regulation of Blood pH: The respiratory system can reduce blood pH by removing CO2 from the blood.
The chemical reactions that regulate the levels of CO2 and carbonic acid occur in the lungs when blood travels through the lung’s pulmonary capillaries. Minor adjustments in breathing are usually sufficient to adjust the pH of the blood by changing how much CO2 is exhaled. In fact, doubling the respiratory rate for less than 1 minute, removing “extra” CO2, would increase the blood pH by 0.2. This situation is common if you are exercising strenuously over a period of time. To keep up the necessary energy production, you would produce excess CO2 (and lactic acid if exercising beyond your aerobic threshold). In order to balance the increased acid production, the respiration rate goes up to remove the CO2. This helps to keep you from developing acidosis.
The body regulates the respiratory rate by the use of chemoreceptors, which primarily use CO2 as a signal. Peripheral blood sensors are found in the walls of the aorta and carotid arteries. These sensors signal the brain to provide immediate adjustments to the respiratory rate if CO2 levels rise or fall. Yet other sensors are found in the brain itself. Changes in the pH of CSF affect the respiratory center in the medulla oblongata, which can directly modulate breathing rate to bring the pH back into the normal range.
Hypercapnia, or abnormally elevated blood levels of CO2, occurs in any situation that impairs respiratory functions, including pneumonia and congestive heart failure. Reduced breathing (hypoventilation) due to drugs such as morphine, barbiturates, or ethanol (or even just holding one’s breath) can also result in hypercapnia. Hypocapnia, or abnormally low blood levels of CO2, occurs with any cause of hyperventilation that drives off the CO2, such as salicylate toxicity, elevated room temperatures, fever, or hysteria.
Renal Regulation of Acid-Base Balance
The renal regulation of the body’s acid-base balance addresses the metabolic component of the buffering system. Whereas the respiratory system (together with breathing centers in the brain) controls the blood levels of carbonic acid by controlling the exhalation of CO2, the renal system controls the blood levels of bicarbonate. A decrease of blood bicarbonate can result from the inhibition of carbonic anhydrase by certain diuretics or from excessive bicarbonate loss due to diarrhea. Blood bicarbonate levels are also typically lower in people who have Addison’s disease (chronic adrenal insufficiency), in which aldosterone levels are reduced, and in people who have renal damage, such as chronic nephritis. Finally, low bicarbonate blood levels can result from elevated levels of ketones (common in unmanaged diabetes mellitus), which bind bicarbonate in the filtrate and prevent its conservation.
Bicarbonate ions, HCO3–, found in the filtrate, are essential to the bicarbonate buffer system, yet the cells of the tubule are not permeable to bicarbonate ions. The steps involved in supplying bicarbonate ions to the system are seen in Figure 26.4.3 and are summarized below:
Step 1: Sodium ions are reabsorbed from the filtrate in exchange for H+ by an antiport mechanism in the apical membranes of cells lining the renal tubule.
Step 2: The cells produce bicarbonate ions that can be shunted to peritubular capillaries.
Step 3: When CO2 is available, the reaction is driven to the formation of carbonic acid, which dissociates to form a bicarbonate ion and a hydrogen ion.
Step 4: The bicarbonate ion passes into the peritubular capillaries and returns to the blood. The hydrogen ion is secreted into the filtrate, where it can become part of new water molecules and be reabsorbed as such, or removed in the urine.
Figure 26.4.3 Conservation of Bicarbonate in the Kidney: Tubular cells are not permeable to bicarbonate; thus, bicarbonate is conserved rather than reabsorbed. Steps 1 and 2 of bicarbonate conservation are indicated.
It is also possible that salts in the filtrate, such as sulfates, phosphates, or ammonia, will capture hydrogen ions. If this occurs, the hydrogen ions will not be available to combine with bicarbonate ions and produce CO2. In such cases, bicarbonate ions are not conserved from the filtrate to the blood, which will also contribute to a pH imbalance and acidosis.
The hydrogen ions also compete with potassium to exchange with sodium in the renal tubules. If more potassium is present than normal, potassium, rather than the hydrogen ions, will be exchanged, and increased potassium enters the filtrate. When this occurs, fewer hydrogen ions in the filtrate participate in the conversion of bicarbonate into CO2 and less bicarbonate is conserved. If there is less potassium, more hydrogen ions enter the filtrate to be exchanged with sodium and more bicarbonate is conserved.
Chloride ions are important in neutralizing positive ion charges in the body. If chloride is lost, the body uses bicarbonate ions in place of the lost chloride ions. Thus, lost chloride results in an increased reabsorption of bicarbonate by the renal system.
Disorders of Fluid Balance: Acid-Base Balance: Ketoacidosis
Diabetic acidosis, or ketoacidosis, occurs most frequently in people with poorly controlled diabetes mellitus. When certain tissues in the body cannot get adequate amounts of glucose, they depend on the breakdown of fatty acids for energy. When acetyl groups break off the fatty acid chains, the acetyl groups then non-enzymatically combine to form ketone bodies, acetoacetic acid, beta-hydroxybutyric acid, and acetone, all of which increase the acidity of the blood. In this condition, the brain isn’t supplied with enough of its fuel—glucose—to produce all of the ATP it requires to function.
Ketoacidosis can be severe and, if not detected and treated properly, can lead to diabetic coma, which can be fatal. A common early symptom of ketoacidosis is deep, rapid breathing as the body attempts to drive off CO2 and compensate for the acidosis. Another common symptom is fruity-smelling breath, due to the exhalation of acetone. Other symptoms include dry skin and mouth, a flushed face, nausea, vomiting, and stomach pain. Treatment for diabetic coma is ingestion or injection of sugar; its prevention is the proper daily administration of insulin.
A person who is diabetic and uses insulin can initiate ketoacidosis if a dose of insulin is missed. Among people with type 2 diabetes, those of Hispanic and African American descent are more likely to go into ketoacidosis than those of other ethnic backgrounds, although the reason for this is unknown.
Chapter Review
A variety of buffering systems exist in the body that helps maintain the pH of the blood and other fluids within a narrow range—between pH 7.35 and 7.45. A buffer is a substance that prevents a radical change in fluid pH by absorbing excess hydrogen or hydroxyl ions. Most commonly, the substance that absorbs the ion is either a weak acid, which takes up a hydroxyl ion (OH–), or a weak base, which takes up a hydrogen ion (H+). Several substances serve as buffers in the body, including cell and plasma proteins, hemoglobin, phosphates, bicarbonate ions, and carbonic acid. The bicarbonate buffer is the primary buffering system of the IF surrounding the cells in tissues throughout the body. The respiratory and renal systems also play major roles in acid-base homeostasis by removing CO2 and hydrogen ions, respectively, from the body.
Review Questions
Critical Thinking Questions
Describe the conservation of bicarbonate ions in the renal system.
Reveal
Bicarbonate ions are freely filtered through the glomerulus. They cannot pass freely into the renal tubular cells and must be converted into CO2 in the filtrate, which can pass through the cell membrane. Sodium ions are reabsorbed at the membrane, and hydrogen ions are expelled into the filtrate. The hydrogen ions combine with bicarbonate, forming carbonic acid, which dissociates into CO2 gas and water. The gas diffuses into the renal cells where carbonic anhydrase catalyzes its conversion back into a bicarbonate ion, which enters the blood.
Describe the control of blood carbonic acid levels through the respiratory system.
Reveal
Carbonic acid blood levels are controlled through the respiratory system by the expulsion of CO2 from the lungs. The formula for the production of bicarbonate ions is reversible if the concentration of CO2 decreases. As this happens in the lungs, carbonic acid is converted into a gas, and the concentration of the acid decreases. The rate of respiration determines the amount of CO2 exhaled. If the rate increases, less acid is in the blood; if the rate decreases, the blood can become more acidic.
Glossary
hypercapnia
: abnormally elevated blood levels of CO2
hypocapnia
: abnormally low blood levels of CO2 |
14110 | https://study.com/academy/lesson/arc-length-of-a-sector-definition-and-area.html | Arc Length & Sector Area | Definition, Formula & Examples - Lesson | Study.com
Log In
Sign Up
Menu
Plans
Courses
By Subject
College Courses
High School Courses
Middle School Courses
Elementary School Courses
By Subject
Arts
Business
Computer Science
Education & Teaching
English (ELA)
Foreign Language
Health & Medicine
History
Humanities
Math
Psychology
Science
Social Science
Subjects
Art
Business
Computer Science
Education & Teaching
English
Health & Medicine
History
Humanities
Math
Psychology
Science
Social Science
Art
Architecture
Art History
Design
Performing Arts
Visual Arts
Business
Accounting
Business Administration
Business Communication
Business Ethics
Business Intelligence
Business Law
Economics
Finance
Healthcare Administration
Human Resources
Information Technology
International Business
Operations Management
Real Estate
Sales & Marketing
Computer Science
Computer Engineering
Computer Programming
Cybersecurity
Data Science
Software
Education & Teaching
Education Law & Policy
Pedagogy & Teaching Strategies
Special & Specialized Education
Student Support in Education
Teaching English Language Learners
English
Grammar
Literature
Public Speaking
Reading
Vocabulary
Writing & Composition
Health & Medicine
Counseling & Therapy
Health
Medicine
Nursing
Nutrition
History
US History
World History
Humanities
Communication
Ethics
Foreign Languages
Philosophy
Religious Studies
Math
Algebra
Basic Math
Calculus
Geometry
Statistics
Trigonometry
Psychology
Clinical & Abnormal Psychology
Cognitive Science
Developmental Psychology
Educational Psychology
Organizational Psychology
Social Psychology
Science
Anatomy & Physiology
Astronomy
Biology
Chemistry
Earth Science
Engineering
Environmental Science
Physics
Scientific Research
Social Science
Anthropology
Criminal Justice
Geography
Law
Linguistics
Political Science
Sociology
Teachers
Teacher Certification
Teaching Resources and Curriculum
Skills Practice
Lesson Plans
Teacher Professional Development
For schools & districts
Certifications
Teacher Certification Exams
Nursing Exams
Real Estate Exams
Military Exams
Finance Exams
Human Resources Exams
Counseling & Social Work Exams
Allied Health & Medicine Exams
All Test Prep
Teacher Certification Exams
Praxis Test Prep
FTCE Test Prep
TExES Test Prep
CSET & CBEST Test Prep
All Teacher Certification Test Prep
Nursing Exams
NCLEX Test Prep
TEAS Test Prep
HESI Test Prep
All Nursing Test Prep
Real Estate Exams
Real Estate Sales
Real Estate Brokers
Real Estate Appraisals
All Real Estate Test Prep
Military Exams
ASVAB Test Prep
AFOQT Test Prep
All Military Test Prep
Finance Exams
SIE Test Prep
Series 6 Test Prep
Series 65 Test Prep
Series 66 Test Prep
Series 7 Test Prep
CPP Test Prep
CMA Test Prep
All Finance Test Prep
Human Resources Exams
SHRM Test Prep
PHR Test Prep
aPHR Test Prep
PHRi Test Prep
SPHR Test Prep
All HR Test Prep
Counseling & Social Work Exams
NCE Test Prep
NCMHCE Test Prep
CPCE Test Prep
ASWB Test Prep
CRC Test Prep
All Counseling & Social Work Test Prep
Allied Health & Medicine Exams
ASCP Test Prep
CNA Test Prep
CNS Test Prep
All Medical Test Prep
College Degrees
College Credit Courses
Partner Schools
Success Stories
Earn credit
Sign Up
Math Courses / Geometry: High School Course
Arc Length & Sector Area | Definition, Formula & Examples
Lesson
Transcript
Roberto Robert Santiago, Jeff Calareso
Author Roberto Robert Santiago
Roberto has worked for 10 years as an educator: six of them teaching 5th grade Math to Precalculus in Puerto Rico and four of them in Arizona as a Middle School teacher. I also have a BA Degree in Secondary Education from the University of Puerto Rico, Rio Piedras Campus.
View bio
Instructor Jeff Calareso
Jeff teaches high school English, math and other subjects. He has a master's degree in writing and literature.
View bio
Learn how to find the arc length of a sector with the formula and examples. Understand the formula and the method to find the area of a sector with examples. Updated: 11/21/2023
Table of Contents
Arc Length and Sector Area
Arc Length of a Sector Formula
How to Find the Arc Length of a Sector.
Area of a Sector Formula
How to Find the Area of an Arc.
Lesson Summary
Show
Frequently Asked Questions
What is the formula for the area of the sector?
The formula to calculate the area of the sector is A=θ 360 o×π r 2, where you would need the measure of the central angle in degrees and the radius length.
What is the formula for arc length of a sector?
The formula to find the arc length of a sector is as follows: s=r θ, where you would need the length of the radius between the endpoint of the arc and the center of the circle, and the angle's measure in radians.
How do you find arc length with angle and radius?
To find arc length given an angle measure and a radius, you would need to first convert the angle measure into radians, then multiply that number by the length of the radius.
Create an account
Table of Contents
Arc Length and Sector Area
Arc Length of a Sector Formula
How to Find the Arc Length of a Sector.
Area of a Sector Formula
How to Find the Area of an Arc.
Lesson Summary
Show
Arc Length and Sector Area --------------------------
When working with circles, you may come across a situation where you do not need to know the entire circumference of it, only the arc length between two points around it. Generally speaking, an arc of a circle is a smooth curved bounded by two distinct points. Alternatively, any arc is a portion of the circumference of a circle, bounded by two points, rather than the entire circle. Arc length is the distance of the arc bounded by two points. A sector of a circle is the area that is between the two radii of the circle that uses the endpoints of the arc.
Arc is the length between the curve between two points. A sector is an area that is bounded by an arc and the two radii connecting the endpoints of the arc and the center of the circle.
In the above image, the endpoints of arc BC are connecting from center point A, forming radii AC and AB. The sector is the area between those two radii.
To unlock this lesson you must be a Study.com Member.
Create your account
Click for sound
6:30
You must c C reate an account to continue watching
Register to view this lesson
Are you a student or a teacher?
I am a student I am a teacher
Create Your Account To Continue Watching
As a member, you'll also get unlimited access to over 88,000 lessons in math, English, science, history, and more. Plus, get practice tests, quizzes, and personalized coaching to help you succeed.
Get unlimited access to over 88,000 lessons.
Try it now
Try it now.
Already registered? Log in here for access
Back
Resources created by teachers for teachers
Over 30,000 video lessons& teaching resources‐all in one place.
Video lessons
Quizzes & Worksheets
Classroom Integration
Lesson Plans
I would definitely recommend Study.com to my colleagues. It’s like a teacher waved a magic wand and did the work for me. I feel like it’s a lifeline.
Jennifer B.
Teacher
Try it now
Back
Coming up next: Circumscribed Circle of a Triangle | Overview & Examples
You're on a roll. Keep up the good work!
Take QuizWatch Next Lesson
Replay
Just checking in. Are you still watching?
Yes! Keep playing.
Your next lesson will play in 10 seconds
0:07 Circles
0:39 What is a Sector?
1:45 Area of Sector - Central Angle
3:27 Arc Length
4:29 Area of Sector - Arc Length
5:22 Lesson Summary
View Video Only
Save
Timeline
97K views
Video
Quiz
Course
Video Only
97K views
Arc Length of a Sector Formula ------------------------------
To find the length of the arc, we need two things: the length of the radius and the measure of the central angle. We will label arc BC as s. Additionally, we need the length of one of the radii (r) and the measure of the central angle (the angle whose vertex is at the center of the circle), which we will label as θ. The formula looks like this: s=r θ
By learning about arc lengths and sector areas, you can calculate regions bounded by roads, including u-turns and sharp turns.
Keep in mind that the measure of the central angle must be expressed in radians rather than in degrees. To convert from degrees to radians use the following formula:
θ=d o(π 180 o) where d o is the measure of the central angle, in degrees. If we were to substitute this piece by θ we would have this expanded form of the arc length formula:
s=r d(π 180).
To unlock this lesson you must be a Study.com Member.
Create your account
How to Find the Arc Length of a Sector. ---------------------------------------
Once you know your radius length and the degree (or radian) measure of your central angle, follow these steps:
Convert angle measure to radian measure, if necessary.
Multiply the radian measure by the length of the radius and round the product to the desired number place.
Example 1: Find the length of arc BC, as shown on the diagram below. Assume the length measures are in centimeters. Round to the nearest tenth of a centimeter.
Figure for Example 1. Created using GeoGebra.
First, we identify our angle measure and convert it into radians. In this example, the angle measure is 82 degrees, so we must convert that into radians as shown below:
θ=82(π 180) We then simplify our fraction 82 180: π, leading to this measure in radians:
θ=41 90 π Now we plug in the angle measure and our radius measure in the arc length formula and calculate the length:
s=r θ s=3.5(41 90 π)s≈3.5(0.4556)(3.14)s≈5.0
Therefore, the length of arc BC is about 5.0 centimeters.
Example 2: Calculate arc length XY using the information on the diagram below. Round to the nearest tenth is possible.
Illustration of Example 2. Created using GeoGebra.
We first convert the angle measure into a radian measure.
θ=45 180 π=1 4 π Then we plug in our values to find the measure of arc XY:
s=r θ s=7.3(1 4 π)s≈7.3(0.25)(3.14)s≈5.7305 s≈5.7 Thus, the length of arc XY is approximately 5.7 units.
To unlock this lesson you must be a Study.com Member.
Create your account
Area of a Sector Formula ------------------------
The formula for the area of a sector, or the area of the arc. We need the same things as with the formula to find the length of a sector (arc length): the length of the radius and the measure of the central angle. The area of the sector is the region bounded between the sides of the central angle. The formula is shown below:
A=θ 360 o×π r 2 o r A=π r 2 θ 360 o
In this formula, you do not need to convert the angle measure into a radian measure.
To unlock this lesson you must be a Study.com Member.
Create your account
How to Find the Area of an Arc. -------------------------------
To find the area of the arc bounded by the central angle of a circle, follow these steps:
Divide the angle measure by 360 degrees.
Calculate the Area of the Circle
Multiply the result from step 1 by the result from step 2.
Example 3: Calculate the area of the sector bounded by the central angle XZY. Round to the nearest hundredth if possible. Use the information below and assume the measures are in units.
Illustration for Example 3. Created using GeoGebra.
1. Divide the angle measure by 360 degrees:60 360=1 6 o r a p p r o x i m a t e l y 0.1667
2. We then calculate the area of the complete circle:
A=π r 2≈3.14(15.5 2)≈754.39
3. Finally, we multiply the result from steps 1 and 2: A r e a o f s e c t o r≈0.1667(754.39)≈125.76 u n i t s 2
So, the area of the sector bounded by angle XZY is about 125.76 square units.
To unlock this lesson you must be a Study.com Member.
Create your account
Lesson Summary --------------
To calculate the length of the arc or the length of a sector, follow these steps:
Convert angle measure to radian measure, if necessary.
Multiply the radian measure by the length of the radius and round the product to the desired number place.
To calculate the area of the sector bounded by a central angle, follow these steps:
Divide the angle measure by 360 degrees.
Calculate the Area of the Circle
Multiply the result from step 1 by the result from step 2.
To unlock this lesson you must be a Study.com Member.
Create your account
Video Transcript
Circles
If you're like me, you think about pizza often. And with pizza, there's so much to consider. Thin crust or deep dish. Pepperoni or veggies. Red pepper flakes sprinkled on top or a ridiculous amount of red pepper flakes poured on top. Mmm, tasty and burning.
Now, most pizzas are circles. And circles are geometry. So, why not contemplate geometry while you eat pizza? It's still not healthy for your body, but at least it can be good for your brain!
What is a Sector?
That slice of pizza? That's called a sector. A sector is a part of a circle enclosed by two radii and the connecting arc. You can have a normal pizza slice sector, or you can have a gigantic pizza slice sector. The key is that it touches the center of the circle and is bound by the two radius lines.
All sectors have a central angle. This is the angle the sector subtends to the center of the circle. We know there are 360 degrees in a circle, so the central angle will be some subsection of that. In this slice, it's 45 degrees:
The central angle here is 45 degrees.
In this one, it's 90:
The central angle here is 90 degrees.
That's a special sector known as a quadrant. Get it? 'Quad-' means 4, and this is one-fourth of the circle. In our half-pizza slice below, it's 180 degrees. That's a special sector called a semicircle.
This is a special sector called a semicircle.
We can also look at it in radians instead of degrees. A radian is just a different way of measuring an angle. A radian is what you get when you take the radius of the circle and lay it on the circumference.
Area of Sector - Central Angle
So, let's say you've got your normal-sized pizza slice, and you want to know its area. The area of a sector can be found in a couple of different ways, depending on what you know. You'll always need to know the radius. Remember, the radius is half the diameter. So, in a 12-inch pizza, the radius is 6 inches.
If we wanted the area of the entire circle, it's πr 2. For the semicircle? 1/2πr 2, since it's half the circle. The principle of the area of a sector follows this same logic. We just take the circle area formula and multiply it by a fraction that represents our sector.
If you know the central angle, the area is (n/360)πr 2, where n is the number of degrees in the central angle. So, let's say our sector has an angle of 23 degrees. Let's plug that into the formula for our slice with a 6-inch radius. Its area is (23/360)π6 2. That's 7.2 inches squared.
If we know the angle in radians, it's even simpler. It follows the same logic. We start with πr 2. A circle has a total angle of 2π. So, if we call our angle theta, then the equivalent of n/360 is (theta)/(2π). Plug that into the same formula: ((theta)/(2π))πr 2. That simplifies to ((theta)/2)r 2. So, if our angle is .4 radians, then we have (.4/2)6 2. Again, we get 7.2 inches squared.
Arc Length
This works if we know the central angle. But what if we don't? We then need to know the arc length. The arc length is the distance along the arc, or circumference of the circle. We write this as lAB.
If you need to find the area of a sector using the arc length, that distance will be given to you. But know that you can figure it out if you have the central angle. We just take the circumference formula (2πr) and multiply that by n/360, so it's 2πr(n/360). That looks familiar, doesn't it? It's the same as the area of a sector formula, just swapping the circumference for the area.
In radians, it's even simpler. Again, a radian is what you get when you take the radius of a circle and lay it on the circumference. So, it's directly related to the circumference. Therefore, the arc length in radians is rC, where r is the radius, and C is the central angle in radians.
Area of Sector - Arc Length
Ok, now let's find out the area of a sector using arc length. Again, this is handy if you're given the radius and arc length, but not the central angle. Here, the area of a sector is just 1/2rL, where r is the radius, and L is the arc length. How can you remember this? Just take your sector, or pizza slice, and turn it like this:
A sector looks like a triangle, which can help you remember the formula.
What does that look like? A triangle! And what's the area formula for a triangle? 1/2baseheight. That's looks a lot like 1/2radiusarc length, doesn't it?
Let's go back to our pizza slice. Let's say the radius is 5 inches, and the arc length is 4 inches. Just plug that into 1/2rL, and we get 1/254. That's going to be 10 square inches.
Lesson Summary
In summary, we learned about sectors and arc lengths. A sector is basically your pizza slice, or the section of a circle bound by two radii and an arc, which is the part of the circumference between the radius lines.
If we know the radius and the central angle, or the angle formed by the radii, we can find the area of the sector by converting the area of a circle formula. If we're using degrees, it's n/360 (where n is the number of degrees) times pi times the radius squared. If we're using radians, it's just theta divided by 2, where theta is the central angle in radians, times the radius squared.
We then looked at arc lengths. You can find the arc length by converting the circumference formula. With a central angle in degrees, it's 2 times pi times the radius (that's the circumference formula) times n/360, where n is the central angle. With radians, it's just the radius times the angle, or rC.
To find the area of a sector using the arc length, you find 1/2 times the radius times the arc length. This is very similar to the area of a triangle formula.
We also justified eating pizza as a mental workout. Feel free to tell yourself that the next time you grab a slice.
Learning Outcomes
Studying this lesson could provide you with the ability to:
Define sector, arc length and central angle
Find the area of a sector using either arc length or by converting the area of a circle formula
Register to view this lesson
Are you a student or a teacher?
I am a student I am a teacher
Unlock Your Education
See for yourself why 30 million people use Study.com
Become a Study.com member and start learning now.
Become a Member
Already a member? Log In
Back
Resources created by teachers for teachers
Over 30,000 video lessons& teaching resources‐all in one place.
Video lessons
Quizzes & Worksheets
Classroom Integration
Lesson Plans
I would definitely recommend Study.com to my colleagues. It’s like a teacher waved a magic wand and did the work for me. I feel like it’s a lifeline.
Jennifer B.
Teacher
Try it now
Back
Recommended Lessons and Courses for You
Related Lessons
Related Courses
Recommended Lessons for You
Centroid & Center of Mass of a Semicircle | Overview & Examples
Surface Area of a Hemisphere | Overview & Formula
Finding the Radius of a Circle | Formula & Examples
Area of a Sector | Formula & Examples
Volume & Surface Area of a Sphere | Formula & Examples
Hemisphere in Math | Definition, Shape & Formula
Surface Area & Volume of an Octahedron
3D Shapes | Types, Properties & Examples
Polyhedron | Definition, Types & Examples
Three-Dimensional Shapes | Definition, Types & Characteristics
3-D Shapes: Lesson for Kids
Octahedron | Definition, Bases & Properties
Indirect Measurement Meaning & Examples
Surface Area & Volume of a Cone | Formula & Calculation
Cylinder Lesson for Kids: Definition & Facts
Height of a Cylinder | Overview, Formula & Examples
Surface Area of a Cylinder | Formula & Calculation
Cones Lesson for Kids: Definition & Properties
Slant Height | Definition, Formula & Example
Volume of a Cone | Definition, Formula & Examples
Related Courses
GED Math: Quantitative, Arithmetic & Algebraic Problem Solving
NY Regents - Geometry Study Guide and Exam Prep
Holt Geometry: Online Textbook Help
Glencoe Geometry: Online Textbook Help
Amsco Geometry: Online Textbook Help
Holt McDougal Larson Geometry: Online Textbook Help
Geometry Proofs: Help & Tutorials
Basic Geometry: Help & Review
Geometry 101: Intro to Geometry
10th Grade Geometry Textbook
Ohio End of Course Exam - Geometry: Study Guide and Test Prep
Big Ideas Math Geometry: Online Textbook Help
ICAS Mathematics - Paper G & H: Test Prep & Practice
Indiana Core Assessments Mathematics: Test Prep & Study Guide
View High School: Geometry
Foundational Mathematics: Bridge to College
SAT Subject Test Mathematics Level 2: Practice and Study Guide
SAT Mathematics Level 2: Help and Review
Critical Thinking Study Guide
CUNY Assessment Test in Math: Practice & Study Guide
Start today. Try it now
Geometry: High School
14 chapters | 145 lessons
Ch 1. High School Geometry: Foundations of...
Ch 2. High School Geometry: Logic in...
Ch 3. High School Geometry: Introduction to...
Ch 4. High School Geometry: Properties of...
Ch 5. High School Geometry: Triangles,...
Ch 6. High School Geometry: Parallel Lines...
Ch 7. High School Geometry: Similar...
Ch 8. High School Geometry:...
Ch 9. High School Geometry: Circular Arcs and Circles
Finding the Area & Circumference of a Circle 7:24
Arc of a Circle | Overview, Length & Examples 4:36
Central and Inscribed Angles: Definitions and Examples 6:32
Measure of an Arc: Process & Practice 4:51
How to Find the Measure of an Inscribed Angle 5:09
Tangent of a Circle | Definition, Formula & Examples 3:52
Measurements of Angles Involving Tangents, Chords & Secants 6:59
Measurements of Lengths Involving Tangents, Chords and Secants 5:44
Inscribed and Circumscribed Figures: Definition & Construction 6:32
Arc Length & Sector Area | Definition, Formula & Examples 6:39
3:53 Next Lesson Circumscribed Circle of a Triangle | Overview & Examples
Ch 10. High School Geometry: Conic...
Ch 11. High School Geometry: Geometric...
Ch 12. High School Geometry: Analytical...
Ch 13. High School Geometry:...
Ch 14. High School Geometry: Introduction to...
Arc Length & Sector Area | Definition, Formula & Examples Related Study Materials
Related Lessons
Centroid & Center of Mass of a Semicircle | Overview & Examples
Surface Area of a Hemisphere | Overview & Formula
Finding the Radius of a Circle | Formula & Examples
Area of a Sector | Formula & Examples
Volume & Surface Area of a Sphere | Formula & Examples
Hemisphere in Math | Definition, Shape & Formula
Surface Area & Volume of an Octahedron
3D Shapes | Types, Properties & Examples
Polyhedron | Definition, Types & Examples
Three-Dimensional Shapes | Definition, Types & Characteristics
3-D Shapes: Lesson for Kids
Octahedron | Definition, Bases & Properties
Indirect Measurement Meaning & Examples
Surface Area & Volume of a Cone | Formula & Calculation
Cylinder Lesson for Kids: Definition & Facts
Height of a Cylinder | Overview, Formula & Examples
Surface Area of a Cylinder | Formula & Calculation
Cones Lesson for Kids: Definition & Properties
Slant Height | Definition, Formula & Example
Volume of a Cone | Definition, Formula & Examples
Related Courses
GED Math: Quantitative, Arithmetic & Algebraic Problem Solving
NY Regents - Geometry Study Guide and Exam Prep
Holt Geometry: Online Textbook Help
Glencoe Geometry: Online Textbook Help
Amsco Geometry: Online Textbook Help
Holt McDougal Larson Geometry: Online Textbook Help
Geometry Proofs: Help & Tutorials
Basic Geometry: Help & Review
Geometry 101: Intro to Geometry
10th Grade Geometry Textbook
Ohio End of Course Exam - Geometry: Study Guide and Test Prep
Big Ideas Math Geometry: Online Textbook Help
ICAS Mathematics - Paper G & H: Test Prep & Practice
Indiana Core Assessments Mathematics: Test Prep & Study Guide
View High School: Geometry
Foundational Mathematics: Bridge to College
SAT Subject Test Mathematics Level 2: Practice and Study Guide
SAT Mathematics Level 2: Help and Review
Critical Thinking Study Guide
CUNY Assessment Test in Math: Practice & Study Guide
Related Topics
Browse by Courses
Explorations in Core Math - Grade 8: Online Textbook Help
MoGEA Mathematics Subtest (068) Study Guide and Test Prep
Harcourt On Core Mathematics - Algebra 1: Online Textbook Help
MTTC Mathematics (Elementary) (089) Study Guide and Test Prep
Big Ideas Math Geometry: Online Textbook Help
Explorations in Core Math - Geometry: Online Textbook Help
MTLE Middle Level Mathematics Study Guide and Test Prep
Explorations in Core Math - Algebra 2: Online Textbook Help
Big Ideas Math Algebra 1: Online Textbook Help
ACCESS Math: Online Textbook Help
MTEL Mathematics (Elementary) (68) Study Guide and Test Prep
Smarter Balanced Assessments - Math Grade 11 Study Guide and Test Prep
Algebra for Teachers: Professional Development
Discovering Geometry An Investigative Approach: Online Help
Study.com ACT Study Guide and Test Prep
Browse by Lessons
3D Shapes Games & Activities
Geometry of Three-Dimensional Objects Activities for Middle School
Right Solid: Definition, Area & Volume
3-D Shapes Lesson Plan
Properties of Solid Shapes Lesson Plan
Cubes: Lesson for Kids
Cubes Lesson Plan
Similar Solids: Definition, Properties, Area & Volume
Surface Area of a Cylinder Games
Surface Area of a Cylinder Lesson Plan
Triangular Prism | Definition, Structure & Examples
Dodecahedron: Volume & Surface Area Formulas
Triangular Prism Lesson for Kids: Definition & Facts
Right Prism Definition, Geometry & Examples
Trapezoidal Prism | Surface Area, Volume & Examples
Create an account to start this course today
Used by over 30 million students worldwide
Create an account
Like this lessonShare
Explore our library of over 88,000 lessons
Search
Browse
Browse by subject
College Courses
Business
English
Foreign Language
History
Humanities
Math
Science
Social Science
See All College Courses
High School Courses
AP
Common Core
GED
High School
See All High School Courses
Other Courses
College & Career Guidance Courses
College Placement Exams
Entrance Exams
General Test Prep
K-8 Courses
Skills Courses
Teacher Certification Exams
See All Other Courses
Upgrade to enroll×
Upgrade to Premium to enroll in Geometry: High School
Enrolling in a course lets you earn progress by passing quizzes and exams.
Track course progress
Take quizzes and exams
Earn certificates of completion
You will also be able to:
Create a Goal
Create custom courses
Get your questions answered
Upgrade to Premium to add all these features to your account!
Upgrade Now
Upgrade to Premium to add all these features to your account!
Download the app
Plans
Student Solutions
Teacher Solutions
Study.com for Schools
Working Scholars® Solutions
Online tutoring
About Us
Blog
Careers
Teach For Us
Press Center
Ambassador
Scholarships
Support
FAQ
Site Feedback
Download the app
Working Scholars® Bringing Tuition-Free College to the Community
© Copyright 2025 Study.com. All other trademarks and copyrights are the property of their respective owners. All rights reserved.
Terms of UsePrivacy PolicyDMCA NoticeADA ComplianceHonor Code For Students |
14111 | https://en.wikipedia.org/wiki/Functional_differential_equation | Jump to content
Search
Contents
(Top)
1 Definition
1.1 Examples
2 Types of functional differential equations
2.1 Differential difference equation
2.1.1 Delay differential equation
2.1.2 Neutral differential equations
2.2 Integro-differential equation
3 Application
3.1 Population growth with time lag
3.2 Mixing model
3.3 Volterra's predator-prey model
3.4 Other models using FDEs
4 See also
5 References
6 Further reading
Functional differential equation
Català
Edit links
Article
Talk
Read
Edit
View history
Tools
Actions
Read
Edit
View history
General
What links here
Related changes
Upload file
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Print/export
Download as PDF
Printable version
In other projects
Wikidata item
Appearance
From Wikipedia, the free encyclopedia
A functional differential equation is a differential equation with deviating argument. That is, a functional differential equation is an equation that contains a function and some of its derivatives evaluated at different argument values.
Functional differential equations find use in mathematical models that assume a specified behavior or phenomenon depends on the present as well as the past state of a system. In other words, past events explicitly influence future results. For this reason, functional differential equations are more applicable than ordinary differential equations (ODE), in which future behavior only implicitly depends on the past.
Definition
[edit]
Unlike ordinary differential equations, which contain a function of one variable and its derivatives evaluated with the same input, functional differential equations contain a function and its derivatives evaluated with different input values.
An example of an ordinary differential equation would be
In comparison, a functional differential equation would be
The simplest type of functional differential equation called the retarded functional differential equation or retarded differential difference equation, is of the form
Examples
[edit]
A simple functional differential equation is the linear first-order delay differential equation[unreliable source?] which is given by
where are constants, is some continuous function, and is a scalar. Below is a table with a comparison of several ordinary and functional differential equations.
| | Ordinary differential equation | Functional differential equation |
---
| Examples | | |
| | |
| | |
| | |
Types of functional differential equations
[edit]
"Functional differential equation" is the general name for a number of more specific types of differential equations that are used in numerous applications. There are delay differential equations, integro-differential equations, and so on.
Differential difference equation
[edit]
Differential difference equations are functional differential equations in which the argument values are discrete. The general form for functional differential equations of finitely many discrete deviating arguments is
where and
Differential difference equations are also referred to as retarded, neutral, advanced, and mixed functional differential equations. This classification depends on whether the rate of change of the current state of the system depends on past values, future values, or both.
| Classifications of differential difference equations |
| Retarded | |
| Neutral | |
| Advanced | |
Delay differential equation
[edit]
Main article: Delay differential equation
Functional differential equations of retarded type occur when for the equation given above. In other words, this class of functional differential equations depends on the past and present values of the function with delays.
A simple example of a retarded functional differential equation is
whereas a more general form for discrete deviating arguments can be written as
Neutral differential equations
[edit]
Functional differential equations of neutral type, or neutral differential equations occur when
Neutral differential equations depend on past and present values of the function, similarly to retarded differential equations, except it also depends on derivatives with delays. In other words, retarded differential equations do not involve the given function's derivative with delays while neutral differential equations do.
Integro-differential equation
[edit]
Main article: Integro-differential equation
Integro-differential equations of Volterra type are functional differential equations with continuous argument values. Integro-differential equations involve both the integrals and derivatives of some function with respect to its argument.
The continuous integro-differential equation for retarded functional differential equations, , can be written as
Application
[edit]
Functional differential equations have been used in models that determine future behavior of a certain phenomenon determined by the present and the past. Future behavior of phenomena, described by the solutions of ODEs, assumes that behavior is independent of the past. However, there can be many situations that depend on past behavior.
FDEs are applicable for models in multiple fields, such as medicine, mechanics, biology, and economics. FDEs have been used in research for heat-transfer, signal processing, evolution of a species, traffic flow and study of epidemics.
Population growth with time lag
[edit]
A logistic equation for population growth is given by where ρ is the reproduction rate and k is the carrying capacity. represents the population size at time t, and is the density-dependent reproduction rate.
If we were to now apply this to an earlier time , we get
Mixing model
[edit]
Upon exposure to applications of ordinary differential equations, many come across the mixing model of some chemical solution.
Suppose there is a container holding liters of salt water. Salt water is flowing in, and out of the container at the same rate of liters per second. In other words, the rate of water flowing in is equal to the rate of the salt water solution flowing out. Let be the amount in liters of salt water in the container and be the uniform concentration in grams per liter of salt water at time . Then, we have the differential equation
The problem with this equation is that it makes the assumption that every drop of water that enters the contain is instantaneously mixed into the solution. This can be eliminated by using a FDE instead of an ODE.
Let be the average concentration at time , rather than uniform. Then, let's assume the solution leaving the container at time is equal to , the average concentration at some earlier time. Then, the equation is a delay-differential equation of the form
Volterra's predator-prey model
[edit]
The Lotka–Volterra predator-prey model was originally developed to observe the population of sharks and fish in the Adriatic Sea; however, this model has been used in many other fields for different uses, such as describing chemical reactions. Modelling predatory-prey population has always been widely researched, and as a result, there have been many different forms of the original equation.
One example, as shown by Xu, Wu (2013), of the Lotka–Volterra model with time-delay is given below: where denotes the prey population density at time t, and denote the density of the predator population at time and
Other models using FDEs
[edit]
Examples of other models that have used FDEs, namely RFDEs, are given below:
Controlled motion of a rigid body
Periodic motions
Flip-flop circuit as a NDE
Model of HIV epidemic
Math models of sugar quantity in blood
Evolution equations of single species
Spread of an infection between two species
Classical electrodynamics
See also
[edit]
Functional equation
Volterra integral equation
Lotka–Volterra equations
Bifurcation theory
Lyapunov function
Volterra series
References
[edit]
^ a b c d e f g Kolmanovskii, V.; Myshkis, A. (1992). Applied Theory of Functional Differential Equations. The Netherlands: Kluwer Academic Publishers. ISBN 0-7923-2013-1.
^ a b Hale, Jack K. (1971). Functional Differential Equations. United States: Springer-Verlag. ISBN 0-387-90023-3.
^ Hale, Jack K.; Verduyn Lunel, Sjoerd M. (1993). Introduction to Functional Differential Equations. United States: Springer-Verlag. ISBN 0-387-94076-6.
^ a b Falbo, Clement E. "Some Elementary Methods for Solving Functional Differential Equations" (PDF). Archived from the original (PDF) on 2016-12-20.
^ Guo, S.; Wu, J. (2013). Bifurcation Theory of Functional Differential Equations. New York: Springer. pp. 41–60. ISBN 978-1-4614-6991-9.
^ Bellman, Richard; Cooke, Kenneth L. (1963). Differential-Difference Equations. New York, NY: Academic Press. pp. 42–49. ISBN 978-0124109735. {{cite book}}: ISBN / Date incompatibility (help)
^ Barnes, B.; Fulford, G. R. (2015). Mathematical Modelling with Case Studies. Taylor & Francis Group LLC. pp. 75–77. ISBN 978-1-4822-4772-5.
^ a b c d e Schmitt, Klaus, ed. (1972). Delay and Functional Differential Equations and Their Applications. United States: Academic Press.
^ Xu, Changjin; Wu, Yusen (2013). "Dynamics in a Lotka–Volterra Predator–Prey Model with Time-varying Delays". Abstract and Applied Analysis. 2013: 1–9. doi:10.1155/2013/956703.
^ García López, Álvaro (1 September 2020). "On an electrodynamic origin of quantum fluctuations". Nonlinear Dynamics. 102 (1): 621–634. arXiv:2001.07392. doi:10.1007/s11071-020-05928-5. S2CID 210838940.
Further reading
[edit]
Herdman, Terry L.; Rankin III, Samuel M.; Stech, Harlan W. (1981). Integral and Functional Differential Equations: Lecture notes. 67. United States: Marcel Dekker Inc, Pure and Applied Mathematics
Ford, Neville J.; Lumb, Patricia M. (2009). "Mixed-type functional differential equations: A numerical approach". Journal of Computational and Applied Mathematics. 229 (2): 471–479
Lemon, Greg; Kinf, John R. (2012). :A functional differential equation model for biological cell sorting due to differential adhesion". Mathematical Models and Methods in Applied Sciences. 12(1): 93–126
Da Silva, Carmen, Escalante, René (2011). "Segmented Tau approximation for forward-backward functional differential equation". Computers and Mathematics with Applications. 62 (12): 4582–4591
Pravica, D. W.; Randriampiry, N.; Spurr, M. J. (2009). "Applications of an advanced differential equation in the study of wavelets". Applied and Computational Harmonic Analysis. 27 (1): 2(10)
Breda, Dimitri; Maset, Stefano; Vermiglio Rossana (2015). Stability of Linear Delay Differential Equations: A Numerical Approach with MATLAB. Springer. ISBN 978-1-4939-2106-5
| | |
--- |
| Authority control databases: National | Czech Republic |
Retrieved from "
Category:
Differential equations
Hidden categories:
CS1 errors: ISBN date
All articles lacking reliable references
Articles lacking reliable references from June 2021
Functional differential equation
Add topic |
14112 | https://math.stackexchange.com/questions/1427579/number-theory-remainders | Number Theory - Remainders - Mathematics Stack Exchange
Join Mathematics
By clicking “Sign up”, you agree to our terms of service and acknowledge you have read our privacy policy.
Sign up with Google
OR
Email
Password
Sign up
Already have an account? Log in
Skip to main content
Stack Exchange Network
Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Visit Stack Exchange
Loading…
Tour Start here for a quick overview of the site
Help Center Detailed answers to any questions you might have
Meta Discuss the workings and policies of this site
About Us Learn more about Stack Overflow the company, and our products
current community
Mathematics helpchat
Mathematics Meta
your communities
Sign up or log in to customize your list.
more stack exchange communities
company blog
Log in
Sign up
Home
Questions
Unanswered
AI Assist Labs
Tags
Chat
Users
Teams
Ask questions, find answers and collaborate at work with Stack Overflow for Teams.
Try Teams for freeExplore Teams
3. Teams
4. Ask questions, find answers and collaborate at work with Stack Overflow for Teams. Explore Teams
Teams
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
Learn more about Teams
Hang on, you can't upvote just yet.
You'll need to complete a few actions and gain 15 reputation points before being able to upvote. Upvoting indicates when questions and answers are useful. What's reputation and how do I get it?
Instead, you can save this post to reference later.
Save this post for later Not now
Thanks for your vote!
You now have 5 free votes weekly.
Free votes
count toward the total vote score
does not give reputation to the author
Continue to help good content that is interesting, well-researched, and useful, rise to the top! To gain full voting privileges, earn reputation.
Got it!Go to help center to learn more
Number Theory - Remainders
Ask Question
Asked 10 years ago
Modified10 years ago
Viewed 82 times
This question shows research effort; it is useful and clear
2
Save this question.
Show activity on this post.
A number is of the form 13 k 1+12 13 k 1+12 and of the form 11 k 2+7 11 k 2+7
That is N=13 k 1+12=11 k 2+7 N=13 k 1+12=11 k 2+7
Now why must N also equal (13×11)k 3+51(13×11)k 3+51 ?
Thanks
number-theory
Share
Share a link to this question
Copy linkCC BY-SA 3.0
Cite
Follow
Follow this question to receive notifications
edited Sep 9, 2015 at 3:41
Arpit Kansal
10.5k 1 1 gold badge 30 30 silver badges 65 65 bronze badges
asked Sep 9, 2015 at 3:39
HormigasHormigas
289 2 2 silver badges 10 10 bronze badges
6
What've you tried?Arpit Kansal –Arpit Kansal 2015-09-09 03:44:57 +00:00 Commented Sep 9, 2015 at 3:44
@ArpitKansal I've tried getting k1 in terms of k2. 51 seems to be the smallest value of N that satisfies the above conditions Hormigas –Hormigas 2015-09-09 03:49:42 +00:00 Commented Sep 9, 2015 at 3:49
Note that N=7(mod 11) and N=12(mod13) Can you say something from here?Arpit Kansal –Arpit Kansal 2015-09-09 03:53:40 +00:00 Commented Sep 9, 2015 at 3:53
@ArpitKansal Not really. A little new to this. Sorry Hormigas –Hormigas 2015-09-09 03:54:54 +00:00 Commented Sep 9, 2015 at 3:54
Do you know CRT(Chinese Remainder Theorem)?Arpit Kansal –Arpit Kansal 2015-09-09 03:56:34 +00:00 Commented Sep 9, 2015 at 3:56
|Show 1 more comment
4 Answers 4
Sorted by: Reset to default
This answer is useful
2
Save this answer.
Show activity on this post.
Alternately, N=13 k 1+12=11 k 2+7⟹N−51=13(k 1−3)=11(k 2−4)N=13 k 1+12=11 k 2+7⟹N−51=13(k 1−3)=11(k 2−4)
Thus N−51 N−51 must be a multiple of both 13 13 and 11 11.
Share
Share a link to this answer
Copy linkCC BY-SA 3.0
Cite
Follow
Follow this answer to receive notifications
answered Sep 9, 2015 at 4:12
MacavityMacavity
48.2k 6 6 gold badges 40 40 silver badges 74 74 bronze badges
2
Elegant and beautiful Hormigas –Hormigas 2015-09-09 05:22:27 +00:00 Commented Sep 9, 2015 at 5:22
Usually the trouble is in finding 51 51, which @robjohn has so meticulously explained in his post below...Macavity –Macavity 2015-09-09 13:38:50 +00:00 Commented Sep 9, 2015 at 13:38
Add a comment|
This answer is useful
0
Save this answer.
Show activity on this post.
Let me give a trick. We have N+92=13 k 1+104=13(k 1+8)N+92=13 k 1+104=13(k 1+8) and N+92=11 k 2+99=11(k 2+9)N+92=11 k 2+99=11(k 2+9).
Then, N+92=11×13 k 3 N+92=11×13 k 3 or N=143 k 3−92 N=143 k 3−92 or N=143 k 4+51 N=143 k 4+51.
See also link
Share
Share a link to this answer
Copy linkCC BY-SA 3.0
Cite
Follow
Follow this answer to receive notifications
edited Sep 9, 2015 at 4:05
answered Sep 9, 2015 at 3:58
GAVDGAVD
7,456 1 1 gold badge 18 18 silver badges 34 34 bronze badges
2
Don't re-use k 3 k 3 for another value. N=143(k 3−1)+51 N=143(k 3−1)+51.Thomas Andrews –Thomas Andrews 2015-09-09 04:04:43 +00:00 Commented Sep 9, 2015 at 4:04
Uhm, OK, I changed it to k 4 k 4. :)GAVD –GAVD 2015-09-09 04:06:10 +00:00 Commented Sep 9, 2015 at 4:06
Add a comment|
This answer is useful
0
Save this answer.
Show activity on this post.
N N as defined is 12 12 mod 13 13 by first definition and 7 7 mod 11 11 by second definition, since both 13 13 and 11 11 are relatively prime (in fact primes) thus N N should have same mod (13×11 13×11) as well, rest follows by manipulating the 12 12, 7 7 remainders with 13 13, 11 11
Share
Share a link to this answer
Copy linkCC BY-SA 3.0
Cite
Follow
Follow this answer to receive notifications
answered Sep 9, 2015 at 5:07
Nikos M.Nikos M.
2,356 16 16 silver badges 26 26 bronze badges
Add a comment|
This answer is useful
0
Save this answer.
Show activity on this post.
Finding a Solution
To find an N N so that
N N≡12≡7(mod 13)(mod 11)(1)(1)N≡12(mod 13)N≡7(mod 11)
we can start by solving
13 x+11 y=1(2)(2)13 x+11 y=1
using the Extended Euclidean Algorithm. The implementation described in this answer gives
1 0 13 0 1 11 1 1−1 2 5−5 6 1 2 11−13 0(3)(3)1 5 2 1 0 1−5 11 0 1−1 6−13 13 11 2 1 0
which implies
13(−5)+11(6)=1(4)(4)13(−5)+11(6)=1
Using (4)(4), we can show
66 66≡1≡0(mod 13)(mod 11)(5)(5)66≡1(mod 13)66≡0(mod 11)
and
−65−65≡0≡1(mod 13)(mod 11)(6)(6)−65≡0(mod 13)−65≡1(mod 11)
12 12 times (5)(5) plus 7 7 times (6)(6) gives
337 337≡12≡7(mod 13)(mod 11)(7)(7)337≡12(mod 13)337≡7(mod 11)
Subtracting 2⋅11⋅13=286 2⋅11⋅13=286 from the left sides of (7)(7) gives
51 51≡12≡7(mod 13)(mod 11)(8)(8)51≡12(mod 13)51≡7(mod 11)
Finding a General Solution
If N 1 N 1 and N 2 N 2 are any two solutions to (1)(1), then
N 1−N 2 N 1−N 2≡0≡0(mod 13)(mod 11)(9)(9)N 1−N 2≡0(mod 13)N 1−N 2≡0(mod 11)
Therefore,
N 1−N 2≡0(mod 11⋅13)(10)(10)N 1−N 2≡0(mod 11⋅13)
Putting together (8)(8) and (10)(10), we get that all the solutions of (1)(1) are given by
N≡51(mod 143)(11)(11)N≡51(mod 143)
Share
Share a link to this answer
Copy linkCC BY-SA 3.0
Cite
Follow
Follow this answer to receive notifications
edited Apr 13, 2017 at 12:20
CommunityBot
1
answered Sep 9, 2015 at 5:46
robjohn♦robjohn
355k 38 38 gold badges 499 499 silver badges 892 892 bronze badges
Add a comment|
You must log in to answer this question.
Start asking to get answers
Find the answer to your question by asking.
Ask question
Explore related questions
number-theory
See similar questions with these tags.
Featured on Meta
Introducing a new proactive anti-spam measure
Spevacus has joined us as a Community Manager
stackoverflow.ai - rebuilt for attribution
Community Asks Sprint Announcement - September 2025
Report this ad
Linked
36Linear diophantine equation 100 x−23 y=−19 100 x−23 y=−19
Related
0Number Theory: Remainders
2Tricky combinatorial number theory
1Prime numbers number theory
8Sum of remainders of Triangular numbers
3Multiple of a number and sum of a set
2Does there exist a prime number form of 37 11⋯1n times 3 37 11⋯1⏟n times 3 or 37 55⋯5n times 1 37 55⋯5⏟n times 1?
Hot Network Questions
Gluteus medius inactivity while riding
Proof of every Highly Abundant Number greater than 3 is Even
The geologic realities of a massive well out at Sea
What were "milk bars" in 1920s Japan?
Another way to draw RegionDifference of a cylinder and Cuboid
Languages in the former Yugoslavia
An odd question
What’s the usual way to apply for a Saudi business visa from the UAE?
How different is Roman Latin?
Lingering odor presumably from bad chicken
Is it safe to route top layer traces under header pins, SMD IC?
How exactly are random assignments of cases to US Federal Judges implemented? Who ensures randomness? Are there laws regulating how it should be done?
Determine which are P-cores/E-cores (Intel CPU)
Is direct sum of finite spectra cancellative?
Interpret G-code
Xubuntu 24.04 - Libreoffice
Does the Mishna or Gemara ever explicitly mention the second day of Shavuot?
Why are LDS temple garments secret?
How long would it take for me to get all the items in Bongo Cat?
Sign mismatch in overlap integral matrix elements of contracted GTFs between my code and Gaussian16 results
Suspicious of theorem 36.2 in Munkres “Analysis on Manifolds”
If Israel is explicitly called God’s firstborn, how should Christians understand the place of the Church?
Exchange a file in a zip file quickly
My dissertation is wrong, but I already defended. How to remedy?
Question feed
Subscribe to RSS
Question feed
To subscribe to this RSS feed, copy and paste this URL into your RSS reader.
Why are you flagging this comment?
It contains harassment, bigotry or abuse.
This comment attacks a person or group. Learn more in our Code of Conduct.
It's unfriendly or unkind.
This comment is rude or condescending. Learn more in our Code of Conduct.
Not needed.
This comment is not relevant to the post.
Enter at least 6 characters
Something else.
A problem not listed above. Try to be as specific as possible.
Enter at least 6 characters
Flag comment Cancel
You have 0 flags left today
Mathematics
Tour
Help
Chat
Contact
Feedback
Company
Stack Overflow
Teams
Advertising
Talent
About
Press
Legal
Privacy Policy
Terms of Service
Your Privacy Choices
Cookie Policy
Stack Exchange Network
Technology
Culture & recreation
Life & arts
Science
Professional
Business
API
Data
Blog
Facebook
Twitter
LinkedIn
Instagram
Site design / logo © 2025 Stack Exchange Inc; user contributions licensed under CC BY-SA. rev 2025.9.26.34547
By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.
Accept all cookies Necessary cookies only
Customize settings
Cookie Consent Preference Center
When you visit any of our websites, it may store or retrieve information on your browser, mostly in the form of cookies. This information might be about you, your preferences, or your device and is mostly used to make the site work as you expect it to. The information does not usually directly identify you, but it can give you a more personalized experience. Because we respect your right to privacy, you can choose not to allow some types of cookies. Click on the different category headings to find out more and manage your preferences. Please note, blocking some types of cookies may impact your experience of the site and the services we are able to offer.
Cookie Policy
Accept all cookies
Manage Consent Preferences
Strictly Necessary Cookies
Always Active
These cookies are necessary for the website to function and cannot be switched off in our systems. They are usually only set in response to actions made by you which amount to a request for services, such as setting your privacy preferences, logging in or filling in forms. You can set your browser to block or alert you about these cookies, but some parts of the site will not then work. These cookies do not store any personally identifiable information.
Cookies Details
Performance Cookies
[x] Performance Cookies
These cookies allow us to count visits and traffic sources so we can measure and improve the performance of our site. They help us to know which pages are the most and least popular and see how visitors move around the site. All information these cookies collect is aggregated and therefore anonymous. If you do not allow these cookies we will not know when you have visited our site, and will not be able to monitor its performance.
Cookies Details
Functional Cookies
[x] Functional Cookies
These cookies enable the website to provide enhanced functionality and personalisation. They may be set by us or by third party providers whose services we have added to our pages. If you do not allow these cookies then some or all of these services may not function properly.
Cookies Details
Targeting Cookies
[x] Targeting Cookies
These cookies are used to make advertising messages more relevant to you and may be set through our site by us or by our advertising partners. They may be used to build a profile of your interests and show you relevant advertising on our site or on other sites. They do not store directly personal information, but are based on uniquely identifying your browser and internet device.
Cookies Details
Cookie List
Clear
[x] checkbox label label
Apply Cancel
Consent Leg.Interest
[x] checkbox label label
[x] checkbox label label
[x] checkbox label label
Necessary cookies only Confirm my choices |
14113 | https://aimathcircles.org/games/ | Games – Alliance of Indigenous Math Circles
Skip to content
Allied Math Circles
Materials for Math Circles
AIMC in Media
Allied Math Circles
Materials for Math Circles
AIMC in Media
DONATE
FacebookYoutube
Search
Alliance of Indigenous Math Circles
AIMC
Home
About
Our Mission and Our Work
Who We Are
Directors
Regional Coordinators
Advisory Board
Photos and Videos
Events
Upcoming Events
Events up to 2021
Our Partners
Contact Us
Bluebird Math Circle
Materials for Math Circles
AIMC in Media
Allied Math Circles
Home
About
Our Mission and Our Work
Who We Are
Directors
Regional Coordinators
Advisory Board
Photos and Videos
Events
Upcoming Events
Events up to 2021
Our Partners
Contact Us
Bluebird Math Circle
Materials for Math Circles
AIMC in Media
Allied Math Circles
Home
About
Our Mission and Our Work
Who We Are
Directors
Regional Coordinators
Advisory Board
Photos and Video
Events
Upcoming Events
2023 Events
2022 Events
Events up to 2021
Our Partners
Contact Us
Home
About
Our Mission and Our Work
Who We Are
Directors
Regional Coordinators
Advisory Board
Photos and Video
Events
Upcoming Events
2023 Events
2022 Events
Events up to 2021
Our Partners
Contact Us
Bluebird Math Circle
Games and Puzzles from Bluebird Math Circle
Offer a game as a warm-up before any topic or whenever you have a few minutes for mathematical play.
Click the issue number to see the game in the context of our mathematical topic.
Classic games help students feel that they belong in mathematical communities. Bluebird Originals are new favorites that AIMC brought to the table. Enjoy!
Card Game—Game of Set and Clans—Original—Navajo Context
When a Navajo person introduces themselves, they name their mother’s clan (1st), their father’s clan (2nd), their maternal grandfather’s clan (3rd), and their paternal grandfather’s clan (4th). Thus every Navajo Nation member has 4 ‘attributes’ – like cards in the SET game. But unlike the game where each attribute has only 3 values, the situation here is much more complicated. Originally, there were four Navajo clans. But nowadays, there are more than 100 clans, divided into more than 20 groups. This should lead to a fascinatingly rich geometry. Would you like to invent and study this geometry? Share your thoughts with Bluebird!
Image: navajowotd.com
From Issue 50
The total deck of cards for the game of SET consists of 81 cards. Each card has 4 attributes – number, shading, color, and shape. Each attribute has 3 values: the number can have the value 1, 2, or 3; the shading can have the value empty, striped, or solid; the color can have the value green, red, or purple; the shape can have the value diamond, oval, or squiggle.
We say that 3 cards form a set if for every attribute all three cards have the same value, or all three cards are of different values. If, for some attribute X, you can say, “Two cards are X but one is not X,” then these three cards do NOT form a set. You can play the game online at
Guessing Game—Native American Flags—Classic—Multiple Nations
Here are flags of eight Native American nations:
From Issue 44
Two people play a guessing game. One of them writes the name of one of these eight nations on a secret piece of paper. The other person must guess which flag the first player has written down, by asking questions. But there are rules:
The question must have a ‘yes’ or ‘no’ answer.
The question must be answerable by looking at the flag or the name of the nation… You cannot ask, “Does this nation live in Colorado?” The reason is that the second player must be able to answer the question by just looking at the flag or naming the nation whose flag it is.
Play the game a few times. The object is to guess the flag in the smallest number of questions, every time.
If the player guessing is lucky, she will get the flag on the first try. For example, she might ask: “Is it the Navajo Flag?” She might get the answer ‘yes’, and guess with just one question. But if she is not lucky, she has only eliminated one of the eight flags. How might she eliminate more flags with each question?
Remember: Do NOT assume that the player guessing is lucky. In fact, assume that he is UNlucky. In the worst case, what is the fewest number of questions with which he can win the game?
Puzzle Games—Square to Square—Classic
From Issue 39
The starting player draws a rectangle on a grid. The sides of the rectangle lie on gridlines (so the lengths of the sides are integers). The second player then colors in the largest square possible that has a side flush with the left side of the original rectangle, so that a smaller rectangle remains. The players then alternate turns coloring in the largest square possible that touches a previous square and leaves a smaller rectangle. (All squares must have integer sides.) The game ends when the initial rectangle is filled with squares, and the person who colors in the last square wins. In the figure player 2 wins. The app at may be useful to experiment.
Puzzle Game—Global Math Week/Exploding Dots—Original—Navajo and Cherokee Context
Teach us how you say the big number 175,487 in your native language.
Do you say it in a base 10 way? Or base 20 way?
Do you switch the order of the digits as you pronounce them?
When you write the number, how do you group the digits?
Here are some Navajo and Cherokee numbers to get started…
From Issue 37
Global Math Week is the annual international event where students, teachers, and parents play through 12 online puzzles or experiences called Exploding Dots, and local explorations that go with them. The mathematical theme is number systems in different bases.
Group Word Games—Buzz and Buzzwhack—Classic
From Issue 29
In the game of Buzz, players take turns counting off: 1, 2, 3…. But when a number is a multiple of 7 (that is, divisible by 7), the player must say ‘buzz’ instead.
How many times does a player say ‘buzz’ if the game goes up to 100? To 1000? (Including 100 and 1000.)
2. The game of Buzzwhack is played exactly like the game of Buzz, with the added rule that a player must say ‘whack’ if the number is a multiple of 4. If the number is a multiple of both 4 and 7, The player must make both sounds.
How many times does a player say ‘whack’ if the game goes up to 100? To 1000? (Including 100 and 1000.)
How many times does a player say ‘Buzzwhack’ if the game goes up to 100? To 1000? (Including 100 and 1000.)
The game of Buzz is a good game for exactly two players, but the game of Buzzwhack is not. Why not?
Image: Sony Computer Entertainment
Paper-and-Pencil Game & Computer Game—The Triangle Game—Classic
From Issue 26 The Triangle Game is played on a equilateral triangle you draw. Vertices of the triangle are labeled anticlockwise by three colors which we denote by 1, 2, and 3 for convenience. Also, parallel to each side, three equally spaced lines are drawn across the triangle, thus creating 16 small triangles. The game is for two players, who take turns to label the vertices:
– a vertex on edge {1,2} may be labeled either 1 or 2, but not 3
– a vertex on edge {2,3} may be labeled either 2 or 3, but not 1
– a vertex on edge {3,1} may be labeled either 3 or 1, but not 2
– a vertex inside the big triangle may be labeled 1 or 2 or 3.
When all the vertices have been labeled, the scores of the two players are calculated as follows:
– The score of Player 1 is the number of small triangles which are labeled {1,2,3} anticlockwise.
– The score of Player 2 is the number of small triangles which are labeled {1,2,3} clockwise.
– The winner is the player with the higher score.
Try the computer-based version:
Puzzle—Equal Parts—Original—Zuni Context
Zuni fetishes are small carvings made from stone, shells, and other materials. Within the Zuni community, the fetishes serve ceremonial purposes and depict animals and icons integral to the Zuni culture. The Zuni also create fetishes as contemporary art for museums and enthusiasts within and outside of the community.
From Issue 21 Split the figure on the grid into two equal parts (so that you can place one part on top of the other one and they completely coincide). You can move the pieces any way you want – slide, turn them around or flip them.Image: Coyote (Zuni fetish)
Conversation Game & Computer Toy—BlueBirdBot—Original
From Issue 20Every time the Bluebird Math Circle meets, participants listen to the bluebird song and think of math questions. Where do math questions come from? How can we pose a lot of them? Math and science people have been collecting generative questions for centuries. “Generative” has two meanings. First, the question itself isn’t too hard to ask (to generate). Second, the question starts (generates) mathematical explorations. Want to try?
Think of two nouns: Thing One and Thing Two. If you don’t know what to pick, look around you, and use the first couple of objects you notice. Put your things into these math questions:
– What shapes do you see in ?
– How many of can fit into a hogan house?
– What are similarities and differences between and ?
These questions invite us to explore size, shape, and structure. That’s where a lot of mathematics comes from! You could write a “mad libs” math question of your own, with empty slots that other people can fill in.
Visit to make various math questions. The question bot is made of templates: it needs your words to work.
Image: Jim and Tori Mullen
Computer Game—Weave by Number—Original—Cree, Hopi, and Navajo Context
Flat figurate numbers can be of shapes different from regular polygons, for example, rectangular numbers or trapezoidal numbers. Donna Fernandez and students from Navajo Preparatory School created a computer game about trapezoidal numbers in the languages of three First Nations –
From Issue 14 The game is called Weave by Number. The goal of the game is to create a geometric weaving pattern found on Native American rugs. The object of the game is to stack objects to match the target number to create a rug design. To play, select a number on the rug, then use the + or – controls to change the height and width of the object. The challenge is that there may be no solution, one solution, or many solutions. If the number of objects in the stack matches the target number, then click “Submit”. If no solution can be found, then click “No solution”. If correct, the number on the grid will change color.
When you click on the numbers, they will be pronounced in various indigenous languages – Navajo, Pueblo, and Cree. This is a great way to learn an indigenous language. The game is designed with artwork depicting the landscape of the tribal lands and symbols or objects from the respective tribes.
Puzzle—How Am I Different?—Classic—Kwantlen First Nation Context
Four Seasons is a set of four drums made by Brandon Gabriel and Melinda Bige, Indigenous artists from the Kwantlen First Nation. The set is displayed in Surrey, British Columbia.
From Issue 8 Pick four similar but different objects, such as shapes or numbers. Think about each of the four objects and find one thing that makes that object different from the other three.
Tabletop Game—Two-Pile Nim—Classic
From Issue 6 Nim is a quick two-player game. You’ll need some game pieces, but those could be almost anything. Stones are shown in the picture here, but you could use coins, buttons, candy, or anything else that’s convenient.
The game begins with two piles. The picture shows piles of 5 and 7 stones, but you can change the numbers in each pile when you play different games. For your turn, you can either:
– Take as many pieces from a single pile, or
– Take the same number of pieces from both piles.
The winner is the player who takes the last pieces.
Play a few games and then think about what’s happening. Are there certain positions where you’re guaranteed to win on your next move? Are there other positions where you’re guaranteed to lose on your next move? If you start with piles of 2 and 3 pieces, can you find a winning strategy? How about if you begin with piles of 5 and 7 pieces?
Conversation Game—Piñon Nuts—Classic—Multi-Tribe Context
The Great Basin includes the high desert regions between the Sierra Nevada and the Rocky Mountains. The Indigenous people of the region, including the Shoshone, Paiute, Washo, and Ute, traditionally gather piñon pine nuts. The tasty nuts provide excellent nutrition.
From Issue 5You want to harvest about half of piñon nuts in a tree, and leave the rest for the forest creatures to eat and for growing new trees. How would you estimate the number of piñon nuts on a tree?
You don’t need a serious reason to estimate: just play with friends or by yourself to pass the time. How many people in a crowd, potatoes in a bag, polka dots on a shirt? Find cute and silly sets to estimate for fun. Who between your friends can estimate the closest without counting, and how do they accomplish that?
Images: Kmusser; Utah State University
Tabletop Game—Tuknanavuhpi—Classic—Hopi Context
Tuknanavuhpi is a two-player abstract strategy board game played by the Hopi of Arizona, United States. The game was traditionally played on a slab of stone with the board pattern etched on it.
From Issue 4 The board for the game of Tuknanavuhpi has 4 by 4 squares with their sides and diagonals intersecting in 41 points. Two players place 20 stones or grains of maize in two colors on their sides of the board. The game’s goal is to capture the other player’s piece by hopping over them. The first player who does so wins. Read more detailed rules on Wikipedia.
Image: skyruk
Party Game—The Same Number of Friends—Classic
From Issue 3In any group of people, at least two people have the same number of friends within the group.
Check for yourself next time you are at a party. (This also works for cousins, team members, and other types of human relations.)
Image: Spiked Math
Puzzle—St.Ives and Oldest Stories—Classic
From Issue 2What is the oldest story-puzzle people still retell? It’s about four thousand years old and comes from North Africa! Archeologists found it on an ancient Egyptian papyrus. It had a story-puzzle about grain, mice, and cats to practice multiplying by 7. Why 7? That’s because back then, as it is for students even now, multiplying by 7 was the hardest of the time tables x2, x3, x4… x10. Here is a more recent version from 18th century.
As I was going to St. Ives,
I met a man with seven wives,
Each wife had seven sacks,
Each sack had seven cats,
Each cat had seven kits:
Kits, cats, sacks, and wives,
How many were there going to St. Ives?
(Hint: you don’t really need to multiply.)
Image: vintage post card
Conversation Game—The Scent of Time—Original—Navajo Context
Perseverance (Ha’ahóni in Navajo) touched down in the Martian quadrant named for Arizona’s Canyon de Chelly National Monument (Tséyi’ in Navajo). The Perseverance team worked with Aaron Yazzie of NASA’s Jet Propulsion Laboratory to collaborate with Navajo Nation naming new features on Mars.
From Issue 1Can we tell time by the smell? Ancient Chinese used scented candles to measure the passage of time. The candles had scented bands. Each hour the candle burned down to the next scent: cinnamon, anise, cloves, and so on. You could quickly smell what time it was, even at night. How can you measure the passage of time with:
Singing
Food
Walking
Animals
Weaving
__(Your own method!)
Will your method work on Mars, too? What are some ways your family and community estimate time?
Image by nasa.gov
NEWSLETTERS AND RECAPS
Issue 64—Of Shapes and Curves—full color PDF
Issue 64—Of Shapes and Curves—black and white PDF
Issue 63 (rescheduled Issue 60)—Line Drawings and Graph Theory—full color PDF
Issue 63 (rescheduled Issue 60)—Line Drawings and Graph Theory—black and white PDF
Issue 62—Pi Loves Calculus—full color PDF
Issue 62—Pi Loves Calculus—black and white PDF
Issue 61—Fair and Square—full color PDF
Issue 61—Fair and Square—black and white PDF
Issue 60—Line Drawings and Graph Theory—full color PDF
Issue 60—Line Drawings and Graph Theory—black and white PDF
Issue 59—Factorization Diagrams—full color PDF
Issue 59—Factorization Diagrams—black and white PDF
« Previous Page 1Page 2Page 3Page 4Page 5Next »
Subscribe To Our Newsletter
Get updates and learn from the best
Follow Us
© 2021 All Rights Reserved
We use cookies to ensure that we give you the best experience on our website. If you continue to use this site we will assume that you are happy with it.Ok |
14114 | https://en.wikipedia.org/wiki/Spanish_personal_pronouns | Jump to content
Search
Contents
1 Table of personal pronouns
2 Subject pronouns
2.1 Pronoun dropping and grammatical gender
2.2 Tú/vos and usted
2.3 Impersonal pronouns
3 Reflexive pronouns and intensifiers
4 Object pronouns
5 Genitive pronouns
6 Old forms
6.1 Formal vos
7 Regional variation
7.1 Voseo
7.2 The use of vusted and vuestra merced
7.3 Use of vosotros
7.4 Creoles
8 Other forms
8.1 Menda
8.2 Servidor
8.3 Neopronouns
9 Notes
10 References
Spanish personal pronouns
Magyar
Edit links
Article
Talk
Read
Edit
View history
Tools
Actions
Read
Edit
View history
General
What links here
Related changes
Upload file
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Print/export
Download as PDF
Printable version
In other projects
Wikidata item
Appearance
From Wikipedia, the free encyclopedia
Personal pronouns in Spanish
"Nosotros" redirects here. For the 1945 Mexican film, see Nosotros (film). For the magazine, see Nosotros (magazine). For the anarchist group, see Nosotros (group).
| |
| This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.Find sources: "Spanish personal pronouns" – news · newspapers · books · scholar · JSTOR (December 2017) (Learn how and when to remove this message) |
| Spanish language |
| A manuscript of the Cantar de mio Cid, 13th century |
| Overview |
| Pronunciation + stress Orthography Names |
| History |
| Old Middle Influences |
| Grammar |
| Determiners Nouns + gender Pronouns + personal + object Adjectives Prepositions Verbs + conjugation + irregular verbs |
| Dialects |
| Andalusian Andean Argentine Belizean Bolivian Canarian Caribbean Central American Chilean Colombian Costa Rican Cuban Dominican Ecuadorian Equatoguinean Guatemalan Honduran Mexican Murcian New Mexican Nicaraguan Paraguay Panamanian Peninsular Peruvian Philippine + status Puerto Rican Rioplatense Saharan Salvadoran Standard Uruguayan Venezuelan |
| Dialectology |
| Seseo Yeísmo Voseo Leísmo Loísmo |
| Interlanguages |
| Llanito Jopara Judaeo-Spanish Portuñol Spanglish Castrapo Creoles Roquetas Pidgin Chavacano or Chabacano Palenquero or Palenque Aljamiado |
| Teaching |
| Hispanism RAE Instituto Cervantes |
| v t e |
Spanish personal pronouns have distinct forms according to whether they stand for the subject (nominative) or object, and third-person pronouns make an additional distinction for direct object (accusative) or indirect object (dative), and for reflexivity as well. Several pronouns also have special forms used after prepositions.
Spanish is a pro-drop language with respect to subject pronouns, and, like many European languages, Spanish makes a T-V distinction in second person pronouns that has no equivalent in modern English. Object pronouns can be both clitic and non-clitic, with non-clitic forms carrying greater emphasis. With clitic pronouns, proclitic forms are much more common, but enclitic forms are mandatory in certain situations. There is significant regional variation in the use of personal pronouns, especially second-person pronouns.
Table of personal pronouns
[edit]
All the personal pronouns used in Spanish are outlined in the table below. Ladino, historically spoken by Sephardic Jews, employs some personal pronouns that have fallen out of use in Spanish.
Spanish personal pronouns
| Number | Person | Nominative | Prepositional | Accusative | Dative | Genitive | Comitative |
| Singular | 1st | yo | mí | me | mío(s)/mía(s) | conmigo |
| 2nd | tú | ti | te | tuyo(s)/tuya(s) | contigo |
| vos 1 | con vos 1 |
| usted | lo/la, se 3 | le, se 3 | suyo(s)/suya(s) | con usted, consigo 3 |
| 3rd | él/ella/ello | él/ella/ello, sí 3 | con él/ella/ello, consigo 3 |
| Plural | 1st | nosotros/nosotras | nos | nuestro(s)/nuestra(s) | con nosotros/nosotras |
| 2nd | vosotros/vosotras 2 | os 2 | vuestro(s)/vuestra(s) 2 | con vosotros/vosotras 2 |
| ustedes | los/las, se 3 | les, se 3 | suyo(s)/suya(s) | con ustedes, consigo 3 |
| 3rd | ellos/ellas | ellos/ellas, sí 3 | con ellos/ellas, consigo 3 |
: 1 Only in countries with voseo; Ladino has vos as the formal form, instead of usted.
: 2 Primarily in Spain; elsewhere, ustedes is used in the plural regardless of the level of formality.
: 3 Reflexive
Usted may be abbreviated as Ud. or Vd. A disused equivalent of vuestro(s)/vuestra(s) is voso(s)/vosa(s).
Subject pronouns
[edit]
Pronoun dropping and grammatical gender
[edit]
Spanish is a pro-drop language with respect to subject pronouns. Information contained in verb endings often renders the explicit use of subject pronouns unnecessary and even erroneous although they may still be used for clarity or emphasis:
Yo hago or just Hago = "I do"
Ellos vieron or just Vieron = "They saw"
English subject pronouns are generally not translated into Spanish if neither clarity nor emphasis is an issue. "I think" is generally translated as just Creo unless the speaker contrasts their views with those of someone else or places emphasis on the fact that their views are their own and not somebody else's.
Third-person masculine and feminine pronouns (él, ella, ellos, and ellas) can refer to grammatically masculine and feminine objects as well as people, but their explicit use as subjects is somewhat uncommon, and restricted to people. The third-person neuter singular pronoun ello is likewise rarely used as an explicit subject in everyday language, although such usage is found in formal and literary contexts. Quite unusually among European languages, the first- and second-person plural subject pronouns (nosotros/nosotras and vosotros/vosotras, respectively) inflect for gender: nosotros and vosotros are used to refer to groups of men (as well as mixed-gender groups), while nosotras and vosotras are used exclusively to refer to groups of women.
Tú/vos and usted
[edit]
Like French and other languages with the T-V distinction, modern Spanish has a distinction in its second-person pronouns that has no equivalent in modern English. The most basic is the difference between tú (vos in areas with voseo) and usted: tú or vos is the "familiar" form, and usted, derived from the third-person form "your grace" (vuestra merced), is the "polite" form. The appropriate usage of those forms is fundamental to interpersonal communication.
The usage of Tú/Vos and Usted depends on a number of factors, such as the number of people with whom the speaker is talking, the formality or informality of the relationship between the speaker and the other person, the age difference between them, and the regional variation of Spanish.
Using the usted form to address someone implies that the person addressed is a social superior, someone to whom respect is owed, or someone with whom one does not have a close relationship. In contrast, the use of tú or vos implies that the person addressed is an equal, a comrade, a friend, someone with whom one has a close relationship, or a child or other social inferior, including (traditionally) a maid or other household employee. Tú is also used to address God, in parallel with English's otherwise-abandoned use of thou. Usage changed in the 20th century in Spain, and a woman who addressed her mother as madre, 'mother' using usted could experience that her children call her mamá, 'mom' and use tú. Also, in Spain the Falangists and the Communists promoted the tuteo as a sign of worker solidarity.
One can give offense by addressing someone with tú instead of usted, similar to inappropriately calling someone by their first name in English; conversely, it can also be awkward to use usted if tú would be expected, which suggests too much social distance or implies that the person addressed is being haughty. Spanish has a verb, tutear, meaning to use the familiar form tú to address a person. If speakers feel that the relationship with the conversant has evolved, sometimes only after a few minutes of conversation, to a point that a shift from usted to tú is desirable, they often confirm that by asking if it is acceptable: Nos tuteamos, ¿verdad? or ¿Te puedo tutear? is fairly common. In Anglophone countries, that would be roughly analogous to asking if it is acceptable to call someone by their first name.
In the plural, in Spain (other than the Canary Islands and parts of western Andalusia), the usage of the familiar vosotros/vosotras and the polite ustedes is identical to the usage of tú/usted. In the Canary Islands as well as those parts of western Andalusia, in addition to all of Spanish America, vosotros is not used except in very formal contexts such as oratory, and ustedes is the familiar as well as the polite plural.
The distinction extends to other types of pronouns and modifiers: when using usted one must also use the third-person object pronouns and possessive adjectives. "Tu casa" (tú with an (acute) accent is the subject pronoun, tu with no accent is a possessive adjective) means "your house" in the familiar singular: the owner of the house is one person, and it is a person with whom one has the closer relationship the tú form implies. In contrast, su casa can mean "his/her/their house, but it can also mean "your house" in the polite singular: the owner of the house is someone with whom one has the more distant or formal relationship implied by the use of usted.
Similarly, the use of usted requires third-person object pronouns except in some Andalusian dialects.[citation needed] Te lavas means "you [familiar singular] wash yourself", but se lava can mean "you [polite singular] wash yourself" as well as "he/she/it washes himself/herself/itself"'.
Impersonal pronouns
[edit]
There are several impersonal pronouns in Spanish:
uno ('one', as well as una for women), which declines as a normal third-person pronoun and is treated as such for purposes of conjugation and reflexivity.
Many ideas that would be expressed with an impersonal pronoun in English would more often be expressed with so-called pasiva refleja (passive reflexive) constructions in Spanish: "That is not done" (Eso no se hace), rather than "You (One) wouldn't do that" (Uno no hace eso).
Impersonal tú might be a recent phenomenon. It is conjugated with the second-person but is not directed to the listener. According to one scholar, it might have appeared in the Valencian Community around the 1940s. It is used very often in speech in Spain: A veces te ilusionas con cosas y las pierdes., 'Sometimes you rave about things and lose them.'
Reflexive pronouns and intensifiers
[edit]
The third person is the only person with a distinct reflexive pronoun: se. In the first and second persons, the normal object pronouns are used. Thus, the reflexive forms are:
| Singular | Plural | |
---
| yo | me | nosotros/nosotras | nos |
| tú/vos | te | vosotros/vosotras | os |
| él/ella/ello/usted | se | ellos/ellas/ustedes | se |
The reflexive pronoun is used with pronominal verbs, also known as reflexive verbs. These verbs require the use of the reflexive pronoun, appropriate to the subject. Some transitive verbs can take on a reflexive meaning, such as lavar (to wash) and lavarse (to wash oneself). Other verbs have reflexive forms which do not take on a reflexive meaning, such as ir (to go) and irse (to go away). Some verbs only have reflexive forms, such as jactarse (to boast).
The nominal intensifier in Spanish (equivalent to English "myself", "yourself", "themselves", etc. when used after a noun) is mismo, which in this case is placed after the noun it modifies and behaves like a normal adjective. Thus:
Yo mismo lo hice = "I [masc.] myself did it"
No entiendo porque necesitas la cosa misma = "I don't understand why you need the thing itself"
Dáselo a los hombres mismos = "Give it to the men themselves"
A nosotros no nos gustan las chicas mismas = "We don't like the girls themselves" (lit. "The girls themselves don't please us")
Unlike English intensifiers, which are often placed several words after the noun they modify (e.g. "I did it myself"), Spanish intensifiers must come immediately after the noun they modify.
Object pronouns
[edit]
Main article: Spanish object pronouns
Object pronouns are personal pronouns that take the function of an object in the sentence. Spanish object pronouns may be both clitic and non-clitic; the clitic form is the unstressed form, and the non-clitic form, which is formed with the preposition a ("to") and the prepositional case, is the stressed form. Clitics cannot function independently and must attach to a host (either a verb or preposition). Clitic pronouns are generally proclitic, i.e. they appear before the verb of which they are the object. Enclitic pronouns (i.e. pronouns attached to the end of the verb (or related word) itself) most often appear with positive imperatives and may appear with infinitives and gerunds as well. In all compound infinitives that make use of the past participle, enclitics attach to the uninflected auxiliary verb and not the past participle(s) itself.
In Spanish, two (and rarely three) clitic pronouns can be used with a single verb, generally one accusative and one dative. They follow a specific order based primarily on person:
| 1 | 2 | 3 | 4 |
--- --- |
| se | teos | menos | lo, la,los, las,le, les |
Thus:
Él me lo dio = "He gave it to me"
Ellos te lo dijeron = "They said it to you"
Yo te me daré = "I will give myself to you"
Vosotros os nos presentasteis = "You [pl.] introduced yourselves to us"
Se le perdieron los libros = "The books disappeared on him" (lit. "The books got lost to him")
The full and pronominal form of a reduplicated direct object must agree in gender and number:
A las tropas las dirige César. = "Caesar directs the troops."
When an accusative third-person non-reflexive pronoun (lo, la, los, or las) is used with a dative pronoun that is understood to also be third-person non-reflexive (le or les), the dative pronoun is replaced by se. Simple non-emphatic clitic doubling is most often found with dative clitics, although it is occasionally found with accusative clitics as well. In a wide area in central Spain, including Madrid, there exists the practice of leísmo; which is, using the indirect object pronoun le for the object pronoun where Standard Spanish would use lo (masculine) or la (feminine) for the object pronoun.
Genitive pronouns
[edit]
Genitive pronouns describe to whom something belongs or of whom (or sometimes what) something is a characteristic or property. They are analogous to English "mine", "yours", "his", "hers", etc., and unlike their English counterparts, they inflect for gender and number according to the thing possessed (not the possessor itself) and are generally used with the definite article:
Mi coche es más grande que el tuyo = "My car is bigger than yours"
Tu casa tiene más cuartos que la suya = "Your house has more rooms than his/hers/yours/theirs"
Estos libros son más interesantes que los vuestros = "These books are more interesting than yours [pl.]"
Esas camisas son más pequeñas que las nuestras = "Those shirts are smaller than ours"
After ser, however, the definite article is usually omitted:
Este coche es mío = "This car is mine"
Esta camisa es suya = "This shirt is his/hers/yours/theirs"
To avoid ambiguity in the meaning of suyo, it may be replaced by de + the appropriate pronoun:
Estos pantalones son más largos que los de él = "These pants are longer than his"
Esta camisa es de ella = "This shirt is hers"
The neuter article lo can also be used with genitive pronouns to express the concept of "what is mine", "what is yours", "what is his", etc.: lo mío, lo tuyo, lo suyo, etc.
Genitive pronouns are identical in form to long-form possessive adjectives, which may be placed after the noun to place emphasis on the fact of possession.
Old forms
[edit]
Formal vos
[edit]
The pronoun vos was once used as a respectful form of address, semantically equivalent to modern usted. It used the same conjugations as modern vosotros (see below) and also the oblique form os and the possessive vuestro/-a/-os/-as. However, unlike vosotros, which always refers to more than one person, vos was usually singular in meaning. The modern voseo of several countries (see below) derives from vos but has become a generic form of address instead of a specifically respectful form. Vos and its related forms are still used in literature, cinema, etc., when attempting to depict the language of past centuries.
Regional variation
[edit]
Voseo
[edit]
Main article: Voseo
The pronoun "vos" is used in some areas of Latin America, particularly in Central America, Argentina, Uruguay, Paraguay, Chile, the state of Zulia in Venezuela, and the Andean regions of Colombia, Bolivia, Perú, and Ecuador. [citation needed] These are all distant from the large Spanish colonial cities, like Mexico City, Cartagena (Colombia), and Lima.
In some areas, like the River Plate region, vos has become the only generic form of address for the second-person singular, that is, it has the same meaning that tú has elsewhere (informal and intimate). In other areas, like Chile, it persists as a fairly stigmatized form alongside the more prestigious tú. In some other areas, it is employed among equals but not for very close people (couples or family) or to inferiors (children, animals etc.), where the pronoun tú would normally be used.
Ladino uses vos as well but uses it as in Old Spanish (see above), that is, as a respectful form of address, equivalent to how usted is used elsewhere. In fact, Ladino does not use usted at all because vos implies the same respect that it once had in Old Spanish. In Ladino, tú is used towards anyone in an informal manner.
In the local Spanish-based creole, Chavacano, the use of vos coexists alongside tú and usted depending on level of intimacy, commonality, and formality.
The use of vusted and vuestra merced
[edit]
| |
| This section does not cite any sources. Please help improve this section by adding citations to reliable sources. Unsourced material may be challenged and removed.Find sources: "vuestra merced" vsted – news · newspapers · books · scholar · JSTOR (April 2024) (Learn how and when to remove this message) |
The variant vusted/vustedes is mostly a regionalism in some countries in South America. It is common in isolated areas of Colombia and Venezuela. Other speakers consider it archaic because it is an older form of a contraction of vuestra merced. In Colombia, it is common for people to use su merced interchangeably with usted. Su merced can be used in the vocative case as well such as when speaking to an older person, as in Su merced, ¿por qué no vienen vusted y sus nietos a mi casa esta tarde?
Vuestra merced (literally "your grace") is the origin of usted, usarcé and similar forms that govern third-person verb forms with a second-person function. They are now confined mostly to period works.
It is unlikely that the similar-sounding Arabic أستاذ (ʾustāḏ), meaning "professor", was involved in the formation of Spanish usted because of the weakness of the semantic link and the fact that usted is not documented before 1598,[a] over a century after the fall of Moorish Granada.
Use of vosotros
[edit]
Today, the informal second-person plural pronoun vosotros is widely used by Spaniards except in some southwestern regions and in most of the Canary Islands, where its use is rare. Among the former colonies of the Spanish Empire, the use of vosotros and its normal conjugations is also retained in the Philippines and Equatorial Guinea.[b] In the Ladino of Sephardic Jews, the only second person plural is vozotros (i.e. there is no ustedes, as in standard Spanish).
Throughout Latin America, the second person plural pronoun ustedes is almost always used orally in both formal (singular usted) and informal (singular tú/vos) contexts. However, vosotros and its related forms are not unheard of in Latin America. The use of vosotros was more widespread in formal, educated speech in Hispanic America around the time of the Spanish American wars of independence.
Even in modern times, the use of vosotros may still be found in oratory, legal documents, or other highly formal or archaic contexts in Latin America. Spanish studies scholar Daniel Eisenberg [es] has noted that because the "use of archaic Spanish can give an impression of authority and wisdom", Latin American Spanish speakers will sometimes use vosotros to achieve a specific rhetorical effect; he observed that the notion "that vosotros is not used in Spanish America is one of the great myths of Spanish language instruction, at least in the U.S.", citing as an example the following quote, which employs the genitive (possessive) form of the word, vuestro:
Más de un batallón de los vuestros, invasor rubio, habrá mordido el polvo de mis agrestes montañas. transl. More than a battalion of yours, blonde invader, will have bitten the dust of my rugged mountains.
— Augusto César Sandino, quoted on a Nicaraguan billboard
Creoles
[edit]
Forms based on vosotros and vos are used in many Spanish-based creole languages.
In Chavacano, spoken in the Philippines, vo is used alongside tu as a singular second-person pronoun in Zamboangueño, Caviteño, and Ternateño. In Zamboangueño, evos is also used. For the plural, Zamboangueño has vosotros while Caviteño has vusos. Papiamento, spoken in Aruba, Bonaire, and Curaçao, maintains boso (singular) and bosonan (plural). Since it was used with slaves, the forms that seemed disrespectful in the rest of America were common.
Other forms
[edit]
Menda
[edit]
Menda is the equivalent of I in Caló, where it is concords in first person singular. In Spanish slang such as Cheli, el menda ♂ /la menda ♀ can be used as an emphatic I, concording with a third person verb, but its use is receding.
Servidor
[edit]
Un servidor, este servidor or simply servidor for the masculine gender and una servidora, esta servidora, servidora for the feminine are nouns meaning "servant" but used with the singular third-person verb as a polite, distancing, or humorous first-person pronoun, e.g. ¿Quién es el siguiente? - ¡Servidor!, 'Who is next? - [humbly] Me!', Servidora está harta de usted., '[Disdainfully] I am fed up with you.' In this sense, it is roughly analogous to the English phrase "yours truly".
Neopronouns
[edit]
Non-binary people in Spanish-speaking countries use many personal pronouns in place of gendered ones. It is common to substitute the "a" in ella/la, ellas/las, suya/suyas, nosotras, and vosotras with the letters "e", "i", "u", or "oa", and in writing with "x", "", "@", "æ", and "_". Other gender-neutral forms include il/li, ól/ol, and xelle/le.
Notes
[edit]
^ See the online Corpus del Español, for example
^ In José Rizal's Noli Me Tangere, Salomé uses vosotros to refer to Elías and his passengers that day. In its sequel, El filibusterismo, in the chapter entitled Risas, llantos, Sandoval addresses his fellow students using vosotros.
References
[edit]
^ "voso, vosa | Definición". Diccionario de la lengua española (in Spanish). Royal Spanish Academy - Association of Academies of the Spanish Language.
^ "Subject Pronouns In Spanish - Lesson 1". Transtle. 2021-03-26. Retrieved 2021-04-14.
^ a b Soler-Espiauba, Dolores (1994). "¿Tú o usted? ¿Cuándo y por qué? Descodificación al uso del estudiante de español como lengua extranjera" ['Tú' or 'usted'? When and why? Decoding for the use of the student of Spanish as a foreign language] (PDF). Actas (in Spanish) (V). ASELE: 199–208. Retrieved 17 September 2020.
^ a b Soler-Espiauba, page 201.
^ Pountain, Christopher J. (2001). A History of the Spanish Language Through Texts. Routledge. pp. 177, 264–5. ISBN 978-0-415-18062-7.
^ "Pronombres Personales Átonos" [Unstressed Personal Pronouns]. Diccionario panhispánico de dudas [Pan-Hispanic Dictionary of Doubts] (in Spanish). Real Academia Española. Retrieved 9 April 2017.
^ a b "Noli me tángere: Novela Tagala".
^ a b "El Filibusterismo".
^ Penny, Ralph (2000). Variation and Change in Spanish. Cambridge University Press. p. 184. ISBN 0-521-60450-8.
^ Frago Gracia, Juan Antonio (2011). "El español de América en la Independencia: Adiciones gramaticales I". Boletín de filología. 46 (1): 47–74. doi:10.4067/S0718-93032011000100002.
^ Gubitosi, Patricia; Lifszyc, Irina (2020). "El uso de vosotros como símbolo de identidad en La Bandera Americana, Nuevo México" (PDF). Glosas. 9.
^ Eisenberg, Daniel (1991). "What I Have Learned about Spanish from 23 Years of Teaching It". Journal of Hispanic Philology. 16: 3–9. ISSN 0147-5460. Archived from the original on 13 March 2016.
^ Reproduced in John G. Copland, Ralph Kite, and Lynn Sandstedt, Literatura y arte, 4th ed. [n.p.: Hold, Rinehart and Winston, 1989], p. 123.
^ ASALE, RAE-; RAE. "menda | Diccionario de la lengua española". «Diccionario de la lengua española» - Edición del Tricentenario (in Spanish). Retrieved 2021-03-24.
^ "servidor". Diccionario de la lengua española (in Spanish) (electronic 23.3 ed.). Real Academia Española and Asociación de Academias de la Lengua Española. 2019. Retrieved 17 September 2020.
^ "English-Spanish Dictionary". WordReference.com. Retrieved 2024-04-10.
^ Papadopoulos, B. (Ed.). (2022). Gender in Language Project. [www.genderinlanguage.com www.genderinlanguage.com]
^ "Pronombres". Pronombr.es (in Spanish). Pronouns.page. Retrieved 24 September 2023.
| v t e Pronouns of the world's languages |
| Phonologies Orthographies Grammars + Adjectives + Determiners + Nouns + Prepositions + Pronouns + Verbs |
| Indo-European(proto-language) | | | | --- | | Germanic | English + personal Colognian German | | Italic | | | | --- | | Romance | Catalan + personal - auxiliary verbs French + personal Portuguese + personal Spanish + object + personal | | | Slavic | Bulgarian Macedonian Slovene | |
| other European | |
| Japonic | |
| Sino-Tibetan | Burmese Cantonese Hokkien Mandarin |
| Austroasiatic | |
| other East Asian | |
| others | Austronesian personal pronouns Gender neutrality in languages with gendered third-person pronouns |
Retrieved from "
Categories:
Spanish grammar
Pronouns by language
Personal pronouns
Hidden categories:
Articles containing Spanish-language text
CS1 Spanish-language sources (es)
Articles with short description
Short description matches Wikidata
Articles needing additional references from December 2017
All articles needing additional references
Articles containing Old Spanish-language text
All articles with unsourced statements
Articles with unsourced statements from April 2021
Articles with unsourced statements from September 2012
Articles needing additional references from April 2024
Articles containing Arabic-language text
Articles containing Ladino-language text
Articles containing Caló-language text
Spanish personal pronouns
Add topic |
14115 | https://ghoshadi.wordpress.com/wp-content/uploads/2018/05/practice-problems.pdf | Practice Problems in Geometry Navneel Singhal August 14, 2016 Abstract The problems here are not sorted in order of difficulty because sometimes after seeing the source of the problem, people get intimidated. The best way is to look at the problem first and then look at the source after solving it.1 Invert the diagram about any point circle in the plane. All concurrencies become obvious.
- A solution which gets a 7/7.
1 Symmedians 1. Telv Cohl: Given a △ABC inscribed in ⊙(O) and a point P. Let △DEF be the tangential triangle of △ABC and let KA, KB, KC be the symmedian point of △BPC, △CPA, △APB, respectively. Prove that OP, DKA, EKB, FKC are concurrent.
2. Russia 2009: Let be given a triangle ABC and its internal angle bisector BD (D ∈BC). The line BD intersects the circumcircle Ωof triangle ABC at B and E. Circle ω with diameter DE cuts Ωagain at F. Prove that BF is the symmedian line of triangle ABC.
3. Romania TST 2014: Let △ABC be an acute triangle of circumcentre O. Let the tangents to the circumcircle of △ABC in points B and C meet at point P. The circle of centre P and radius PB = PC meets the internal angle bisector of ∠BAC inside △ABC at point S, and OS∩BC = D. The projections of S on AC and AB respectively are E and F. Prove that AD, BE and CF are concurrent.
4. andria (AoPS):let ABC be a triangle. let A0, B0, C0 be the midpoints of BC, CA, AB respectively. let Ωbe the nine point circle of △ABC. let AA0 ∩Ω= A1, BB0 ∩Ω= B1, CC0 ∩Ω= C1. let A2, B2, C2 be the reflections of A, B, C WRT A1, B1, C1 respectively. let A3, B3, C3 be the reflections of A2, B2, C2 WRT BC, CA, AB respectively. prove that AA3, BB3, CC3 are concurrent.
5. andria: In triangle ABC with circumcenter O points M, N are midpoints of AB, AC the tangents from B, C intersect at T let ⊙(△BON) ∩⊙(△COM) = S, AT ∩⊙(△ABC) = R prove that A, O, S, R lie on the circle.
6. Tran Quang Hung: Let ABC be a triangle with external bisector AD, incenter I and circumcenter O.
Perpendicular bisector of AI cuts OA at J. K, L are circumcenter of triangle ABD, ACD. S, T are reflection of A through JK, JL. AE, AF are symmedian of triangle AIC, AIB with E, F lie on IC, IB.
Prove that SF, TE and BC are concurrent.
1Some of the problems here which are supposedly high-numbered problems from the ISLs etc are actually not hard. In the words of v Enhance, try each problem on each contest religiously for at least half an hour to get a feel for its difficulty. Some problems turn out to be really foolish.
1 Navneel Singhal 2 Orthocenters 7. ELMO 2014: Let ABC be a triangle with circumcenter O and orthocenter H. Let ω1 and ω2 denote the circumcircles of triangles BOC and BHC, respectively. Suppose the circle with diameter AO intersects ω1 again at M, and line AM intersects ω1 again at X. Similarly, suppose the circle with diameter AH intersects ω2 again at N, and line AN intersects ω2 again at Y . Prove that lines MN and XY are parallel.
8. See Yufei Zhao’s handout ”Lemmas in Geometry” for more.
2 Orthocenters 1. Own, easy: Let H be the orthocenter of a triangle ABC. Let M be the midpoint of BC, and let E, F be the feet of the B and the C altitudes onto the opposite sides. Let X be the intersection of ray MA with the circumcircle of BHC. Prove that HX, EF and BC concur at a point and also show that the line joining that point and A is perpendicular to the line HM.
2. USA TSTST 2011 P4: Acute triangle ABC is inscribed in circle ω. Let H and O denote its orthocenter and circumcenter, respectively. Let M and N be the midpoints of sides AB and AC, respectively. Rays MH and NH meet ω at P and Q, respectively. Lines MN and PQ meet at R. Prove that OA ⊥RA.
3. IMO 2008 P1: Let H be the orthocenter of an acute-angled triangle ABC. The circle ΓA centered at the midpoint of BC and passing through H intersects the sideline BC at points A1 and A2. Similarly, define the points B1, B2, C1, and C2. Prove that six points A1, A2, B1, B2, C1, and C2 are concyclic.
4. IMO 2015 P3:2 Let ABC be an acute triangle with AB ⪈AC. Let Γ be its cirumcircle, H its orthocenter, and F the foot of the altitude from A. Let M be the midpoint of BC. Let Q be the point on Γ such that ∠HQA = π/2 and let K be the point on Γ such that ∠HKQ = π/2. Assume that the points A, B, C, K, and Q are all different and lie on Γ in this order. Prove that the circumcircles of triangles KQH and FKM are tangent to each other.
5. EGMO 2012 P7: Let ABC be an acute-angled triangle with circumcircle Γ and orthocenter H. Let K be a point of Γ on the other side of BC from A. Let L be the reflection of K across AB, and let M be the reflection of K across BC. Let E be the second point of intersection of Γ with the circumcircle of triangle BLM. Show that the lines KH, EM, and BC are concurrent.
6. APMO 2012 P4: Let ABC be an acute triangle. Denote by D the foot of the perpendicular line drawn from the point A to the side BC, by M the midpoint of BC, and by H the orthocenter of ABC. Let E be the point of intersection of the circumcircle Γ of the triangle ABC and the ray MH, and F be the point of intersection (other than E) of the line ED and the circle Γ. Prove that BF CF = AB BC must hold.
7. USA January TST 2014: Let ABCD be a cyclic quadrilateral, and let E, F, G, and H be the midpoints of AB, BC, CD, DA respectively.
Let W, X, Y, and Z be the orthocenters of triangles AHE, BEF, CFG,and DGH, respectively. Prove that quadrilaterals ABCD and WXY Z have the same area.3 8. APMO 2010 P4: Let ABC be an acute angled triangle satisfying the conditions AB > BC and AC > BC. Denote by O and H the circumcentre and orthocentre, respectively, of the triangle ABC.
Suppose that the circumcircle of the triangle AHC intersects the line AB at M different from A, and the circumcircle of the triangle AHB intersects the line AC at N different from A. Prove that the circumcentre of the triangle MNH lies on the line OH.
2Don’t get intimidated by the presence of IMO P3’s and P6’s, as some of them quite often turn out to be somewhat misplaced IMO problems, and this problem actually has a very short solution.
3This problem is probably most easily solved using complex numbers but finding a synthetic solution provides a lot of insight.
2 Navneel Singhal 3 In/Excenters 9. NIMO 2014: Let ABC be a triangle and let Q be a point such that AB ⊥QB and AC ⊥QC. A circle with center I is inscribed in △ABC which touches BC, CA, AB at D, E, F respectively. If ray QI intersects EF at P, prove that DP ⊥EF.
10. USA TST 2009 P2: Let ABC be an acute triangle. Point D lies on side BC. Let OB, OC be the circumcenters of triangles ABD and ACD, respectively. Suppose that the points B, C, OB, OC lies on a circle centered at X. Let H be the orthocenter of triangle ABC. Prove that ∠DAX = ∠DAH.
11. ISL 2005 G5: Let △ABC be an acute-angled triangle with AB ̸= AC. Let H be the orthocentre of triangle ABC, and let M be the midpoint of the side BC. Let D be a point on the side AB and E a point on the side AC such that AE = AD and the points D, H, E are on the same line. Prove that the line HM is perpendicular to the common chord of the circumscribed circles of triangle △ABC and triangle △ADE.
12. ISL 1998: Let ABC be a triangle, H its orthocentre, O its circumcentre, and R its circumradius. Let D be the reflection of the point A across the line BC, let E be the reflection of the point B across the line CA, and let F be the reflection of the point C across the line AB. Prove that the points D, E and F are collinear if and only if OH = 2R.
13. USA TSTST 2016 P2: Let ABC be a scalene triangle with orthocenter H and circumcenter O. Denote by M, N the midpoints of AH, BC. Suppose the circle γ with diameter AH meets the circumcircle of ABC at G ̸= A, and meets line AN at a point Q ̸= A. The tangent to γ at G meets line OM at P.
Show that the circumcircles of △GNQ and △MBC intersect at a point T on PN.
3 In/Excenters 1. Sharygin: Let triangle A1B1C1 be symmetric to ABC w.r.t. the incentre of its medial triangle. Prove that the orthocentre of A1B1C1 coincides with the circumcentre of the triangle formed by the excentres of ABC.
2. Sharygin: The incircle of triangle ABC touches BC, CA, AB at points A1, B1, C1, respectively. The perpendicular from the incentre I to the median from vertex C meets the line A1B1 in point K. Prove that CK is parallel to AB.
3. Russia 2006: Let K and L be two points on the arcs AB and BC of the circumcircle of a triangle ABC, respectively, such that KL ∥AC. Show that the incentres of triangles ABK and CBL are equidistant from the midpoint of the arc ABC of the circumcircle of triangle ABC.
4. Russia 2012:The point E is the midpoint of the segment connecting the orthocentre of the scalene triangle ABC and the point A. The incircle of triangle ABC incircle is tangent to AB and AC at points C′ and B′ respectively. Prove that point F, the point symmetric to point E with respect to line B′C′, lies on the line that passes through both the circumcentre and the incentre of triangle ABC.
5. Russia 2012: The points A1, B1, C1 lie on the sides sides BC, AC and AB of the triangle ABC respectively. Suppose that AB1 −AC1 = CA1 −CB1 = BC1 −BA1. Let IA, IB, IC be the incentres of triangles AB1C1, A1BC1 and A1B1C respectively. Prove that the circumcentre of triangle IAIBIC is the incentre of triangle ABC.
6. Vietnam TST 2003: Given a triangle ABC. Let O be the circumcentre of this triangle ABC. Let H, K, L be the feet of the altitudes of triangle ABC from the vertices A, B, C, respectively. Denote by A0, B0, C0 the midpoints of these altitudes AH, BK, CL, respectively. The incircle of triangle ABC has centre I and touches the sides BC, CA, AB at the points D, E, F, respectively. Prove that the four lines A0D, B0E, C0F and OI are concurrent. (When the point O coincides with I, we consider the line OI as an arbitrary line passing through O.) 3 Navneel Singhal 3 In/Excenters 7. ISL 2011 G6: Let ABC be a triangle with AB = AC and let D be the midpoint of AC. The angle bisector of ∠BAC intersects the circle through D, B and C at the point E inside the triangle ABC.
The line BD intersects the circle through A, E and B in two points B and F. The lines AF and BE meet at a point I, and the lines CI and BD meet at a point K. Show that I is the incentre of triangle KAB.
8. RMM 2012: Let ABC be a triangle and let I and O denote its incentre and circumcentre respectively.
Let ωA be the circle through B and C which is tangent to the incircle of the triangle ABC; the circles ωB and ωC are defined similarly. The circles ωB and ωC meet at a point A′ distinct from A; the points B′ and C′ are defined similarly. Prove that the lines AA′, BB′ and CC′ are concurrent at a point on the line IO.
9. ISL 2012: Let ABC be a triangle with circumcentre O and incentre I. The points D, E and F on the sides BC, CA and AB respectively are such that BD + BF = CA and CD + CE = AB. The circumcircles of the triangles BFD and CDE intersect at P ̸= D. Prove that OP = OI.
10. Own: Let ABC be a triangle with all angles> 45◦. D, E, F are the feet of the altitudes from A, B, C.
G is the centroid. Intersection of DG and (ABC) is A′. Define B′ and C′ analogously.A′B′ intersects with AC at Lac and A′B′ with BC at Lbc. Define the L’s with other subscripts similarly. Let (Oa) be the circle passing through A and Lac and tangent to A′B′. Let (O′ a) be the circle through A and Lab and tangent to C′A′. Here we denote by (X) a circle with center as X. Define the circles with the other subscripts in the same manner. Let the circumcentre of AOaO′ a be O′′ a. Define other centres similarly, using a cyclic shift of variable names. Extend A′O′′ a, B′O′′ b and C′O′′ c to form a triangle A1B1C1. Let the mixtilinear incircle touch points with its circumcircle be X, Y, and Z. Prove that the cevians A1X etc concur at the point P such that the circumcentre of the cevian triangle of the isotomic conjugate of isogonal conjugate of P with respect to A1B1C1 is the circumcentre of ABC.4 11. Let I be the incenter of an acute-angled triangle ABC. Line AI cuts the circumcircle of BIC again at E. Let D be the foot of the altitude from A to BC, and let J be the reflection of I across BC. Show D, J and E are collinear.
12. Russia 1999: A triangle ABC is inscribed in a circle S. Let A0 and C0 be the midpoints of the arcs BC and AB on S, not containing the opposite vertex, respectively. The circle S1 centered at A0 is tangent to BC, and the circle S2 centered at C0 is tangent to AB. Prove that the incenter I of △ABC lies on a common tangent to S1 and S2.
13. Taiwan 2014 TST Quiz: Let ABC be a triangle with incenter I and circumcenter O. A straight line L is parallel to BC and tangent to the incircle. Suppose L intersects IO at X, and select Y on L such that Y I is perpendicular to IO. Prove that A, X, O, Y are concyclic.
14. Let I be the incenter of a triangle ABC and let the A, B and C mixtilinear incircles touch the circumcircle of ABC at TA, TB and TC respectively. Let ITA, ITB, ITC cut BC, CA, AB at X, Y and Z respectively. Prove that AX, BY and CZ concur at a point joining the centroid of ABC to the Gergonne point of ABC.
15. Russia 2014: Let ABC be a triangle with AB > BC and circumcircle Γ. Points M, N lie on the sides AB, BC respectively, such that AM = CN. Lines MN and AC meet at K. Let P be the incenter of the triangle AMK, and let Q be the K-excenter of the triangle CNK. If R is midpoint of arc ABC of Γ, then prove that RP = RQ.
4Another problem: Draw its diagram. It has a surprisingly simple solution, even though the notation is quite intimidating.
4 Navneel Singhal 5 Parallelograms 4 Altitudes and Midpoints 1. ISL 2011 G45: Let ABC be an acute triangle with circumcircle Ω. Let B0 be the midpoint of AC and let C0 be the midpoint of AB. Let D be the foot of the altitude from A and let G be the centroid of the triangle ABC. Let ω be a circle through B0 and C0 that is tangent to the circle Ωat a point X ̸= A. Prove that the points D, G and X are collinear.
2. Russia: An acute-angled ABC (AB < AC) is inscribed into a circle ω. Let M be the centroid of ABC, and let AH be an altitude of this triangle. A ray MH meets ω at A′. Prove that the circumcircle of the triangle A′HB is tangent to AB.
3. ThE-dArK-lOrD (AoPS):Given △ABC with altitude AHA, BHB, CHC where HA, HB, HC ∈BC, CA, AB respectively Let D, E, F are points in segment AHA, BHB, CHC such that ∠BDC = ∠CEA = ∠AFB = 90◦And let X ̸= D, Y ̸= E, Z ̸= F lie on AHA, BHB, CHC such that ∠BXC = ∠CY A = ∠AZB = 90◦Let M is circumcenter of △DEF and N is circumcenter of △XY Z 1) Prove that H, M, N collinear where H is orthocenter of △ABC 2) Prove that Z, D, Y collinear if and only if Z, N, Y collinear.
4. CentroAmerican Olympiad: Let ABC be an acute-angled triangle, Γ its circumcircle and M the midpoint of BC. Let N be a point in the arc BC of Γ not containing A such that ∠NAC = ∠BAM.
Let R be the midpoint of AM, S the midpoint of AN and T the foot of the altitude through A. Prove that R, S and T are collinear.
5. Tran Quang Hung: Let ABC be a triangle with orthocenter H, circumcenter O and nine point circle (N). Construct parallelogram ABDC. Let P be a point on radical axis of (N) and circle diameter OD such that OP ∥BC. K lies on OH such that PK = PO. Prove that radical axis of (N) and circle diameter HK passes through O.
6. Own: Let the perimeter of a triangle ABC be 2 and let BC be the smallest side. Let P and Q be on AC and AB such that AP + PB = AQ + QC = 1. A line parallel to the internal angle bisector of B through P meets the perpendicular bisector of BC at T. BP intersects QC at W. Prove that A, W, T are collinear iffAB = AC.6 5 Parallelograms 1. USAMO 2003: Let ABC be a triangle. A circle passing through A and B intersects segments AC and BC at D and E, respectively. Lines AB and DE intersect at F, while lines BD and CF intersect at M. Prove that MF = MC if and only if MB.MD = MC2.
2. Let ABC be a triangle with circumcenter O and orthocenter H, and let M and N be the midpoints of AB and AC. Rays MO and NO meet line BC at Y and X, respectively. Lines MX and NY meet at P. Prove that OP bisects AH.
3. Let ABCD be a parallelogram. Let E and F be points on AB and AD such that BE = DF. Prove that DE, BF and the angle bisector of ∠BCD concur.
4. Let ABCD be a parallelogram. P is a point such that ∠PDC = ∠PBC. Prove that ∠PAB = ∠PCB.
5. Let ABCD be a parallelogram in which the angle bisector of ∠ADC meets AB and BC at X and Y respectively. Prove that the circumcenter of BXY lies on the circumcircle of ABC.
5A solution using a √ bc inversion is also possible. Try finding it after a solution using one of our lemmas.
6This may look weird, but the idea of the solution is quite natural at heart.
5 Navneel Singhal 6 Miscellaneous Problems 6. ELMO 2012: Let ABC be an acute triangle with AB < AC, and let D and E be points on side BC such that BD = CE and D lies between B and E. Suppose there exists a point P inside ABC such that PD ∥AE and ∠PAB = ∠EAC. Prove that ∠PBA = ∠PCA.
7. Tran Quang Hung: Let ABCD be a parallelogram. (O) is the circumcircle of triangle ABC. P is a point on BC. K is circumcenter of triangle PAB. L is on AB such that KL ⊥BC. CL cuts (O) again at M. Prove that M, P, C, D are concyclic.
8. ISL 2013 G5: Let ABCDEF be a convex hexagon with AB = DE, BC = EF, CD = FA, and ∠A −∠D = ∠C −∠F = ∠E −∠B. Prove that the diagonals AD, BE, and CF are concurrent.7 9. ELMO 2016: Oscar is drawing diagrams with trash can lids and sticks. He draws a triangle ABC and a point D such that DB and DC are tangent to the circumcircle of ABC. Let B′ be the reflection of B over AC and C′ be the reflection of C over AB. If O is the circumcenter of DB′C′, help Oscar prove that AO is perpendicular to BC.
6 Miscellaneous Problems 1. Romania TST: Let ABC be a triangle, D be a point on side BC, and let O be the circumcircle of triangle ABC. Show that the circles tangent to O, AD, BD and to O, AD, DC are tangent to each other if and only if ∠BAD = ∠CAD.
2. Two circles intersect at two points A and B. A line ℓwhich passes through the point A meets the two circles again at the points C and D, respectively. Let M and N be the midpoints of the arcs BC and BD (which do not contain the point A) on the respective circles. Let K be the midpoint of the segment CD. Prove that ∡MKN = 90◦.
3. The tangents at A and B to the circumcircle of the acute triangle ABC intersect the tangent at C at the points D and E, respectively. The line AE intersects BC at P and the line BD intersects AC at R.
Let Q and S be the midpoints of the segments AP and BR respectively. Prove that ∠ABQ = ∠BAS.
4. Russia: Two circles intersect at A and B. A line through A meets the first circle again at C and the second circle again at D. Let M and N be the midpoints of the arcs BC and BD not containing A, and let K be the midpoint of the segment CD. Show that ∠MKN = π/2. (You may assume that C and D lie on opposite sides of A.) 5. A circle centred at O and inscribed in triangle ABC meets sides AC;AB;BC at K;M;N, respectively.
The median BB1 of the triangle meets MN at D. Show that O;D;K are collinear.
6. In scalene △ABC, the tangent from the foot of the bisector of ∠A to the incircle of △ABC, other than the line BC, meets the incircle at point Ka. Points Kb and Kc are analogously defined. Prove that the lines connecting Ka, Kb, Kc with the midpoints of BC, CA, AB, respectively, have a common point on the incircle.
7. In triangle ABC, a circle passes through A and B and is tangent to BC. Also, a circle that passes through B and C is tangent to AB. These two circles intersect at a point K other than B. If O is the circumcentre of ABC, prove that ∠BKO = 90◦.
8. Sharygin: Quadrilateral ABCD is circumscribed around a circle with centre I. Prove that the projections of points B and D to the lines IA and IC lie on a single circle.
7Yes, this problem comes under the section parallelograms.
6 Navneel Singhal 6 Miscellaneous Problems 9. ISL 2015 G5: Let ABC be a triangle with CA ̸= CB. Let D, F, and G be the midpoints of the sides AB, AC, and BC respectively. A circle Γ passing through C and tangent to AB at D meets the segments AF and BG at H and I, respectively. The points H′ and I′ are symmetric to H and I about F and G, respectively. The line H′I′ meets CD and FG at Q and M, respectively. The line CM meets Γ again at P. Prove that CQ = QP.
10. ISL 2015 G7: Let ABCD be a convex quadrilateral, and let P, Q, R, and S be points on the sides AB, BC, CD, and DA, respectively. Let the line segment PR and QS meet at O. Suppose that each of the quadrilaterals APOS, BQOP, CROQ, and DSOR has an incircle. Prove that the lines AC, PQ, and RS are either concurrent or parallel to each other.
11. ISL 2014 G7: Let ABC be a triangle with circumcircle Ωand incentre I. Let the line passing through I and perpendicular to CI intersect the segment BC and the arc BC (not containing A) of Ωat points U and V , respectively. Let the line passing through U and parallel to AI intersect AV at X, and let the line passing through V and parallel to AI intersect AB at Y . Let W and Z be the midpoints of AX and BC, respectively. Prove that if the points I, X, and Y are collinear, then the points I, W, and Z are also collinear.
12. ISL 2014 G6: Let ABC be a fixed acute-angled triangle. Consider some points E and F lying on the sides AC and AB, respectively, and let M be the midpoint of EF . Let the perpendicular bisector of EF intersect the line BC at K, and let the perpendicular bisector of MK intersect the lines AC and AB at S and T , respectively. We call the pair (E, F) interesting, if the quadrilateral KSAT is cyclic.
Suppose that the pairs (E1, F1) and (E2, F2) are interesting. Prove that E1E2 AB = F1F2 AC 13. ISL 2014 G4: Consider a fixed circle Γ with three fixed points A, B, and C on it. Also, let us fix a real number λ ∈(0, 1). For a variable point P ̸∈{A, B, C} on Γ, let M be the point on the segment CP such that CM = λ · CP . Let Q be the second point of intersection of the circumcircles of the triangles AMP and BMC. Prove that as P varies, the point Q lies on a fixed circle.8 14. IMO 2013: Let the excircle of triangle ABC opposite the vertex A be tangent to the side BC at the point A1. Define the points B1 on CA and C1 on AB analogously, using the excircles opposite B and C, respectively. Suppose that the circumcentre of triangle A1B1C1 lies on the circumcircle of triangle ABC. Prove that triangle ABC is right-angled.
15. ISL 2015 G3: Let ABC be a triangle with ∠C = 90◦, and let H be the foot of the altitude from C. A point D is chosen inside the triangle CBH so that CH bisects AD. Let P be the intersection point of the lines BD and CH. Let ω be the semicircle with diameter BD that meets the segment CB at an interior point. A line through P is tangent to ω at Q. Prove that the lines CQ and AD meet on ω.
16. China TST: A circle Γ through A meets AB, AC at E, F respectively and (ABC) at P. Prove that the reflection of P across EF lies on BC if and only if Γ passes through O.
17. Let the circumcenter of ABC be O. Let the projection of A onto BC be HA. AO meets (BOC) again at A′. Projections of A′ onto AB, AC are D, E. Let HADE have the circumcenter OA. Define HB, HC, OB, OC respectively. Prove that OAHA, OBHC and OCHC concur at a point.
18. Diagonals of a cyclic quadrilateral ABCD meet at P and ∃a circle Γ tangent to the extensions of AB, BC, AD, DC at X, Y, Z, T respectively. Circle Ωpasses through A, B, and is tangent to Γ at S.
Prove that SP ⊥ST.
19. Let D, E be the feet of the B and the C altitudes in an acute △ABC. Let the reflection of E with respect to AC, BC be S, T. The circumcircle of △CST meets AC again at X. Denote the circumcenter of △CST as O. Prove that XO ⊥DE.
8After a suitable transformation, this problem can be finished even by coordinates.
7 Navneel Singhal 7 Further solving 20. USA TST 2016: Let ABC be a scalene triangle with circumcircle Ωand suppose that the incircle of ABC touches BC at D. Let the angle bisector of BC and Ωat E and F. The circumcircle of DEF meets the A-excircle at S1 and S2 and Ωat T ̸= F. Prove that AT passes through either S1 or S2.
21. USA TST 2015: Let ABC be a non-equilateral triangle and let Ma, Mb, Mc be the midpoints of the sides BC, CA, AB, respectively. Let S be a point lying on the Euler line. Denote by X, Y , Z the second intersections of MaS, MbS, McS with the nine-point circle. Prove that AX, BY , CZ are concurrent.
22. In acute ABC, ∠A is the smallest. P is a variable point on BC and D, E lie on AB, AC respectively such that BP = PD and CP = PE. Prove that as P varies on BC, circumcircle of ADE passes through a fixed point.
23. Let ABC be an acute scalene triangle inscribed in circle Ω. A circle ω centered at O meets AB, AC again at E, D respectively. Point P lies on arc BAC of Ω. Prove that OP, BD, CE are concurrent if and only if the incircles of PBD and PCE are concentric.
24. The incircle ω of a quadrilateral ABCD touches AB, BC, CD, DA at E, F, G, H respectively. X is an arbitrary point on segment AC inside ω .The segments XB, XD meet ω at I, J. Prove that FJ, IG and AC concur at a point.
25. Let the incircle (I) of △ABC touch BC, CA, AB at D, E, F respectively and let their midpoints be P, Q, R. The reflections of D, E, F over AI, BI, CI are D′, E′, F ′. Prove that PD′, QE′, RF ′ concur at a point.
7 Further solving 1. Yufei Zhao’s notes 2. Evan Chen’s articles 3. Sharygin Geometrical Olympiad 4. TSTs of various countries 5. Forum Geometricorum (Good for reading) 6. Akopyan, Geometry in figures 7. Roger Johnson, Advanced Euclidean Geometry 8. I.F. Sharygin, Problems in Plane Geometry 9. Aref, Wernick, Problems and Solutions in Euclidean Geometry 8 |
14116 | https://math.stackexchange.com/questions/1078737/how-prove-this-function-inequality-xfx-frac1xf-left-frac1x-right | analysis - How prove this function inequality $xf(x)>\frac{1}{x}f\left(\frac{1}{x}\right)$ - Mathematics Stack Exchange
Join Mathematics
By clicking “Sign up”, you agree to our terms of service and acknowledge you have read our privacy policy.
Sign up with Google
OR
Email
Password
Sign up
Already have an account? Log in
Skip to main content
Stack Exchange Network
Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Visit Stack Exchange
Loading…
Tour Start here for a quick overview of the site
Help Center Detailed answers to any questions you might have
Meta Discuss the workings and policies of this site
About Us Learn more about Stack Overflow the company, and our products
current community
Mathematics helpchat
Mathematics Meta
your communities
Sign up or log in to customize your list.
more stack exchange communities
company blog
Log in
Sign up
Home
Questions
Unanswered
AI Assist Labs
Tags
Chat
Users
Teams
Ask questions, find answers and collaborate at work with Stack Overflow for Teams.
Try Teams for freeExplore Teams
3. Teams
4. Ask questions, find answers and collaborate at work with Stack Overflow for Teams. Explore Teams
Teams
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
Learn more about Teams
Hang on, you can't upvote just yet.
You'll need to complete a few actions and gain 15 reputation points before being able to upvote. Upvoting indicates when questions and answers are useful. What's reputation and how do I get it?
Instead, you can save this post to reference later.
Save this post for later Not now
Thanks for your vote!
You now have 5 free votes weekly.
Free votes
count toward the total vote score
does not give reputation to the author
Continue to help good content that is interesting, well-researched, and useful, rise to the top! To gain full voting privileges, earn reputation.
Got it!Go to help center to learn more
How prove this function inequality x f(x)>1 x f(1 x)x f(x)>1 x f(1 x)
Ask Question
Asked 10 years, 9 months ago
Modified10 years, 9 months ago
Viewed 347 times
This question shows research effort; it is useful and clear
11
Save this question.
Show activity on this post.
Let f(x)f(x) be monotone decreasing on (0,+∞)(0,+∞), such that
0<f(x)<|f′(x)|,∀x∈(0,+∞).0<f(x)<|f′(x)|,∀x∈(0,+∞).
Show that
x f(x)>1 x f(1 x),∀x∈(0,1).x f(x)>1 x f(1 x),∀x∈(0,1).
My ideas:
Since f(x)f(x) is monotone decreasing, f′(x)<0 f′(x)<0, hence
f(x)+f′(x)<0.f(x)+f′(x)<0.
Let
F(x)=e x f(x)⟹F′(x)=e x(f(x)+f′(x))<0 F(x)=e x f(x)⟹F′(x)=e x(f(x)+f′(x))<0
so F(x)F(x) is also monotone decreasing. Since 0<x<1 0<x<1,
F(x)>F(1 x)F(x)>F(1 x)
so
e x f(x)>e 1 x f(1 x).e x f(x)>e 1 x f(1 x).
So we must prove
e 1 x−x>1 x 2,0<x<1 e 1 x−x>1 x 2,0<x<1
⟺ln x−x>ln 1 x−1 x,0<x<1⟺lnx−x>ln1 x−1 x,0<x<1
because 0<x<1,1 x>1 0<x<1,1 x>1 so I can't. But I don't know whether this inequality is true. I tried Wolfram Alpha but it didn't tell me anything definitive.
PS: This problem is from a Chinese analysis problem book by Huimin Xie.
analysis
inequality
functional-inequalities
Share
Share a link to this question
Copy linkCC BY-SA 3.0
Cite
Follow
Follow this question to receive notifications
edited Dec 23, 2014 at 19:32
epimorphic
3,281 3 3 gold badges 25 25 silver badges 40 40 bronze badges
asked Dec 23, 2014 at 13:12
math110math110
95.1k 17 17 gold badges 154 154 silver badges 524 524 bronze badges
6
Note that x e x x e x is an increasing function if x∈(0,1)x∈(0,1) so x e x<1 x e 1/x x e x<1 x e 1/x and then your inequality is false (the inequality in the comment).Marco Cantarini –Marco Cantarini 2014-12-23 13:57:53 +00:00 Commented Dec 23, 2014 at 13:57
oh,this inequality is not true,that mean my idea is not usefull？math110 –math110 2014-12-23 14:01:57 +00:00 Commented Dec 23, 2014 at 14:01
maybe this books problem is not true? maybe we can take countexapmle?math110 –math110 2014-12-23 14:05:07 +00:00 Commented Dec 23, 2014 at 14:05
@MarcoCantarini, you are maybe wrong. See wolframalpha.com/input/….Alex Silva –Alex Silva 2014-12-23 14:05:56 +00:00 Commented Dec 23, 2014 at 14:05
To clearify the comment of @MarcoCantarini: x↦x e x x↦x e x is increasing for all x>0 x>0. Thus x e x<1/x e 1/x x e x<1/x e 1/x for x∈(0,1)x∈(0,1). Isnt, however, the function one should study x↦x e 1/x x↦x e 1/x?mickep –mickep 2014-12-23 14:07:02 +00:00 Commented Dec 23, 2014 at 14:07
|Show 1 more comment
2 Answers 2
Sorted by: Reset to default
This answer is useful
7
Save this answer.
Show activity on this post.
A tentative of proof:
Put g(x)=x 2 f(x)−f(1/x)g(x)=x 2 f(x)−f(1/x). We have
g′(x)=2 x f(x)+x 2 f′(x)+1 x 2 f′(1 x)=A+B+C g′(x)=2 x f(x)+x 2 f′(x)+1 x 2 f′(1 x)=A+B+C
with A=x 2(f(x)+f′(x))A=x 2(f(x)+f′(x)), B=1 x 2(f(1 x)+f′(1 x))B=1 x 2(f(1 x)+f′(1 x)), and C=x(2−x)f(x)−1 x 2 f(1 x)C=x(2−x)f(x)−1 x 2 f(1 x).
You have proved that A<0 A<0 and B<0 B<0. We have
C=x(2−x)f(x)−1 x 2 f(1 x)=−(x−1)2 f(x)+1 x 2 g(x)C=x(2−x)f(x)−1 x 2 f(1 x)=−(x−1)2 f(x)+1 x 2 g(x)
Hence g′(x)−1 x 2 g(x)<0 g′(x)−1 x 2 g(x)<0. Put h(x)=g(x)exp(1/x)h(x)=g(x)exp(1/x), we have h′(x)=(g′(x)−1 x 2 g(x))exp(1/x)h′(x)=(g′(x)−1 x 2 g(x))exp(1/x), and hence h h is decreasing. As g(1)=0 g(1)=0, we have h(1)=0 h(1)=0, h(x)>0 h(x)>0 for x∈(0,1)x∈(0,1), and we are done.
Share
Share a link to this answer
Copy linkCC BY-SA 3.0
Cite
Follow
Follow this answer to receive notifications
answered Dec 23, 2014 at 14:24
KelennerKelenner
18.9k 28 28 silver badges 36 36 bronze badges
1
1 wa! Very very Nice! Thank you+1 math110 –math110 2014-12-23 14:29:05 +00:00 Commented Dec 23, 2014 at 14:29
Add a comment|
This answer is useful
4
Save this answer.
Show activity on this post.
I think the answer by @Kelenner is really good. This answer is just to prove the inequality
e 1/x−x>1/x 2,0<x<1.()()e 1/x−x>1/x 2,0<x<1.
that was discussed in the post/comments. We apply the logarithm, and since the logarithm is monotonically increasing, the inequality (∗)(∗) is equivalent to
2 ln x>x−1 x,0<x<1.()()2 lnx>x−1 x,0<x<1.
Let
g(x)=2 ln x−x+1 x.g(x)=2 lnx−x+1 x.
Then g(1)=0 g(1)=0 and a differentiation (and simplification) gives
g′(x)=−(x−1)2 x 2.g′(x)=−(x−1)2 x 2.
Hence g′(x)<0 g′(x)<0 for 0<x<1 0<x<1 (so g g is monotonically decreasing) and it follows that g(x)>0 g(x)>0 for 0<x<1 0<x<1 and thus that (∗∗)(∗∗) holds. But (∗∗)(∗∗) was seen to be equivalent to (∗)(∗), and so the inequality (∗)(∗) is true.
Edit: I updated the solution without the change of variable, since I don't think it simplified anything in the end.
Share
Share a link to this answer
Copy linkCC BY-SA 3.0
Cite
Follow
Follow this answer to receive notifications
edited Dec 23, 2014 at 17:21
answered Dec 23, 2014 at 16:00
mickepmickep
20.1k 1 1 gold badge 33 33 silver badges 57 57 bronze badges
1
1 Nice!Thank you very much math110 –math110 2014-12-23 16:30:59 +00:00 Commented Dec 23, 2014 at 16:30
Add a comment|
You must log in to answer this question.
Start asking to get answers
Find the answer to your question by asking.
Ask question
Explore related questions
analysis
inequality
functional-inequalities
See similar questions with these tags.
Featured on Meta
Introducing a new proactive anti-spam measure
Spevacus has joined us as a Community Manager
stackoverflow.ai - rebuilt for attribution
Community Asks Sprint Announcement - September 2025
Report this ad
Related
5How prove this (a 2+b 4−−−−−−√−a)(b 2+a 4−−−−−−√−b)≤a 2 b 2(a 2+b 4−a)(b 2+a 4−b)≤a 2 b 2
5prove |exp(x)−1−x−x 2 2!−x 3 3!|<e 24|exp(x)−1−x−x 2 2!−x 3 3!|<e 24
1How prove this limits lim n→∞∫1 0 g(x)f′(n x)d x=0 lim n→∞∫0 1 g(x)f′(n x)d x=0
1Prob. 14, Sec. 2.7, in Kreyszig's Functional Analysis Book: How to find the norm of this bounded linear operator?
4Is the sequence a n=∏i=1 n(1+i n 2)a n=∏i=1 n(1+i n 2) decreasing?
1Prove this inequality n 3 n−2 n<(2 5)n−1 n 3 n−2 n<(2 5)n−1
2Bound ∥A x∥‖A x‖ in term of ∥x−y∥‖x−y‖
2How to prove a "generalization" of the "Clarkson inequality"?
1How Does One Verify This Operator Norm Inequality?
Hot Network Questions
A time-travel short fiction where a graphologist falls in love with a girl for having read letters she has not yet written… to another man
How long would it take for me to get all the items in Bongo Cat?
An odd question
What is a "non-reversible filter"?
Riffle a list of binary functions into list of arguments to produce a result
How can blood fuel space travel?
Identifying a thriller where a man is trapped in a telephone box by a sniper
Exchange a file in a zip file quickly
Can a state ever, under any circumstance, execute an ICC arrest warrant in international waters?
What is the feature between the Attendant Call and Ground Call push buttons on a B737 overhead panel?
how do I remove a item from the applications menu
Is it ok to place components "inside" the PCB
How many stars is possible to obtain in your savefile?
Any knowledge on biodegradable lubes, greases and degreasers and how they perform long term?
Bypassing C64's PETSCII to screen code mapping
Checking model assumptions at cluster level vs global level?
How to use \zcref to get black text Equation?
What is the meaning of 率 in this report?
The geologic realities of a massive well out at Sea
RTC battery and VCC switching circuit
Xubuntu 24.04 - Libreoffice
Suspicious of theorem 36.2 in Munkres “Analysis on Manifolds”
Analog story - nuclear bombs used to neutralize global warming
Another way to draw RegionDifference of a cylinder and Cuboid
Question feed
Subscribe to RSS
Question feed
To subscribe to this RSS feed, copy and paste this URL into your RSS reader.
Why are you flagging this comment?
It contains harassment, bigotry or abuse.
This comment attacks a person or group. Learn more in our Code of Conduct.
It's unfriendly or unkind.
This comment is rude or condescending. Learn more in our Code of Conduct.
Not needed.
This comment is not relevant to the post.
Enter at least 6 characters
Something else.
A problem not listed above. Try to be as specific as possible.
Enter at least 6 characters
Flag comment Cancel
You have 0 flags left today
Mathematics
Tour
Help
Chat
Contact
Feedback
Company
Stack Overflow
Teams
Advertising
Talent
About
Press
Legal
Privacy Policy
Terms of Service
Your Privacy Choices
Cookie Policy
Stack Exchange Network
Technology
Culture & recreation
Life & arts
Science
Professional
Business
API
Data
Blog
Facebook
Twitter
LinkedIn
Instagram
Site design / logo © 2025 Stack Exchange Inc; user contributions licensed under CC BY-SA. rev 2025.9.26.34547
By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.
Accept all cookies Necessary cookies only
Customize settings
Cookie Consent Preference Center
When you visit any of our websites, it may store or retrieve information on your browser, mostly in the form of cookies. This information might be about you, your preferences, or your device and is mostly used to make the site work as you expect it to. The information does not usually directly identify you, but it can give you a more personalized experience. Because we respect your right to privacy, you can choose not to allow some types of cookies. Click on the different category headings to find out more and manage your preferences. Please note, blocking some types of cookies may impact your experience of the site and the services we are able to offer.
Cookie Policy
Accept all cookies
Manage Consent Preferences
Strictly Necessary Cookies
Always Active
These cookies are necessary for the website to function and cannot be switched off in our systems. They are usually only set in response to actions made by you which amount to a request for services, such as setting your privacy preferences, logging in or filling in forms. You can set your browser to block or alert you about these cookies, but some parts of the site will not then work. These cookies do not store any personally identifiable information.
Cookies Details
Performance Cookies
[x] Performance Cookies
These cookies allow us to count visits and traffic sources so we can measure and improve the performance of our site. They help us to know which pages are the most and least popular and see how visitors move around the site. All information these cookies collect is aggregated and therefore anonymous. If you do not allow these cookies we will not know when you have visited our site, and will not be able to monitor its performance.
Cookies Details
Functional Cookies
[x] Functional Cookies
These cookies enable the website to provide enhanced functionality and personalisation. They may be set by us or by third party providers whose services we have added to our pages. If you do not allow these cookies then some or all of these services may not function properly.
Cookies Details
Targeting Cookies
[x] Targeting Cookies
These cookies are used to make advertising messages more relevant to you and may be set through our site by us or by our advertising partners. They may be used to build a profile of your interests and show you relevant advertising on our site or on other sites. They do not store directly personal information, but are based on uniquely identifying your browser and internet device.
Cookies Details
Cookie List
Clear
[x] checkbox label label
Apply Cancel
Consent Leg.Interest
[x] checkbox label label
[x] checkbox label label
[x] checkbox label label
Necessary cookies only Confirm my choices |
14117 | https://www.youtube.com/watch?v=03aAr9Fh2SQ | Order of Operations with Integers | Math with Mr. J
Math with Mr. J
1730000 subscribers
1692 likes
Description
129302 views
Posted: 23 Apr 2021
Welcome to Order of Operations with Integers with Mr. J! Need help with order of operations? You're in the right place!
Whether you're just starting out, or need a quick refresher, this is the video for you if you're looking for help with how to solve order of operation problems with integers (aka PEMDAS with integers). Mr. J will go through order of operations examples and explain the steps of how to solve order of operations problems involving positive and negative integers.
✅ Order of Operations with Integers (Intro):
✅ Intro to Order of Operations:
✅ More Examples of Order of Operations Problems:
✅ Order of Operations with Exponents:
✅ Order of Operations with Parentheses and Brackets:
About Math with Mr. J: This channel offers instructional videos that are directly aligned with math standards. Teachers, parents/guardians, and students from around the world have used this channel to help with math content in many different ways. All material is absolutely free.
Click Here to Subscribe to the Greatest Math Channel On Earth:
Follow Mr. J on Twitter: @MrJMath5
Email: math5.mrj@gmail.com
Music:
Hopefully this video is what you're looking for when it comes to order of operations with integers.
113 comments
Transcript:
[Music] welcome to math with mr j [Music] in this video i'm going to cover the order of operations with integers and we're going to be working with both positive and negative integers we have two examples that we're going to go through together in order to get this down so let's jump into number one where we have negative eight squared divided by two plus six parentheses four times negative 2 and parentheses and we'll go through our process starting with parentheses so do we have any sets of parentheses within that problem where we have to solve something within the parentheses yes at the end we have 4 times negative 2. now we do have parentheses at the beginning of the problem around the negative 8 but there's nothing to solve in there parentheses around negative numbers help us organize the problem that way we don't forget we're dealing with a negative or confuse the negative with an operation that we need to perform again it helps keep us organized so let's solve the parentheses what's in the parentheses at the end of the problem there four times negative two so we have a positive times a negative that's going to give us a negative i'll put that negative eight in parentheses that way it helps us stay organized and we'll bring down everything we did not use and we will continue to go through our process so any parentheses where we have to solve something within the parentheses no any exponents yes so that's what we do next we have negative eight squared that does not mean negative eight times two it means negative eight times negative eight so a negative times a negative equals a positive so we get 64. bring down everything we did not use so we're breaking this problem down step by step in order to get to that final answer so our process here do we have any parentheses no any exponents no any multiplication or division yes we have both 64 divided by 2 and then 6 times negative 8. whenever you have a number right up against parentheses it means multiplication now multiplication and division are on the same level so to speak so we solve from left to right so 64 divided by 2 comes first that's going to give us 32 bring down everything we did not use so any parentheses with something inside that we need to solve no any exponents no multiplication or division yes we have six times negative eight so a positive six times a negative eight that's going to give us a negative answer so negative forty-eight bring down the addition sign and the 32 and we wrap things up with 32 plus negative 48 that's going to give us a negative 16 for our final answer so let's move on to number two where we have 21 divided by negative three times parentheses eight plus five and parentheses minus four let's go through our process so any parentheses where we have something to solve within those parentheses yes that 8 plus 5. so we're going to start there 8 plus 5 is 13. bring down everything we did not use now keep everything in the same exact order all right any parentheses where we have something to solve no any exponents no any multiplication or division yes we have both so solve from left to right we will do 21 divided by negative 3 so we have a positive divided by a negative that's going to give us a negative result so we have negative 7 here i'll put it in parentheses to help organize our problem and then bring down everything we did not use so any parentheses no exponents no multiplication or division yes that's what we do next so we have negative seven times thirteen a negative times a positive equals a negative that's going to give us negative ninety-one and bring down our subtraction and the four so we have negative ninety-one minus four so there are different ways to think through this last step as far as subtracting 4 from negative 91. the first being well we could think we are subtracting a positive number we are taking away 4. so we're going to move four spots to the left on a number line or if we're subtracting integers we can always add the opposite so let's add the opposite which would be adding negative four so we end up with negative 91 plus negative 4 which is the same as negative 91 minus a positive 4. both are going to give us negative 95 and that is our final answer so there you have it there's how you solve order of operations problems with integers i hope that helped thanks so much for watching until next time peace |
14118 | https://math.stackexchange.com/questions/75722/proof-if-n-pq-then-p-1-mid-q-1-and-q-1-mid-p-1 | number theory - Proof: if $n=pq$ then $p-1\mid q-1$ and $q-1\mid p-1$ - Mathematics Stack Exchange
Join Mathematics
By clicking “Sign up”, you agree to our terms of service and acknowledge you have read our privacy policy.
Sign up with Google
OR
Email
Password
Sign up
Already have an account? Log in
Skip to main content
Stack Exchange Network
Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Visit Stack Exchange
Loading…
Tour Start here for a quick overview of the site
Help Center Detailed answers to any questions you might have
Meta Discuss the workings and policies of this site
About Us Learn more about Stack Overflow the company, and our products
current community
Mathematics helpchat
Mathematics Meta
your communities
Sign up or log in to customize your list.
more stack exchange communities
company blog
Log in
Sign up
Home
Questions
Unanswered
AI Assist Labs
Tags
Chat
Users
Teams
Ask questions, find answers and collaborate at work with Stack Overflow for Teams.
Try Teams for freeExplore Teams
3. Teams
4. Ask questions, find answers and collaborate at work with Stack Overflow for Teams. Explore Teams
Teams
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
Learn more about Teams
Hang on, you can't upvote just yet.
You'll need to complete a few actions and gain 15 reputation points before being able to upvote. Upvoting indicates when questions and answers are useful. What's reputation and how do I get it?
Instead, you can save this post to reference later.
Save this post for later Not now
Thanks for your vote!
You now have 5 free votes weekly.
Free votes
count toward the total vote score
does not give reputation to the author
Continue to help good content that is interesting, well-researched, and useful, rise to the top! To gain full voting privileges, earn reputation.
Got it!Go to help center to learn more
Proof: if n=p q n=p q then p−1∣q−1 p−1∣q−1 and q−1∣p−1 q−1∣p−1
Ask Question
Asked 13 years, 11 months ago
Modified11 years, 4 months ago
Viewed 2k times
This question shows research effort; it is useful and clear
2
Save this question.
Show activity on this post.
Now I'm asking my first question to understand a specific proof:
Let n=p q n=p q and q,p∈P q,p∈P. Then we get p−1∣n−1 p−1∣n−1 and q−1∣n−1 q−1∣n−1, because there are prime integers mod p p and mod q q. Further we get n−1=p q−1=p(q−1)+p−1 n−1=p q−1=p(q−1)+p−1. To this step everything is clear. Now the author says: from p(q−1)+p−1 p(q−1)+p−1 it follows q−1∣p−1 q−1∣p−1 and p−1∣q−1 p−1∣q−1. I don't have a clue how he gets there. Any help is appreciated. Thanks :-)
number-theory
prime-numbers
Share
Share a link to this question
Copy linkCC BY-SA 3.0
Cite
Follow
Follow this question to receive notifications
edited Oct 25, 2011 at 18:20
Did
285k 27 27 gold badges 334 334 silver badges 613 613 bronze badges
asked Oct 25, 2011 at 12:22
ulead86ulead86
3,461 29 29 silver badges 45 45 bronze badges
2
1 You get the right spacing if you use \mid instead of |. Also "mod" is usually not italicized.joriki –joriki 2011-10-25 12:31:15 +00:00 Commented Oct 25, 2011 at 12:31
I also would like to know who the author is. Carmichael numbers are cool. I would also suggest making the title of the problem more tidy so it fits on the main page.JavaMan –JavaMan 2011-10-25 12:48:52 +00:00 Commented Oct 25, 2011 at 12:48
Add a comment|
3 Answers 3
Sorted by: Reset to default
This answer is useful
5
Save this answer.
Show activity on this post.
This is to show that if n=p q n=p q and if p−1 p−1 divides n−1 n−1, then p−1 p−1 divides q−1 q−1.
To wit, p−1 p−1 divides n−1 n−1 hence p−1 p−1 divides (n−1)−(p−1)=p(q−1)(n−1)−(p−1)=p(q−1) as well. But p−1 p−1 and p p are relatively prime hence p−1 p−1 divides q−1 q−1.
Share
Share a link to this answer
Copy linkCC BY-SA 3.0
Cite
Follow
Follow this answer to receive notifications
answered Oct 25, 2011 at 13:17
DidDid
285k 27 27 gold badges 334 334 silver badges 613 613 bronze badges
Add a comment|
This answer is useful
2
Save this answer.
Show activity on this post.
You have a mistake somewhere. Take p=5,q=3 p=5,q=3 then n=p q=15 n=p q=15 but n−1=14 n−1=14 is not divisible by p−1=4 p−1=4.
Who is the author?
Share
Share a link to this answer
Copy linkCC BY-SA 3.0
Cite
Follow
Follow this answer to receive notifications
answered Oct 25, 2011 at 12:28
Gadi AGadi A
19.9k 9 9 gold badges 85 85 silver badges 124 124 bronze badges
4
It's not the complete proof, it's one step in the proof of the Korselt-Theorem including Carmichael-Numbers. If n is a CMN <=> for all p∈P p∈P with p∣n p∣n we get (p−1)∣(n−1)(p−1)∣(n−1)ulead86 –ulead86 2011-10-25 12:44:38 +00:00 Commented Oct 25, 2011 at 12:44
1 Note that stating this in your question itself will help you get helpful answers.Gadi A –Gadi A 2011-10-25 13:01:43 +00:00 Commented Oct 25, 2011 at 13:01
I know, sorry for the inconvenience, I'll be more specific nexttime, I promise ulead86 –ulead86 2011-10-25 13:54:33 +00:00 Commented Oct 25, 2011 at 13:54
2 Daniel, you can go back and edit your question to include relevant information The Chaz 2.0 –The Chaz 2.0 2011-10-25 18:43:36 +00:00 Commented Oct 25, 2011 at 18:43
Add a comment|
This answer is useful
0
Save this answer.
Show activity on this post.
p−1∣p qn−1⟺p−1∣q−1,p−1∣p q⏞n−1⟺p−1∣q−1, by mod p−1:p≡1⇒p q−1≡q−1 p−1:p≡1⇒p q−1≡q−1QED
Share
Share a link to this answer
Copy linkCC BY-SA 3.0
Cite
Follow
Follow this answer to receive notifications
edited Jun 1, 2014 at 16:54
answered Jun 1, 2014 at 16:45
Bill DubuqueBill Dubuque
284k 42 42 gold badges 339 339 silver badges 1k 1k bronze badges
Add a comment|
You must log in to answer this question.
Start asking to get answers
Find the answer to your question by asking.
Ask question
Explore related questions
number-theory
prime-numbers
See similar questions with these tags.
Featured on Meta
Introducing a new proactive anti-spam measure
Spevacus has joined us as a Community Manager
stackoverflow.ai - rebuilt for attribution
Community Asks Sprint Announcement - September 2025
Report this ad
Related
2If n n is an odd pseudoprime , then 2 n−1 2 n−1 is also odd pseudoprime
1Let n=p g n=p g, then we get p−1∣n−1 p−1∣n−1 because there are multiplicative groups of integers modulo n
4About continued fractions as best rational approximations
6Why if n∣m n∣m, then (a n−1)∣(a m−1)(a n−1)∣(a m−1)?
2Fermat's little theorem proof by Euler
1A question on an inequality appearing in the proof of Mills' theorem
3If q∣2 p+3 p q∣2 p+3 p then q>p q>p
2Understanding the proof of infinitely many primes ≡3(mod 4)≡3(mod 4)
0Lagrange's Lemma in number theory
Hot Network Questions
How can the problem of a warlock with two spell slots be solved?
Transforming wavefunction from energy basis to annihilation operator basis for quantum harmonic oscillator
How exactly are random assignments of cases to US Federal Judges implemented? Who ensures randomness? Are there laws regulating how it should be done?
Is encrypting the login keyring necessary if you have full disk encryption?
How do trees drop their leaves?
Riffle a list of binary functions into list of arguments to produce a result
I have a lot of PTO to take, which will make the deadline impossible
Suspicious of theorem 36.2 in Munkres “Analysis on Manifolds”
A time-travel short fiction where a graphologist falls in love with a girl for having read letters she has not yet written… to another man
Storing a session token in localstorage
How to start explorer with C: drive selected and shown in folder list?
Interpret G-code
Analog story - nuclear bombs used to neutralize global warming
Sign mismatch in overlap integral matrix elements of contracted GTFs between my code and Gaussian16 results
How to home-make rubber feet stoppers for table legs?
How to use \zcref to get black text Equation?
alignment in a table with custom separator
"Unexpected"-type comic story. Aboard a space ark/colony ship. Everyone's a vampire/werewolf
The rule of necessitation seems utterly unreasonable
ICC in Hague not prosecuting an individual brought before them in a questionable manner?
How can blood fuel space travel?
How many stars is possible to obtain in your savefile?
Matthew 24:5 Many will come in my name!
An odd question
more hot questions
Question feed
Subscribe to RSS
Question feed
To subscribe to this RSS feed, copy and paste this URL into your RSS reader.
Why are you flagging this comment?
It contains harassment, bigotry or abuse.
This comment attacks a person or group. Learn more in our Code of Conduct.
It's unfriendly or unkind.
This comment is rude or condescending. Learn more in our Code of Conduct.
Not needed.
This comment is not relevant to the post.
Enter at least 6 characters
Something else.
A problem not listed above. Try to be as specific as possible.
Enter at least 6 characters
Flag comment Cancel
You have 0 flags left today
Mathematics
Tour
Help
Chat
Contact
Feedback
Company
Stack Overflow
Teams
Advertising
Talent
About
Press
Legal
Privacy Policy
Terms of Service
Your Privacy Choices
Cookie Policy
Stack Exchange Network
Technology
Culture & recreation
Life & arts
Science
Professional
Business
API
Data
Blog
Facebook
Twitter
LinkedIn
Instagram
Site design / logo © 2025 Stack Exchange Inc; user contributions licensed under CC BY-SA. rev 2025.9.26.34547
By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.
Accept all cookies Necessary cookies only
Customize settings
Cookie Consent Preference Center
When you visit any of our websites, it may store or retrieve information on your browser, mostly in the form of cookies. This information might be about you, your preferences, or your device and is mostly used to make the site work as you expect it to. The information does not usually directly identify you, but it can give you a more personalized experience. Because we respect your right to privacy, you can choose not to allow some types of cookies. Click on the different category headings to find out more and manage your preferences. Please note, blocking some types of cookies may impact your experience of the site and the services we are able to offer.
Cookie Policy
Accept all cookies
Manage Consent Preferences
Strictly Necessary Cookies
Always Active
These cookies are necessary for the website to function and cannot be switched off in our systems. They are usually only set in response to actions made by you which amount to a request for services, such as setting your privacy preferences, logging in or filling in forms. You can set your browser to block or alert you about these cookies, but some parts of the site will not then work. These cookies do not store any personally identifiable information.
Cookies Details
Performance Cookies
[x] Performance Cookies
These cookies allow us to count visits and traffic sources so we can measure and improve the performance of our site. They help us to know which pages are the most and least popular and see how visitors move around the site. All information these cookies collect is aggregated and therefore anonymous. If you do not allow these cookies we will not know when you have visited our site, and will not be able to monitor its performance.
Cookies Details
Functional Cookies
[x] Functional Cookies
These cookies enable the website to provide enhanced functionality and personalisation. They may be set by us or by third party providers whose services we have added to our pages. If you do not allow these cookies then some or all of these services may not function properly.
Cookies Details
Targeting Cookies
[x] Targeting Cookies
These cookies are used to make advertising messages more relevant to you and may be set through our site by us or by our advertising partners. They may be used to build a profile of your interests and show you relevant advertising on our site or on other sites. They do not store directly personal information, but are based on uniquely identifying your browser and internet device.
Cookies Details
Cookie List
Clear
[x] checkbox label label
Apply Cancel
Consent Leg.Interest
[x] checkbox label label
[x] checkbox label label
[x] checkbox label label
Necessary cookies only Confirm my choices |
14119 | https://ocw.mit.edu/courses/6-042j-mathematics-for-computer-science-spring-2015/mit6_042js15_session1.pdf | 1 “mcs” — 2015/5/18 — 1:43 — page 5 — #13 What is a Proof? 1.1 Propositions Definition. A proposition is a statement (communication) that is either true or false. For example, both of the following statements are propositions. The first is true, and the second is false. Proposition 1.1.1. 2 + 3 = 5. Proposition 1.1.2. 1 + 1 = 3. Being true or false doesn’t sound like much of a limitation, but it does exclude statements such as “Wherefore art thou Romeo?” and “Give me an A!” It also ex cludes statements whose truth varies with circumstance such as, “It’s five o’clock,” or “the stock market will rise tomorrow.” Unfortunately it is not always easy to decide if a proposition is true or false: Proposition 1.1.3. For every nonnegative integer, n, the value of n2 C n C 41 is prime. (A prime is an integer greater than 1 that is not divisible by any other integer greater than 1. For example, 2, 3, 5, 7, 11, are the first five primes.) Let’s try some numerical experimentation to check this proposition. Let p.n/ WWD n 2 C n C 41:1 (1.1) We begin with p.0/ D 41, which is prime; then p.1/ D 43; p.2/ D 47; p.3/ D 53; : : : ; p.20/ D 461 are each prime. Hmmm, starts to look like a plausible claim. In fact we can keep checking through n D 39 and confirm that p.39/ D 1601 is prime. But p.40/ D 402 C 40 C 41 D 41 ! 41, which is not prime. So it’s not true that the expression is prime for all nonnegative integers. In fact, it’s not hard to show that no polynomial with integer coefficients can map all nonnegative numbers into 1The symbol WWD means “equal by definition.” It’s always ok simply to write “=” instead of WWD, but reminding the reader that an equality holds by definition can be helpful. 6 “mcs” — 2015/5/18 — 1:43 — page 6 — #14 Chapter 1 What is a Proof? prime numbers, unless it’s a constant (see Problem 1.17). But the real point of this example is to show that in general, you can’t check a claim about an infinite set by checking a finite set of its elements, no matter how large the finite set. By the way, propositions like this about all numbers or all items of some kind are so common that there is a special notation for them. With this notation, Propo sition 1.1.3 would be 8n 2 N: p.n/ is prime: (1.2) Here the symbol 8 is read “for all.” The symbol N stands for the set of nonnegative integers: 0, 1, 2, 3, . . . (ask your instructor for the complete list). The symbol “2” is read as “is a member of,” or “belongs to,” or simply as “is in.” The period after the N is just a separator between phrases. Here are two even more extreme examples: Proposition 1.1.4. [Euler’s Conjecture] The equation a 4 C b4 C c 4 D d 4 has no solution when a; b; c; d are positive integers. Euler (pronounced “oiler”) conjectured this in 1769. But the proposition was proved false 218 years later by Noam Elkies at a liberal arts school up Mass Ave. The solution he found was a D 95800; b D 217519; c D 414560; d D 422481. In logical notation, Euler’s Conjecture could be written, 8a 2 ZC 8b 2 ZC 8c 2 ZC 8d 2 ZC: a4 C b4 C c 4 ¤ d 4: Here, ZC is a symbol for the positive integers. Strings of 8’s like this are usually abbreviated for easier reading: 8a; b; c; d 2 ZC: a4 C b4 C c 4 ¤ d 4: Proposition 1.1.5. 313.x3 C y3/ D z3 has no solution when x; y; z 2 ZC . This proposition is also false, but the smallest counterexample has more than 1000 digits! It’s worth mentioning a couple of further famous propositions whose proofs were sought for centuries before finally being discovered: Proposition 1.1.6 (Four Color Theorem). Every map can be colored with 4 colors so that adjacent2 regions have different colors. 2Two regions are adjacent only when they share a boundary segment of positive length. They are not considered to be adjacent if their boundaries meet only at a few points. 7 “mcs” — 2015/5/18 — 1:43 — page 7 — #15 1.1. Propositions Several incorrect proofs of this theorem have been published, including one that stood for 10 years in the late 19th century before its mistake was found. A laborious proof was finally found in 1976 by mathematicians Appel and Haken, who used a complex computer program to categorize the four-colorable maps. The program left a few thousand maps uncategorized, which were checked by hand by Haken and his assistants—among them his 15-year-old daughter. There was reason to doubt whether this was a legitimate proof: the proof was too big to be checked without a computer. No one could guarantee that the com puter calculated correctly, nor was anyone enthusiastic about exerting the effort to recheck the four-colorings of thousands of maps that were done by hand. Two decades later a mostly intelligible proof of the Four Color Theorem was found, though a computer is still needed to check four-colorability of several hundred spe cial maps.3 Proposition 1.1.7 (Fermat’s Last Theorem). There are no positive integers x, y, and z such that n x n C y n D z for some integer n > 2. In a book he was reading around 1630, Fermat claimed to have a proof for this proposition, but not enough space in the margin to write it down. Over the years, the Theorem was proved to hold for all n up to 4,000,000, but we’ve seen that this shouldn’t necessarily inspire confidence that it holds for all n. There is, after all, a clear resemblance between Fermat’s Last Theorem and Euler’s false Conjecture. Finally, in 1994, British mathematician Andrew Wiles gave a proof, after seven years of working in secrecy and isolation in his attic. His proof did not fit in any margin.4 Finally, let’s mention another simply stated proposition whose truth remains un known. Proposition 1.1.8 (Goldbach’s Conjecture). Every even integer greater than 2 is the sum of two primes. Goldbach’s Conjecture dates back to 1742. It is known to hold for all numbers up to 1018, but to this day, no one knows whether it’s true or false. 3The story of the proof of the Four Color Theorem is told in a well-reviewed popular (non technical) book: “Four Colors Suffice. How the Map Problem was Solved.” Robin Wilson. Princeton Univ. Press, 2003, 276pp. ISBN 0-691-11533-8. 4In fact, Wiles’ original proof was wrong, but he and several collaborators used his ideas to arrive at a correct proof a year later. This story is the subject of the popular book, Fermat’s Enigma by Simon Singh, Walker & Company, November, 1997. 8 “mcs” — 2015/5/18 — 1:43 — page 8 — #16 Chapter 1 What is a Proof? For a computer scientist, some of the most important things to prove are the correctness of programs and systems—whether a program or system does what it’s supposed to. Programs are notoriously buggy, and there’s a growing community of researchers and practitioners trying to find ways to prove program correctness. These efforts have been successful enough in the case of CPU chips that they are now routinely used by leading chip manufacturers to prove chip correctness and avoid mistakes like the notorious Intel division bug in the 1990’s. Developing mathematical methods to verify programs and systems remains an active research area. We’ll illustrate some of these methods in Chapter 5. 1.2 Predicates A predicate can be understood as a proposition whose truth depends on the value of one or more variables. So “n is a perfect square” describes a predicate, since you can’t say if it’s true or false until you know what the value of the variable n happens to be. Once you know, for example, that n equals 4, the predicate becomes the true proposition “4 is a perfect square”. Remember, nothing says that the proposition has to be true: if the value of n were 5, you would get the false proposition “5 is a perfect square.” Like other propositions, predicates are often named with a letter. Furthermore, a function-like notation is used to denote a predicate supplied with specific variable values. For example, we might use the name “P ” for predicate above: P.n/ WWD “n is a perfect square”; and repeat the remarks above by asserting that P.4/ is true, and P.5/ is false. This notation for predicates is confusingly similar to ordinary function notation. If P is a predicate, then P.n/ is either true or false, depending on the value of n. On the other hand, if p is an ordinary function, like n2 C1, then p.n/ is a numerical quantity. Don’t confuse these two! 1.3 The Axiomatic Method The standard procedure for establishing truth in mathematics was invented by Eu clid, a mathematician working in Alexandria, Egypt around 300 BC. His idea was to begin with five assumptions about geometry, which seemed undeniable based on direct experience. (For example, “There is a straight line segment between every 9 “mcs” — 2015/5/18 — 1:43 — page 9 — #17 1.4. Our Axioms pair of points”.) Propositions like these that are simply accepted as true are called axioms. Starting from these axioms, Euclid established the truth of many additional propo sitions by providing “proofs.” A proof is a sequence of logical deductions from axioms and previously proved statements that concludes with the proposition in question. You probably wrote many proofs in high school geometry class, and you’ll see a lot more in this text. There are several common terms for a proposition that has been proved. The different terms hint at the role of the proposition within a larger body of work. ✏ Important true propositions are called theorems. ✏ A lemma is a preliminary proposition useful for proving later propositions. ✏ A corollary is a proposition that follows in just a few logical steps from a theorem. These definitions are not precise. In fact, sometimes a good lemma turns out to be far more important than the theorem it was originally used to prove. Euclid’s axiom-and-proof approach, now called the axiomatic method, remains the foundation for mathematics today. In fact, just a handful of axioms, called the Zermelo-Fraenkel with Choice axioms (ZFC), together with a few logical deduction rules, appear to be sufficient to derive essentially all of mathematics. We’ll examine these in Chapter 7. 1.4 Our Axioms The ZFC axioms are important in studying and justifying the foundations of math ematics, but for practical purposes, they are much too primitive. Proving theorems in ZFC is a little like writing programs in byte code instead of a full-fledged pro gramming language—by one reckoning, a formal proof in ZFC that 2 C 2 D 4 requires more than 20,000 steps! So instead of starting with ZFC, we’re going to take a huge set of axioms as our foundation: we’ll accept all familiar facts from high school math. This will give us a quick launch, but you may find this imprecise specification of the axioms troubling at times. For example, in the midst of a proof, you may start to wonder, “Must I prove this little fact or can I take it as an axiom?” There really is no absolute answer, since what’s reasonable to assume and what requires proof depends on the circumstances and the audience. A good general guideline is simply to be up front about what you’re assuming. 10 “mcs” — 2015/5/18 — 1:43 — page 10 — #18 Chapter 1 What is a Proof? 1.4.1 Logical Deductions Logical deductions, or inference rules, are used to prove new propositions using previously proved ones. A fundamental inference rule is modus ponens. This rule says that a proof of P together with a proof that P IMPLIES Q is a proof of Q. Inference rules are sometimes written in a funny notation. For example, modus ponens is written: Rule. P; P IMPLIES Q Q When the statements above the line, called the antecedents, are proved, then we can consider the statement below the line, called the conclusion or consequent, to also be proved. A key requirement of an inference rule is that it must be sound: an assignment of truth values to the letters, P , Q, . . . , that makes all the antecedents true must also make the consequent true. So if we start off with true axioms and apply sound inference rules, everything we prove will also be true. There are many other natural, sound inference rules, for example: Rule. P IMPLIES Q; Q IMPLIES R P IMPLIES R Rule. NOT.P / IMPLIES NOT.Q/ Q IMPLIES P On the other hand, Non-Rule. NOT.P / IMPLIES NOT.Q/ P IMPLIES Q is not sound: if P is assigned T and Q is assigned F, then the antecedent is true and the consequent is not. As with axioms, we will not be too formal about the set of legal inference rules. Each step in a proof should be clear and “logical”; in particular, you should state what previously proved facts are used to derive each new conclusion. 11 “mcs” — 2015/5/18 — 1:43 — page 11 — #19 1.5. Proving an Implication 1.4.2 Patterns of Proof In principle, a proof can be any sequence of logical deductions from axioms and previously proved statements that concludes with the proposition in question. This freedom in constructing a proof can seem overwhelming at first. How do you even start a proof? Here’s the good news: many proofs follow one of a handful of standard tem plates. Each proof has it own details, of course, but these templates at least provide you with an outline to fill in. We’ll go through several of these standard patterns, pointing out the basic idea and common pitfalls and giving some examples. Many of these templates fit together; one may give you a top-level outline while others help you at the next level of detail. And we’ll show you other, more sophisticated proof techniques later on. The recipes below are very specific at times, telling you exactly which words to write down on your piece of paper. You’re certainly free to say things your own way instead; we’re just giving you something you could say so that you’re never at a complete loss. 1.5 Proving an Implication Propositions of the form “If P , then Q” are called implications. This implication is often rephrased as “P IMPLIES Q.” Here are some examples: ✏ (Quadratic Formula) If ax2 C bx C c D 0 and a ¤ 0, then p x D ⇣ -b ˙ b2 - 4ac ⌘ =2a: ✏ (Goldbach’s Conjecture 1.1.8 rephrased) If n is an even integer greater than 2, then n is a sum of two primes. ✏ If 0 x 2, then -x3 C 4x C 1 > 0. There are a couple of standard methods for proving an implication. 1.5.1 Method #1 In order to prove that P IMPLIES Q: 1. Write, “Assume P .” 2. Show that Q logically follows. 12 “mcs” — 2015/5/18 — 1:43 — page 12 — #20 Chapter 1 What is a Proof? Example Theorem 1.5.1. If 0 x 2, then -x3 C 4x C 1 > 0. Before we write a proof of this theorem, we have to do some scratchwork to figure out why it is true. The inequality certainly holds for x 0; then the left side is equal to 1 and 1 > 0. As x grows, the 4x term (which is positive) initially seems to have greater magnitude than -x3 (which is negative). For example, when x 1, we have 4x D 4, but -x3 D -1 only. In fact, it looks like -x3 doesn’t begin to dominate until x > 2. So it seems the -x3 C4x part should be nonnegative for all x between 0 and 2, which would imply that -x3 C 4x C 1 is positive. So far, so good. But we still have to replace all those “seems like” phrases with solid, logical arguments. We can get a better handle on the critical -x3 C 4x part by factoring it, which is not too hard: -x 3 C 4x D x.2 - x/.2 C x/ Aha! For x between 0 and 2, all of the terms on the right side are nonnegative. And a product of nonnegative terms is also nonnegative. Let’s organize this blizzard of observations into a clean proof. Proof. Assume 0 x 2. Then x, 2-x, and 2Cx are all nonnegative. Therefore, the product of these terms is also nonnegative. Adding 1 to this product gives a positive number, so: x.2 - x/.2 C x/ C 1 > 0 Multiplying out on the left side proves that -x 3 C 4x C 1 > 0 as claimed. ⌅ There are a couple points here that apply to all proofs: ✏ You’ll often need to do some scratchwork while you’re trying to figure out the logical steps of a proof. Your scratchwork can be as disorganized as you like—full of dead-ends, strange diagrams, obscene words, whatever. But keep your scratchwork separate from your final proof, which should be clear and concise. ✏ Proofs typically begin with the word “Proof” and end with some sort of de limiter like ⇤ or “QED.” The only purpose for these conventions is to clarify where proofs begin and end. D D 13 “mcs” — 2015/5/18 — 1:43 — page 13 — #21 1.6. Proving an “If and Only If” 1.5.2 Method #2 - Prove the Contrapositive An implication (“P IMPLIES Q”) is logically equivalent to its contrapositive NOT.Q/ IMPLIES NOT.P / : Proving one is as good as proving the other, and proving the contrapositive is some times easier than proving the original statement. If so, then you can proceed as follows: 1. Write, “We prove the contrapositive:” and then state the contrapositive. 2. Proceed as in Method #1. Example p Theorem 1.5.2. If r is irrational, then r is also irrational. A number is rational when it equals a quotient of integers —that is, if it equals m=n for some integers m and n. If it’s not rational, then it’s called irrational. So p we must show that if r is not a ratio of integers, then r is also not a ratio of integers. That’s pretty convoluted! We can eliminate both not’s and simplify the proof by using the contrapositive instead. p Proof. We prove the contrapositive: if r is rational, then r is rational. p Assume that r is rational. Then there exist integers m and n such that: p m r n Squaring both sides gives: 2 m r 2 n Since m2 and n2 are integers, r is also rational. ⌅ 1.6 Proving an “If and Only If” Many mathematical theorems assert that two statements are logically equivalent; that is, one holds if and only if the other does. Here is an example that has been known for several thousand years: Two triangles have the same side lengths if and only if two side lengths and the angle between those sides are the same. The phrase “if and only if” comes up so often that it is often abbreviated “iff.” D D 14 “mcs” — 2015/5/18 — 1:43 — page 14 — #22 Chapter 1 What is a Proof? 1.6.1 Method #1: Prove Each Statement Implies the Other The statement “P IFF Q” is equivalent to the two statements “P IMPLIES Q” and “Q IMPLIES P .” So you can prove an “iff” by proving two implications: 1. Write, “We prove P implies Q and vice-versa.” 2. Write, “First, we show P implies Q.” Do this by one of the methods in Section 1.5. 3. Write, “Now, we show Q implies P .” Again, do this by one of the methods in Section 1.5. 1.6.2 Method #2: Construct a Chain of Iffs In order to prove that P is true iff Q is true: 1. Write, “We construct a chain of if-and-only-if implications.” 2. Prove P is equivalent to a second statement which is equivalent to a third statement and so forth until you reach Q. This method sometimes requires more ingenuity than the first, but the result can be a short, elegant proof. Example The standard deviation of a sequence of values x1; x2; : : : ; xn is defined to be: s .x1 - !/2 C .x2 - !/2 C ! ! ! C .xn - !/2 (1.3) n where ! is the average or mean of the values: x1 C x2 C ! ! ! C xn ! n Theorem 1.6.1. The standard deviation of a sequence of values x1; : : : ; xn is zero iff all the values are equal to the mean. For example, the standard deviation of test scores is zero if and only if everyone scored exactly the class average. Proof. We construct a chain of “iff” implications, starting with the statement that the standard deviation (1.3) is zero: s .x1 - !/2 C .x2 - !/2 C ! ! ! C .xn - !/2 D 0: (1.4) n WWD 15 “mcs” — 2015/5/18 — 1:43 — page 15 — #23 1.7. Proof by Cases Now since zero is the only number whose square root is zero, equation (1.4) holds iff .x1 - !/2 C .x2 - !/2 C ! ! ! C .xn - !/2 D 0: (1.5) Squares of real numbers are always nonnegative, so every term on the left hand side of equation (1.5) is nonnegative. This means that (1.5) holds iff Every term on the left hand side of (1.5) is zero. (1.6) But a term .xi - !/2 is zero iff xi D !, so (1.6) is true iff Every xi equals the mean. ⌅ MIT OpenCourseWare 6.042J / 18.062J Mathematics for Computer Science Spring 2015 For information about citing these materials or our Terms of Use, visit: |
14120 | https://www.damtp.cam.ac.uk/user/reh10/lectures/nst-mmii-chapter1.pdf | Chapter 1 Variational Methods 1.1 Stationary Values of Functions Recall Taylor’s Theorem for a function f(x) in three dimensions with a displacement δx = (δx, δy, δz): f(x + δx) = f(x) + ∂f ∂x δx + ∂f ∂y δy + ∂f ∂z δz + higher order terms so that δf = f(x + δx) −f(x) = ∂f ∂x δx + ∂f ∂y δy + ∂f ∂z δz + · · · = ∇ f . δx + · · · .
In the limit |δx| →0 we write df = ∇ f . dx.
This result is true in any number n of dimensions.
At an extremum (a maximum or minimum) f must be stationary, i.e. the first variation df must vanish for all possible directions of dx. This can only happen if ∇ f = 0 there.
Note that if we try to find the extrema of f by solving ∇ f = 0, we may also find other stationary points of f which are neither maxima nor minima, for instance saddle points.
(This is the same difficulty as in one dimension, where a stationary point may be a point of inflection rather than a maximum or minimum.) If we need to find the extrema of f in a bounded region – for instance, within a two-dimensional unit square – then not only must we solve ∇ f = 0 but we must also compare the resulting values of f with those on the boundary of the square. It is quite possible for the maximum value to occur on the boundary without that point being a stationary one.
1 © R. E. Hunt, 2002 Constrained stationary values Suppose that we wish to find the extrema of f(x) subject to a constraint of the form g(x) = c, where c is some constant. In this case, the first variation df must still vanish, but now not all possible directions for dx are allowed: only those which lie in the surface defined by g(x) = c. Hence, since df = ∇ f .dx, the vector ∇ f must lie perpendicular to the surface.
But recall that the normal to a surface of the form g(x) = c is in the direction ∇g.
Hence ∇ f must be parallel to ∇g, i.e., ∇ f = λ∇g for some scalar λ.
This gives us the method of Lagrange’s undetermined multiplier: solve the n equations ∇(f −λg) = 0 for x together with the single constraint equation g(x) = c.
The resulting values of x give the stationary points of f subject to the constraint. Note that while solving the total of n+1 equations it is usually possible to eliminate λ without ever finding its value; hence the moniker “undetermined”.
If there are two constraints g(x) = c and h(x) = k, then we need a multiplier for each constraint, and we solve ∇(f −λg −µh) = 0 together with the two constraints. The extension to higher numbers of constraints is straightforward.
1.2 Functionals Let y(x) be a function of x in some interval a < x < b, and consider the definite integral F = Z b a {y(x)}2 + y′(x)y′′(x) dx.
F is clearly independent of x; instead it depends only on the function y(x). F is a simple example of a functional, and to show the dependence on y we normally denote it F[y].
We can think of functionals as an extension of the concept of a function of many variables – e.g. g(x1, x2, . . . , xn), a function of n variables – to a function of an infinite number of variables, because F depends on every single value that y takes in the range a < x < b.
2 © R. E. Hunt, 2002 We shall be concerned in this chapter with functionals of the form F[y] = Z b a f(x, y, y′) dx where f depends only on x and the value of y and its first derivative at x. However, the theory can be extended to more general functionals (for example, with functions f(x, y, y′, y′′, y′′′, . . . ) which depend on higher derivatives, or double integrals with two independent variables x1 and x2 instead of just x).
1.3 Variational Principles Functionals are useful because many laws of physics and of physical chemistry can be recast as statements that some functional F[y] is minimised.
For example, a heavy chain suspended between two fixed points hangs in equilibrium in such a way that its total gravitational potential energy (which can be expressed as a functional) is minimised. A mechanical system of heavy elastic strings minimises the total potential energy, both elastic and gravitational. Similar principles apply when electric fields and charged particles are present (we include the electrostatic potential energy) and when chemical reactions take place (we include the chemical potential energy).
Two fundamental examples of such variational principles are due to Fermat and Hamilton.
Fermat’s Principle Consider a light ray passing through a medium of variable refractive index µ(r). The path it takes between two fixed points A and B is such as to minimise the optical path length Z B A µ(r) dl, where dl is the length of a path element.
Strictly speaking, Fermat’s principle only applies in the geometrical optics approximation; i.e., when the wavelength of the light is small compared with the physical dimensions of the optical system, so that light may be regarded as rays. This is true for a telescope, but not for Young’s slits: when the geometrical optics approximation fails to hold, diffraction occurs.
For example, consider air above a hot surface, say a tarmac road on a hot day. The air is hotter near the road and cooler above, so that µ is smaller closer to the road surface. A light ray travelling from a car to an observer minimises the optical path length by staying 3 © R. E. Hunt, 2002 close to the road, and so bends appropriately. The light seems to the observer to come from a low angle, leading to a virtual image (and hence to the “mirage” effect).
Hamilton’s Principle of Least Action Consider a mechanical system with kinetic energy T and potential energy V which is in some given configuration at time t1 and some other configuration at time t2. Define the Lagrangian of the system by L = T −V, and define the action to be S = Z t2 t1 L dt (a functional which depends on the way the system moves). Hamilton’s principle states that the actual motion of the system is such as to minimise the action.
1.4 The Calculus of Variations How do we find the function y(x) which minimises, or more generally makes stationary, our archetypal functional F[y] = Z b a f(x, y, y′) dx, with fixed values of y at the end-points (viz. fixed y(a) and y(b))?
We consider changing y to some “nearby” function y(x) + δy(x), and calculate the corresponding change δF in F (to first order in δy). Then F is stationary when δF = 0 for all possible small variations δy.
Note that a more “natural” notation would be to write dF rather than δF, since we will consider only the first-order change and ignore terms which are second order in δy. However, the notation δ is traditional in this context.
4 © R. E. Hunt, 2002 Now δF = F[y + δy] −F[y] = Z b a f(x, y + δy, y′ + (δy)′) dx − Z b a f(x, y, y′) dx = Z b a f(x, y, y′) + ∂f ∂y δy + ∂f ∂y′(δy)′ dx − Z b a f(x, y, y′) dx [using a Taylor expansion to first order] = Z b a ∂f ∂y δy + ∂f ∂y′(δy)′ dx = ∂f ∂y′ δy b a + Z b a ∂f ∂y δy −d dx ∂f ∂y′ δy dx [integrating by parts] = Z b a ∂f ∂y −d dx ∂f ∂y′ δy dx since δy = 0 at x = a, b (because y(x) is fixed there). It is clear that δF = 0 for all possible small variations δy(x) if and only if d dx ∂f ∂y′ = ∂f ∂y .
This is Euler’s equation.
Notation ∂f/∂y′ looks strange because it means “differentiate with respect to y′, keeping x and y constant”, and it seems impossible for y′ to change if y does not. But ∂/∂y and ∂/∂y′ in Euler’s equation are just formal derivatives (as though y and y′ were unconnected) and in practice it is easy to do straightforward “ordinary” partial differentiation.
Example: if f(x, y, y′) = x(y′2 −y2) then ∂f ∂y = −2xy, ∂f ∂y′ = 2xy′.
Note however that d/dx and ∂/∂x mean very different things: ∂/∂x means “keep y and y′ constant” whereas d/dx is a so-called “full derivative”, so that y and y′ are differentiated with respect to x as well.
5 © R. E. Hunt, 2002 Continuing with the above example, ∂ ∂x ∂f ∂y′ = 2y′, but d dx ∂f ∂y′ = d dx(2xy′) = 2y′ + 2xy′′.
Hence Euler’s equation for this example is 2y′ + 2xy′′ = −2xy or y′′ + 1 x y′ + y = 0 (Bessel’s equation of order 0, incidentally).
Several Dependent Variables What if, instead of just one dependent variable y(x), we have n dependent variables y1(x), y2(x), . . . , yn(x), so that our functional is F[y1, . . . , yn] = Z b a f(x, y1, . . . , yn, y′ 1, . . . , y′ n) dx ?
In this case, Euler’s equation applies to each yi(x) independently, so that d dx ∂f ∂y′ i = ∂f ∂yi for i = 1, . . . , n.
The proof is very similar to before: δF = Z b a ∂f ∂y1 δy1 + · · · + ∂f ∂yn δyn + ∂f ∂y′ 1 (δy1)′ + · · · + ∂f ∂y′ n (δyn)′ dx = Z b a n X i=1 ∂f ∂yi δyi + ∂f ∂y′ i (δyi)′ dx = n X i=1 Z b a ∂f ∂yi −d dx ∂f ∂y′ i δyi dx using the same manipulations (Taylor expansion and integration by parts). It is now clear that we can only have δF = 0 for all possible variations of all the yi(x) if Euler’s equation applies to each and every one of the yi at the same time.
6 © R. E. Hunt, 2002 1.5 A First Integral In some cases, it is possible to find a first integral (i.e., a constant of the motion) of Euler’s equation. Consider df dx = ∂f ∂x + y′∂f ∂y + y′′ ∂f ∂y′ (calculating d dxf x, y(x), y′(x) using the chain rule). Using Euler’s equation, df dx = ∂f ∂x + y′ d dx ∂f ∂y′ + y′′ ∂f ∂y′ = ∂f ∂x + d dx y′ ∂f ∂y′ [product rule] so that d dx f −y′ ∂f ∂y′ = ∂f ∂x.
Hence, if f has no explicit x-dependence, so that ∂f/∂x = 0, we immediately deduce that f −y′ ∂f ∂y′ = constant.
(Note that “f has no explicit x-dependence” means that x does not itself appear in the expression for f, even though y and y′ implicitly depend on x; so f = y′2 −y2 has no explicit x-dependence while f = x(y′2 −y2) does.) If there are n dependent variables y1(x), . . . , yn(x), then the first integral above is easily generalised to f − n X i=1 y′ i ∂f ∂y′ i = constant if f has no explicit x-dependence.
1.6 Applications of Euler’s Equation Geodesics A geodesic is the shortest path on a given surface between two specified points A and B. We will illustrate the use of Euler’s equation with a trivial example: geodesics on the Euclidean plane.
7 © R. E. Hunt, 2002 The total length of a path from (x1, y1) to (x2, y2) along the path y(x) is given by L = Z B A dl = Z B A p dx2 + dy2 = Z B A s 1 + dy dx 2 dx = Z x2 x1 p 1 + y′2 dx.
Note that we assume that y(x) is single-valued, i.e., the path does not curve back on itself.
We wish to minimise L over all possible paths y(x) with the end-points held fixed, so that y(x1) = y1 and y(x2) = y2 for all paths. This is precisely our archetypal variational problem with f(x, y, y′) = p 1 + y′2, and hence ∂f ∂y = 0, ∂f ∂y′ = y′ p 1 + y′2.
The Euler equation is therefore d dx y′ p 1 + y′2 !
= 0 = ⇒ y′ p 1 + y′2 = k, a constant.
So y′2 = k2/(1 −k2). It is clear that k ̸= ±1, so y′ is a constant, m say. Hence the solutions of Euler’s equation are the functions y = mx + c (where m and c are constants) – i.e., straight lines! To find the particular values of m and c required in this case we now substitute in the boundary conditions y(x1) = y1, y(x2) = y2.
It is important to note two similarities with the technique of minimising a function f(x) by solving ∇ f = 0.
Firstly, we have not shown that this straight line does indeed produce a minimum of L: we have shown only that L is stationary for this choice, so it might be a maximum or even some kind of “point of inflection”. It is usually easy to confirm that we have the correct solution by inspection – in this case it 8 © R. E. Hunt, 2002 is obviously a minimum. (There is no equivalent of the one-dimensional test f ′′(x) > 0 for functionals, or at least not one which is simple enough to be of any use.) Secondly, assuming that we have indeed found a minimum, we have shown only that it is a local minimum, not a global one. That is, we have shown only that “nearby” paths have greater length. Once again, however, we usually confirm that we have the correct solution by inspection. Compare this difficulty with the equivalent problem for functions, illustrated by the graph below.
An alternative method of solution for this simple geodesic problem is to note that f(x, y, y′) = p 1 + y′2 has no explicit x-dependence, so we can use the first integral: const. = f −y′ ∂f ∂y′ = p 1 + y′2 −y′ y′ p 1 + y′2 = 1 p 1 + y′2, i.e., y′ is constant (as before).
The Brachistochrone A bead slides down a frictionless wire, starting from rest at a point A. What shape must the wire have for the bead to reach some lower point B in the shortest time? (A similar device was used in some early clock mechanisms.) Using conservation of energy, 1 2mv2 = mgy, i.e., v = √2gy. Also dl = v dt, so dt = p dx2 + dy2 √2gy = 1 √2g p 1 + y′2 √y dx.
9 © R. E. Hunt, 2002 The time taken to reach B is therefore T[y] = 1 √2g Z xB 0 s 1 + y′2 y dx and we wish to minimise this, subject to y(0) = 0, y(xB) = yB.
We note that the integrand has no explicit x-dependence, so we use the first integral const. = s 1 + y′2 y −y′ ∂ ∂y′ s 1 + y′2 y = s 1 + y′2 y − y′2 p y p 1 + y′2 = 1 p y p 1 + y′2.
Hence y(1 + y′2) = c, say, a constant, so that y′ = rc −y y or r y c −y dy = dx.
Substitute y = c sin2 θ; then dx = 2c s sin2 θ 1 −sin2 θ sin θ cos θ dθ = 2c sin2 θ dθ = c(1 −cos 2θ) dθ.
Using the initial condition that when y = 0 (i.e., θ = 0), x = 0, we obtain x = c(θ −1 2 sin 2θ), y = c sin2 θ which is an inverted cycloid. The constant c is found by applying the other condition, y = yB when x = xB.
10 © R. E. Hunt, 2002 Note that strictly speaking we should have said that y′ = ± p (c −y)/y above. Taking the negative root instead of the positive one would have lead to x = −c(θ −1 2 sin 2θ), y = c sin2 θ, which is exactly the same curve but parameterised in the opposite direction. It is rarely worth spending much time worrying about such intricacies as they invariably lead to the same effective result.
Light and Sound Consider light rays travelling through a medium with refractive index inversely propor-tional to √z where z is the height. By Fermat’s principle, we must minimise Z dl √z.
This is exactly the same variational problem as for the Brachistochrone, so we conclude that light rays will follow the path of a cycloid.
More realistically, consider sound waves in air. Sound waves obey a principle similar to Fermat’s: except at very long wavelengths, they travel in such a way as to minimise the time taken to travel from A to B, Z B A dl c , where c is the (variable) speed of sound (comparable to 1/µ for light). Consider a situation where the absolute temperature T of the air is linearly related to the height z, so that T = αz + T0 for some temperature T0 at ground level.
Since the speed of sound is proportional to the square root of the absolute temperature, we have c ∝√αz + T0 = √ Z say. This leads once again to the Brachistochrone problem (for Z rather than z), and we conclude that sound waves follow paths z(x) which are parts of cycloids, scaled vertically by a factor 1/α (check this as an exercise).
1.7 Hamilton’s Principle in Mechanical Problems Hamilton’s principle can be used to solve many complicated problems in rigid-body me-chanics. Consider a mechanical system whose configuration can be described by a number of so-called generalised coordinates q1, q2, . . . , qn. Examples: • A particle with position vector r = (x1, x2, x3) moving through space. Here we can simply let q1 = x1, q2 = x2 and q3 = x3: there are three generalised coordinates.
11 © R. E. Hunt, 2002 • A pendulum swinging in a vertical plane: here there is only one generalised coordinate, q1 = θ, the angle to the vertical.
• A rigid body (say a top) spinning on its axis on a smooth plane.
This requires five generalised coordinates: two to describe the position of the point of contact on the plane, one for the angle of the axis to the vertical, one for the rotation of the axis about the vertical, and one for the rotation of the top about its own axis.
The Lagrangian L = T −V is a function of t, q1, . . . , qn and ˙ q1, . . . , ˙ qn, so S = Z L t, q1(t), . . . , qn(t), ˙ q1(t), . . . , ˙ qn(t) dt.
This is a functional with n dependent variables qi(t), so we can use Euler’s equation (with t playing the role of x, and qi(t) playing the role of yi(x)) for each of the qi independently: d dt ∂L ∂˙ qi = ∂L ∂qi for each i. In this context these equations are known as the Euler–Lagrange equations.
In the case when L has no explicit time-dependence, the first integral (from §1.5) gives us that L − n X i=1 ˙ qi ∂L ∂˙ qi = constant.
It is frequently the case that T is a homogeneous quadratic in the ˙ qi, i.e., it is of the form n X i=1 n X j=1 aij(q1, . . . , qn) ˙ qi ˙ qj where the coefficients aij do not depend on any of the “generalised velocities” ˙ qi or on t, and V also does not depend on the velocities or time so that V = V (q1, . . . , qn). Then it can be shown that L − n X i=1 ˙ qi ∂L ∂˙ qi = (T −V ) −2T = −(T + V ), i.e., the total energy E = T + V is conserved when there is no explicit time-dependence.
This fails however when the external forces vary with time or when the potential is velocity-dependent, e.g., for motion in a magnetic field.
12 © R. E. Hunt, 2002 A Particle in a Conservative Force Field Here L = 1 2m( ˙ x2 1 + ˙ x2 2 + ˙ x2 3) −V (x1, x2, x3); hence the Euler–Lagrange equations are d dt(m ˙ x1) = −∂V ∂x1 , d dt(m ˙ x2) = −∂V ∂x2 , d dt(m ˙ x3) = −∂V ∂x3 , or in vector notation d dt(m˙ r) = −∇V, i.e., F = ma where F = −∇V is the force and a = ¨ r is the acceleration.
Two Interacting Particles Consider a Lagrangian L = 1 2m1|˙ r1|2 + 1 2m2|˙ r2|2 −V (r1 −r2), where the only force is a conservative one between two particles with masses m1 and m2 at r1 and r2 respectively, and depends only on their (vector) separation.
We could use the six Cartesian coordinates of the particles as generalised coordinates; but instead define r = r1 −r2, the relative position vector, and R = m1r1 + m2r2 M , the position vector of the centre of mass, where M = m1 + m2 is the total mass. Now |˙ r1|2 = ˙ R + m2 M ˙ r 2 = ˙ R + m2 M ˙ r .
˙ R + m2 M ˙ r = | ˙ R|2 + m2 2 M 2 |˙ r|2 + 2m2 M ˙ R . ˙ r and similarly |˙ r2|2 = | ˙ R|2 + m2 1 M 2 |˙ r|2 −2m1 M ˙ R . ˙ r.
Let r = (x1, x2, x3), R = (X1, X2, X3), and use these as generalised coordinates. Then L = 1 2M| ˙ R|2 + m1m2 2M |˙ r|2 −V (r) = 1 2M( ˙ X2 1 + ˙ X2 2 + ˙ X2 3) + m1m2 2M ( ˙ x2 1 + ˙ x2 2 + ˙ x2 3) −V (x1, x2, x3).
The Euler–Lagrange equation for Xi is therefore d dt(M ˙ Xi) = 0, 13 © R. E. Hunt, 2002 i.e., ¨ R = 0 (the centre of mass moves with constant velocity); and for xi is d dt m1m2 M ˙ xi = −∂V ∂xi , i.e., µ¨ r = −∇V where µ is the reduced mass m1m2/(m1 + m2) (the relative position vector behaves like a particle of mass µ).
Note that the kinetic energy T is a homogeneous quadratic in the ˙ Xi and ˙ xi; that V does not depend on the ˙ Xi and ˙ xi; and that L has no explicit t-dependence. We can deduce immediately that the total energy E = T + V is conserved.
1.8 The Calculus of Variations with Constraint In §1.1 we studied constrained variation of functions of several variables. The exten-sion of this method to functionals (i.e., functions of an infinite number of variables) is straightforward: to find the stationary values of a functional F[y] subject to G[y] = c, we instead find the stationary values of F[y] −λG[y], i.e., find the function y which solves δ(F −λG) = 0, and then eliminate λ using G[y] = c.
1.9 The Variational Principle for Sturm–Liouville Equations We shall show in this section that the following three problems are equivalent: (i) Find the eigenvalues λ and eigenfunctions y(x) which solve the Sturm–Liouville problem −d dx p(x)y′ + q(x)y = λw(x)y in a < x < b, where neither p nor w vanish in the interval.
(ii) Find the functions y(x) for which F[y] = Z b a (py′2 + qy2) dx is stationary subject to G[y] = 1 where G[y] = Z b a wy2 dx.
The eigenvalues of the equivalent Sturm–Liouville problem in (i) are then given by the values of F[y].
14 © R. E. Hunt, 2002 (iii) Find the functions y(x) for which Λ[y] = F[y] G[y] is stationary; the eigenvalues of the equivalent Sturm–Liouville problem are then given by the values of Λ[y].
Hence Sturm–Liouville problems can be reformulated as variational problems.
Note the similarity between (iii) and the stationary property of the eigenvalues of a symmetric matrix (recall that it is possible to find the eigenvalues of a symmetric matrix A by finding the stationary values of aT Aa/aTa over all possible vectors a). The two facts are in fact closely related.
To show that (ii) is equivalent to (i), consider δ(F −λG) = δ Z b a (py′2 + qy2 −λwy2) dx.
Using Euler’s equation, F −λG is stationary when d dx(2py′) = 2qy −2λwy, i.e., −d dx(py′) + qy = λwy, which is the required Sturm–Liouville problem: note that the Lagrange multiplier of the variational problem is the same as the eigenvalue of the Sturm–Liouville problem.
Furthermore, multiplying the Sturm–Liouville equation by y and integrating, we ob-tain Z b a −y d dx(py′) + qy2 dx = λ Z b a wy2 dx = λG[y] = λ using the constraint. Hence λ = Z b a −y d dx(py′) + qy2 dx = [−ypy′]b a + Z b a (py′2 + qy2) dx [integrating by parts] = Z b a (py′2 + qy2) dx = F[y], using “appropriate” boundary conditions. This proves that the stationary values of F[y] give the eigenvalues.
15 © R. E. Hunt, 2002 There are two ways of showing that (ii) is equivalent to (iii).
The first, informal way is to note that multiplying y by some constant α say does not in fact change the value of Λ[y]. This implies that when finding the stationary values of Λ we can choose to normalise y so that G[y] = 1, in which case Λ is just equal to F[y]. So finding the stationary values of Λ is equivalent to finding the stationary values of F subject to G = 1.
The second, formal way is to calculate δΛ = F + δF G + δG −F G = F + δF G 1 −δG G −F G [using a Taylor expansion for (1 + δG/G)−1 to first order] = δF G −F δG G2 (again to first order). Hence δΛ = 0 if and only if δF = (F/G) δG; that is, Λ is stationary if and only if δF −Λ δG = 0.
But this is just the same problem as (ii); so finding the stationary values of Λ is the same as finding the stationary values of F subject to G = 1.
In the usual case that p(x), q(x) and w(x) are all positive, we have that Λ[y] ≥0.
Hence all the eigenvalues must be non-negative, and there must be a smallest eigenvalue λ0; Λ takes the value λ0 when y = y0, the corresponding eigenfunction. But what is the absolute minimum value of Λ over all functions y(x)? If it were some value µ < λ0, then µ would be a stationary (minimum) value of Λ and would therefore be an eigenvalue, contradicting the statement that λ0 is the smallest eigenvalue. Hence Λ[y] ≥λ0 for any function y(x).
As an example, consider the simple harmonic oscillator −y′′ + x2y = λy subject to y →0 as |x| →∞. This is an important example as it is a good model for many physical oscillating systems. For instance, the Schr¨ odinger equation for a diatomic molecule has approximately this form, where λ is proportional to the quantum mechanical energy level E; we would like to know the ground state energy, i.e., the eigenfunction with the lowest eigenvalue λ.
Here p(x) = 1, q(x) = x2 and w(x) = 1, so Λ[y] = R ∞ −∞(y′2 + x2y2) dx R ∞ −∞y2 dx .
16 © R. E. Hunt, 2002 We can solve this Sturm–Liouville problem exactly: the lowest eigenvalue turns out to be λ0 = 1 with corresponding eigenfunction y0 = exp(−1 2x2). But suppose instead that we didn’t know this; we can use the above facts about Λ to try to guess at the value of λ0. Let us use a trial function ytrial = exp(−1 2αx2), where α is a positive constant (in order to satisfy the boundary conditions). Then Λ[ytrial] = (α2 + 1) R ∞ −∞x2 exp(−αx2) dx R ∞ −∞exp(−αx2) dx .
We recall that R ∞ −∞exp(−αx2) dx = p π/α and R ∞ −∞x2 exp(−αx2) dx = 1 2 p π/α3 (by integration by parts). Hence Λ[ytrial] = (α2 + 1)/2α.
We know that Λ[ytrial], for any α, cannot be less than λ0.
The smallest value of (α2 + 1)/2α is 1, when α = 1; we conclude that λ0 ≤1, which gives us an upper bound on the lowest eigenvalue.
In fact this method has given us the exact eigenvalue and eigenfunction; but that is an accident caused by the fact that this is a particularly simple example!
The Rayleigh–Ritz Method The Rayleigh–Ritz method is a systematic way of estimating the eigenvalues, and in particular the lowest eigenvalue, of a Sturm–Liouville problem. The first step is to re-formulate the problem as the variational principle that Λ[y], the Rayleigh quotient, is stationary. Secondly, using whatever clues are available (for example, symmetry consid-erations or general theorems such as “the ground state wavefunction has no nodes”) we make an “educated guess” ytrial(x) at the true eigenfunction y0(x) with lowest eigenvalue λ0. It is preferable for ytrial to contain a number of adjustable parameters (e.g., α in the example above).
We can now find Λ[ytrial], which will depend on these adjustable parameters. We calculate the minimum value Λmin of Λ with respect to all the adjustable parameters; we can then state that the lowest eigenvalue λ0 ≤Λmin. If the trial function was a reasonable guess then Λmin should actually be a good approximation to λ0.
If we wish, we can improve the approximation by introducing more adjustable param-eters.
The fact that Λ[y] is stationary with respect to variations in the function y means that if ytrial is close to the true eigenfunction y0 (say within O(ε) of it) then the final calculated value Λmin will be a very good approximation to λ0 (within O(ε2) in fact). If the inclusion 17 © R. E. Hunt, 2002 of further adjustable parameters fails to significantly improve the approximation then we can be reasonably sure that the approximation is a good one.
Note that if the trial function happens to include the exact solution y0 as a special case of the adjustable parameters, then the Rayleigh–Ritz method will find both y0 and λ0 exactly. This is what happened in the example above.
An alternative to calculating Λ[ytrial] and minimising it with respect to the adjustable parameters is to calculate F[ytrial] and G[ytrial], and to minimise F subject to G = 1.
These procedures are equivalent, as we showed at the start of this section.
Higher eigenvalues [non-examinable] Once we have found a good approximation y0 trial to y0, we can proceed to find approximations to the higher eigenvalues λ1, λ2, . . . . Just as λ0 is the absolute minimum of Λ[y] over all possible functions y, so λ1 is the absolute minimum of Λ[y] over functions which are constrained to be orthogonal to y0. (Recall that y1 is orthogonal to y0 in the sense that R b a wy0y1 dx = 0.) Hence, to estimate λ1 we proceed as before but choose our new trial function y1 trial in such a way that it is orthogonal to our previous best approximation y0 trial.
This process can be continued to higher and higher eigenvalues but of course becomes less and less accurate.
18 © R. E. Hunt, 2002 |
14121 | https://www.sciencedirect.com/topics/earth-and-planetary-sciences/cold-neutron | Cold Neutron - an overview | ScienceDirect Topics
Skip to Main content
Journals & Books
Cold Neutron
In subject area:Earth and Planetary Sciences
Cold neutrons are defined as neutrons that arise from a moderator at low temperatures, characterized by a large wavelength, which allows them to be guided and focused over large distances through zig-zag or Garland reflections.
AI generated definition based on:Applied Radiation and Isotopes, 2020
How useful is this definition?
Press Enter to select rating, 1 out of 3 stars Press Enter to select rating, 2 out of 3 stars Press Enter to select rating, 3 out of 3 stars
About this page
Add to MendeleySet alert
Also in subject area:
Physics and Astronomy
Discover other topics
1. On this page
On this page
Definition
Chapters and Articles
Related Terms
Recommended Publications
Featured Authors
On this page
Definition
Chapters and Articles
Related Terms
Recommended Publications
Featured Authors
Chapters and Articles
You might find these chapters and articles relevant to this topic.
Chapter
Polymer Characterization
2012, Polymer Science: A Comprehensive ReferenceD. Richter, ... D. Schwahn
2.11.1 Introduction
Thermal and cold neutrons have de Broglie wavelengths from λ=0.1 to 2 nm corresponding to velocities of υ=4000 m s−1 down to 200 m s−1. The wavelength range covers that of X-ray and synchrotron radiation diffraction instruments. However, in contrast to electromagnetic radiation, the neutron velocity has the same order of magnitude as the atomic velocities in the sample and the kinetic energy of the neutrons – in the order of meV other than typical X-ray energy of several keV – compares with the characteristic energies of atomic or molecular motions. Therefore, even the slow relaxational motions in polymers are detectable by a velocity change of the neutron. The spatial character of the motion can be inferred from the angular distribution of the scattered neutrons.
In general, scattering of thermal neutrons yields information on the sample by measurement and analysis of the double differential cross section:1,2
d 2 σ(θ)d Ω d E=k f k i 1 N∑i,j〈b i b j〉S i,j(Q,ω)
that is, the intensity of scattered neutrons with energy E f into a given direction θ. The energy transfer, that is, the difference of kinetic energy before and after the scattering, Δ E=E f –E i relates to ℏω= Δ E. The momentum transfer ħ Q¯, respectively the wave vector Q¯, is given by Q¯= k¯i – k¯f, where k¯i and k¯f are the wave vectors of the incoming and outgoing (scattered) neutrons. They relate to the neutron wavelength k i,f = 2 π/λ i,f; the neutron momenta are p¯i,f =m n υ i,f = ħ k¯i,f. The energy transfer Δ E can be determined by measurement of the neutron velocities υ i and υ f. Note that for all problems discussed in this chapter |k¯i|≈|k¯f| and therefore Q=(4 π/λ)sin(θ/2)=2|k i|sin(θ/2) can be assumed. This regime is also called ‘quasielastic’. Finally, b i denotes the scattering length of atom nucleus i and 〈…〉 is the ensemble average.
The unique features of neutrons that render them a powerful tool for the investigation of ‘polymers’ are
1.
the isotope and spin dependence of b i,
2.
typical wavelengths of cold and thermal neutrons that match molecular and atomic distances, and
3.
even slow motions of molecules cause neutron velocity changes that are large enough to be detectable, in particular neutron spin echo (NSE) spectroscopy is able to resolve changes Δ υ of the order of 10−5 υ i.
To proceed further, we introduce the intermediate scattering function S(Q¯, t) as the Fourier transform of S(Q, ω). S(Q, t) directly depends on the (time-dependent) atomic positions:
S i j(Q¯,t)≃〈∑n,m e i Q¯⋅[R¯n i(t)−R¯m j(0)]〉
Note that, in general, the position of an atom n of type i, R¯n i(t), is a quantum mechanical operator rather than a simple, time-dependent coordinate. For polymer investigations in the (Q, ω) range discussed here, ℏω≪k B T, T≈250–500 K, and E i≪E bond, conditions for which R¯n i(t) may safely treated as classical coordinate and S(Q, ω)≈S(Q, –ω).
2.11.1.1 Coherent and Incoherent Scattering
Considering the ensemble average of eqn , we have to notice that chemically equivalent atoms may have a number of different scattering lengths b i that are randomly distributed over the ensemble of all atoms of the same kind in the sample. Most important in the present context is the variation due to the spin-dependent component of the proton scattering length. Whereas the average value 〈b i〉 leads to coherent scattering, the fluctuating part 4 π(〈b i 2〉−〈b i〉2) leads to incoherent scattering introducing an additional contribution from the atom self-correlation:
S i self(Q,t)=∑n〈e i Q¯⋅(R¯n i(t)−R¯n i(0))〉≃exp(−Q 2 6〈R¯i 2(t)〉)
where the right-hand side is a result of the Gaussian approximation that assumes Gaussian distribution functions for the atomic displacements. Note that the spin state of the scattered neutrons (spin-flip scattering) changes with a probability of 2/3.3
2.11.1.2 Coherent Scattering and Coarse Graining
Many polymer problems – including those discussed in this chapter – address the structure and dynamics in a mesoscopic regime. Here a description in terms of individual atom coordinates R¯ is not adequate and a coarse-grained description in terms of scattering length density Δ ρ(r¯, t) is used. To do so, a molecular unit of type j (e.g., a polymer segment, a monomer, or a whole smaller molecule) is selected and the sum of the scattering lengths of the contained atoms is related to the effective volume of this unit, ρ j=∑i∈j b i/V j. Then the scattering only depends on the scattering length density difference, the contrast Δ ρ(r¯,t)=ρ polymer–ρ matrix. To yield a valid description of the scattering, the extension of the chosen molecular unit L should be smaller than L<1/Q max. Then the related scattering function is
S(Q,t)=∫〈Δ ρ(r¯,t)⋅Δ ρ(r¯',0)〉e i Q¯⋅(r¯−r'¯)d 3 r¯
The corresponding small-angle neutron scattering (SANS) intensity is proportional to S(Q¯, t= 0).4
2.11.1.3 Contrast Generation and Variation
The above description implies that contrast variation and matching can be employed to enhance or suppress the contribution of a signal from selected subunits of a system. This is done by selective deuteration such that a contrast with respect to the generally hydrogen containing compounds of the sample is created. For solutions, normally deuterated solvents are used. NSE, in general, requires a deuteration of the matrix in order to optimize the intensity to background ratio. On the other hand, because of the very high incoherent cross section of hydrogen in quasielastic experiments aiming on the self-motion of the atoms, deliberate hydrogenation may be used in order to highlight certain molecules or molecular parts.
Prominent examples of successful application of contrast variation are the investigations of the single-chain structure 5 and dynamics of polymers in melts.6 Further details are obtained by investigating d-polymers that contain only a h-labeled section, that is, at the ends,7 at branching points or at its center in a fully deuterated matrix.8
Show more
View chapterExplore book
Read full chapter
URL:
Reference work 2012, Polymer Science: A Comprehensive ReferenceD. Richter, ... D. Schwahn
Chapter
X-ray and neutron scattering facilities across the globe
2023, Small Angle X-Ray and Neutron Scattering with Applications to GeomaterialsZhao Yixin, ... Sun Yingfeng
3.2.4 EQ-SANS at SNS, ORNL
EQ-SANS at SNS, Oak Ridge, is designed for wide neutron momentum transfer (Q) coverage, high neutron beam intensity, and good wavelength resolution. The EQ-SANS is located on beamline 6.
The instrument uses cold neutrons from a coupled supercritical hydrogen moderator. The EQ-SANS runs in the pinhole geometry, and Fig. 3.9 shows its main components. When the proton pulse hits the mercury target, SNS generates fast neutrons of about 1 GeV. After slowing down, thermal and cold neutrons are separated from the remaining fast neutrons by deflecting them using curved beam benders that is made of glass coated with a supermirror multilayer . The beam enters a curved multichannel beam bender, which is located in the primary beam shutter and the bulk shield insert of the target monolith.
Sign in to download full-size image
Fig. 3.9. Layout of the EQ-SANS instrument .
The collimation system is composed of three motorized multiple-slit wheels and a manually controlled sample slit defining the sample beam size. Six additional downstream guard slits are applied to weaken the instrument background by removing residual fast neutrons. The W-shaped sapphire frame overlap window is installed. The sapphire blades in the window are tilted 2 degree relative to the beam axis. This window is used to reflect neutrons with λ>33 Å, combining with the frame definition choppers to ensure a clean beam spectrum with the desirable wavelength range of neutrons. The detector located in the evacuated scattering tank has a total area of 1×1 m 2. The two planes of tubes are fixed up on an arc with a radius of 5 m centered toward the sample.
The scattering data from the same sample measured with the GP-SANS are shown for comparison. The Q-range for both instruments covers 0.005–0.35 Å−1. For strongly scattering samples, the lowest reliable Q min is ∼0.001 Å−1 at SDD=10 m and λ=20 Å. Using 2.2 Å and SDD=1.5 m, the maximum achievable Q max can be extended to around 1 Å−1.
Show more
View chapterExplore book
Read full chapter
URL:
Book 2023, Small Angle X-Ray and Neutron Scattering with Applications to GeomaterialsZhao Yixin, ... Sun Yingfeng
Chapter
Radiation Effects in Electronic Materials and Devices
2003, Encyclopedia of Physical Science and Technology (Third Edition)Andrew Holmes-Siedle, Victor A.J. van Lint
X Special Uses of Radiation
We have learned to control and use radiation in a large number of ways, most of which are to the benefit of mankind. First, humans have to be protected from radiation. Second, devices, especially microelectronics and optics, have to be protected. Third, controlled amounts of radiation are a part of life-saving diagnosis and therapy. Fourth, scientists have thought up a large number of other useful techniques which derive from the special powers of high-energy radiation, some of which we will now mention briefly.
X.A Radiography—The Familiar One
The most common use of radiation is in radiography, for diagnosing disease. The familiar radiographic X-ray uses photons of energy near 50 keV. This range gives the correct contrast for picturing bones and internal organs or the contents of airline baggage. Chest radiography contributes more than any other man-made source to the overall exposure of the population to radiation. However, the perceived benefits outweigh the perceived risks so that this technique inspires much less anxiety than most other forms of radiation, such as the minute emissions from power stations.
X.B Specialized Radiography
The technologies of electron beams, computer control and fast imaging have made advances leading to some unique forms of radiography, described below.
i
Computed tomography. A more detailed picture of internal organs is given by a special form of radiography in which X-ray tubes are rotated around the body and a computer reconstructs the images as “slices” through the body.
ii
High-speed photography. Electron beams can be switched on and off very rapidly. “Flash X-ray machines” use this method to illuminate high-speed processes such as rotating engines, explosions, and bullets striking a target.
iii
Aircraft safety. X-ray machines are used to study clearances and detect cracks in the spars and engines of aircraft. Linear accelerators and cobalt-60 gamma-rays are used to penetrate thick girders, where lower-energy X-rays cannot penetrate. Beams of cold neutrons have also given unique views of the motion of fuel and oil within aeroengines.
X.C Life Savers
i
Radiotherapy. The careful local irradiation of a cancerous growth can reduce the tumor and greatly prolong the life of the subject. Radiotherapy treatment planning is a highly skilled procedure in which the radiation physicist calculates and then measures with precision during treatment the local radiation dose to a tumor while minimizing the doses that reach healthy tissue. As part of the planning, computers are used to calculate and plot the anticipated radiation doses around an organ for a chosen radiation source. The sources may be implanted radioisotopes or external high-energy beams. The art of medical dosimetry is to control the energy deposited so accurately that neither under- nor overdoses occur. Some tissues other than tumors that undergo dangerous overgrowth are now also being treated with radiation.
ii
High-energy beams in therapy. Particle accelerators which operate in the range of billions of electron volts have been used successfully for a dual purpose—discovering new facts about fundamental physics (HEP) and treating deep-seated cancers in the brain and body.
iii
Personnel protection. Both man-made radiation and the natural environment are monitored to keep the radiation exposure of humans to the minimum. Certain veins of minerals on the Earth's surface (Brazil and India have outstanding examples) can give dangerous radiation levels. Workers who use radiation must also be protected. Radiation Safety officers use instruments initially developed for nuclear physics but now specially adapted to Personnel protection at work. Miniaturized “pocket dosimeters” will “bleep” to warn of radiation hazards, while miniaturized “dosimeter badges” keep a monthly count of a person's total exposure. Polycarbonate plastic foils which record the tracks of heavy particles are used in the control of dose from Radon, a hazard from the ground in volcanic areas. A new occupational hazard, of long-term exposure to cosmic rays on high-flying airliners, is now being monitored by semiconductor detectors originally designed for spacecraft.
iv
Detection of explosives. Neutron beams can detect the high content of nitrogen in an explosive by using detectors which recognize the characteristic backscatter of radiation from an object, even within luggage or a large vehicle. The returns given by this method are more precise than those given by X-ray detection systems.
X.D Radiotracers
Radioisotopes can be detected in minute amounts by gamma-photon counting instruments. In this way, small amounts of isotopes can be tracked through the body's chemical processes and provide a “tracer” of the body's functions. Similar methods are used to track and understand industrial chemical or physical processes.
X.E Sterilization
A beam of electrons or gamma-rays will kill bacteria and parasites in food, surgical instruments, or sewage by the ionization effect without leaving any radioactivity. At the doses required, no serious degradation occurs in fruit, grain and many products irradiated, although great caution is being exercised before the public is allowed to eat irradiated foods. Industrial radiation treatment machines will, in future, constitute one of the largest uses of electrons and gamma-rays in human service. Radiation physics is used in the design of the processing plant and—as for therapy but on a higher scale—the precise delivery of doses.
X.F Curing of Polymers
In industrial processes, polymers are treated with radiation after molding or extrusion to solidify or merely to toughen (cross-link) the existing polymer. Radiation is also useful for “curing” thin layers of polymers such as ink, paint, coatings on wires or dipped articles. The benefit of radiation curing is that it often reduces the pollution caused by older processes as solvents are evaporated off during drying.
X.G Level Measurement
The fact that gamma-rays can penetrate thick tubes means that a beam of gamma photons from an isotope, passed across a container can be measured by a counter. The level of a liquid in the container can be measured by a sudden drop in count rate as the surface level passes through the gamma beam. A similar effect can be obtained by the back-scatter of particles.
X.H Ion Implantation
Ion beams, generated in accelerators are implanted in solids to modify their properties. High-current ion implanters are available for industrial use. The predominant use of ion beams is in the formation of miniature p-n junctions using kilovolt beams of phosphorus and boron. The theory of displacement effects, described earlier, is now being applied to the better control of junction formation on the submicron scale in microelectronics.
X.I Microanalysis
Radiation is used in many ways in the analysis of chemical or crystalline makeup of materials. For example, the identity of a few milligrams of a material can be determined by the diffraction of X-rays from the crystal structure, the measurement of the energy of X-rays given off when an electron-beam probe is played on the sample or the measurement of the radioactivity generated by neutrons.
X.J Light from Radition
Luminescence—the conversion of radiation to light in certain “phosphor” compounds—has been a major theme of radiation physics for a 100 years. In the early days, Roentgen and Rutherford both used phosphorescent screens to make radiation visible. The “cathode ray,” i.e., the electron is used effectively in modern color monitor screens because phosphor technology has developed greatly from those beginnings. In order to identify individual particles, “scintillation counters” monitor minute light pulses from large, clear volumes of phosphors which are specially grown or cast. The glow in certain irradiated phosphors is also smoothly released during heating. This effect—thermoluminescence—is a leading method for dosimetry and for archaeological dating. New HEP experiments will carry several tons of very dense and highly pure scintillators. These are designed to help uncover new members of the elementary particle family. Thus optics and luminescence will continue to be of importance to microelectronics as one of the skills required in radiation physics.
X.K Summary
It can be seen from the above that, while the benefit to humans conferred by radiation when used in health care is of major importance, there are many other ways in which the science of radiation physics is of major benefit. In this last section, we have thus described some of those lesser-known and specialized applications of radiation in the service of mankind.
Show more
View chapterExplore book
Read full chapter
URL:
Reference work 2003, Encyclopedia of Physical Science and Technology (Third Edition)Andrew Holmes-Siedle, Victor A.J. van Lint
Chapter
X-Ray Small-Angle Scattering
2003, Encyclopedia of Physical Science and Technology (Third Edition)O. Kratky, P. Laggner
V Inorganic Substances— Materials Science
V.A General
This field includes many of the common natural or synthetic materials, such as metals, alloys, semiconductors, glasses, colloids, and catalysts. In all cases, the aim of small-angle scattering is the characterization of structural inhomogeneities. These may be of highly practical interest in their relation to specific macroscopic properties, such as mechanical strength, electrical conductivity, magnetic coercive force, and catalytic activity. Control of these inhomogeneities on a more than merely empirical basis can lead to quality improvement. On the other hand, there is also strong theoretical interest, as such data provide reliable information to test theories of cluster or defect formation and phase-separation processes.
In contrast to the substances discussed in previous chapters, most inorganic materials are composed of rather heavy elements. For X-rays this has the disadvantage that their mass absorption, which increases strongly with the atomic number, becomes a limiting factor through the very small optimum sample thickness, that is, 1/μ. With Cu K α radiation the optimum thickness of purealuminum is 76 μm, and it is less than 10 μm for most heavier elements of interest. For Mo K α the values are about one order of magnitude larger, but still the optimal values are relatively small and consequently the samples may not be always representative for the bulk material. This disadvantage does not occur in neutron scattering, since neutron absorption does not increase in a systematic way with the atomic number and the absorption cross sections are relatively low as compared to X-rays. Therefore, neutron small-angle scattering has proven particularly fruitful in materials science, despite its limitation that only a few reactors around the world offer a suitably high flux of “cold” neutrons.
Another complication for the use of X-rays in this field is the effect of double Bragg reflection from polycrystalline materials. This occurs if a ray first reflected by one crystallite hits another one with its lattice planes almost but not quite parallel to the first one. The resulting scattering to small angles may in some cases be stronger than the “true” small-angle scattering due to inhomogeneities, and the two effects cannot be distinguished. A way to overcome this is the use of neutrons of suitably long wavelengths, with λ>2d (d is the largest lattice plane distance), so that the geometric conditions for Bragg reflection are altogether avoided.
Owing to the ample diversity of the various materials, a simple systematic treatment is impossible. Only in a minority of cases are the conditions for particle scattering met so that parameters related to size and shape of the inhomogeneities can be reliably evaluated; in most cases, both nonuniform sizes and high concentrations of inhomogeneities render such information unaccessible. In these latter cases, the scattering power or the invariant as outlined above for densely packed systems can be used to quantify the structural or compositional fluctuations. Quite generally, however, the main emphasis of such studies has been on relative changes in scattering behavior with different composition or pretreatment of the samples, rather than on a detailed structural interpretation, which for the reasons already indicated may be a difficult if not impossible task.
V.B Physical Metallurgy
The classical example for the utilization of X-ray small-angle scattering in this field has been the investigation of phase separation during age hardening of alloys, pioneered by a study of Guinier in 1938 on the systems Al–Cu and Al–Ag. Guinier observed diffuse small-angle scattering at the center of the otherwise normal discrete diffraction pattern of the metallic crystal lattice. Independently and almost at the same time, Preston published similar findings. The consistent interpretation of these results was the segregation of submicroscopic clusters of atoms of the minor component out of the supersaturated solid solution. Owing to their inventors, a certain type of such clusters is generally called Guinier–Preston zones or GP zones. Since then, numerous studies by X-rays and neutrons have been published on this theme, with the general goals being to elucidate mechanisms and kinetics on the submicroscopic structural level of such phase separations and to establish detailed phase diagrams.
As a methodologically important example, we give the analysis of this first stage of age hardening.
After rapid cooling of an Al–Ag alloy from temperatures where the alloy is homogeneous to about 100°C, an isotropic, diffuse, small-angle scattering pattern as shown in Fig. 57 is observed. It shows essentially two interesting features: the scattering intensity decreases toward zero at very small angles and a maximum occurs at Bragg values of about 50 Å.
Sign in to download full-size image
FIGURE 57. Small-angle scattering from Al(20)–Ag(80) after cooling from 520°C. [Reprinted with permission from Guinier, A., and Fournet, G. (1955). “Small Angle Scattering of X-Rays,” p. 205, Wiley, New York.]
The interpretation by Walker and Guinier attributed this scattering pattern to independent particles with an internal electron density distribution. Furthermore, it was concluded that the particles have an average spherical symmetry, since the orientation of the sample has no effect on the scattering curve. The analysis can then follow along the lines of Fourier transformation as outlined in Section II.B.3.e to obtain the radial electron density distribution or the correlation function p(r). If the latter is normalized to p(0)=1, then the function gives the probability of finding an atom of silver at a distance r away from another one (Fig. 58).
Sign in to download full-size image
FIGURE 58. The probability of finding a silver atom at a distance r from another one in the Al–Ag alloy, as evaluated by Fourier transformation of the curve in Fig. 57. [Reprinted with permission from Guinier, A., and Fournet, G. (1955). “Small Angle Scattering of X-Rays,” p. 207, Wiley, New York.]
The physical explanation for this behavior is the following. When the silver atoms cluster around a particular point in the alloy, they migrate by diffusion, but slowly, as the temperature of annealing is low. Therefore, the silver atoms clustered in a nucleus leave a shell that is poorer in silver atoms than the average. Thus the scattering particle is made up of a nucleus of a high electron density surrounded by a shell of density lower than the average throughout the sample. On average, however, the whole “particle” has the same electron density as the total sample volume, since it is only created by internal demixing. Thus the overall net contrast of the particles is zero, and consequently I(0)=0, in agreement with the observation. This particularly simple concept applies, however, only to the first stage of phase separation at low annealing temperatures, where diffusion is very slow. For longer annealing times and higher temperatures, but still below the miscibility limit in the phase diagram, the small-angle pattern often becomes very complex in that it develops directed streaks of scattering, the directions and number of which depend on the orientation of the specimen. In this case, the small-angle pattern can no longer be discussed separately from the wide-angle diffraction; that is, the scattering is strongly influenced by the crystal lattice and its defects.
It should be noted, however, that X-ray small-angle scattering has been highly useful in obtaining otherwise hard to access information on metallurgically important phenomena, such as vacancy clustering in irradiated materials, growth or dissolution of precipitates, and spinoidal decomposition.
V.C Miscellaneous
V.C.1 Catalysts
Small-angle scattering provides a noninvasive method to evaluate the specific surface area of catalysts. An analysis of the Porod slopes [see Eq. (9)] of the scattering from the supporting material with and without catalyst may lead to a reliable value for the total catalyst surface.
A typical result of a study in amorphous platinum supported on silica and aluminium, in terms of a size distribution of catalyst particles which are assumed to be spherical, is shown in Fig. 59 together with the size distribution-obtained from electron microscopy. It is evident that, at least for the smaller sizes, the distributions are similar with both methods. Even if these distribution functions are not completely correct in every detail, they yield useful information, especially for comparing different metal concentrations, temperatures, and so on. As an economically interesting result, it was found that for platinum and silica, the incorporation of platinum at more than 1% by weight would be uneconomical, as beyond this concentration excess metal is primarily taken up in larger particles with a lower catalytic surface.
Sign in to download full-size image
FIGURE 59. The distribution of metal particle diameters in an alumina-supported platinum catalyst containing 0.6 wt.% Pt. The continuous curve is from X-ray small-angle scattering, and the dashed curve is from electron microscopy. [Reprinted with permission from Renouprez, A., Hoang-Van, C., and Compagnon, P. A. (1974). J. Catalysts34, 411.]
V.C.2 Glasses and Ceramics
Although visible-light scattering has been most frequently used to study phase-separation processes in multicomponent glasses, X-ray small-angle scattering also proves useful since it resolves compositional fluctuations at a much smaller scale of dimensions and can yield data on the nature of the decomposition process. For instance, the mixture B 2 O 3(80)–PbO(15)–Al 2 O 3(5) after rapid cooling from the liquid state to room temperature shows small-angle scattering curves (Fig. 60) that are very similar to those observed with the Al–Ag alloy (compare Fig. 57), especially at lower quenching rates. These data form an important basis for a discussion of the decomposition process in terms of the spinoidal decomposition model.
Sign in to download full-size image
FIGURE 60. Small-angle scattering curves for a set of B 2 O 3–PbO–Al 2 O 3 samples splat cooled with variable cooling rate ranging from about 2×10 3 (curve 4) to 2×10 4 K/sec (curve 1). [Reprinted with permission from Acuña, R. J., and Craievich, A. F. (1979). J. Noncryst. Solids34, 13.]
V.C.3 Critical Scattering in Liquids
At the critical point of a system, the density fluctuations approach infinity and hence also the small-angle scattering goes through a maximum. An example is shown in Fig. 61, where the scattering from the liquid mixture of Li–NH 3 at 210 K is depicted for different concentrations. Such experiments can be very useful in supplementing thermodynamic data but may be complicated in solids due to competing metastable and stable phase formation.
Sign in to download full-size image
FIGURE 61. Small-angle scattering curves obtained with Mo K α radiation of Li–NH 3 solutions of 210 K. Lithium concentrations are given in moles per mole NH 3. [Reprinted with permission from Knapp, D. N., and Bale, D. H., J. Appl. Crystallogr.11, 606.]
Show more
View chapterExplore book
Read full chapter
URL:
Reference work 2003, Encyclopedia of Physical Science and Technology (Third Edition)O. Kratky, P. Laggner
Review article
Clay swelling — A challenge in the oilfield
2010, Earth-Science ReviewsR.L. Anderson, ... P.V. Coveney
Small angle neutron scattering (SANS) is a useful and versatile technique for the study of inhomogeneities of both crystalline and amorphous structures on the sub-micron scale (Hammouda, 2008). The technique has a number of useful advantages over the broadly similar X-ray equivalent, small angle X-ray scattering (SAXS). Firstly, owing to the longer wavelength of cold neutrons, SANS is capable of measuring samples with a much greater degree of swelling, up to interlayer d-spacings of 2000 Å (Smalley, 2006). Secondly, the widely different scattering lengths of neutrons with hydrogen as compared to deuterium (Hammouda, 2008) allow manipulation of contrast by varying the deuterium to hydrogen ratio (Tchoubar and Cohaut, 2006). Exploitation of these contrast matching techniques has been used to determine the thickness of a layer of adsorbed polymer at a particle surface (Fleer et al., 1993) and has permitted differentiation between adsorbed and free polymer in a laponite-PEO system (Malwitz et al., 2004). The resolution of SANS is much better than that achieved with XRD (Smalley, 2006); the use of ultra small angle techniques (USANS) allows probing of domains as large as 20 μm (Hammouda, 2008). The rotation of a sample around its vertical axis (“rocking”) enables orientation changes of clay platelets to be observed (Smalley, 2006). The applicability of SANS to measurement of sol–gel transition of smectites, for example, is limited by the anisotropic nature of the mineral and the polydispersity of particle size. As a consequence many studies have used laponite as a model substance (Tchoubar and Cohaut, 2006). The low flux of neutron sources compared to that of X-rays demands use of relatively large samples (typically a few grams) for SANS experiments (Hammouda, 2008).
View article
Read full article
URL:
Journal2010, Earth-Science ReviewsR.L. Anderson, ... P.V. Coveney
Review article
Clay Science & Technology (XV International Clay Conference)
2014, Applied Clay ScienceMurillo L. Martins, ... Heloisa N. Bordallo
2.1 Production of neutrons
The half-life of a free neutron is about 900 s. Such a short lifetime makes necessary the production of neutrons concurrent with the experiment. Free neutrons for scientific purposes can be obtained by means of nuclear reactions in fission reactors or from spallation sources. In both cases large scale facilities are required in order to operate the sources and provide adequate instrumentation for the users.
In the case of nuclear fission reactors, free neutrons are obtained after a slow neutron is captured by an 235 U nucleus, which splits and liberates 2 or 3 additional neutrons with an energy of 1.29 MeV together with fission fragments. Each of these neutrons can hit other 235 U nuclei giving rise to 2 or 3 additional neutrons. From those, 1 neutron is used to continue the chain reactions, which can be either accelerated if the fissile materials mass is above the so-called critical mass M c leading to an uncontrollable reaction or it can stop if the fissile material mass remains below M c. Research reactors operate below M c to control the nuclear reaction, but delayed neutrons together with secondary neutrons originating from the highly excited fission fragments allow the reaction to continue practically indefinitely.
The wavelength of neutrons being in thermal equilibrium with the moderator has a Maxwellian distribution (Fig.2), and one can further describe the neutrons based on their energy as hot (T≈2300 K, E≈200 meV), thermal (T≈300 K, E≈26 meV) or cold neutrons (T≈25 K, E≈2.5 meV). If the moderator has a temperature of 300 K, the most probable wavelength is 1.45 Å matching interatomic spacings. Therefore, experiments like single crystal, powder diffraction and stress analysis are carried out with thermal neutrons. On the other hand, neutrons that have been further slowed in a cold source, typically an aluminum tank filled with liquid deuterium kept at a temperature of 25 K, allow shifting of the peak flux to higher wavelengths. Those neutrons have wavelengths between 3 and 6 Å and a corresponding energy of the order of phonon excitations and internal vibrational modes of molecules. Thus, experiments on dynamics (time-of-flight, backscattering and spin echo), reflectometry, tomography and small angle neutron scattering are performed using cold neutrons. Therefore, a spatial and energetic (temporal) match can be found between the wavelength and energy of neutrons and the characteristic length and time-scale of atomic motions and distances in condensed and soft matter (Squires, 1978), Fig.3.
Sign in to download full-size image
Fig.2. A reactor's performance depends on the neutron flux at each energy. The solid curve labeled thermal shows the Maxwellian distribution of neutrons from an ambient moderator, which can be shifted by using a cold≈20 K or a hot moderator≈200 K. A pulsed spallation source performance depends on the flux and pulse width. The curve shows the flux per unit fractional energy.
Sign in to download full-size image
Fig.3. Using neutrons and complementary techniques to explore different length and time scales. The horizontal axes indicate real and reciprocal length scales, while the vertical axes refer to time and energy scales. Scientific areas falling within different length and time scales are indicated along the edges. The experimentally accessible areas of the various neutron-based techniques are shown as polygons in strong colors. Those techniques that are sensitive to both time and length scales are represented above the main horizontal axis; those that measure only length-scales below. In addition to the neutron-based techniques, the analogous areas for a selection of complementary experimental techniques are shown in gray.
The neutron flux in research reactors rapidly increased in the 1960s, but it has also been hampered by environmental and political pressures due to critical problems associated with heat and the potential for radiation damage. The most powerful research reactor presently is at the Institute Laue–Langevin (ILL) — France, which became critical for the first time in 1974. The FRMII reactor, at the Heinz Maier-Leibnitz Zentrum — Germany, provides half of the thermal neutron flux in comparison to ILL, but uses only one third of the reactor power.
In the case of the spallation sources, which are inherently safe because less energy is needed and the thermal dissipation is lower, free neutrons are obtained with high energy protonpulses being accelerated onto a target made of a neutron rich material. Corresponding neutron pulses are freed by the target and after being moderated are guided to the instruments. The neutron yield from spallation is typically between 20 and 50 per event; however it depends ultimately on the target material used. Since the spallation reaction is not possible without the operation of an accelerator, production of neutrons by spallation can be inherently safer than reactors, where a chain reaction must be continuously ongoing to obtain neutrons. Regarding the neutron flux, the most powerful existing spallation source is SNS, at Oak Ridge — USA, with a power of 1.2 MW ramping up to 1.4 MW. The ISIS source at the Rutherford Appleton Laboratory — UK (160 kW) and J-Parc — Japan (expected to reach 2 MW) are other examples of highly productive facilities.
Nowadays, reactor sources still provide a higher average flux than the spallation sources. However, the time structure of the latter can provide higher monochromatic intensities and consequently unprecedented gains in flux. After the advent of the European Spallation Source (ESS) — Sweden, whose operation is expected to start in 2020, the 5 MW power will enable a similar average flux as currently available from the reactors.
Show more
View article
Read full article
URL:
Journal2014, Applied Clay ScienceMurillo L. Martins, ... Heloisa N. Bordallo
Review article
Characterization of carbon nanotubes and analytical methods for their determination in environmental and biological samples: A review
2015, Analytica Chimica ActaC. Herrero-Latorre, ... R.M. Peña-Crecente
2.1.3 Neutron and X-ray diffraction
Microscopic techniques suffer from a major drawback due to the mass scale used. Itkis et al. showed that it is not possible to obtain representative results for a bulk sample of 10 g of CNT from typical SEM or TEM images, for which the amount of material visualized was estimated to be in the order of 10−12 g. Local measurements of the sizes and diameters of CNTs can be obtained by the microscopy techniques outlined above, but if information on the larger scale is required in order to obtain a statistical picture of the sample rather than local information, diffraction techniques are usually used to provide this important information . Since both ND and XRD operate on the macroscopic level, these two techniques provide a description of the average structure of the carbon nanotube sample analyzed . ND involves the use of a beam of thermal or cold neutrons to obtain a diffraction pattern that can be related to the sample structure. This technique gives information about the characteristics of the CNTs such as bond length and, consequently, the possible distortion of hexagonal carbon surfaces. Information related to the atomic arrangement within a single layer and to the stacking nature of graphene layers in the case of MWCNTs was obtained by Burian et al. on using ND. Furthermore, the dispersion of SWCNTs in water using surfactants has been studied by means of small angle neutron scattering in order to identify the optimal surfactant concentration for dispersion . Giannasi et al. applied ND to the characterization of SWCNTs using a SANDALS-type diffractometer (a small angle diffractometer developed to investigate the structures of liquids and amorphous materials). Changes in the diffraction profile were observed due to the increase in the diameter of the SWCNTs and the division of diffraction spectra into two areas according to higher or lower Q values was also proposed. The Q-region higher than 2 Å−1 is related to individual CNTs, while the Q-region below this value is related to CNT bundles. The same authors used an extended Q-range time-of-flight diffractometer to demonstrate that the existence of anomalies in the carbon nanotube spectra can be related to the presence of spurious carbon that is not detected by other more conventional techniques .
In XRD the sample causes the diffraction of a beam of incident X-rays to different specific directions. The mean positions of the atoms in the sample and their chemical bonds can be determined by measuring the angles and intensities of the diffraction pattern obtained. Consequently, analysis of CNTs by XRD yields information about the average structure and the spatial correlations between atoms within a single layer. XRD also supplies information about the nature of inter-layer correlations and about the number, diameter, length and chirality of layers . In a recent review, García-Gutiérrez et al. illustrated the use of this valuable tool to characterize the structures of both single- and multi-walled carbon nanotubes as well as related CNT-polymer nanocomposites at different length scales (single CNTs, bundles of CNTs and aggregates of CNT bundles). Additionally, Neverov et al. developed an algorithm to be applied to combined XRD and ND diffraction data in order to identify the structure of carbonaceous nanomaterials. This demonstrated the usefulness of both XRD and ND (separately or in conjunction) for structure diagnostics.
Show more
View article
Read full article
URL:
Journal2015, Analytica Chimica ActaC. Herrero-Latorre, ... R.M. Peña-Crecente
Review article
The thermal hydraulic phenomenon in tight lattice bundles: A review
2019, Annals of Nuclear EnergyB.H. Yan
2.2.1 Experiments
The two phase flow phenomena such as the boiling transition (crises) in annular flow regime caused by the dry out of liquid film were severe safety issues for tight lattice bundles. One of the major concerns was the avoidance of high quality boiling crisis (film dry out). The two phase pressure drop and the stability of water film in high void regimes in the upper part of fuel elements were important issues. Tamai et al. (2006) measured the two phase friction loss in a 37-rod tight lattice, similar to that shown in Fig. 5. It was revealed that the two phase friction loss was a dominant component and accounted for about 60% of the pressure drop under an RMWR nominal operating condition. The TRAC-BF1 code was suggested in the prediction of pressure drop with an error of about 10%.
The visualization experiments for two phase flow in tight lattice have been started from recent years. Zboray and Prasser (2013a) studied annular flows in a tight lattice fuel bundle model using cold-neutron imaging technique. Three different bundle geometries, as shown in Fig. 10, were modeled in these investigations. The two-phase mixture of air and water is created at the bottom of the channel, and exited at the top of it into a tank, where the air is left to egress while the water is recycled by a pump. The two phase flow data was obtained with neutron imaging technique. A split effect by the vane manifesting in a thinned and increased film region was observed. The film thickness on the surface of spacer vanes was found to be very sensitive to small geometric differences. It was proved that the spacer could separate the phases and promote liquid coolant deposition on the fuel pin surfaces. Their subsequent research found that the lower (upstream) face of the vane holds a significantly thinner film as the downstream surface (Zboray and Prasser, 2013b). This was due to the direct impact of gas flow and corresponding strong shear forces on the upstream surface. A strong spatial variation of liquid film thickness was observed on both surfaces.
Sign in to download hi-res image
Fig. 10. Reconstructed cross-sections of the empty flow channels (Zboray and Prasser 2013a,b; Prasser et al., 2016).
Based on the research of Zboray and Prasser (2013a,b), Prasser et al. (2016) continued to measure the average liquid film profiles considering the effect of spacer grids with vanes and found that the connection between opposite fuel rod surfaces was interrupted in annular flow regime. The contact via the liquid phase was perfect in the liquid slugs between Taylor bubbles. It started to deteriorate when the gas flow rate reached values characteristic for the churn turbulent flow regime. Despite of this, the wave patterns were synchronized on both opposing surfaces.
Ito et al. (2016) measured the spatial-temporal distributions of liquid film thickness in annular flow in a square lattice and a tight lattice pair of adjacent sub-channels, as shown in Fig. 11. The flow duct follows the walls and symmetry boundaries of a pair of adjacent sub-channels. Both test sections were made of acrylic glass, and have the same length of 2.5 m. The square lattice channel is confined by 6 adjacent rods. Two out of these 6 rods are in contact with the fluid of the simulated pair of sub-channels over an angle of 180°. The outer 4 rods are only quarter rods covering 90° each. The pair of triangular tight-lattice sub-channels is surrounded by 4 rods with a diameter of 20 mm. Two of these four rods, forming the sub-channels gap, cover an angle of 120°, the other two of 60° each. No significant difference was observed between square and tight lattice channels. The authors proposed that the film thickness fluctuations on both opposing walls in the sub-channel gap were correlated with inlet conditions.
Sign in to download hi-res image
Fig. 11. Cross section of test section in Ito et al. (2016).
The main parameters of the test for the two phase flow and heat transfer in tight lattice were shown in Table 2. J G and J L denote the velocity for gas phase and liquid phase, respectively.
Table 2. Main parameters for the two phase flow and heat transfer experiments in tight lattice.
| References | Diameter | P/D | Fluid | Flow conditions | Lattice array | Data |
--- --- ---
| Ito et al. (2016) | 20 mm | 1.1 | Gas/water | J G = 20–70 m/s, J L = 0.2–0.5 m/s | Triangular | Liquid film |
| Prasser et al. (2016) | 20 mm | 1.1 | Air/water | J G = 60 m/s, J L = 0.2 m/s | Triangular | Liquid film |
| Tamai et al. (2006) | 13 mm | 1.08, 1.1 | Water | P = 2.0–9.0 MPa G = 200–1000 kg/m 2 s | 37-Rod triangular | Pressure drop |
| Zboray and Prasser (2013a,b) | 20 mm | 1.1 | Air/water | J G = 22–35 m/s, J L = 0.6 m/s | Triangular | Annular flow |
Show more
View article
Read full article
URL:
Journal2019, Annals of Nuclear EnergyB.H. Yan
Review article
Neutron scattering: A subsurface application review
2021, Earth-Science ReviewsMirhasan Hosseini, ... Stefan Iglauer
3.2 Texture and strain analysis
Neutron scattering is increasingly used to investigate texture and the associated stress–strain analysis of geomaterials (Walther et al., 1995; Kocks et al., 1998; Nikitin et al., 2004; Hall et al., 2012; Wensrich et al., 2012; Athanasopoulos et al., 2017; Athanasopoulos et al., 2018), as evident in Table 5. This is due in part to the low absorption and high penetration of samples associated with neutrons (Fig. 1 b). Another advantage of neutrons is that some intensity corrections are not necessary, especially for minerals with low-angle reflections where intensity corrections for X-rays are crucial (Wenk et al., 1984). Pole figures for two different rock samples, a deformed marble and a quartzite, are shown in Fig. 9. Fig. 9 a shows that neutrons have a better distribution pattern than that of X-rays for the sample. This is because instead of surfaces, large volumes are averaged by the neutron diffraction signal (Schafer, 2002; Ghildiyal et al., 1999).
Table 5. Summary of studies on texture and strain analysis using NS.
| Sample analyzed | Aim | Scattering parameters and features | Key findings | Reference |
--- ---
| Marble | Strain | Neutron diffraction measurements of the d-spacing for the sample were obtained at three points on a plane perpendicular to the sample axis, with and without a confining pressure. | Further evaluation of the lattice strains requires identification of the diffraction elastic constants such as Young’s moduli and the Poisson ratio. | Carmichael et al. (2020) |
| Eight limestone and marble samples | Texture/strain | Quantitative texture analysis was used for the evaluation of the texture of the samples by neutron diffraction. Three different beamlines with different wavelengths (2.52 Å, 0.8 to 2.4 Å, 1.4 to 2.1 Å) were used for the coverage of samples. | Textures of naturally deformed calcite at various depths in the crust were collected, and various texture patterns were recognized that may produce unique seismic velocity patterns. | Zucali et al. (2020) |
| Forty-seven quartzite and 8 marble samples | Texture | TOF was used for the measurements with λ = 0.2 to 6 Å by 30 detectors at 2θ to 40°, 90°, and 150°. | The study shows good agreement between neutron diffraction and EBSD. | Wenk et al. (2019) |
| Granular quartz sand | Stress/strain | A polychromatic (i.e. wide wavelength) neutron beam dispersing in relation to its TOF from the source was used for the experiment. | The combination of NSS and DIC techniques in a single experimental approach can provide novel insight into the coupled evolution of stress-strain distributions throughout granular media. | Athanasopoulos et al. (2019) |
| Three sandstone samples | Strain | White-pulsed diffracted neutrons were detected by two detectors at 2θ = ±90° to the incident beam. | By increasing the height of the incident neutron beam size, neutron intensity can be increased without introducing pseudostrain. Also, the peak position depends on rock type instead of gauge volume height. | Abe et al. (2018) |
| Two sandstone and carbonate samples | Strain | Diffraction patterns were measured using the TOF technique. The TOF and d-spacing ranges were 25 to 65 ms and 1.4 to 4.2 Å respectively. | A combination of AE signal measurements and neutron diffraction is a potent tool for analyzing the deformation mechanisms of rock samples. | Abe et al. (2014) |
| Three samples of eclogite, marble, and artificial rock (MIX) created by seven mineral phases | Texture | Rietveld texture analysis and TOF neutron diffraction were used for MAUD software analysis. In this regard, the peak shape, the crystal lattice parameters, the temperature coefficient, and the phase fractions are useful parameters for Rietveld refinement. | To characterize the texture of a mono-mineralic sample and a four-phase sample, 150 and 350 diffraction spectra respectively are sufficient. | Keppler et al. (2014) |
| Near spherical monodisperse copper powder | Stress/strain | Neutrons with λ =0.22 nm were used to measure variations in the 200 reflections of the sample under load. The preferred direction of the scan was 45°to the axial direction. The maximum attainable angle for the additional scan was 28° (incident beam obscured at the preferred direction). | The exponential decay in axial stress, a reduction in three normal stress components near the wall, and highly localised regions of high shear stress were interesting features in the stress distribution. | Wensrich et al. (2012) |
| Three ultramafic samples | Texture/strain | The wavelength for the used beamline was 1.46 Å. Intensity and localisation corrections and combined analysis were done during the experiment. | Various texture types were identified based on the lattice orientations of olivine. The results also suggest a mantle origin with T >800°C for the activation of slip systems in olivine. | Zucali et al. (2012) |
| Granular quartz sand | Strain | A Bragg peak at 2θ ≈ 86.8° (λ = 1.64 Å) was measured with a Q-vector (strain measurement direction) along the sample axis. | With such measurements, each grain could be thought of as acting as a local (3D) strain gauge. | Hall et al. (2011) |
Sign in to download hi-res image
Fig. 9. (a) Pole figures for a coarse-grained deformed marble using X-rays and neutron diffraction for peak 0006 (where neutrons are stronger than X-rays) at T = 400 °C and P = 100 MPa, 1: determined by X-ray diffraction in reflection geometry, 2: determined by monochromatic neutron radiation. Neutrons have a symmetrical distribution pattern. [Reproduced from Wenk et al., 1984 with permission from Elsevier.] (b) Pole figures for a deformed quartzite using a petrographic microscope and neutron diffraction, 1: determined by a universal stage petrographic microscope over 100 grains, 2: determined by monochromatic neutron radiation in a neutron diffractometer conducted over 1 million grains. Neutrons have better statistics. [Reproduced from Ghildiyal et al., 1999 with permission from the Overseas Publishers Association.]
From a fundamental material science and engineering geology perspective, texture and strain refer to the crystallographic preferred orientation (direction of the crystal lattice) and shape or size deformation of a material (direction of anisotropic grains) under applied forces, respectively (Brokmeier, 1997; Brokmeier, 1999; Bhattacharyya et al., 2006). Texture and strain can be considered as fingerprints for the history of the earth because essential information about anisotropies of physical (e.g. elastic, magnetic and thermal) properties (e.g. shape, size, and arrangement of grains and homogeneity) of rock, constituting the crust and upper mantle, are provided using these two parameters (Wenk, 1985; Ertel et al., 1989; Feldmann, 1989; Kocks et al., 1998; Rinaldi, 2002). For example, the elastic properties of the individual components of polymineralic materials has been studied by strain measurements (Allen et al., 1992; Hauk, 1997; Daymond et al., 1997; Daymond et al., 1999; Santisteban et al., 2002; Schafer, 2002; Webster et al., 2002).
The analysis of neutron diffraction texture is based on Bragg’s law (Wenk, 2012), conducted either by a steady flux of thermal and cold neutrons at reactors or by pulsed neutrons at spallation sources. The reliability of these techniques have been tested by Wenk (2012) to determine textures on a single sample (Fig. 10 a). A key feature of the calcite’s texture visible in Fig. 10 is its symmetrical distribution of the neutron pole figure. This is an index of the bulk deformation geometry of calcite. Similar results have been reported in other observations (Wenk, 1991; Walther et al., 1995; Zucali et al., 2020). For instance, the textures of naturally deformed calcite at various depths in the earth’s crust were collected by Zucali et al. (2020). This study recognized different texture patterns that may produce unique seismic velocity patterns.
Sign in to download hi-res image
Fig. 10. (a) Polycrystalline calcite 0001 neutron pole figures. A round-robin was applied to test the measurement precision of the neutron diffraction texture. Four different neutron diffraction laboratories were selected for the investigation, 1: monochromatic neutrons at a conventional reactor (Julios at KFA, Jülich), 2: monochromatic neutrons at a reactor with a position-sensitive detector (D1B at Institut Laue-Langevin, Grenoble), 3: TOF tests and single peak extraction at a pulsed reactor (SKAT at Dubna, Russia), 4: spallation neutrons with 30 detectors and OD measured by the Rietveld method (high-pressure preferred orientation at the Los Alamos Neutron Science Center, Los Alamos). [Reproduced from Wenk, 2012 with permission from Springer Nature.] (b) Calcite and dolomite 0001 neutron pole figures for Triassic marbles. All samples were calcite except Brg1101, which was dolomite. Numbers at the top right of the pole figures show which pole density scale was applied (in mrd). [Reproduced from Wenk et al., 2019 with permission from the Multidisciplinary Digital Publishing Institute.]
Additionally, by correlating diffraction peak position to variations in the lattice parameter, elastic strains can be interpreted. These strains can then be used to quantify stress using the appropriate elastic stiffness (Brown et al., 2016; Masoomi et al., 2017; Jacob et al., 2018). These stresses are essential in predicting rock failure, rock deformation, and fracture strength.
It is evident from Fig. 10 a that the position-sensitive detector and time-of-flight (TOF) methods give robust statistics for low diffraction peaks. This is because these two methods determine integrated intensities (area under the peak) rather than peak intensities (e.g., peak height). Further, for TOF tests, the Rietveld approach offers the most efficient study of texture. Similarly, Wenk et al. (2019) have used TOF (analyzed by the Rietveld approach in MAUD) and electron backscatter diffraction (EBSD) methods to analyze textures of quartzite and marble samples. Their results demonstrate that marble may absorb a significant portion of the strain and have local heterogeneities, as expressed in calcite and dolomite pole figures (Fig. 10 b).
Abe et al. (2014) have effectively applied an integration of acoustic emission (AE) signal measurements and neutron diffraction to analyze the deformation mechanisms of sandstone and carbonate samples. The effects of an incident neutron beam and gauge volume on the strain of three sandstone samples has also been assessed by Abe et al. (2018). Their results demonstrate that increasing the height of the incident neutron beam can increase the neutron intensity. Additionally, the peak position depends on the rock type instead of the gauge volume height.
There are some important contributions of NS for stress and strain measurements in granular geomaterials (e.g. Hall et al., 2011; Hall et al., 2012; Wensrich et al., 2012; Athanasopoulos et al., 2017; Athanasopoulos et al., 2018; Athanasopoulos et al., 2019). For example, spatially-resolved neutron and X-ray diffractions have been used by Hall et al. (2011) to measure internal strains of sand grains under load and thus, investigate the mechanics of granular media. With these types of measurements, each grain could be thought of as acting as a local (3D) strain gauge. Subsequently, Wensrich et al. (2012) have used a technique based on neutron powder diffraction to produce in-situ mappings of stress distribution in a copper powder die compaction. Exponential decay in axial stress was one of the interesting features observed in this distribution. Similarly, in a new experimental approach, Athanasopoulos et al. (2019) have used a combination of neutron strain scanner (NSS) and digital image correlation (DIC) of quartz sand under load to map the changes of grain strains under the effect of loading and thus, determine the mechanical behaviour of granular media at multiscale. The multiscale analyses included the characterization of the strain field using DIC at mesoscale and the stress distribution using NSS at microscale. A more detailed description of the loading apparatus can be found in Athanasopoulos et al. (2018).
The relative contribution of all components of rock to a rock’s geomechanical properties can be established, as shown in Fig. 11. The figure shows that the elastic strain partitioning curve is independent of composition.
Sign in to download hi-res image
Fig. 11. Calcite and halite axial elastic strains at various applied loads. The elastic limit of the halite is at a halite strain of approximately 350 μstrain. Above a calcite elastic strain of approximately 550 μstrain, the strain partitioning between the two phases starts to tend towards homogeneous elastic strain. [Reproduced from Schafer, 2002 with permission from Copernicus GmbH on behalf of the Deutsche Mineralogische Gesellschaft.]
In summary, texture analysis and determination of geomechanical properties such as stress and strain in various geomaterials have become increasingly important applications of NS.
Show more
View article
Read full article
URL:
Journal2021, Earth-Science ReviewsMirhasan Hosseini, ... Stefan Iglauer
Related terms:
Neutron Scattering
Thin Films
Thermal Neutron
Granular Material
Scintillation Counter
Diffractometers
Fast Neutron
Tomography
Calcite
Carbon Nanotube
View all Topics
Recommended publications
Physica B: Condensed MatterJournal
Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated EquipmentJournal
Nuclear Engineering and DesignJournal
Journal of Magnetism and Magnetic MaterialsJournal
Browse books and journals
Featured Authors
Geltenbort, Peter V.Institut Laue-Langevin, Grenoble, France Citations9,340 h-index43 Publications133
Nesvizhevsky, Valery V.Institut Laue-Langevin, Grenoble, France Citations5,123 h-index35 Publications66
Serebrov, Anatoli P.Petersburg Nuclear Physics Institute (PNPI), Gatchina, Russian Federation Citations3,172 h-index30 Publications46
Hino, MasahiroInstitute for Integrated Radiation and Nuclear Science, Kyoto University, Sennan, Japan Citations2,360 h-index25 Publications105
About ScienceDirect
Remote access
Advertise
Contact and support
Terms and conditions
Privacy policy
Cookies are used by this site. Cookie settings
All content on this site: Copyright © 2025 or its licensors and contributors. All rights are reserved, including those for text and data mining, AI training, and similar technologies. For all open access content, the relevant licensing terms apply.
We use cookies that are necessary to make our site work. We may also use additional cookies to analyze, improve, and personalize our content and your digital experience. You can manage your cookie preferences using the “Cookie Settings” link. For more information, see ourCookie Policy
Cookie Settings Accept all cookies
Cookie Preference Center
We use cookies which are necessary to make our site work. We may also use additional cookies to analyse, improve and personalise our content and your digital experience. For more information, see our Cookie Policy and the list of Google Ad-Tech Vendors.
You may choose not to allow some types of cookies. However, blocking some types may impact your experience of our site and the services we are able to offer. See the different category headings below to find out more or change your settings.
You may also be able to exercise your privacy choices as described in our Privacy Policy
Allow all
Manage Consent Preferences
Strictly Necessary Cookies
Always active
These cookies are necessary for the website to function and cannot be switched off in our systems. They are usually only set in response to actions made by you which amount to a request for services, such as setting your privacy preferences, logging in or filling in forms. You can set your browser to block or alert you about these cookies, but some parts of the site will not then work.
Cookie Details List
Performance Cookies
[x] Performance Cookies
These cookies allow us to count visits and traffic sources so we can measure and improve the performance of our site. They help us to know which pages are the most and least popular and see how visitors move around the site.
Cookie Details List
Contextual Advertising Cookies
[x] Contextual Advertising Cookies
These cookies are used for properly showing banner advertisements on our site and associated functions such as limiting the number of times ads are shown to each user.
Cookie Details List
Cookie List
Clear
[x] checkbox label label
Apply Cancel
Consent Leg.Interest
[x] checkbox label label
[x] checkbox label label
[x] checkbox label label
Confirm my choices |
14122 | https://math.stackexchange.com/questions/547611/proving-the-minimum-value-of-xaxb-xc | quadratics - Proving the minimum value of (x+a)(x+b)/(x+c) - Mathematics Stack Exchange
Join Mathematics
By clicking “Sign up”, you agree to our terms of service and acknowledge you have read our privacy policy.
Sign up with Google
OR
Email
Password
Sign up
Already have an account? Log in
Skip to main content
Stack Exchange Network
Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Visit Stack Exchange
Loading…
Tour Start here for a quick overview of the site
Help Center Detailed answers to any questions you might have
Meta Discuss the workings and policies of this site
About Us Learn more about Stack Overflow the company, and our products
current community
Mathematics helpchat
Mathematics Meta
your communities
Sign up or log in to customize your list.
more stack exchange communities
company blog
Log in
Sign up
Home
Questions
Unanswered
AI Assist Labs
Tags
Chat
Users
Teams
Ask questions, find answers and collaborate at work with Stack Overflow for Teams.
Try Teams for freeExplore Teams
3. Teams
4. Ask questions, find answers and collaborate at work with Stack Overflow for Teams. Explore Teams
Teams
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
Learn more about Teams
Hang on, you can't upvote just yet.
You'll need to complete a few actions and gain 15 reputation points before being able to upvote. Upvoting indicates when questions and answers are useful. What's reputation and how do I get it?
Instead, you can save this post to reference later.
Save this post for later Not now
Thanks for your vote!
You now have 5 free votes weekly.
Free votes
count toward the total vote score
does not give reputation to the author
Continue to help good content that is interesting, well-researched, and useful, rise to the top! To gain full voting privileges, earn reputation.
Got it!Go to help center to learn more
Proving the minimum value of (x+a)(x+b)/(x+c)
Ask Question
Asked 11 years, 11 months ago
Modified8 years, 11 months ago
Viewed 4k times
This question shows research effort; it is useful and clear
2
Save this question.
Show activity on this post.
Show that the minimum value of (x+a)(x+b)(x+c)(x+a)(x+b)(x+c), where a>>c, b>>c, is (a−c−−−−√+b−c−−−−√)2(a−c+b−c)2 for real values of x>−c>−c.
I did
(x+a)(x+b)(x+c)=y(x+a)(x+b)(x+c)=y
and then took its discriminant greater than zero. This led me to
y 2−2(a+b−2 c)y+(a−b)2>0 y 2−2(a+b−2 c)y+(a−b)2>0
I also tried differentiating the expression as follows.
y′=(x+c)[2 x+(a+b)]−x 2+(a+b)x+a b2=0 y′=(x+c)[2 x+(a+b)]−x 2+(a+b)x+a b2=0
∴x 2+2 c x+(a+b)c−a b=0∴x 2+2 c x+(a+b)c−a b=0
I am unable to proceed after this. Please help.
quadratics
Share
Share a link to this question
Copy linkCC BY-SA 3.0
Cite
Follow
Follow this question to receive notifications
edited Nov 1, 2013 at 6:00
TejasTejas
asked Nov 1, 2013 at 5:10
TejasTejas
2,122 2 2 gold badges 17 17 silver badges 40 40 bronze badges
2
1 I'm not sure how you got from your expression for y y to your final equation. Are you allowed to use calculus? The standard approach would be to differentiate the original expression with respect to x x, set it equal to zero, clear out any denominators, and then find the roots of teh resulting polynomial in x x.user7530 –user7530 2013-11-01 05:16:10 +00:00 Commented Nov 1, 2013 at 5:16
Can you show me the steps? I did try to differentiate it, but I think I'm going wrong somewhere.Tejas –Tejas 2013-11-01 05:26:27 +00:00 Commented Nov 1, 2013 at 5:26
Add a comment|
2 Answers 2
Sorted by: Reset to default
This answer is useful
2
Save this answer.
Show activity on this post.
Your last equation is correct. Solving it for x x gives you the two extrema of your function; say that the roots of the quadratic equation (your last one) are x 1 x 1 and x 2 x 2. Because of the signs, x 1 x 1 corresponds to the maximum and x 2 x 2 to the minimum of the function. Compute now the corresponding value y 2 y 2 (you will need to work for simplifying them). From what I got,
y 2=(a+b−2 c)+2(a−c)(b−c)−−−−−−−−−−−√y 2=(a+b−2 c)+2(a−c)(b−c)
Manipulating y 2 y 2 shows that it is equal to
(a−c−−−−√+b−c−−−−√)2(a−c+b−c)2
I hope and wish this helps you to continue.
Share
Share a link to this answer
Copy linkCC BY-SA 3.0
Cite
Follow
Follow this answer to receive notifications
edited Apr 12, 2016 at 5:17
answered Nov 1, 2013 at 7:01
Claude LeiboviciClaude Leibovici
294k 55 55 gold badges 130 130 silver badges 316 316 bronze badges
3
Did you find x1 and x2 by applying Quadratic Formula to the last equation?Tejas –Tejas 2013-11-01 12:43:55 +00:00 Commented Nov 1, 2013 at 12:43
Yes, for sure. I do not think there is another way. If you find any (or you are told), please let me know.Claude Leibovici –Claude Leibovici 2013-11-01 13:19:30 +00:00 Commented Nov 1, 2013 at 13:19
No, I too think that's the only way.Tejas –Tejas 2013-11-01 13:52:00 +00:00 Commented Nov 1, 2013 at 13:52
Add a comment|
This answer is useful
1
Save this answer.
Show activity on this post.
I'm going to avoid using calculus to solve this question. Instead, I have a different approach which uses simple algebra. Let's call this given expression z z. Put y=c+x y=c+x
⇒z=(y−c+a)(y−c+b)y⇒z=(y−c+a)(y−c+b)y
Simplifying this by opening the brackets we get,
⇒z=(a−c)(b−c)+y(a−c)+y(b−c)+y 2 y⇒z=(a−c)(b−c)+y(a−c)+y(b−c)+y 2 y
⇒z=(a−c)(b−c)y+(a−c)+(b−c)+y⇒z=(a−c)(b−c)y+(a−c)+(b−c)+y
Now, here we do a bit of manipulation. We add and subtract 2(a−c)(b−c)−−−−−−−−−−−√2(a−c)(b−c). Why? Keep looking.
⇒z=(a−c)(b−c)y+(a−c)+(b−c)+y+2(a−c)(b−c)−−−−−−−−−−−√−2(a−c)(b−c)−−−−−−−−−−−√⇒z=(a−c)(b−c)y+(a−c)+(b−c)+y+2(a−c)(b−c)−2(a−c)(b−c)
Here, we club (a−c)(b−c)y,y(a−c)(b−c)y,y and 2(a−c)(b−c)−−−−−−−−−−−√2(a−c)(b−c) to get a squared term. That's why I added and subtacted 2(a−c)(b−c)−−−−−−−−−−−√2(a−c)(b−c).
⇒z=(a−c)(b−c)y+y+2(a−c)(b−c)−−−−−−−−−−−√+(a−c)+(b−c)−2(a−c)(b−c)−−−−−−−−−−−√⇒z=(a−c)(b−c)y+y+2(a−c)(b−c)+(a−c)+(b−c)−2(a−c)(b−c)
⇒z=((a−c)(b−c)−−−−−−−−−−−√y√−y√)2+(a+b−2 c)−2(a−c)(b−c)−−−−−−−−−−−√⇒z=((a−c)(b−c)y−y)2+(a+b−2 c)−2(a−c)(b−c)
Now, since
⇒((a−c)(b−c)−−−−−−−−−−−√y√−y√)2≥0⇒((a−c)(b−c)y−y)2≥0
This is because it is a squared term. It can never be negative, it is only either positive or at the minimum, zero. So,the expression z z is minimum only when
⇒((a−c)(b−c)−−−−−−−−−−−√y√−y√)2=0⇒((a−c)(b−c)y−y)2=0
Hence, the minimum value of z z is, i.e, z reduces to
⇒z=(a+b−2 c)−2(a−c)(b−c)−−−−−−−−−−−√⇒z=(a+b−2 c)−2(a−c)(b−c)
Which upon simplification is,
⇒z=(a−c−−−−√+b−c−−−−√)2⇒z=(a−c+b−c)2
Which is the required minimum value.
Share
Share a link to this answer
Copy linkCC BY-SA 3.0
Cite
Follow
Follow this answer to receive notifications
edited Oct 31, 2016 at 12:26
answered Oct 31, 2016 at 12:05
vs_292vs_292
257 2 2 silver badges 6 6 bronze badges
Add a comment|
You must log in to answer this question.
Start asking to get answers
Find the answer to your question by asking.
Ask question
Explore related questions
quadratics
See similar questions with these tags.
Featured on Meta
Introducing a new proactive anti-spam measure
Spevacus has joined us as a Community Manager
stackoverflow.ai - rebuilt for attribution
Community Asks Sprint Announcement - September 2025
Report this ad
Related
1(Discriminant) For which values of k will the equation g(x) = x + k have two real roots that are of opposite signs?
3If the range of the function f(x)=x 2+a x+b x 2+2 x+3 f(x)=x 2+a x+b x 2+2 x+3 is [−5,4],a,b∈N[−5,4],a,b∈N,then find the value of a 2+b 2.a 2+b 2.
5What is the value of a 2+b 2 a 2+b 2?
1The equation a x+a−x=b a x+a−x=b
4If a x 2−b x+5=0 a x 2−b x+5=0 does not have two distinct real roots, what is the minimum value of 5 a+b 5 a+b?
3Finding the minimum value.
1Minimum value of 2−cos(x)sin(x)2−cos(x)sin(x) without differentiation
1Can this be an onto function?
0Is it possible that m x 2−x+1=0 m x 2−x+1=0 has two negative roots?
Hot Network Questions
Xubuntu 24.04 - Libreoffice
Is existence always locational?
I'm having a hard time intuiting throttle position to engine rpm consistency between gears -- why do cars behave in this observed way?
Should I let a player go because of their inability to handle setbacks?
What is this chess h4 sac known as?
Find non-trivial improvement after submitting
Is there a specific term to describe someone who is religious but does not necessarily believe everything that their religion teaches, and uses logic?
I have a lot of PTO to take, which will make the deadline impossible
Lingering odor presumably from bad chicken
ConTeXt: Unnecessary space in \setupheadertext
Do sum of natural numbers and sum of their squares represent uniquely the summands?
Suspicious of theorem 36.2 in Munkres “Analysis on Manifolds”
What "real mistakes" exist in the Messier catalog?
What is the meaning of 率 in this report?
Proof of every Highly Abundant Number greater than 3 is Even
Exchange a file in a zip file quickly
How to use \zcref to get black text Equation?
Does the mind blank spell prevent someone from creating a simulacrum of a creature using wish?
Another way to draw RegionDifference of a cylinder and Cuboid
Can peaty/boggy/wet/soggy/marshy ground be solid enough to support several tonnes of foot traffic per minute but NOT support a road?
How do trees drop their leaves?
The rule of necessitation seems utterly unreasonable
Do we need the author's permission for reference
Can a cleric gain the intended benefit from the Extra Spell feat?
Question feed
Subscribe to RSS
Question feed
To subscribe to this RSS feed, copy and paste this URL into your RSS reader.
Why are you flagging this comment?
It contains harassment, bigotry or abuse.
This comment attacks a person or group. Learn more in our Code of Conduct.
It's unfriendly or unkind.
This comment is rude or condescending. Learn more in our Code of Conduct.
Not needed.
This comment is not relevant to the post.
Enter at least 6 characters
Something else.
A problem not listed above. Try to be as specific as possible.
Enter at least 6 characters
Flag comment Cancel
You have 0 flags left today
Mathematics
Tour
Help
Chat
Contact
Feedback
Company
Stack Overflow
Teams
Advertising
Talent
About
Press
Legal
Privacy Policy
Terms of Service
Your Privacy Choices
Cookie Policy
Stack Exchange Network
Technology
Culture & recreation
Life & arts
Science
Professional
Business
API
Data
Blog
Facebook
Twitter
LinkedIn
Instagram
Site design / logo © 2025 Stack Exchange Inc; user contributions licensed under CC BY-SA. rev 2025.9.26.34547
By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.
Accept all cookies Necessary cookies only
Customize settings
Cookie Consent Preference Center
When you visit any of our websites, it may store or retrieve information on your browser, mostly in the form of cookies. This information might be about you, your preferences, or your device and is mostly used to make the site work as you expect it to. The information does not usually directly identify you, but it can give you a more personalized experience. Because we respect your right to privacy, you can choose not to allow some types of cookies. Click on the different category headings to find out more and manage your preferences. Please note, blocking some types of cookies may impact your experience of the site and the services we are able to offer.
Cookie Policy
Accept all cookies
Manage Consent Preferences
Strictly Necessary Cookies
Always Active
These cookies are necessary for the website to function and cannot be switched off in our systems. They are usually only set in response to actions made by you which amount to a request for services, such as setting your privacy preferences, logging in or filling in forms. You can set your browser to block or alert you about these cookies, but some parts of the site will not then work. These cookies do not store any personally identifiable information.
Cookies Details
Performance Cookies
[x] Performance Cookies
These cookies allow us to count visits and traffic sources so we can measure and improve the performance of our site. They help us to know which pages are the most and least popular and see how visitors move around the site. All information these cookies collect is aggregated and therefore anonymous. If you do not allow these cookies we will not know when you have visited our site, and will not be able to monitor its performance.
Cookies Details
Functional Cookies
[x] Functional Cookies
These cookies enable the website to provide enhanced functionality and personalisation. They may be set by us or by third party providers whose services we have added to our pages. If you do not allow these cookies then some or all of these services may not function properly.
Cookies Details
Targeting Cookies
[x] Targeting Cookies
These cookies are used to make advertising messages more relevant to you and may be set through our site by us or by our advertising partners. They may be used to build a profile of your interests and show you relevant advertising on our site or on other sites. They do not store directly personal information, but are based on uniquely identifying your browser and internet device.
Cookies Details
Cookie List
Clear
[x] checkbox label label
Apply Cancel
Consent Leg.Interest
[x] checkbox label label
[x] checkbox label label
[x] checkbox label label
Necessary cookies only Confirm my choices |
14123 | https://askfilo.com/user-question-answers-smart-solutions/if-then-find-out-the-max-and-value-of-3333313635343239 | If y=\sin x+2 \cos x then find out the max and \min ^{m} value of y...
World's only instant tutoring platform
Instant TutoringPrivate Courses
Tutors
Explore TutorsBecome Tutor
Login
StudentTutor
CBSE
Smart Solutions
If y= x+2 x then find out the max and ^{m} value of y.
Question
Question asked by Filo student
If y=sin x+2 cos x then find out the max and min m value of y.
Views: 5,631 students
Updated on: May 10, 2025
Not the question you're searching for?
Ask your question
Ask your question
Or
Upload the image of your question
Get Solution
Text solutionVerified
Concepts:
Trigonometric functions, Maximum and minimum values
Explanation:
To find the maximum and minimum values of the function y=sin x+2 cos x, we can rewrite it in the form R sin(x+ϕ), where R is the amplitude and ϕ is the phase shift. First, we calculate R as follows: R=1 2+2 2=5. Next, we find the angle ϕ using the formula: tan ϕ=1 2=2. Therefore, ϕ=tan−1(2). The maximum value of y occurs when sin(x+ϕ)=1, which gives us: max y=R=5. The minimum value occurs when sin(x+ϕ)=−1, giving us: min y=−R=−5. Thus, the maximum value of y is 5 and the minimum value is −5.
Step by Step Solution:
Step 1
Identify the function: y=sin x+2 cos x.
Step 2
Calculate the amplitude R: R=1 2+2 2=5.
Step 3
Determine the maximum and minimum values: max y=R=5,min y=−R=−5.
Step 4
Conclude that the maximum value of y is 5 and the minimum value is −5.
Final Answer:
The maximum value of y is 5 and the minimum value is −5.
Ask your next question
Or
Upload the image of your question
Get Solution
Get instant study help from an expert tutor 24/7 Download Filo
Found 4 tutors discussing this question
Mateo Discussed
If y=sin x+2 cos x then find out the max and min m value of y.
8 mins ago
Discuss this question LIVE
8 mins ago
One destination to cover all your homework and assignment needs
Learn Practice Revision Succeed
Instant 1:1 help, 24x7
60, 000+ Expert tutors
Textbook solutions
Big idea maths, McGraw-Hill Education etc
Essay review
Get expert feedback on your essay
Schedule classes
High dosage tutoring from Dedicated 3 experts
Download AppExplore now
Trusted by 4 million+ students
Students who ask this question also asked
Question 1
Views: 5,687
यदि द्विघात बहुपद p(x)=k x 2−3 x+5 के शून्यकों का योग 1 है तो k का मान लिखें। REDMI NOTE 13 5G 25/03/2025 20:06
Topic: Smart Solutions
View solution
Question 2
Views: 5,698
Find the complementary angle of 50° 30'
Topic: Smart Solutions
View solution
Question 3
Views: 5,973
In FeCr 2O 4, the oxidation numbers of Fe and Cr are: (a) + 2 and + 3 (b) 0 and + 2 (c) + 2 and + 6 (d) + 3 and + 6
Topic: Smart Solutions
View solution
Question 4
Views: 5,148
Statement A: In a pure capacitive AC circuit, the phase difference between current and voltage is π/2. Statement B: In a pure inductive AC circuit, the phase difference between the current and voltage is π. Which of the following is correct? (1) Both statements (A) and (B) are correct (2) Both statements (A) and (B) are incorrect (3) Statement (A) is correct and statement (B) is incorrect (4) Statement (A) is incorrect and statement (B) is correct Which of the following statement is incorrect about electromagnetic waves? (1) They are transverse in nature (2) They can be produced by accelerating charges (3) They travel with the same speed in all media (4) They travel in free space with the speed of light 3 x 10^8 m/s Consider the following statements regarding a purely capacitive AC circuit and pick the correct option. Statement A: Voltage and current are in phase with each other. Statement B: Both voltage (V) and current (I) reach maximum value at the same time. Statement C: Capacitive reactance is inversely proportional to capacitance of the capacitor. (1) Only A and B are correct (2) Only C is correct (3) Only A is correct (4) A, B and C are correct Read the following statements and choose the correct option. Statement A: An emf can be induced by moving a conductor in a magnetic field. Statement B: An emf can be induced in a coil by changing the magnetic field, in which the coil is lying. (1) Both statements A and B are true (2) A is true but B is false (3) B is true but A is false (4) Both statements A and B are false Choose the correct statement regarding EM waves. (1) These waves do not require material medium for their propagation (2) It travels in free space with speed C = 1/√(μ₀ε₀) (3) Their direction of propagation can be determined by E x B (4) All of these Which of the statement is incorrect in series LCR circuit? (1) The power factor is unity (2) The current in the circuit is maximum (3) Power of the circuit is maximum (4) The current leads voltage by π/4 In the following question, a statement of assertion is followed by a statement of reason (R). A: When a current I = (3 + 4 sin ωt) flows in a wire, reading of a d.c. ammeter connected in series is 3 units. R: A d.c. ammeter measures only the value of current amplitude. (1) If both Assertion & Reason are true and the reason is the correct explanation of the assertion. (2) If both Assertion & Reason are true but the reason is not the correct explanation of the assertion. (3) If Assertion is true statement but Reason is false. (4) If both Assertion and Reason are false statements. Among the following, which waves are used for taking photographs during fog? (1) Ultraviolet rays (2) Radiowaves (3) Microwaves (4) Infrared waves If a square conducting loop is taken out from a region of uniform magnetic field with speed v as shown in figure, then direction of induced current in the loop will be (1) Clockwise (2) Anticlockwise (3) Depending on speed of loop (4) No current will induce An iron core coil is connected in series with an electric bulb, with an AC source. As the iron piece is taken out of the coil, the brightness of bulb (1) Increases (2) Decreases (3) Remains same (4) First increases then decreases
Topic: Smart Solutions
View solution
View more
Video Player is loading.
Play Video
Play Skip Backward
Mute
Current Time 0:00
/
Duration-:-
Loaded: 0%
Stream Type LIVE
Seek to live, currently behind live LIVE
Remaining Time-0:00
1x
Playback Rate
2.5x
2x
1.5x
1x, selected
0.75x
Chapters
Chapters
Descriptions
descriptions off, selected
Captions
captions settings, opens captions settings dialog
captions off, selected
Audio Track
Picture-in-Picture Fullscreen
This is a modal window.
Beginning of dialog window. Escape will cancel and close the window.
Text Color Opacity Text Background Color Opacity Caption Area Background Color Opacity
Font Size Text Edge Style Font Family
Reset restore all settings to the default values Done
Close Modal Dialog
End of dialog window.
Stuck on the question or explanation?
Connect with our 331 tutors online and get step by step solution of this question.
Talk to a tutor now
238 students are taking LIVE classes
Question Text If y=sin x+2 cos x then find out the max and min m value of y.
Updated On May 10, 2025
Topic All topics
Subject Smart Solutions
Class Class 11
Answer Type Text solution:1
Are you ready to take control of your learning?
Download Filo and start learning with your favorite tutors right away!
Questions from top courses
Algebra 1
Algebra 2
Geometry
Pre Calculus
Statistics
Physics
Chemistry
Advanced Math
AP Physics 2
Biology
Smart Solutions
College / University
Explore Tutors by Cities
Tutors in New York City
Tutors in Chicago
Tutors in San Diego
Tutors in Los Angeles
Tutors in Houston
Tutors in Dallas
Tutors in San Francisco
Tutors in Philadelphia
Tutors in San Antonio
Tutors in Oklahoma City
Tutors in Phoenix
Tutors in Austin
Tutors in San Jose
Tutors in Boston
Tutors in Seattle
Tutors in Washington, D.C.
World's only instant tutoring platform
Connect to a tutor in 60 seconds, 24X7
27001
Filo is
ISO 27001:2022 Certified
Become a Tutor
Instant Tutoring
Scheduled Private Courses
Explore Private Tutors
Filo Instant Ask Button
Instant tutoring API
High Dosage Tutoring
About Us
Careers
Contact Us
Blog
Knowledge
Privacy Policy
Terms and Conditions
© Copyright Filo EdTech INC. 2025
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply. |
14124 | https://www.medrxiv.org/content/10.1101/2021.05.31.21257914v1.full-text | Albumin-dependent and independent mechanisms in the syndrome of kwashiorkor
Abstract
The syndrome of kwashiorkor is a striking phenotype of childhood severe malnutrition (SM) comprising oedema, fatty liver, and skin and hair changes. Despite high fatality, the aetiology and pathophysiology of kwashiorkor remain enigmatic, including the role of serum albumin on oedema development. Here, we demonstrate that serum albumin is associated with the presence and severity of oedema among severely malnourished children. Further, in two independent cohorts of children in Malawi and Kenya, we show albumin-independent mechanisms are associated with oedema in SM, including oxidative stress and extracellular matrix (ECM) remodelling. Plasma concentrations of ECM-related proteins: lumican, podoplanin, lymphatic vessel endothelial hyaluronan receptor 1 (LYVE1) and matrix metalloproteinase (MMP)2 were associated with kwashiorkor. We therefore conclude that the pathophysiology of kwashiorkor has both albumin-dependent and independent mechanisms. We discuss the ways in which albumin-independent mechanisms may explain the clinical features observed in kwashiorkor.
Introduction
The syndrome of kwashiorkor (a.k.a oedematous severe malnutrition) is a striking phenotype of childhood malnutrition comprising oedema, fatty liver, hair depigmentation, a desquamating skin rash and behavioural changes1. It is distinct from the syndrome of marasmus (a.k.a severe wasting), characterised by low weight-for-height (<-3 z scored from 2006 WHO standards), low (<115 mm) mid-upper arm circumference (MUAC), visible atrophy and loose skin. Kwashiorkor and marasmus may co-occur (i.e. marasmic-kwashiorkor). Whilst both phenotypes are assumed to result from inadequate nutritional intake, the aetiology of the oedematous phenotype remains elusive1. Several hypotheses on the pathophysiology of kwashiorkor have been proposed but none are supported by robust epidemiological or mechanistic evidence 1.
The earliest explanation of kwashiorkor was a low protein diet leading to hypoalbuminemia causing pathognomonic oedema 2. However, in 2007, prospective assessment of food and nutrient intake in a population at risk for kwashiorkor in India and Malawi found no association between measured protein intake and kwashiorkor3, 4. Furthermore, oedema in SM is observed to resolve independently of protein intake5 and without an increase in serum albumin 6. However, the latter has been questioned upon reanalysis of the original data suggesting serum albumin could have increased in these earlier studies 7.
Circulating essential amino acid (EAA) concentrations, particularly sulphated AAs, are reported to be lower in kwashiorkor compared to marasmus 8, 9. Some of the clinical characteristics of kwashiorkor are similar to those occurring in methionine deficiency, notably the skin lesions and reduced plasma glutathione levels. Furthermore, supplementation study of cysteine has been associated with faster resolution of oedema compared to alanine supplementation 10. However, supplementation of methionine itself did not yield the same effect 11, nor did supplementation of an antioxidant mixture containing N-acetylcysteine prevent the development of kwashiorkor 12. Recently, DNA hypomethylation has been reported in kwashiorkor relative to marasmus during active disease, but not in subsequently recovered cases in adulthood, which the authors attribute to reduced concentrations and methyl-flux of methionine 13. However, due to the absence of data from non-malnourished controls, the results could also suggest relative hypermethylation in marasmus. Both DNA hyper and hypomethylation have been observed in caloric restriction and ageing 14, 15. The conclusion of hypomethylation in kwashiorkor, instead of hypermethylation in marasmus, was based on a prior observation that methyl-flux from methionine is reduced in kwashiorkor. Thus, the role of methionine deficiency in kwashiorkor remains unclear.
Oxidative stress has been suggested as an alternative hypothesis. The “free radical hypothesis” proposed increased production of free radicals accompanied by a reduction in anti-oxidative mechanisms, leading to oedema, skin and hair changes and fatty liver 16. Low anti-oxidative capacity was attributed to monotonous diets lacking several micronutrients and minerats (riboflavin, nicotinic acid, carotene, selenium, zinc) and sulphur AAs, needed for glutathione synthesis 1, 16. However, a trial of antioxidant supplementation containing riboflavin, vitamin E, selenium, and N-acetylcysteine for kwashiorkor prevention was ineffective 12; although, differences in oxidative stress were not measured in that trial. A pilot study of supplementation of glutathione and/or alpha-lipoic acid however improved survival and reduction of skin lesions in severe kwashiorkor 17. Exogenous toxicants, including aflatoxins from staple foods like maize often consumed in low and middle-incomes countries could also increase oxidative stress and explain the accumulation of liver fat in kwashiorkor. However, despite finding aflatoxins in biological samples of children with kwashiorkor 18–22, a causal link has not be demonstrated and study biases may have influenced results 23.
Endothelial dysfunction from disruption of sulphated glycosaminoglycans (GAGs) has also been proposed to cause kwashiorkor 24. However, congenital conditions linked with the inability to produce GAGs are not typically associated with oedema formation in affected children 1, 25, 26. Abnormal gut microbiota has also been implicated, although a recent analysis found no differences in the faecal metagenome between children with kwashiorkor and marasmus 27. A causal link between gut microbiome has been proposed from work in germ-free mice transplanted with microbiome from children with kwashiorkor, however oedema was not reported to have occurred in these animals. The study was not designed to distinguish whether effects relating to kwashiorkor from those of marasmus and so did not include faecal samples from children with marasmus 28. Children with SM in general have an altered gut metagenome composition compared to healthy children 28, 29, indicating that dysregulation of the microbiome may be a cause or consequence of SM, but this does not explain the pathophysiology of kwashiorkor.
Our aim was to determine albumin-independent differences in pathophysiology between the two SM phenotypes to inform targeted prevention and treatment strategies 30, 31.
Results
Low serum albumin is necessary but not sufficient to develop kwashiorkor
We initially determined the association between serum albumin concentration and kwashiorkor using data from a clinical trial of reformulated therapeutic milk among hospitalized children with severe acute malnutrition conducted in Malawi and Kenya (the discovery cohort) 32. Within this trial, 79% (662/843) of the children had admission serum albumin data with a median (interquartile range; IQR) of 34g/L (IQR 24 – 40). HIV, older age, and enrolment at the Malawi site were associated with lower albumin concentrations, while breastfeeding, pre-existing heart disease, and presenting with severe pneumonia or diarrhoea were associated with higher albumin (all p<0.05) in multivariable analysis. Serum albumin concentration was negatively associated with the presence of kwashiorkor (aOR = 0.75 [95% CI: 0.71, 0.78] per g/L, p < 0.001). We observed a significant decline in serum albumin concentration with increasing oedema severity graded according to the WHO classification (Figure 1a). Almost all children with kwashiorkor had serum albumin levels below 35g/L, but many children with similarly low levels of serum albumin did not have oedema or other features of kwashiorkor (Figure 1a,b). In a separate external validation cohort children with SM recruited in hospital after stabilization in another previous clinical trial in Kenya 33, serum albumin concentrations were significantly lower in children presenting with kwashiorkor compared to those with marasmus (Figure 1c) (aOR = 0.92 [95% CI: 0.87, 0.96], p = 0.001). Oedema grading data were not collected for this study.
(a) Association between serum albumin concentration and degree of oedema severity in the F75 reformation clinical trial32: “None” means no oedema (marasmus) whereas “+” means oedema on both feet; “++” – oedema in both feet and legs; “+++” – oedema in both feet, legs, arms, hands and face. Oedema severity was assessed by trained clinicians following World Health Organization guidelines; (b) probability of presenting with oedema based on serum albumin concentration at hospital admission in the discovery cohort: green and red dots indicate those that presented with or without oedema respectively; (c) difference in serum albumin concentration between kwashiorkor and marasmus in the validation cohort; (d) distribution of oedema status after 3 days of hospitalization in the F75 reformulation clinical trial; (e) changes in serum albumin concentration among kwashiorkor during admission and after 3 days of hospitalization
Oedema resolved within 3 days of hospitalization in almost half (48%) of children admitted with kwashiorkor in the discovery cohort and oedema had improved in 31%. A small proportion (3%) of those admitted with marasmus developed oedema during treatment (Figure 1d). Among children whose nutritional oedema resolved or improved, there was a small increase in serum albumin concentration during 3 days of hospitalisation (0.68 g/L mean increase, p=0.02), whereas serum albumin remained unchanged among those whose oedema did not improve (Figure 1e). However, despite the small increase serum albumin among children whose oedema resolved or improved, concentrations at 3 days (median 20 g/L, IQR 16.5 – 26 g/L) were still far below clinically recognized norms in children (34 – 54 g/L). Adjusting for regression to the mean indicated no differences in changes in serum albumin between those without oedema and those with oedema which either improved (p = 0.93) or worsened (p = 0.38). These findings strongly suggest that although low serum albumin is associated with kwashiorkor, other factors play an essential role in the pathophysiology of the kwashiorkor phenotype.
Selection of a sub-population matched on serum albumin levels
To determine factors associated with kwashiorkor in conjunction with low albumin, we further selected children from the F75 reformulation trial discovery cohort (Figure 2). This sub-cohort comprised children with kwashiorkor and marasmus who had been matched on exact serum albumin levels. In the discovery cohort, age and sex distributions were similar in oedematous and non-oedematous groups. Mid-upper arm circumference (MUAC) was higher among children with kwashiorkor (p < 0.001), whereas HIV was more prevalent among children with marasmus (p < 0.001). A greater proportion of oedematous children were recruited in Malawi than in Kenya.
Recruitment flow diagram for the discovery and validation cohorts
To validate the results obtained from the discovery sub-cohort, a validation sub-cohort was selected from the validation set from the trial in Kenya, with kwashiorkor and marasmus matched on age, sex, site of recruitment and sex, but not matched for serum albumin concentration (more details in the Methods section) (Figure 2). In the validation cohort, 47 children with marasmus and 51 with kwashiorkor were selected based on 25 strata. As with the discovery cohort, serum albumin was higher in marasmus than in kwashiorkor thus, for succeeding analyses, variables were normalized by serum albumin concentration in order to assess differences occurring independently of serum albumin concentrations to harmonize approaches with the discovery cohort. The baseline description of both cohorts is presented in Table 1 and flowcharts of the selection for both cohorts are presented in Figure 2.
Admission characteristics of the children used in this study from the two independent cohorts
Plasma lipids and extracellular matrix proteins are albumin-independent factors associated with kwashiorkor
To discover albumin-independent protein and metabolite factors associated with kwashiorkor, plasma samples from the discovery sub-cohort were subjected to untargeted liquid chromatography tandem mass tag (TMT)-based proteomics and targeted metabolomics (Biocrates™ p 180). After data cleaning and pre-processing, 187 out of 456 proteins and 155 out of 205 metabolites were retained for further analysis. A complete list of annotated proteins and targeted metabolites and their association with nutritional oedema is provided in Supplementary table S1. Nine metabolites including 1 phosphatidylcholine (PC), 6 lysoPC, and 1 sphingomyelin species, apolipoprotein C-I (Apo C1) and 3 extracellular matrix protein (ECM)-related proteins (lumican, inter-alpha-trypsin inhibitor heavy chain H2 [ITIH2] and histidine-rich glycoprotein [HRG]) were positively associated with kwashiorkor compared to marasmus cases matched by exact serum albumin levels (Figure 3a). Furthermore, all these metabolites and proteins were associated with increasing severity of oedema (Figure 3b).
Differential abundance of proteins and metabolites between kwashiorkor and marasmus. (A) Volcano plot showing the log odds ratio (x-axis) and –log p value after false-discovery rate adjustment of plasma proteins (y-axis). False discovery adjustment was performed separately for proteins and metabolites. The horizontal line signify the FDR p = 0.05 and p = 0.01 cut-offs, whereas vertical broken line signify log odds ratio = 0. Features on the upper right quadrant represent those with FDR-corrected p values < 0.05, and are associated with kwashiorkor compared to marasmus phenotype, whereas those in the upper left quadrant are associated with marasmus. Estimates were obtained using conditional logistic regression adjusting for age, sex, HIV status and site of recruitment stratified for admission serum albumin concentration. (B) Boxplot showing the association between the plasma concentrations of significantly associated features and the degree of oedema severity. “None” means no oedema (marasmus) whereas “+” means oedema on both feet; “++” – oedema in both feet and legs; “+++” – oedema in both feet, legs, arms, hands and face. Oedema severity was assessed by trained clinicians following World Health Organization guidelines; p values were estimated using ordinal logistic regression adjusted for age, sex, HIV status, site of recruitment and serum albumin concentration. (C) Radar plot comparing plasma amino acid content in kwashiorkor and marasmus both with matched serum albumin and serum albumin > 35g/L (high albumin). denotes difference at p <0.05 between kwashiorkor and marasmus matched with serum albumin. # denoted different at p < 0.05 between kwashiorkor and marasmus with serum albumin >35g/L (high albumin)
Plasma phenylalanine and 5-hydroxyindoleacetic acid (5-HIAA), but not methionine, distinguish SM phenotype
Plasma levels of phenylalanine (aOR = 0.47 [95% confidence interval: 0.29, 0.77]) and 5-HIAA (aOR = 0.18 [95% confidence interval: 0.07, 0.47]) were negatively associated with kwashiorkor. On the contrary, methionine levels were not associated with SM phenotype (aOR = 0.67 [95% confidence interval: 0.42, 1.08]) nor with oedema severity. In fact, an almost complete overlap between each free amino acid concentration was observed between kwashiorkor and marasmus (Figure 3c). Although 5-HIAA was negatively associated with kwashiorkor, plasma levels of the other members of the tryptophan pathway, i.e. tryptophan, serotonin and kynurenine, were not (Supplementary figure S1). Comparing kwashiorkor with children with marasmus but with serum albumin > 35g/L (high albumin), almost all measured amino acid concentrations were higher (p < 0.05) in the high albumin-marasmus group compared to kwashiorkor, indicating an association between serum albumin concentration on measured plasma amino acid content. Asparagine, aspartic acid, citrulline, ornithine and proline concentrations were not different between kwashiorkor and marasmus, whereas glycine and histidine were significantly lower in the high albumin-marasmus group compared to kwashiorkor.
Multi-omics co-expression network analysis uncovers albumin-independent mechanisms associated with oedema in SM
Co-expression network analysis of integrated proteomics and metabolomics data identified fifteen modules of strongly correlated features (Figure 4a). Features not clustering with any module are presented in module ME7. Module membership is presented in Supplementary Table S2. A general description of the membership of each module is shown in Figure 4a. Briefly, PC modules (ME1, 3, 4, 9, 10, 13 and 14) were clustered based on the lengths of their side chains, bonding to the glycerol backbone (either ether or ester-linked) and the degree of unsaturation (average number of double bonds). Most amino acids, lysoPCs and sphingomyelines clustered in separate modules (ME5, ME11 and ME12, respectively). ME6 contained unsaturated acylcarnitines, whereas saturated acylcarnitines were placed with other unassigned metabolites in ME7. Protein-rich modules were characterized by gene-ontology (GO) enrichment analysis 34. M8 was composed of proteins associated with oxidative stress whereas M16 with immunoglobulins. The two large protein modules were ME2 and M15. Although closely related, ME2 was mainly composed of proteins associated with immune response and complement activation whereas ME15 was mainly composed of proteins associated with lipid transport and metabolism, and extracellular matrix remodelling.
Multi-omics weighted co-expression network analysis. (A) Plot showing log odds ratio with binary outcome (kwashiorkor vs marasmus) as response variable and each module’s eigenvector as independent variable adjusted for age, sex, HIV status, site of recruitment and stratified based on admission serum albumin using conditional logistic regression. Side bars indicate 95% confidence interval. Red dots denote modules significantly (p < 0.05) associated with kwashiorkor. (B) Network depiction of the modules associated with kwashiorkor showing the members of each module and their module characteristics. Network structure was obtained using the WGCNA package in R and visualized using Cytoscape version 3.8.2.
Each module is characterised by an eigenvector (E(q), which is the 1st principal component of module q that represents the overall behaviour of the module35. Regressing E(q) to a binary outcome (kwashiorkor or marasmus) adjusting for age, sex, HIV and recruitment site, stratified by each value of admission serum albumin, we found seven modules (ME4, 6, 8, 10, 11 and 15) to be significantly associated with kwashiorkor (Figure 4a,b).
Most of the associated modules were composed of lipids (ME4, 6, 10-12). However, there was a preferential increase in plasma concentration of unsaturated ester-bound PCs (ME4, 10) compared to ether-bound PCs (ME1) and PCs with lower degree of unsaturation (ME9) in kwashiorkor. Modules containing both ester- and ether-bound PCs were also not associated with kwashiorkor, further emphasizing the preference for esterified PCs. Plasma levels of unsaturated acylcarnitines (ME6) were also preferentially increased in kwashiorkor compared to saturated acylcarnitines (clustered in ME7). LysoPCs (ME11) and sphingomyelins (ME12) were found to be positively associated with kwashiorkor compared to marasmus. These positive associations of lipid modules to kwashiorkor are corroborated by the results of lipid specific associations (Figure 3a) and the positive association of proteins involved in lipid transport and metabolism (ME15). Proteins associated with oxidative stress (ME8) was also positively associated with kwashiorkor.
We further observed that proteins linked with extracellular matrix remodelling (ME15) were positively associated with kwashiorkor. This also corroborates with the results of protein specific associations (Figure 3a), showing that ECM-associated proteins lumican, ITIH2 and HRG were positively associated with kwashiorkor.
Plasma markers of endothelial glycocalyx integrity are associated with oedema severity but not specifically with kwashiorkor
We quantified lumican using ELISA to validate the untargeted proteomics results in both discovery and validation cohorts. Lumican was found to be positively associated with kwashiorkor compared to marasmus (aOR = 1.49 [95% CI: 1.23, 1.79]) per µg/mL, adjusting for age, sex, HIV status and site of recruitment in agreement with the untargeted proteomics results (Figure 5a). Also consistent with untargeted proteomics findings, plasma lumican concentration was positively associated with increasing degree of oedema severity (p < 0.001) (Figure 5b). The positive association of plasma lumican and kwashiorkor was replicated in the validation cohort for lumican levels normalized on serum albumin concentration (p = 0.002) (Figure 5c). Comparing circulating lumican levels between discharge (still SM but free of underlying infections) and 60 days post-discharge (fully recovered from SM and infections) in the validation cohort, lumican was found to significantly increase (p < 0.001) among children with marasmus, whereas it decreased among children with kwashiorkor (p < 0.03).
Association between SM phenotype and lumican and endothelial glycocalyx markers.
As lumican has been reported to adsorb on the endothelial glycocalyx 36, we reasoned that the increase in plasma lumican likely reflected a disruption of the endothelial glycocalyx. Hence, we determined the association between kwashiorkor and plasma endothelial glycocalyx (EG) markers. Of the several EG integrity markers reported in the literature, and given limited sample volumes, we prioritised analysis of two abundant markers in plasma previously reported to be increased in diseases with known EG dysfunction 37: syndecan-1 (Syn1), a proteoglycan bearing sulphated glycosaminoglycans (GAG), and hyaluronan (HA), a non-sulphated GAG.
Based on literature suggesting increased serum levels of EG markers in diseases associated with leakage of intra-vascular fluid and proteins leading to oedema, such as dengue37, we initially hypothesized that increased plasma levels of Syn1 and HA would be associated with kwashiorkor. Surprisingly, neither Syn1 nor HA were associated with kwashiorkor compared to marasmus in the discovery cohort (Figure 5d-i). Their plasma levels were however negatively associated with increasing degree of oedema severity. These results were replicated in the validation cohort, except for a modest but significant increase in HA among children with kwashiorkor (Figure 5i). Plasma levels of Syn1 and HA significantly decreased after 60 days post discharge among children with either initial phenotype who fully recovered from malnutrition without further acute illness following discharge.
ECM remodelling is an albumin-independent mechanism in kwashiorkor
Plasma levels of matrix metalloproteinase (MMP)2 in the discovery cohort had a positive association with kwashiorkor (aOR = 1.89 [95% confidence interval: 1.38, 2.58]) per µg/mL, and was associated with severity of oedema (p < 0.0001) (Figure 6a). Because of this, we measured plasma levels of ECM remodelling regulators, i.e. MMP2, tissue inhibitors of MMP (TIMP)1, and TIMP2, and other ECM proteins (podoplanin and LYVE1) in the validation cohort, both at hospital discharge and at day 60 post-discharge among children who achieved full nutritional recovery.
Association between SM phenotype and markers of ECM remodelling markers and systemic inflammatory.
ECM remodelling regulators MMP2 and TIMP1 were positively associated with kwashiorkor. Furthermore, plasma levels of these proteins significantly reduced during nutritional rehabilitation (Figure 6b). Apart from lumican, other ECM proteins were altered in plasma of children with kwashiorkor. Podoplanin, a mucin-like glycoprotein found in the alveoli, heart and lymphatic vascular system, was negatively associated, whereas lymphatic vessel endothelial HA receptor 1 (LYVE1) was positively associated with kwashiorkor. Plasma levels of LYVE1 also reduced during nutritional rehabilitation in both the kwashiorkor and marasmus phenotypes, but podoplanin remained unchanged.
As ECM remodelling is activated by inflammation, we further measured key plasma markers of systemic inflammation in both SM phenotypes. None of the inflammatory cytokines measured were differentially abundant between kwashiorkor and marasmus cases matched for serum albumin, suggesting inflammatory response-independent mechanisms were driving ECM remodelling in kwashiorkor. It can be observed however that plasma levels of IL8, IL10, VEGFR3, GRO alpha KC and sCD14 decreased significantly in plasma of validation cohort children with kwashiorkor during the 60 days post-hospital discharge but remained unchanged in marasmus. Plasma IL6 significantly decreased in both kwashiorkor and marasmus upon full nutritional and clinical recovery (Figure 6B).
Discussion
There is a universal understanding within the medical literature of the role of serum albumin concentration on oedema formation in general, as explained by Starling forces. However, in hypoalbuminemic states such as the nephrotic syndrome and inflammation, evidence suggests that other factors beyond a decline in colloid osmotic pressure are also responsible for the altered fluid distribution38. The role that albumin plays in kwashiorkor has been a topic of debate among scientists, with some postulating a causal role of hypoalbuminaemia in its aetiology7, 39 while others rejecting their association 6, 40. In this study, we showed that kwashiorkor is associated with both albumin-dependent and independent mechanisms. We demonstrated for the first time a role of ECM degradation as an albumin-independent mechanism in the pathophysiology of kwashiorkor.
Our data from two independent cohorts show that serum albumin is lower among children with kwashiorkor compared to marasmus and negatively associated with the degree of oedema severity. In fact, there were almost no cases of kwashiorkor where serum albumin concentrations were more than 35 g/L in the discovery cohort. In the validation cohort who were enrolled towards the end of their hospital admission having initiated therapeutic feeding and no longer suffering acute infection, 35% of kwashiorkor cases had serum albumin levels above 35 g/L compared to 67% for the marasmus cases. These data provide the first physiological validation of the current WHO nutritional oedema grading system 41. However, in the absence of active acute infection (validation cohort), serum albumin concentrations overlapped more between groups compared to at admission to the hospital (F75 reformulation trial). Furthermore, we observed that resolution or improvement of oedema was accompanied by a small but not likely clinically relevant increase in serum albumin concentrations, agreeing with previous observations 5, 6. These led us to postulate that other factors beyond albumin play important roles in oedema formation in SM.
Using a targeted metabolomics approach, we previously showed that serum concentrations of 141 metabolites (including AAs) tended to be lower in kwashiorkor compared to marasmus in general, and not only AA 42. In this current study, we found that plasma AA profile was very similar between kwashiorkor and marasmus when matched for serum albumin concentrations, contrary to previous reports in which serum albumin concentrations were not considered 8, 9, 42. These data indicate an association between serum albumin and serum free AA concentrations. One explanation for this is water displacement by albumin. In conditions of low albumin content, water replaces the space that would have been occupied by albumin per volume of serum, thereby causing a dilution of polar metabolites. Hence, an apparently lower content per unit volume of polar metabolites is observed in kwashiorkor compared to marasmus with high serum albumin concentration. Another potential explanation is that the lower serum albumin concentration is a reflection of low concentrations of AA precursors needed for albumin synthesis. We therefore addressed these issues by matching for serum albumin when comparing kwashiorkor and marasmus in the discovery cohort and normalising for serum albumin in the validation cohort.
Our results also demonstrate that kwashiorkor is associated with increased levels of oxidative stress (increased hydrogen peroxide catabolism, oxygen transport, response to reactive oxygen species and cellular oxidant detoxification). However, whether increased oxidative stress causes or is a consequence of kwashiorkor requires further investigation. Nonetheless, we showed in this study that oxidative stress was increased in kwashiorkor independently of the plasma AA profile, which agrees with one of the postulates of the free radical hypothesis 16. However, we did not find evidence for an association between plasma levels of endothelial glycocalyx components, Syn1 and HA, and kwashiorkor. Instead we found other ECM proteins that are associated with kwashiorkor, such as lumican, LYVE1, podoplanin and MMP2. It is important to note however that endothelial glycocalyx components are also structurally linked to ECM proteins.
Lumican is a leucine-rich proteoglycan with keratan sulphate, a sulphated glycosaminoglycan (sGAG), side chains and is a major component of corneal, dermal and muscle connective tissue. Downregulation of lumican results in skin fragility and laxity, and corneal opacity 43. Hence, degradation of lumican could explain the skin changes44, 45 and corneal opacity 46, 47 reported to occur in some children with kwashiorkor. Although, no study has linked lumican specifically with the type of skin changes in kwashiorkor, i.e. “flaky paint” or “peeling paint” dermatosis, reduction of lumican levels have been reported in skin diseases such as actinic keratosis and Bowen disease 48.
The lymphatic system could also be involved in the clinical manifestations of kwashiorkor, especially oedema. LYVE1 and podoplanin are both markers of lymphatic endothelial integrity predominantly expressed in lymphatic vessels 49–51. LYVE1 and podoplanin are essential for lymphatic system development and ablation of podoplanin and LYVE1 in transgenic mice resulted in diminished lymphatic transport and lymphedema 52, 53. Hence, differential plasma levels of these markers indicate that lymphatic system could be compromised in kwashiorkor, leading to poor fluid homeostasis. Degradation of ECM in the lymph may also explain the disturbances in lipid metabolism observed in kwashiorkor, being the main route for chylomicrons from enterocytes to reach the bloodstream 54. Interestingly, reduction of podoplanin by knock-out of T-synthase in mice caused fatty liver by chylomicrons being diverted directly to the portal vein instead of being transported to the bloodstream via the lymphatic system 55. It is however worth noting that liver steatosis is not a common observation among children with congenital intestinal lymphangiectasia, a disease associated with lymphatic damage56. Hepatic lipid accumulation in animal models of SM has so far been proposed to be related to mitochondrial dysfunction, peroxisomal damage57, 58 or choline deficiency 59. However, in these animal studies, rodents were fed low-protein diets which did not induce oedema. ECM degradation, especially in the lymph, could be a contributing mechanism to liver fat accumulation in kwashiorkor, which is testable. Analysis of post-mortem portal vein triglyceride content using minimally invasive tissue sampling strategies could test this hypothesis. Alternatively, high content of triglycerides, apolipoprotein B48 and lymphocytes in ascitic fluids could further demonstrate the role of lymphatic degradation in kwashiorkor. However, ascites in kwashiorkor may already indicate a more advanced condition or an entirely different clinical picture, which could influence this observation.
Both LYVE1 and podoplanin (via colocalization with CD44) are major HA receptors 50, 60. Although we did not find significant association between kwashiorkor and HA in the discovery cohort, plasma albumin-normalized HA was higher in kwashiorkor in the validation cohort, indicating higher HA shedding. Observed differences between our cohorts could be because children in the discovery cohort were both severely undernourished and clinically ill at the time of sampling, whereas children in the validation cohort were still severely undernourished but severe infection had resolved, micronutrients, protein and energy had been initiated, and they were tolerating therapeutic feeds, which is regarded as a sign of nutritional stabilisation.
Increased levels of plasma ECM were accompanied by increased plasma concentrations of MMP2, which is an active regulator of ECM remodelling. MMP2 is a 72 kDa type IV collagenase that is distributed in many tissues and associated with several serious diseases. Along with MMP9, it is also expressed in lymphatic endothelial cells 61 and plays a key role in lymphatic vessel formation 62. Oxidative stress is a strong activator of MMP2 63, and reactive oxygen–nitrogen species-induced MMP2 activation has been shown to play major roles in various diseases such as cardiac injury 64, hepatic fibrosis 65 and atherosclerosis 66. Our findings therefore provide a plausible mechanism for previous data suggesting generalized loss of sGAG in kwashiorkor 24, 67–70. Our results suggest an MMP-induced degradation of the core ECM proteins that these sGAG are structurally linked to. We also observed that this disruption is not exclusive to sGAG-binding ECM but also to ECM proteins linked to non-sulphated GAGs, such as LYVE1 and podoplanin.
We did not find evidence of greater systemic inflammation in kwashiorkor compared to marasmus, when albumin was matched. This is surprising considering the well-described interaction among oxidative stress, inflammation and ECM remodelling 71. It is thus plausible that children with kwashiorkor have a predisposition to a heightened ECM remodelling given the same inflammatory insult experienced by children with marasmus. Hence, examining variability in ECM remodelling-associated genes, such as MMPs, would be a promising next step to understand the aetiology of kwashiorkor. These results also highlight the role of non-nutritional factors such as (epi)genetic factors in the aetiology of kwashiorkor.
Although our results do not give a definite answer to what causes kwashiorkor, we reveal important findings on the pathophysiology of oedema, especially the role that albumin plays. This finding is not only relevant to SM but also to other oedematous diseases such as nephrotic syndrome and sepsis. We recognize that matching patients by admission serum albumin to specifically examine albumin-independent mechanisms associated with kwashiorkor precludes comparison with the full spectrum of marasmus cases. Nonetheless, our results remained consistent in the validation cohort where we normalized by albumin rather than individually matched. A limitation of the study is the lack of data on the renal function, which has also been reported to be associated with LYVE1 72, podoplanin 73 and lumican 74. Although it is plausible that any renal dysfunction in kwashiorkor could be linked with the degradation of renal ECM proteins.
Given these findings, we propose that the mechanism for oedema in kwashiorkor involves both reduced serum albumin concentration and increased oxidative stress leading to heightened ECM degradation resulting in (1) reduction in interstitial integrity and (2) impaired lymphatic integrity causing poor interstitial fluid drainage. The ECM is a highly dynamic structure in which components are continuously synthesized, degraded and regenerated 75. This potentially explains the resolution of oedema despite minimal increase in serum albumin concentrations. Hence, targeting restoration of ECM during treatment could help rapidly restore interstitial rigidity and lymphatic integrity allowing the drainage of interstitially displaced fluids back to circulation.
Methods
Overall study design
This study comprised of two separate nested case-control studies formed from a sub-selection of children with either kwashiorkor or marasmus from two clinical trials in Malawi and Kenya, as further described below. A hypothesis generating discovery cohort was used to explore albumin-independent mechanisms, which were then validated using the second cohort.
Study population and setting
Discovery cohort
The discovery cohort was nested within a randomised controlled trial (NCT02246296) that aimed at determining the effect of a lactose-free, low-carbohydrate F75 milk formulated to limit carbohydrate malabsorption, diarrhoea and refeeding syndrome among children hospitalized for complicated SM in Queen Elizabeth Central Hospital in Malawi, and Kilifi County Hospital and Coast General Teaching and Referral Hospital in Kenya 32. The trial enrolled children aged 6 months to 13 years at admission to hospital if they had complicated SM, defined as: mid-upper arm circumference (MUAC) < 11.5 cm or weight-for-height Z score < −3 if younger than 5 years of age, BMI Z score < −3 if older than 5 years, or oedematous malnutrition at any age. The children were admitted to hospital because of medical complications or failed an appetite test (8/843, 0.9%) as defined by WHO guidelines 76. Children were excluded if they had a known allergy to milk products or did not provide consent. The primary outcome of the trial was the time to initial stabilization, defined as having reached the ‘transition’ phase of treatment and switched to a standard higher caloric feed based on WHO guidelines. Biological samples for research including serum and plasma samples were collected upon admission but before randomization and stored at -80°C until analysis. For the trial, biochemical tests were performed to determine serum albumin concentration. Clinical findings were also recorded such as presence of shock, pneumonia, malaria, heart disease, cerebral palsy and diarrhoea, as well as breastfeeding. The trial recruited a total of 843 children of which 8.9% died prior to stabilization while another 6.2% died after the first stabilization 32.
Validation cohort
The validation cohort was nested within a randomised controlled trial (NCT00934492) that tested the efficacy of daily co-trimoxazole prophylaxis in reducing post-discharge mortality among HIV-uninfected children aged 60 days to 59 months admitted to hospital and diagnosed with SM in four hospitals in Kenya (two rural hospitals in Kilifi and Malindi, and two urban hospitals in Mombasa and Nairobi)) 33. Children were eligible for inclusion in the trial on the basis of the mid-upper-arm circumference (MUAC) measurements (<11·5 cm for children aged ≥6 months and <11·0 cm for infants aged 2–5 months) or presence of kwashiorkor; had a negative HIV rapid-antibody test; and had completed the stabilisation phase of treatment. Children were recruited into the trial for a median of 6 days from admission to the hospitals. Children were actively followed up for a total of 1 year, monthly in the first 6 months and every 2 months until month 12 for growth, readmission or death and traced at home if they defaulted. Samples were stored at -80°C until analysis.
Variables and data source/measurement
The presence of oedema, which was evaluated by trained research clinical staff. Kwashiorkor was diagnosed based on the presence of oedema regardless of concurrent wasting. Children without nutritional oedema and with either mid-upper arm circumference <11.5cm (or <11cm if age <6 months) or weight-for-length/height (WFL/H) < -3 were considered as marasmus.
Data sources and management
Clinical data was obtained from two independent clinical trials 32, 33, as above.
Study size
Of the 843 study children recruited in the F75 reformulation clinical trial, 46% (385) had grade one (+, n=67), grade two (++, n=113), and grade three (+++, n=29) nutritional oedema at admission. For this study, children with nutritional oedema (n=72; 19%) and with known serum albumin concentrations was selected as the discovery cohort. A total of 181 (21%) had missing albumin concentration at admission. Hence, for the discovery cohort, children with kwashiorkor were matched on serum albumin concentrations to those with marasmus (n=72; 16%). Sample size was limited by finding exact matches of serum albumin concentrations between SM phenotypes and hence all matched case-control pairs were included.
The sample size calculation for the validation cohort was based on the results of the discovery cohort. Based on results for lumican (proteomics) and PC.ae.C34:3 (metabolomics), we calculated that a sample size of 40 per group would be sufficient to achieve >80% power at α = 0.05, accounting for stratification based on oedema severity and multiple testing. Subjects for the validation cohort were selected if they had achieved total nutritional and clinical rehabilitation (defined as having a MUAC >12.5 cm, absence of oedema and/or disease needing hospitalization) at day 60 post-hospital discharge. Selection was also limited to children who had sufficient plasma samples at enrolment and at month 2 of follow-up. Kwashiorkor (n=40) were matched to marasmus (n=40) based on age, sex, and site of recruitment and randomisation arm in the trial.
Laboratory analyses
Untargeted plasma proteomics analysis
Liquid chromatography tandem mass spectrometry plasma proteomics analysis was performed for the discovery cohort using the plasma samples collected at enrolment during admission. Briefly, plasma proteomics was performed using Tandem Mass Tag (TMT; Thermo Scientific) as described in our previous study 77. Plasma samples were depleted of abundant proteins using spin columns (Thermo Scientific) then reduced and alkylated respectively with 40mM tris(2-carboxyethyl)phosphine and 80mM iodoacetamide. The proteins were subsequently precipitated using pre-chilled (-20°C) acetone followed by centrifugation at 8,000g for 10 min at 4°C. Precipitated proteins were then subjected to trypsin digestion (1:15 trypsin:sample ratio) and labelled with TMT 10plex kit (Thermo Scientific) according to manufacturer’s instructions. The TMT-tagged peptides generated were then separated on the Dionex Ultimate 3000 nano-flow ultra-high-pressure liquid chromatography system (Thermo Scientific) with a 75 µm × 25 cm C18 reverse-phase analytical column (Thermo Scientific) at 40 °C. Elution was carried out with mobile phase B (80% acetonitrile with 0.1% formic acid) gradient (2 to 35% B) over 310 min at a flow rate of 0.3 μl/min. The chromatographic outflow was connected to a Q Exactive Orbitrap Mass Spectrometer (Thermo Scientific) via a nano-electrospray ion source. Further details of the chromatographic and mass spectrometry parameters were as previously described by Njunge, et al. 77.
Mass spectrometer raw files were analysed by MaxQuant software version 1.6.0.1 78 and peptide spectra were searched against the human Uniprot FASTA database using the Andromeda search engine 79. Further details on the proteomics dataset extraction and pre-processing were previously in Njunge, et al.77. A complete list of all annotated proteins is provided in Supplemental Table S1.
Targeted plasma metabolomics analysis
Plasma metabolomics analysis was performed for admission samples only in the discovery cohort using both direct flow injection and reverse-phase liquid chromatography coupled to tandem mass spectrometry (MS/MS) using Prime Platform at The Metabolomics Innovation Centre (University of Alberta, Canada). Mass spectrometric analysis was done using an ABI 4000 Q-Trap mass spectrometer (Applied Biosystems/MDS Sciex, CA, USA), which could provide absolute quantifications of up to 187 endogenous serum metabolites. Moreover, a targeted method for analysis of organic acids from serum was also used to quantify 18 organic acids. A complete list of all targeted metabolites is provided in Supplemental Table S1.
Targeted plasma analysis of endothelial glycocalyx components
Plasma levels of Syn1 and HA were performed using quantitative ELISA (Thermo Scientific, MD, USA) following manufacturer’s instructions at admission for the discovery cohort, and at admission and 60 days post-discharge for the validation cohort.
Multiplex immunochemical analysis
Magnetic bead-based multiplex assay performed in a Luminex® platform (R&D Systems, MN, USA) were used to quantify plasma concentration of lumican, MMP2, TIMP1, TIMP2. These proteins were assayed at admission for the discovery cohort, and at admission and 60 days post-discharge for the validation cohort. Further, cytokine and chemokines (n = 29) concentration in plasma at admission and 60 days post-discharge for the validation cohort were determined by using a human cytokine magnetic bead assay (EMD Millipore) on the Magpix with Xponent software (version 4.2; Luminex Corp) and acquired Median Fluorescent Intensity data analysed using the Milliplex analyst software (version 3.5.5.0 standard). Levels of CXCL-13, MMP3, 8, 13, and TGF-β were also measured but their concentrations were too low to be detected in most of the samples.
Data Preprocessing
For proteomics, columns containing the protein identifiers (IDs), protein names, gene names, and corrected reporter ion intensity in the protein group matrix file from MaxQuant were obtained. Data pre-processing included removing features with more the 20% missing values. The dataset was then log transformed and batch corrected using using ComBat function as implemented in sva R package 80. Missing values were then imputed using an imputation algorithm based on k-nearest neighbour.
For metabolomics, metabolites with more than 20% missing values in both SM phenotype groups were removed before analysis. Then, metabolites with concentrations below the limit of detection (LOD) for each metabolite were set as half the LOD. Lastly, only metabolites that have <30% coefficient of variation among the quality control samples were retained for further data analysis. Both proteomics and metabolomics data were log transformed prior to analysis.
Data analysis
Data analyses were all performed using R v 3.6 81. Baseline patient characteristics are provided as either mean ± standard deviation (SD), median (25 and 75th percentile) or proportions, as applicable. For the discovery cohort, difference in exposures (untargeted proteome and targeted metabolite levels, Syn1, HA, lumican, MMP2, TIMP1 and TIMP2, and a panel of 29 cytokines and chemokines) between marasmus and kwashiorkor were analysed using conditional logistic regression adjusted for age, sex, HIV status and recruitment site, to account for the sparseness introduced by exactly matching by serum albumin. To assess the association between increasing oedema severity and plasma/serum levels of glycocalyx components, individual protein and metabolite levels, we used an ordinal regression with age, sex, HIV status, recruitment site and serum albumin as additional covariates. High MUAC signifies the absence of wasting but also increases with oedema in kwashiorkor. Hence, no adjustment for MUAC was made in the models as this would obscure the interpretation of the results. Longitudinal analyses were performed using linear mixed models with the individual subjects set as random effect. Correction for multiple testing was performed using Benjamini-Hochberg false-discovery rate method 82.
Multi-omics weighted co-expression network analysis (WCNA) was then performed using the WGCNA R package 83. WCNA, is a data-driven network approach that is used to find clusters, known as modules, of tightly correlated features that can then be used to assess associations towards a specific outcome83. Understanding which modules relate to clinical outcomes and determining pathways involving features that comprise the modules enables us to uncover molecular pathways that could be associated to the outcome of interest. After pre-processing and combining both metabolomics and proteomics datasets, a soft threshold for network construction needed to achieve a scale-free topography typical of biological networks (r² ≳ 0.8)35 was determined. Scale-free topography for our data was achieved using β = 18 for an signed network. A Pearson correlation (sij) matrix was then generated between each multi-omics pairs (i and j) which was transformed into an adjacency matrix through the power transformation, aij = |sij|β. This power transformation punishes weak correlations while amplifying strong correlations. Using hierarchical clustering embedded with the WGCNA package, co-expressed metabolites and proteins are clustered into modules. Each member of the module is characterized by an eigenvector (E(q), where (q) denotes the module) through a singular value decomposition. The E(q) represents the collective behaviour of the particular module35. To determine which modules are associated with oedematous SAM, a conditional logistic regression was used with E(q) as independent variable adjusted for age, sex, HIV status and site of recruitment stratified by admission serum albumin concentration.
For protein features, the Gene ontology (GO) enriched biological processes (BP) of differentially expressed proteins was determined using The Database for Annotation, Visualization and Integrated Discovery (DAVID) v6.8 Bioinformatics Resource 84. Homo sapiens was used as background for enrichment calculation.
Data availability and access statement
The processed data and codes (STATA and R) will be deposited in the KEMRI-Wellcome data repository on the Harvard Dataverse under the Biosciences Dataverse subtheme ( and issued with Digital Object Identifiers (DOI) at the time of deposit. The data will be titled “Albumin-dependent and independent mechanisms in the syndrome of kwashiorkor”. The anonymised mass spectrometry raw files generated and analysed in the current study will be deposited to The ProteomeXchange Consortium: and assigned a unique identifier.
Data Availability
The processed data and codes (STATA and R) will be deposited in the KEMRI-Wellcome data repository on the Harvard Dataverse under the Biosciences Dataverse subtheme ( and issued with Digital Object Identifiers (DOI) at the time of deposit. The data will be titled: Albumin-dependent and independent mechanisms in the syndrome of kwashiorkor. The anonymised mass spectrometry raw files generated and analysed in the current study will be deposited to The ProteomeXchange Consortium: and assigned a unique identifier.
Approvals
The F75 reformulation trial was approved by KEMRI Ethical Review Committee (SCC 2799), College of Medicine Research Ethics Boards of the University of Malawi (P.03/14/1540), Oxford Tropical Research Ethics Committee (OXTREC 58–14) and the Hospital for Sick Children Research Ethics Board, Toronto (1000046559), including the secondary analysis in this manuscript. The co-trimoxazole trials was approved by Kenya National Ethical Review Committee (SSC 1562) and Oxford Tropical Research Ethics Committee (reference number 18-09), including the secondary analysis in this manuscript. This paper is published with the permission of the Director of the Kenya Medical Research Institute.
Differences in plasma concentration of tryptophan downstream metabolites between kwashiorkor and marasmus
Individual protein and metabolite associations with kwashiorkor
Membership of proteins and metabolites to modules in the weighted correlation network analysis
Acknowledgement
We thank the parents and guardians of the study participants who patiently participated in in both clinical trials in Malawi and Kenya. We acknowledge the enthusiastic work of our nurses, field workers, clinical and non-clinical staff who tirelessly collected the data and samples and provided administrative support to the project.
GBG was a postdoctoral fellow of the Research Foundation Flanders (FWO) and received financial support from the Thrasher Foundation Early Career Award (15122) and VLIR-UOS-Ghent University Global Minds Fund. JMN, MN, IP, JT, WV, RB, and JAB received support from CHAIN: Bill & Melinda Gates Foundation (OPP1131320). JAB is also supported by MRC/DfID/Wellcome Trust Global Health Trials Scheme (MR/M007367/1). The F75 reformulation trial was funded by Thrasher Research Fund (9403) while the co-trimoxazole trial was funded by the Wellcome Trust (WT083579MA), both awarded to JAB.
References
View the discussion thread.
Thank you for your interest in spreading the word about medRxiv.
NOTE: Your email address is requested solely to identify you as the sender of this article.
Citation Manager Formats
Subject Area |
14125 | https://com-advantage.com/old_site/blp_early/derivative.pdf | 1 Introduction Development of Atomic Theory Bohr Theory Schrödinger Theory The Wave-Particle Duality is Not Due to the Uncertainty Principle The Correspondence Principle Does Not Hold Identification of Lower-Energy Hydrogen by Soft X-rays from Dark Interstellar Medium The Hydrogen Atom Revisited Randell L. Mills BlackLight Power, Inc.
493 Old Trenton Road Cranbury, NJ 08512 Several myths about quantum mechanics exist due to a loss of awareness of its details since its inception in the beginning of the last century or based on recent experimental evidence. It is taught in textbooks that atomic hydrogen cannot go below the ground state. Atomic hydrogen having an experimental ground state of 13.6 eV can only exist in a vacuum or in isolation, and atomic hydrogen cannot go below this ground state in isolation. However, there is no known composition of matter containing hydrogen in the ground state of 13.6 eV. It is a myth that hydrogen has a theoretical ground state based on first principles. Historically there were many directions in which to proceed to solve a wave equation for hydrogen. The Schrödinger equation gives the observed spontaneously radiative states and the nonradiative energy level of atomic hydrogen. On this basis alone, it is justified despite its inconsistency with physical laws as well as with many experiments.
A solution compatible with first principles and having first principles as the basis of quantization was never found. Scattering results required the solution to be interpreted as probability waves that give rise to the uncertainty principle which in turn forms the basis of the wave particle duality. The correspondence principal predicts that quantum predictions must approach classical predictions on a large scale. However, recent data has shown that the Heisenberg uncertainty principle as the basis of the wave particle duality and the correspondence principle taught in textbooks are experimentally incorrect. Recently, a reconsideration of the postulates of quantum mechanics, has given rise to a closed form solution of a Schrödinger -like wave equation based on first principles. Hydrogen at predicted lower energy levels has been identified in the extreme ultraviolet emission spectrum from interstellar medium. In addition, new compositions of matter containing hydrogen at predicted lower energy levels have recently been observed in the laboratory, which energy levels are achieved using the novel catalysts.
B l a c k l i g h t H o m e T e c h n i c a l P a p e r s Tables 1&3 Table 2– (different document) The Data And Its Interpretation Novel Energy States of Hydrogen Formed by a Catalytic Reaction Discussion References 2 INTRODUCTION J. J. Balmer showed, in 1885, that the frequencies for some of the lines observed in the emission spectrum of atomic hydrogen could be expressed with a completely empirical relationship. This approach was later extended by J. R. Rydberg, who showed that all of the spectral lines of atomic hydrogen were given by the equation: ν = R 1 nf 2 −1 ni 2 (1) where R = 109,677 cm−1, nf = 1,2,3,..., ni = 2,3,4,..., and ni > nf . Niels Bohr, in 1913, developed a theory for atomic hydrogen based on an unprecedented postulate of stable circular orbits that do not radiate. Although no explanation was offered for the existence of stability for these orbits, the results gave energy levels in agreement with Rydberg's equation.
E e n a eV n n o H = − = − 2 2 2 8 13 598 πε . (2) n = 1,2,3,...
(3) where aH is the Bohr radius for the hydrogen atom (52.947 pm), e is the magnitude of the charge of the electron, and εo is the vacuum permittivity. Bohr's theory was a straightforward application of Newton's laws of motion and Coulomb's law of electric force - both pillars of classical physics and is in accord with the experimental observation that atoms are stable. However, it is not in accord with electromagnetic theory - another pillar of classical physics which predicts that accelerated charges radiate energy in the form of electromagnetic waves. An electron pursuing a curved path is accelerated and therefore should continuously lose energy, spiraling into the nucleus in a fraction of a second. The predictions of electromagnetic theory have always agreed with experiment, yet atoms do not collapse. To the early 20th century theoreticians, this contradiction could mean only one thing: The laws of physics that are valid in the macroworld do not hold true in the microworld of the atom. In 1923, de Broglie suggested that the motion of an electron has a wave aspect— λ = h p . This concept seemed unlikely according to the familiar properties of electrons such as charge, mass and adherence to the laws of particle mechanics. But, the wave nature of the electron was confirmed by Davisson and Germer in 1927 by observing diffraction effects when electrons were reflected from metals. Schrödinger reasoned that if electrons have wave properties, there must be a wave equation that governs their motion.
And in 1926, he proposed the Schrödinger equation, HΨ = EΨ, where Ψ is the wave function, H is the wave operator, and E is the energy of the wave. This equation, and its associated postulates, is now the basis of quantum mechanics, and it is the basis for the world view that the atomic realm including the electron and photon cannot be described in terms of "pure" wave and "pure" particle but in terms of a wave-particle duality. The wave-3 particle duality based on the fundamental principle that physics on an atomic scale is very different from physics on a macroscopic scale is central to present day atomic theory .
top Development of Atomic Theory Bohr Theory In 1911, Rutherford proposed a planetary model for the atom where the electrons revolved about the nucleus (which contained the protons) in various orbits to explain the spectral lines of atomic hydrogen. There was, however, a fundamental conflict with this model and the prevailing classical physics. According to classical electromagnetic theory, an accelerated particle radiates energy (as electromagnetic waves). Thus, an electron in a Rutherford orbit, circulating at constant speed but with a continually changing direction of its velocity vector is being accelerated; thus, the electron should constantly lose energy by radiating and spiral into the nucleus.
An explanation was provided by Bohr in 1913, when he assumed that the energy levels were quantized and the electron was constrained to move in only one of a number of allowed states. Niels Bohr's theory for atomic hydrogen was based on an unprecedented postulate of stable circular orbits that do not radiate. Although no explanation was offered for the existence of stability for these orbits, the results gave energy levels in agreement with Rydberg's equation.
Bohr's theory was a straightforward application of Newton's laws of motion and Coulomb's law of electric force. According to Bohr's model, the point particle electron was held to a circular orbit about the relatively massive point particle nucleus by the balance between the coulombic force of attraction between the proton and the electron and centrifugal force of the electron.
e2 4πε0r2 = mev2 r (4) Bohr postulated the existence of stable orbits in defiance of classical physics (Maxwell's Equations), but he applied classical physics according to Eq. (4). Then Bohr realized that the energy formula Eqs. (2-3) was given by postulating nonradiative states with angular momentum Lz = mevr = nh n = 1,2,3...
(5) and by solving the energy equation classically. The Bohr radius is given by substituting the solution of Eq. (5) for v into Eq. (4). r = 4πε0h2n2 mee2 = n2a0 n = 1,2,3...
(6) The total energy is the sum of the potential energy and the kinetic energy. In the present case of an inverse squared central field, the total energy (which is the negative of the binding energy) is one half the potential energy . The potential energy, φ r ( ), is given by Poisson's equation φ r ( ) = ρ r' ( )dv' 4πε0 r −r' V ' ∫ (7) 4 For a point charge at a distance r from the nucleus the potential is φ r ( ) = − e2 4πε0r (8) Thus, the total energy is given by E = −Z 2e2 8πεor (9) Substitution of Eq. (6) into Eq.(9) with the replacement of the electron mass by the reduced electron mass gives Eqs. (2-3).
Bohr’s model was in agreement with the observed hydrogen spectrum, but it failed with the helium spectrum, and it could not account for chemical bonds in molecules. The prevailing wisdom was that the Bohr model failed because it was based on the application of Newtonian mechanics for discrete particles. And, its limited applicability was attributed to the unwarranted assumption that the energy levels are quantized.
Bohr's theory may also be analyzed according to the corresponding energy equation.
Newton's differential equations of motion in the case of the central field such as a gravitational or electrostatic field are m(˙˙ r −r ˙ θ 2) = f(r) (10) m r r ( ˙ ˙ ˙˙) 2 0 θ θ + = (11) where f( ) r is the central force. The second or transverse equation, Eq. (11), gives the result that the angular momentum is constant.
r2 ˙ θ = constant = L / m (12) where L is the angular momentum. The central force equations can be transformed into an orbital equation by the substitution, u = 1 r . The differential equation of the orbit of a particle moving under a central force is δ 2u δθ 2 + u = −1 mL2u2 m2 f (u−1) (13) Because the angular momentum is constant, motion in only one plane need be considered; thus, the orbital equation is given in polar coordinates. The solution of Eq. (13) for an inverse square force f(r) = −k r2 (14) is r = r0 1+ e 1+ ecosθ (15) e = A m L2 m2 k (16) 5 r0 = m L2 m2 k(1+ e) (17) where e is the eccentricity and A is a constant. The equation of motion due to a central force can also be expressed in terms of the energies of the orbit. The square of the speed in polar coordinates is v2 = (˙ r2 + r2 ˙ θ 2) (18) Since a central force is conservative, the total energy, E, is equal to the sum of the kinetic, T, and the potential, V , and is constant. The total energy is 1 2 m(˙ r2 + r2 ˙ θ 2) + V(r) = E = constant (19) Substitution of the variable u = 1 r and Eq. (12) into Eq. (19) gives the orbital energy equation.
1 2 m L2 m2 [( δ 2u δθ 2 ) + u2]+ V(u-1) = E (20) Because the potential energy function V(r) for an inverse square force field is V(r) = - k r = -ku (21) the energy equation of the orbit, Eq. (20), is 1 2 2 2 2 2 2 m L m u u ku E [( ) ] δ δθ + − = (22) δ δθ 2 2 2 2 2 0 u u m L E ku + − + [ ] = (23) which has the solution r = m L2 m2 k-1 1+[1+ 2Em L2 m2 k-2]1/2 cosθ (24) where the eccentricity, e, is e = [1+ 2Em L2 m2 k −2]1/2 (25) Eq. (25) permits the classification of the orbits according to the total energy, E, as follows: E < 0, e < 1 ellipse E e < = 0 0 , circle (special case of ellipse) E = 0, e = 1 parabolic orbit E > 0, e > 1 hyperbolic orbit (26) 6 Since E = T + V and is constant, the closed orbits are those for which T <|V|, and the open orbits are those for which T ≥|V|. It can be shown that the time average of the kinetic energy, < T >, for elliptic motion in an inverse square field is 1 / 2 that of the time average of the potential energy, < V >. < T >= 1 / 2 < V >.
Bohr's solution is trivial in that he specified a circular bound orbit which determined that the eccentricity was zero, and he specified the angular momentum as a integer multiple of Planck's constant bar. Eq. (25) in CGS units becomes E me n e n a = − = − 1 2 2 4 2 2 2 2 0 h (27) Top Schrödinger Theory In 1923, de Broglie suggested that the motion of an electron has a wave aspect— λ = h p .
This was confirmed by Davisson and Germer in 1927 by observing diffraction effects when electrons were reflected from metals. Schrödinger reasoned that if electrons have wave properties, there must be a wave equation that governs their motion. And, in 1926, he proposed the Schrödinger equation HΨ = EΨ (28) where Ψ is the wave function, H is the wave operator, and E is the energy of the wave. To give the sought three quantum numbers, the Schrödinger equation solutions are three dimensional in space and four dimensional in spacetime ∇2−1 v2 δ 2 δt2 Ψ(r,θ,φ,t) = 0 (29) where Ψ(r,θ,φ,t) according to quantum theory is the probability density function of the electron as described below. When the time harmonic function is eliminated , − + + + ( ) ( ) = ( ) h2 2 2 2 2 2 2 2 2 1 1 1 µ δ δ δ δ θ δ δθ θ δ δθ θ δ δφ θ φ θ φ φ θ r r r r r r V r r E r r r Ψ Ψ Ψ Ψ Ψ sin sin sin , , , , , , (30) where the potential energy V r ( ) is V r e r ( ) = − 2 0 4πε (31) The Schrödinger equation (Eq. (30)) can be transformed into a sum comprising a part that depends only on the radius and a part that is a function of angle only. The general form of the solutions for ψ r,θ,φ ( ) are ψ θ φ θ φ r f r Y nlm l m lm , , , , ( ) = ( ) ( ) ∑ (32) The angular part of Eq. (30) is the generalized Legendre equation which is derived from the Laplace equation by Jackson (Eq. (3.9) of Jackson ). The solutions for the angular part of Eq.
(30), Ylm θ,φ ( ), obtained by separation of variables are the spherical harmonics 7 Ylm θ,φ ( ) = 2l +1 ( ) l −m ( )!
4π l + m ( )!
Pl m cosθ ( )eimφ (33) By substitution of the eigenvalues corresponding to the angular part , the Schrödinger equation becomes the radial equation, R r ( ), given by − + + ( ) + ( ) ( ) = ( ) h h 2 2 2 2 2 2 1 2 mr d dr r dR dr l l mr V r R r ER r (34) The Schrödinger equation is similar to Eq. (19) except that the solution is for motion of a particle moving in three dimensions rather than a one dimensional particle. In the former case, the kinetic energy of rotation is Krot given classically by K mr rot = 1 2 2 2 ω (35) where m is the mass of the electron. In the latter case, the kinetic energy of rotation Krot is given by K mr rot = + ( ) l l h 1 2 2 2 (36) where L = + ( ) l l h 1 2 (37) is the value of the electron angular momentum L for the state Y lm θ φ , ( ).
In the case of the ground state of hydrogen, the Schrödinger equation solution is trivial for an implicit circular bound orbit which determines that the eccentricity is zero, and with the specification that the electron angular momentum is Planck's constant bar. Eq. (25) in CGS units becomes E me e a = − = − 1 2 2 4 2 2 0 h (38) Many problems in classical physics give three quantum numbers when three spatial dimensions are considered. The Schrödinger equation requires that the solution is for motion of a particle moving in three dimensions rather than a one dimensional particle in order to obtain three quantum numbers as shown below. However, this approach gives rise to predictions about the angular momentum and angular energy which are not consistent with experimental observations as well as a host of other problems which are summarized in the Discussion Section.
The radial equation may be written as d dr r dR dr mr E V r l l mr R r 2 2 2 2 2 2 1 2 0 + − ( ) − + ( ) ( ) = h h (39) Let U r rR r ( ) = ( ), then the radial equation reduces to ′′ + − ( ) − + ( ) = U mr E V r l l mr U 2 1 2 0 2 2 2 2 h h (40) where ψ θ φ = ( ) ( ) 1 r U r Y lm lm , (41) Substitution of the potential energy given by Eq. (31) into Eq. (40) gives for sufficiently large r 8 ′′ − = U U α 2 0 2 (42) provided we define α 2 2 2 2 = −mE h (43) where α is the eigenvalue of the eigenfunction solution of the Schrödinger equation given infra having units of reciprocal length and E is the energy levels of the hydrogen atom. To arrive at the solution which represents the electron, a suitable boundary condition must be imposed.
Schrödinger postulated a boundary condition: Ψ →0 as r →∞, which leads to a purely mathematical model of the electron. This equation is not based on first principles, has no validity as such, and should not be represent as so. Eq. (43) must be postulated in order that the Rydberg equation is obtained as shown below. It could be defined arbitrarily, but is justified because it gives the Rydberg formula. That Schrödinger guessed the accepted approach is not surprising since many approaches were contemplated at this time , and since none of these approaches were superior, Schrödinger's approach prevailed.
The solution of Eq. (42) that is consistent with the boundary condition is U c e c e r r ∞ ( ) −( ) = + 1 2 2 2 α α / / (44) In the case that α is real, the energy of the particle is negative. In this case U will not have an integrable square if c1 fails to vanish wherein the radial integral has the form R r dr U dr 2 2 0 2 ∞ ∫ ∫ = (45) It is shown below that the solution of the Schrödinger corresponds to the case wherein c1 fails to vanish. Thus, the solutions with sufficiently large r are infinite. The same problem arises in the case of a free electron that is ionized from hydrogen. If α is imaginary, which means that E is positive, Eq. (42) is the equation of a linear harmonic oscillator . U∞ shows sinusoidal behavior; thus, the wavefunction for the free electron can not be normalized and is infinite. In addition, the angular momentum of the free electron is infinite since it is given by l l h + ( ) 1 2 (Eq.
(37)) where l →∞.
In order to solve the bound electron states, let E W = − (46) so that W is positive. In Eq. (39), let r x = /α where α is given by Eq. (43). x d R dx dR dx me x l l x R 2 2 2 2 2 2 4 1 0 + + − − + ( ) = h α (47) Eq. (47) is the differential equation for associated Laguerre functions given in general form by xy y n k x k x y ′′ + ′ + − − − − − = 2 1 2 4 1 4 0 2 (48) which has a solution possessing an integrable square of the form y e x L x x k n k = ( ) − − ( ) / / 2 1 2 (49) 9 provided that n and k are positive integers. However, n does not have to be an integer, it may be any arbitrary constant α . Then the corresponding solution is y e x d dx L x x k k k = ( ) − − ( ) / / 2 1 2 α (50) In the case that n is chosen to be an integer in order to obtain the Rydberg formula, n k −≥0 since otherwise L x n k ( ) of Eq. (49) would vanish. By comparing Eq. (47) and Eq. (48), k x 2 1 4 1 − = + ( ) l l (51) Thus, k = + 2 1 l (52) and n k n me − − = −= − 1 2 2 2 1 l h α (53) Substitution of the value of α and solving for W gives W me n = − ( ) 1 2 4 2 2 l h (54) Because of the conditions on n and k , the quantity n −l can not be zero. It is usually denoted by n and called the principle quantum. The energy states of the hydrogen atom are W E me n n n = − = 1 2 4 2 2 h (55) and the corresponding eigenfunctions from Eq. (49) are R c e x L x n n x n , , / l l l l l = ( ) − + + 2 2 1 (56) where the variable x is defined by x r mW r me n r = = = α 8 2 2 2 h h (57) In the Bohr theory of the hydrogen atom, the first orbital has a radius in CGS units given by a me X cm 0 2 2 8 0 53 10 = = − h . (58) Thus, α = 2 0 / na and x n r a = 2 0 (59) The energy states of the hydrogen atom in CGS units in terms of the Bohr radius are given by Eq. (27). From Eq. (56), Rn,l for the hydrogen atom ground state is R c e L a e r a r a 1 0 1 0 1 1 0 3 2 0 0 2 , , / / / = = − − − (60) For this state Y cons t l = = ( ) − tan / 4 1 2 π (61) when the function is normalized. Thus, the ground state function is ψ π 0 0 3 1 2 0 = ( ) − − a e r a / / (62) Immediately further problems arise. Since l must equal zero in the ground state, the predicted angular energy and angular momentum given by Eq. (36) and Eq. (37), respectively, are zero 10 which are experimentally incorrect. In addition, different integer values of l exist in the case of excited electron states. In these cases, the Schrödinger equation solutions, Eq. (36) and Eq. (37), predict that the excited state energy levels are nondegenerate as a function of the l quantum number even in the absence of an applied magnetic field. Consider the case of the excited state with n = = 2 1 ; l compared to the experimentally degenerate state n = = 2 0 ; l . According to Eq.
(37) the difference in angular energy of these two states is 3 4 . eV where the expectation radius, 4 0 a , is given by the squared integral of Eq. (70) over space. Thus, the predicted energy in the absence of a magnetic field is over six orders of magnitude of the observed nondegenerate energy (10 10 7 6 − − − eV ) in the presence of a magnetic field.
Schrödinger realized that his equation was limited. It is not Lorentzian invariant; thus, it violates special relativity. It also does not comply with Maxwell's equations and other first principle laws. Schrödinger sought a resolution of the incompatibility with special relativity for the rest of his life. He was deeply troubled by the physical consequences of his equation and its solutions. His hope was that the resolution would make his equation fully compatible with classical physics and the quantization would arise from first principles.
Quantum mechanics failed to predict the results of the Stern-Gerlach experiment which indicated the need for an additional quantum number. Quantum electrodynamics was proposed by Dirac in 1926 to provide a generalization of quantum mechanics for high energies in conformity with the theory of special relativity and to provide a consistent treatment of the interaction of matter with radiation. From Weisskopf , "Dirac's quantum electrodynamics gave a more consistent derivation of the results of the correspondence principle, but it also brought about a number of new and serious difficulties." Quantum electrodynamics; 1.) does not explain nonradiation of bound electrons; 2.) contains an internal inconsistency with special relativity regarding the classical electron radius - the electron mass corresponding to its electric energy is infinite; 3.) it admits solutions of negative rest mass and negative kinetic energy; 4.) the interaction of the electron with the predicted zero-point field fluctuations leads to infinite kinetic energy and infinite electron mass; 5.) Dirac used the unacceptable states of negative mass for the description of the vacuum; yet, infinities still arise.
A physical interpretation of Eq. (28) was sought. Schrödinger interpreted eΨ (x)Ψ(x) as the charge-density or the amount of charge between x and x + dx ( Ψ is the complex conjugate of Ψ). Presumably, then, he pictured the electron to be spread over large regions of space. Three years after Schrödinger’s interpretation, Max Born, who was working with scattering theory, found that this interpretation led to logical difficulties, and he replaced the Schrödinger interpretation with the probability of finding the electron between x and x + dx as Ψ(x)Ψ (x)dx ∫ (63) Born’s interpretation is generally accepted. Nonetheless, interpretation of the wave function is a never-ending source of confusion and conflict. Many scientists have solved this problem by conveniently adopting the Schrödinger interpretation for some problems and the Born 11 interpretation for others. This duality allows the electron to be everywhere at one time—yet have no volume. Alternatively, the electron can be viewed as a discrete particle that moves here and there (from r = 0 to r = ∞), and ΨΨ gives the time average of this motion.
Schrödinger was also troubled by the philosophical consequences of his theory since quantum mechanics leads to certain philosophical interpretations which are not sensible.
Some conjure up multitudes of universes including "mind" universes; others require belief in a logic that allows two contradictory statements to be true. The question addressed is whether the universe is determined or influenced by the possibility of our being conscious of it. The meaning of quantum mechanics is debated, but the Copenhagen interpretation is predominant. Its asserts that "what we observe is all we can know; any speculation about what a photon, an atom, or even a SQUID (Superconducting Quantum Interference Device) really is or what it is doing when we are not looking is just that speculation" . As shown by Platt in the case of the Stern-Gerlach experiment, "the postulate of quantum measurement [which] asserts that the process of measuring an observable forces the state vector of the system into an eigenvector of that observable, and the value measured will be the eigenvalue of that eigenvector". According to this interpretation every observable exists in a state of superposition of possible states, and observation or the potential for knowledge causes the wavefunction corresponding to the possibilities to collapse into a definite.
According to the quantum mechanical view, a moving particle is regarded as a wave group.
To regard a moving particle as a wave group implies that there are fundamental limits to the accuracy with which such "particle" properties as position and momentum can be measured.
Quantum predicts that the particle may be located anywhere within its wave group with a probability Ψ 2. An isolated wave group is the result of superposing an infinite number of waves with different wavelengths. The narrower the wave group, the greater range of wavelengths involved. A narrow de Broglie wave group thus means a well-defined position ( ∆x smaller) but a poorly defined wavelength and a large uncertainty ∆p in the momentum of the particle the group represents. A wide wave group means a more precise momentum but a less precise position. The infamous Heisenberg uncertainty principle is a formal statement of the standard deviations of properties implicit in the probability model of fundamental particles. ∆x∆p ≥h 2 (64) According to the standard interpretation of quantum mechanics, the act of measuring the position or momentum of a quantum mechanical entity collapses the wave-particle duality because the principle forbids both quantities to be simultaneously known with precision.
Top The Wave-Particle Duality is Not Due to the Uncertainty Principle Quantum entities can behave like particles or waves, depending on how they are observed.
They can be diffracted and produce interference patterns (wave behavior) when they are allowed to take different paths from some source to a detector--in the usual example, electrons or photons go through two slits and form an interference pattern on the screen behind. On the other hand, 12 with an appropriate detector put along one of the paths (at a slit, say), the quantum entities can be detected at a particular place and time, as if they are point-like particles. But any attempt to determine which path is taken by a quantum object destroys the interference pattern. Richard Feynman described this as the central mystery of quantum physics.
Bohr called this vague principle 'complementary', and explained it in terms of the uncertainty principle, put forward by Werner Heisenberg, his postdoc at the time. In an attempt to persuade Einstein that wave-particle duality is an essential part of quantum mechanics, Bohr constructed models of quantum measurements that showed the futility of trying to determine which path was taken by a quantum object in an interference experiment. As soon as enough information is acquired for this determination, the quantum interferences must vanish, said Bohr, because any act of observing will impart uncontrollable momentum kicks to the quantum object.
This is quantified by Heisenberg's uncertainty principle, which relates uncertainty in positional information to uncertainty in momentum--when the position of an entity is constrained, the momentum must be randomized to a certain degree.
More than 60 years after the famous debate between Niels Bohr and Albert Einstein on the nature of quantum reality, a question central to their debate --the nature of quantum interference--has resurfaced. The usual textbook explanation of wave-particle duality in terms of unavoidable 'measurement disturbances' is experimentally proven incorrect by an experiment reported in the September 3, 1998 issue of Nature by Durr, Nonn, and Rempe. Durr, Nonn, and Rempe report on the interference fringes produced when a beam of cold atoms is diffracted by standing waves of light. Their interferometer displayed fringes of high contrast--but when they manipulated the electronic state within the atoms with a microwave field according to which path was taken, the fringes disappeared entirely. The interferometer produced a spatial distribution of electronic populations which were observed via fluorescence. The microwave field canceled the spatial distribution of electronic populations. The key to this new experiment was that although the interferences are destroyed, the initially imposed atomic momentum distribution left an envelope pattern (in which the fringes used to reside) at the detector. A careful analysis of the pattern demonstrated that it had not been measurably distorted by a momentum kick of the type invoked by Bohr, and therefore that any locally realistic momentum kicks imparted by the manipulation of the internal atomic state according to the particular path of the atom are too small to be responsible for destroying interference.
Top The Correspondence Principle Does Not Hold Recent experimental results also dispel another doctrine of quantum mechanics [13, 14]. Bohr proposed a rule of thumb called the correspondence principle . A form of the principle widely repeated in textbooks and lecture halls states that predictions of quantum mechanics and classical physics should match for the most energetic cases.
13 In the Nov. 22 Physical Review Letters , Bo Gao calculates possible energy states of any chilled, two-atom molecule, such as sodium, that's vibrating and rotating almost to the breaking point. He performs the calculations via quantum mechanical and so called semiclassical methods and compares the results. Instead of the results agreeing better for increasingly energetic states. The opposite happens.
Classical Solution of the Schrödinger Equation Mills has solved and published a solution of a Schrödinger type equation based on first principles . The central feature of this theory is that all particles (atomic-size and macroscopic particles) obey the same physical laws. Whereas Schrödinger postulated a boundary condition: Ψ →0 as r →∞, the boundary condition in Mills' theory was derived from Maxwell's equations : For non-radiative states, the current-density function must not possess space-time Fourier components that are synchronous with waves traveling at the speed of light.
Application of this boundary condition leads to a physical model of particles, atoms, molecules, and, in the final analysis, cosmology. The closed-form mathematical solutions contain fundamental constants only, and the calculated values for physical quantities agree with experimental observations. In addition, the theory predicts that Eq. (3), should be replaced by Eq.
(65).
n = 1,2,3,..., and, n = 1 2 ,1 3, 1 4 ,...
(65) Some revisions to standard quantum theory are implied. Quantum mechanics becomes a real physical description as opposed to a purely mathematical model where the old and the revised versions are interchangeable by a Fourier Transform operation .
The theories of Bohr, Schrödinger, and presently Mills all give the identical equation for the principal energy levels of the one electron atom.
E Z e n a Z n X X J Z X n eV ele o H = − = − = − − 2 2 2 2 2 18 2 2 8 2 1786 10 13 598 πε .
.
(66) The Mills theory solves the two dimensional wave equation for the charge density function of the electron. And, the Fourier transform of the charge density function is a solution of the three dimensional wave equation in frequency k,ω ( ) space. Whereas, the Schrödinger equation solutions are three dimensional in spacetime. The energy is given by ψHψ −∞ ∞ ∫ dv = E ψ 2 −∞ ∞ ∫ dv; (67) ψ 2 −∞ ∞ ∫ dv = 1 (68) 14 Thus, ψHψ −∞ ∞ ∫ dv = E (69) In the case that the potential energy of the Hamiltonian, H , is a constant times the wavenumber, the Schrödinger equation is the well known Bessel equation. Then with one of the solutions for ψ , Eq. (69) is equivalent to an inverse Fourier transform. According to the duality and scale change properties of Fourier transforms, the energy equation of the present theory and that of quantum mechanics are identical, the energy of a radial Dirac delta function of radius equal to an integer multiple of the radius of the hydrogen atom (Eq. (66)). And, Bohr obtained the same energy formula by postulating nonradiative states with angular momentum Lz = mh (70) and solving the energy equation classically.
The mathematics for all three theories converge to Eq. (66). However, the physics is quite different. Only the Mills theory is derived from first principles and holds over a scale of spacetime of 45 orders of magnitude: it correctly predicts the nature of the universe from the scale of the quarks to that of the cosmos.
Mills revisions transform Schrödinger's and Heisenberg's quantum theory into what may be termed a classical quantum theory. Physical descriptions flow readily from the theory.
For example, in the old quantum theory the spin angular momentum of the electron is called the "intrinsic angular momentum". This term arises because it is difficult to provide a physical interpretation for the electron's spin angular momentum. Quantum Electrodynamics provides somewhat of a physical interpretation by proposing that the "vacuum" contains fluctuating electric and magnetic fields. In contrast, in Mills' theory, spin angular momentum results from the motion of negatively charged mass moving systematically, and the equation for angular momentum, r × p, can be applied directly to the wave function (a current density function) that describes the electron. And, quantization is carried by the photon, rather than probability waves of the electron.
Top Fractional Quantum Energy Levels of Hydrogen The nonradiative state of atomic hydrogen which is historically called the "ground state" forms the basis of the boundary condition of Mills theory to solve the wave equation. Mills further predicts that certain atoms or ions serve as catalysts to release energy from hydrogen to produce an increased Binding Energy eV n = 13 6 2 .
(71) where n p = 1 2 1 3 1 4 1 , , ,..., (72) and p is an integer greater than 1, designated as H a p H where aH is the radius of the hydrogen atom. (Although it is purely mathematical, these stable energy levels are also given by both Bohr's binding energy hydrogen atom called a hydrino atom having a binding energy of 15 and Schrödinger's theories by multiplication of the central charge by an integer.) Hydrinos are predicted to form by reacting an ordinary hydrogen atom with a catalyst having a net enthalpy of reaction of about m eV ⋅27 2 . (73) where m is an integer. This catalysis releases energy from the hydrogen atom with a commensurate decrease in size of the hydrogen atom, r na n H = . For example, the catalysis of H n ( ) = 1 to H n ( / ) = 1 2 releases 40 8 . eV , and the hydrogen radius decreases from aH to 1 2 aH.
It is taught in textbooks that atomic hydrogen cannot go below the ground state. Atomic hydrogen having an experimental ground state of 13.6 eV can only exist in a vacuum or in isolation, and atomic hydrogen cannot go below this ground state in isolation. However, there is no known composition of matter containing hydrogen in the ground state of 13.6 eV. Atomic hydrogen is radical and is very reactive. It may react to form a hydride ion or compositions of matter. It is a chemical intermediate which may be trapped as many chemical intermediates may be by methods such as isolation or cryogenically. A hydrino atom may be considered a chemical intermediate that may be trapped in vacuum or isolation. A hydrino atom may be very reactive to form a hydride ion or a novel composition of matter. Hydrogen at predicted lower energy levels, hydrino atoms, has been identified in the extreme ultraviolet emission spectrum from interstellar medium. In addition, new compositions of matter containing hydrogen at predicted lower energy levels have recently been observed in the laboratory, which energy levels are achieved using the novel catalysts.
The excited energy states of atomic hydrogen are also given by Eq. (71) except that n = 1 2 3 , , ,...
(74) The n = 1 state is the "ground" state for "pure" photon transitions (the n = 1 state can absorb a photon and go to an excited electronic state, but it cannot release a photon and go to a lower-energy electronic state). However, an electron transition from the ground state to a lower-energy state is possible by a nonradiative energy transfer such as multipole coupling or a resonant collision mechanism. These lower-energy states have fractional quantum numbers, n = 1 integer .
Processes that occur without photons and that require collisions are common. For example, the exothermic chemical reaction of H + H to form H2 does not occur with the emission of a photon. Rather, the reaction requires a collision with a third body, M, to remove the bond energy- H + H + M →H2 + M . The third body distributes the energy from the exothermic reaction, and the end result is the H2 molecule and an increase in the temperature of the system.
Some commercial phosphors are based on nonradiative energy transfer involving multipole coupling . For example, the strong absorption strength of Sb3+ ions along with the efficient nonradiative transfer of excitation from Sb3+ to Mn2+, are responsible for the strong manganese luminescence from phosphors containing these ions. Similarly, the n = 1 state of hydrogen and 16 the n = 1 integer states of hydrogen are nonradiative, but a transition between two nonradiative states is possible via a nonradiative energy transfer, say n = 1 to n = 1 / 2. In these cases, during the transition the electron couples to another electron transition, electron transfer reaction, or inelastic scattering reaction which can absorb the exact amount of energy that must be removed from the hydrogen atom. Thus, a catalyst provides a net positive enthalpy of reaction of m eV ⋅27 2 . (i.e. it absorbs m eV ⋅27 2 . where m is an integer). Certain atoms or ions serve as catalysts which resonantly accept energy from hydrogen atoms and release the energy to the surroundings to effect electronic transitions to fractional quantum energy levels.
Once formed hydrinos have a binding energy given by Eqs. (71-72); thus, they may serve as catalysts which provide a net enthalpy of reaction given by Eq. (73). Also, the simultaneous ionization of two hydrogen atoms may provide a net enthalpy given by Eq. (73). Since the surfaces of stars comprise significant amounts of atomic hydrogen, hydrinos may be formed as a source to interstellar space where further transitions may occur.
A number of experimental observations lead to the conclusion that atomic hydrogen can exist in fractional quantum states that are at lower energies than the traditional "ground" (n = 1) state. For example, the existence of fractional quantum states of hydrogen atoms explains the spectral observations of the extreme ultraviolet background emission from interstellar space , which may characterize dark matter as demonstrated in Table 2. (In these cases, a hydrogen atom in a fractional quantum state, H ni ( ), collides, for example, with a n = 1 2 hydrogen atom, H 1 2 , and the result is an even lower-energy hydrogen atom, H nf ( ), and H 1 2 is ionized.
H ni ( ) + H 1 2 →H nf ( ) + H + + e−+ photon (75) The energy released, as a photon, is the difference between the energies of the initial and final states given by Eqs. (71-72) minus the ionization energy of H 1 2 , 54.4 eV .) The catalysis of an energy state of hydrogen to a lower energy state wherein a different lower energy state atom of hydrogen serves as the catalyst is called disproportionation by Mills .
Top Identification of Lower-Energy Hydrogen by Soft X-rays from Dark Interstellar Medium The first soft X-ray background was detected and reported about 25 years ago.
Quite naturally, it was assumed that these soft X-ray emissions were from ionized atoms within hot gases. In a more recent paper, a grazing incidence spectrometer was designed to measure and record the diffuse extreme ultraviolet background . The instrument was carried aboard a sounding rocket and data were obtained between 80 Å and 650 Å (data points approximately every 1.5 Å). Here again, the data were interpreted as emissions from hot gases. However, the 17 authors left the door open for some other interpretation with the following statement from their introduction: "It is now generally believed that this diffuse soft X-ray background is produced by a high-temperature component of the interstellar medium. However, evidence of the thermal nature of this emission is indirect in that it is based not on observations of line emission, but on indirect evidence that no plausible non-thermal mechanism has been suggested which does not conflict with some component of the observational evidence." The authors also state that "if this interpretation is correct, gas at several temperatures is present." Specifically, emissions were attributed to gases in three ranges: 5.5 < log T < 5.7; log T = 6; 6.6 < log T < 6.8.
The explanation proposed herein of the observed dark interstellar medium spectrum hinges on the possibility of energy states below the n = 1 state, as given by Eqs. (71-72). Thus, lower-energy transitions of the type, ∆E n n X eV eV f i = − − 1 1 13 6 54 4 2 2 .
. n = 1 1 2 1 3 1 4 , , , ,..., and n n i f > (76) induced by a disproportionation reaction with H aH 2 ought to occur. The wavelength is related to ∆E by λ (in Å) = 1.240 X 104 ∆E(in eV) (77) The energies and wavelengths of several of these proposed transitions are shown in Table 1.
Note that the lower energy transitions are in the soft X-ray region.
18 Table 1. Energies (Eq. (76)) of several fractional-state transitions catalyzed by H aH 2 .
−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−− n i n f ∆E (eV) λ (Å) −−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−− 1 2 1 3 13.6 9 1 2 1 3 1 4 40.80 303.9 1 4 1 5 68.00 182.4 1 5 1 6 95.20 130.2 1 6 1 7 122.4 101.3 1 7 1 8 149.6 82.9 −−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−− Top The Data And Its Interpretation In their analysis of the data, Labov and Bowyer established several tests to separate emission features from the background. There were seven features (peaks) that passed their criteria. The wavelengths and other aspects of these peaks are shown in Table 2. Peaks 2 and 5 were interpreted by Labov and Bowyer as instrumental second-order images of peaks 4 and 7, respectively. Peak 3, the strongest feature, is clearly a helium resonance line: He(1s12p1 → 1s2).
At issue here, is the interpretation of peaks 1, 4, 6, and 7. It is proposed that peaks 4, 6, and 7 arise from the 1 3 → 1 4 , 1 4 → 1 5 , and 1 6 → 1 7 hydrogen atoms transitions given by Eq. (76).
It is also proposed that peak 1 arises from inelastic helium scattering of peak 4. That is, the 1 3 → 1 4 transition yields a 40.8 eV photon (303.9 Å). When this photon strikes He (1s2), 21.2 eV is absorbed in the excitation to He (1s12p1). This leaves a 19.6 eV photon (632.6 Å), 19 peak 1. For these four peaks, the agreement between the predicted values (Table 1) and the experimental values (Table 2) is remarkable.
Table 3. Data (Labov & Bowyer) near the predicted 1 5 1 6 → transition (130.2 Å).
−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−− _ counts background counts – background (Å) 125.82 26 21.58 4.42 127.10 22 21.32 0.68 128.37 18 19.50 –1.50 129.64 29 20.28 8.72 130.90 18 19.76 –1.76 132.15 20 19.50 0.50 133.41 19 19.50 –0.50 134.65 19 20.80 –1.80 −−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−− One argument against this new interpretation of the data is that the transition 1 5 → 1 6 is missing—predicted at 130.2 Å by Eqs. (76-77). This missing peak cannot be explained into existence, but a reasonable rationale can be provided for why it might be missing from these data.
The data obtained by Labov and Bowyer are outstanding when the region of the spectrum, the time allotted for data collection, and the logistics are considered. Nonetheless, it is clear that the signal-to-noise ratio is low and that considerable effort had to be expended to differentiate emission features from the background. This particular peak, 1 5 → 1 6 , is likely to be only slightly stronger than the 1 6 → 1 7 peak (the intensities, Table 2, appear to decrease as n decreases), which has low intensity. Labov and Bowyer provided their data (wavelength, count, count error, background, and background error). The counts minus background values for the 20 region of interest, 130.2 ± 5 Å, are shown in Table 3 (the confidence limits for the wavelength of about ±5 Å are the single-side 1 confidence levels and include both the uncertainties in the fitting procedure and uncertainties in the wavelength calibration). Note that the largest peak (count – background) is at 129.64 Å and has a counts − background = 8.72. The counts − background for the strongest signal of the other hydrino transitions are: n = 1 3 / to n = 1 4 / , 20.05; n = 1 4 / to n = 1 5 / , 11.36; n = 1 6 / to n = 1 7 / , 10.40. Thus, there is fair agreement with the wavelength and the strength of the signal. This, of course, does not mean that there is a peak at 130.2 Å. However, it is not unreasonable to conclude that a spectrum with a better signal-to-noise ratio might uncover the missing peak.
Another, and more important, argument against this new interpretation is the fact that the proposed fractional-quantum-state hydrogen atoms have not been detected before. There are several explanations. Firstly, the transitions to these fractional states must be forbidden or must have very high activation energies—otherwise all hydrogen atoms would quickly go to these lower energy states (an estimated transition probability, based on the Labov and Bowyer data, is be between 10−15 and 10−17s−1). In actuality, a catalyst is required in order to obtain emission.
Secondly, the number of hydrogen atoms (n = 1), the hydrogen-atom density, and the presence of an active catalyst under any conditions on Earth is exceeding low. The combination of extremely low population and extremely low transition probability makes the detection of these transitions especially difficult. Thirdly, this is a very troublesome region of the electromagnetic spectrum for detection because these wavelengths do not penetrate even millimeters of the atmosphere (i.e. this region is the vacuum ultraviolet which requires windowless spectroscopy at vacuum for detection). Lastly, no one previously has been actively searching for these transitions.
The Chandra X-ray Observatory is scheduled to perform similar experiments with detection at much better signal to noise than obtained by Labov and Bowyer.
Top Novel Energy States of Hydrogen Formed by a Catalytic Reaction The catalysis of hydrogen involves the nonradiative transfer of energy from atomic hydrogen to a catalyst which may then release the transferred energy by radiative and nonradiative mechanisms. As a consequence of the nonradiative energy transfer, the hydrogen atom becomes unstable and emits further energy until it achieves a lower-energy nonradiative state having a principal energy level given by Eqs. (71-72).
Potassium ions can also provide a net enthalpy of a multiple of that of the potential energy of the hydrogen atom. The second ionization energy of potassium is 31.63 eV ; and K + releases 4.34 eV when it is reduced to K . The combination of reactions K + to K 2+ and K + to K , then, has a net enthalpy of reaction of 27.28 eV , which is equivalent to m = 1 in Eq. (73).
27.28 eV + K + + K + + H aH p →K + K 2+ + H aH (p +1) + [(p +1)2 −p2] X 13.6 eV (78) 21 K + K 2+ →K + + K + + 27.28 eV (79) The overall reaction is H aH p →H aH (p +1) + [(p +1)2 −p2] X 13.6 eV (80) Typically the emission of extreme ultraviolet light from hydrogen gas is achieved via a discharge at high voltage, a high power inductively coupled plasma, or a plasma created and heated to extreme temperatures by RF coupling (e.g. > 106 K ) with confinement provided by a toroidal magnetic field. Intense EUV emission was observed by Mills et al. at low temperatures (e.g. < 103 K) from atomic hydrogen and certain atomized pure elements or certain gaseous ions which ionize at integer multiples of the potential energy of atomic hydrogen. The release of energy from hydrogen as evidenced by the EUV emission must result in a lower-energy state of hydrogen. The lower-energy hydrogen atom called a hydrino atom by Mills would be expected to demonstrate novel chemistry. The formation of novel compounds based on hydrino atoms would be substantial evidence supporting catalysis of hydrogen as the mechanism of the observed EUV emission. A novel hydride ion called a hydrino hydride ion having extraordinary chemical properties given by Mills is predicted to form by the reaction of an electron with a hydrino atom. Compounds containing hydrino hydride ions have been isolated as products of the reaction of atomic hydrogen with atoms and ions identified as catalysts in the Mills et al. EUV study [16, 23, 24]. The novel hydride compounds were identified analytically by techniques such as time of flight secondary ion mass spectroscopy, X-ray photoelectron spectroscopy, and proton nuclear magnetic resonance spectroscopy. For example, the time of flight secondary ion mass spectroscopy showed a large hydride peak in the negative spectrum.
The X-ray photoelectron spectrum showed large metal core level shifts due to binding with the hydride as well as novel hydride peaks. The proton nuclear magnetic resonance spectrum showed significantly upfield shifted peaks which corresponded to and identified novel hydride ions.
Top Discussion The Schrödinger equation gives the observed spontaneously radiative energy levels and the nonradiative state of hydrogen. On this basis alone, it is justified despite its inconsistency with physicals laws and numerous experimental observations such as • The appropriate eigenvalue must be postulated and the variables of the Laguerre differential equation must be defined as integers in order to obtain the Rydberg formula.
22 • The Schrödinger equation is not Lorentzian invariant.
• The Schrödinger equation violates first principles including special relativity and Maxwell's equations .
• The Schrödinger equation gives no basis why excited states are radiative and the 13.6 eV state is stable .
• The Schrödinger equation solutions, Eq. (36) and Eq. (37), predict that the ground state electron has zero angular energy and zero angular momentum, respectively.
• The Schrödinger equation solution, Eq. (37), predicts that the ionized electron has infinite angular momentum.
• The Schrödinger equation solutions, Eq. (36) and Eq. (37), predict that the excited state energy levels are nondegenerate as a function of the l quantum number even in the absence of an applied magnetic field and the predicted energy is over six orders of magnitude of the observed nondegenerate energy in the presence of a magnetic field.
• The Schrödinger equation predicts that each of the functions that corresponds to a highly excited state electron is not integrable and can not be normalized; thus, each is infinite.
• The Schrödinger equation predicts that the ionized electron is sinusoidal over all space and can not be normalized; thus, it is infinite.
• The Heisenberg uncertainty principle arises as the standard deviation in the electron probability wave, but experimentally it is not the basis of wave particle duality.
• The correspondence principle does not hold experimentally.
• The Schrödinger equation does not predict the electron magnetic moment and misses the spin quantum number all together.
• The Schrödinger equation is not a wave equation since it gives the velocity squared proportional to the frequency.
23 • The Schrödinger equation is not consistent with conservation of energy in an inverse potential field wherein the binding energy is equal to the kinetic energy and the sum of the binding energy and the kinetic energy is equal to the potential energy .
• The Schrödinger equation interpreted as a probability wave of a point particle can not explain neutral scattering of electrons from hydrogen .
• The Schrödinger equation interpreted as a probability wave of a point particle gives rise to infinite magnetic and electric energy in the corresponding fields of the electron.
• A modification of the Schrödinger equation was developed by Dirac to explain spin which relies on the unfounded notions of negative energy states of the vacuum, virtual particles, and gamma factors.
The success of quantum mechanics can be attributed to 1.) the lack of rigor and unlimited tolerance to ad hoc assumptions in violation of physical laws, 2.) fantastical experimentally immeasurable corrections such as virtual particles, vacuum polarizations, effective nuclear charge, shielding, ionic character, compactified dimensions, and renormalization, and 3.) curve fitting parameters that are justified solely on the basis that they force the theory to match the data.
Quantum mechanics is now in a state of crisis with constantly modified versions of matter represented as undetectable minuscule vibrating strings that exist in many unobservable hyperdimensions, that can travel back and forth between undetectable interconnected parallel universes. And, recent data shows that the expansion of the universe is accelerating. This observation has shattered the long held unquestionable doctrine of the origin of the universe as a big bang . It may be time to reconsider the roots of quantum theory, namely the theory of the hydrogen atom. Especially in light of the demonstration that the hydrogen atom can be solved in closed form from first principles, that new chemistry is predicted, and that the predictions have substantial experimental support.
Billions of dollars have been spent to harness the energy of hydrogen through fusion using plasmas created and heated to extreme temperatures by RF coupling (e.g. > 106 K ) with confinement provided by a toroidal magnetic field. Mills et al. have demonstrated that energy may be released from hydrogen using a chemical catalyst at relatively low temperatures with an apparatus which is of trivial technological complexity compared to a tokomak. And, rather than producing radioactive waste, the reaction has the potential to produce compounds having extraordinary properties. The implications are that a vast new energy source and a new field of hydrogen chemistry have been discovered.
24 Top References 1. Beiser, A., Concepts of Modern Physics, Fourth Edition, McGraw-Hill, New York, (1987),. pp. 87-117.
2. Fowles, G. R., Analytical Mechanics, Third Edition, Holt, Rinehart, and Winston, New York, (1977), pp. 154-156.
3. McQuarrie, D. A., Quantum Chemistry, University Science Books, Mill Valley, CA, (1983), pp. 78-79.
4. Jackson, J. D., Classical Electrodynamics, Second Edition, John Wiley & Sons, New York, (1962), pp. 84-108.
5. McQuarrie, D. A., Quantum Chemistry, University Science Books, Mill Valley, CA, (1983), pp. 221-224.
6. W. Moore, Schrödinger life and thought, Cambridge University Press, (1989), p.198.
7. Fowles, G. R., Analytical Mechanics, Third Edition, Holt, Rinehart, and Winston, New York, (1977), pp. 57-60.
8. H. Margenau, G. M. Murphy, The Mathematics of Chemistry and Physics, D. Van Nostrand Company, Inc., New York, (1943), pp. 77-78.
9. Weisskopf, V. F., Reviews of Modern Physics, Vol. 21, No. 2, (1949), pp. 305-315.
10. Horgan, J., "Quantum Philosophy", Scientific American, July, (1992), pp. 94-104.
11. Platt, D. E., Am. J. Phys., 60 (4), April, 1992, pp. 306-308.
12. S. Durr, T. Nonn, G. Rempe, Nature, September 3, (1998), Vol. 395, pp. 33-37.
13. B. Gao, Phys. Rev. Lett., Vol. 83, No. 21, Nov. 22, (1999), pp. 4225-4228.
14. Science News, Vol. 156, November 27th 1999, p. 342, under "Physics rule of thumb gets thumbs down" 2nd & 3rd paragraphs.
15. Science News, 1/11/86, p. 26.
25 16. R. Mills, The Grand Unified Theory of Classical Quantum Mechanics, January 1999 Edition, BlackLight Power, Inc., Cranbury, New Jersey, Distributed by Amazon.com.
17. Haus, H. A., "On the radiation from point charges", American Journal of Physics, 54, (1986), pp. 1126-1129.
18. N. V. Sidgwick, The Chemical Elements and Their Compounds, Volume I, Oxford, Clarendon Press, (1950), p.17.
19. M. D. Lamb, Luminescence Spectroscopy, Academic Press, London, (1978), p. 68.
20. Labov, S., Bowyer, S., "Spectral observations of the extreme ultraviolet background", The Astrophysical Journal, 371, (1991), pp. 810-819.
21. S. Bower, G. Field, and J. Mack, "Detection of an Anisotrophic Soft X-ray Background Flux," Nature, Vol. 217, (1968), p. 32.
22. R. Mills, J. Dong, Y. Lu, "Observation of Extreme Ultraviolet Hydrogen Emission from Incandescently Heated Hydrogen Gas with Certain Catalysts", 1999 Pacific Conference on Chemistry and Spectroscopy and the 35th ACS Western Regional Meeting, Ontario Convention Center, California, (October 6-8, 1999) and Int. J.
Hydrogen Energy, accepted.
23. R. Mills, B. Dhandapani, N. Greenig, J. He, "Synthesis and Characterization of Potassium Iodo Hydride", Int. J. of Hydrogen Energy in progress.
24. R. Mills, "Novel Hydride Compound", Int. J. of Hydrogen Energy, accepted.
25. N. A. Bahcall, J. P. Ostriker, S. Perlmutter, P. J. Steinhardt, Science, May 28, 1999, Vol. 284, pp. 1481-1488. |
14126 | https://www3.nd.edu/~apilking/Calculus2Resources/Lecture%204/SlidesL4.pdf | General Logarithms and Exponentials Last day, we looked at the inverse of the logarithm function, the exponential function. we have the following formulas: ln(x) ln(ab) = ln a+ln b, ln( a b ) = ln a−ln b ln ax = x ln a lim x→∞ln x = ∞, lim x→0 ln x = −∞ d dx ln |x| = 1 x Z 1 x dx = ln |x| + C ex ln ex = x and eln(x) = x ex+y = exey, ex−y = ex ey , (ex)y = exy.
lim x→∞ex = ∞, and lim x→−∞ex = 0 d dx ex = ex Z exdx = ex + C Annette Pilkington Natural Logarithm and Natural Exponential General exponential functions For a > 0 and x any real number, we define ax = ex ln a, a > 0.
The function ax is called the exponential function with base a.
Note that ln(ax) = x ln a is true for all real numbers x and all a > 0. (We saw this before for x a rational number).
Note: The above definition for ax does not apply if a < 0.
Annette Pilkington Natural Logarithm and Natural Exponential Laws of Exponents We can derive the following laws of exponents directly from the definition and the corresponding laws for the exponential function ex: ax+y = axay ax−y = ax ay (ax)y = axy (ab)x = axbx ▶For example, we can prove the first rule in the following way: ▶ax+y = e(x+y) ln a ▶= ex ln a+y ln a ▶= ex ln aey ln a = axay.
▶The other laws follow in a similar manner.
Annette Pilkington Natural Logarithm and Natural Exponential Derivatives We can also derive the following rules of differentiation using the definition of the function ax, a > 0, the corresponding rules for the function ex and the chain rule.
d dx (ax) = d dx (ex ln a) = ax ln a d dx (ag(x)) = d dx eg(x) ln a = g ′(x)ag(x) ln a ▶Example: Find the derivative of 5x3+2x.
▶Instead of memorizing the above formulas for differentiation, I can just convert this to an exponential function of the form eh(x) using the definition of 5u, where u = x3 + 2x and differentiate using the techniques we learned in the previous lecture.
▶We have, by definition, 5x3+2x = e(x3+2x) ln 5 ▶Therefore d dx 5x3+2x = d dx e(x3+2x) ln 5 = e(x3+2x) ln 5 d dx (x3 + 2x) ln 5 ▶= (ln 5)(3x2 + 2)e(x3+2x) ln 5 = (ln 5)(3x2 + 2)5x3+2x.
Annette Pilkington Natural Logarithm and Natural Exponential Graphs of General exponential functions For a > 0 we can draw a picture of the graph of y = ax using the techniques of graphing developed in Calculus I.
▶We get a different graph for each possible value of a.
We split the analysis into two cases, ▶since the family of functions y = ax slope downwards when 0 < a < 1 and ▶the family of functions y = ax slope upwards when a > 1.
Annette Pilkington Natural Logarithm and Natural Exponential Case 1:Graph of y = ax, 0 < a < 1 -4 -2 2 4 10 20 30 40 50 y=1x y=H18Lx y=H14Lx y=H12Lx ▶y-intercept: The y-intercept is given by y = a0 = e0 ln a = e0 = 1.
▶x-intercept: The values of ax = ex ln a are always positive and there is no x intercept.
▶Slope: If 0 < a < 1, the graph of y = ax has a negative slope and is always decreasing, d dx (ax) = ax ln a < 0. In this case a smaller value of a gives a steeper curve [for x < 0].
▶The graph is concave up since the second derivative is d2 dx2 (ax) = ax(ln a)2 > 0.
▶As x →∞, x ln a approaches −∞, since ln a < 0 and therefore ax = ex ln a →0.
▶As x →−∞, x ln a approaches ∞, since both x and ln a are less than 0. Therefore ax = ex ln a →∞.
For 0 < a < 1, lim x→∞ax = 0, lim x→−∞ ax = ∞.
Annette Pilkington Natural Logarithm and Natural Exponential Case 2: Graph of y = ax, a > 1 -4 -2 2 4 20 40 60 80 100 120 y=8x y=4x y=2x ▶y-intercept: The y-intercept is given by y = a0 = e0 ln a = e0 = 1.
▶x-intercept: The values of ax = ex ln a are always positive and there is no x intercept.
▶If a > 1, the graph of y = ax has a positive slope and is always increasing, d dx (ax) = ax ln a > 0.
▶The graph is concave up since the second derivative is d2 dx2 (ax) = ax(ln a)2 > 0.
▶In this case a larger value of a gives a steeper curve [when x > 0].
▶As x →∞, x ln a approaches ∞, since ln a > 0 and therefore ax = ex ln a →∞ ▶As x →−∞, x ln a approaches −∞, since x < 0 and ln a > 0.
Therefore ax = ex ln a →0.
For a > 1, lim x→∞ax = ∞, lim x→−∞ ax = 0 .
Annette Pilkington Natural Logarithm and Natural Exponential Power Rules We now have 4 different types of functions involving bases and powers. So far we have dealt with the first three types: If a and b are constants and g(x) > 0 and f (x) and g(x) are both differentiable functions.
d dx ab = 0, d dx (f (x))b = b(f (x))b−1f ′(x), d dx ag(x) = g ′(x)ag(x) ln a, d dx (f (x))g(x) For d dx (f (x))g(x), we use logarithmic differentiation or write the function as (f (x))g(x) = eg(x) ln(f (x)) and use the chain rule.
▶Also to calculate limits of functions of this type it may help write the function as (f (x))g(x) = eg(x) ln(f (x)).
Annette Pilkington Natural Logarithm and Natural Exponential Example Example Differentiate x2x2, x > 0.
▶We use logarithmic differentiation on y = x2x2.
▶Applying the natural logarithm to both sides, we get ln(y) = 2x2 ln(x) ▶Differentiating both sides, we get 1 y dy dx = (ln x)4x + 2x2 x .
▶Therefore dy dx = y h 4x ln x + 2x i = x2x2h 4x ln x + 2x i .
Annette Pilkington Natural Logarithm and Natural Exponential Example Example What is lim x→∞x−x ▶limx→∞x−x = limx→∞e−x ln(x) ▶As x →∞, we have x →∞and ln(x) →∞, therefore if we let u = −x ln(x), we have that u approaches −∞as x →∞.
▶Therefore lim x→∞e−x ln(x) = lim u→−∞eu = 0 Annette Pilkington Natural Logarithm and Natural Exponential General Logarithmic Functions Since f (x) = ax is a monotonic function whenever a ̸= 1, it has an inverse which we denote by f −1(x) = loga x.
▶We get the following from the properties of inverse functions: ▶ f −1(x) = y if and only if f (y) = x loga(x) = y if and only if ay = x ▶ f (f −1(x)) = x f −1(f (x)) = x aloga(x) = x loga(ax) = x.
Annette Pilkington Natural Logarithm and Natural Exponential Change of base Formula It is not difficult to show that loga x has similar properties to ln x = loge x.
This follows from the Change of Base Formula which shows that The function loga x is a constant multiple of ln x.
loga x = ln x ln a ▶Let y = loga x.
▶Since ax is the inverse of loga x, we have ay = x.
▶Taking the natural logarithm of both sides, we get y ln a = ln x, ▶which gives, y = ln x ln a .
▶The algebraic properties of the natural logarithm thus extend to general logarithms, by the change of base formula.
loga 1 = 0, loga(xy) = loga(x) + loga(y), loga(xr) = r loga(x).
for any positive number a ̸= 1. In fact for most calculations (especially limits, derivatives and integrals) it is advisable to convert loga x to natural logarithms. The most commonly used logarithm functions are log10 x and ln x = loge x.
Annette Pilkington Natural Logarithm and Natural Exponential Using Change of base Formula for derivatives Change of base formula loga x = ln x ln a From the above change of base formula for loga x, we can easily derive the following differentiation formulas: d dx (loga x) = d dx ln x ln a = 1 x ln a d dx (loga g(x)) = g ′(x) g(x) ln a.
Annette Pilkington Natural Logarithm and Natural Exponential A special Limit We derive the following limit formula by taking the derivative of f (x) = ln x at x = 1, We know that f ′(1) = 1/1 = 1. We also know that f ′(1) = lim x→0 ln(1 + x) −ln 1 x = lim x→0 ln(1 + x)1/x = 1.
Applying the (continuous) exponential function to the limit on the left hand side (of the last equality), we get elimx→0 ln(1+x)1/x = lim x→0 eln(1+x)1/x = lim x→0(1 + x)1/x.
Applying the exponential function to the right hand sided(of the last equality), we gat e1 = e. Hence e = lim x→0(1 + x)1/x Note If we substitute y = 1/x in the above limit we get e = lim y→∞ “ 1 + 1 y ”y and e = lim n→∞ “ 1 + 1 n ”n where n is an integer (see graphs below). We look at large values of n below to get an approximation of the value of e.
Annette Pilkington Natural Logarithm and Natural Exponential A special Limit n = 10 → “ 1 + 1 n ”n = 2.59374246, n = 100 → “ 1 + 1 n ”n = 2.70481383, n = 100 → “ 1 + 1 n ”n = 2.71692393, n = 1000 → “ 1 + 1 n ”n = 2.71814593.
20 40 60 80 100 2.58 2.60 2.62 2.64 2.66 2.68 2.70 points Hn, H1 + 1nLnL, n = 1...100 Annette Pilkington Natural Logarithm and Natural Exponential |
14127 | https://simple.wikipedia.org/wiki/Wilson%27s_theorem | Wilson's theorem - Simple English Wikipedia, the free encyclopedia
Jump to content
[x] Main menu
Main menu
move to sidebar hide
Getting around
Main page
Simple start
Simple talk
New changes
Show any page
Help
Contact us
About Wikipedia
Special pages
Search
Search
[x] Appearance
Appearance
move to sidebar hide
Text
Small Standard Large
This page always uses small font size
Width
Standard Wide
The content is as wide as possible for your browser window.
Color (beta)
Automatic Light Dark
This page is always in light mode.
Give to Wikipedia
Create account
Log in
[x] Personal tools
Give to Wikipedia
Create account
Log in
Wilson's theorem
[x] 38 languages
العربية
বাংলা
Български
Català
Čeština
Dansk
Deutsch
Ελληνικά
English
Español
Euskara
فارسی
Français
한국어
Hrvatski
Bahasa Indonesia
Italiano
עברית
Қазақша
Kreyòl ayisyen
Latviešu
Lietuvių
Magyar
Nederlands
日本語
Polski
Português
Română
Русский
Slovenčina
Slovenščina
کوردی
Suomi
Svenska
ไทย
Українська
Tiếng Việt
中文
Change links
Page
Talk
[x] English
Read
Change
Change source
View history
[x] Tools
Tools
move to sidebar hide
Actions
Read
Change
Change source
View history
General
What links here
Related changes
Upload file
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Sandbox
Edit interlanguage links
Print/export
Make a book
Download as PDF
Page for printing
In other projects
Wikidata item
From Simple English Wikipedia, the free encyclopedia
Wilson's theorem is a theorem of number theory. Let n be any natural number. Wilson's theorem says that n is a prime numberif and only if:
(n−1)!≡−1(mod n){\displaystyle (n-1)!\ \equiv \ -1{\pmod {n}}}
This means that if n is a prime number, the equation is correct. Also, if the equation is correct, then n is a prime number. The equation says that the factorial of (n - 1) is one less than a multiple of n.
This short article about mathematics can be made longer. You can help Wikipedia by adding to it.
Retrieved from "
Category:
Theorems in number theory
Hidden category:
Math stubs
This page was last changed on 12 July 2025, at 02:17.
Text is available under the Creative Commons Attribution-ShareAlike License and the GFDL; additional terms may apply. See Terms of Use for details.
Privacy policy
About Wikipedia
Disclaimers
Code of Conduct
Developers
Statistics
Cookie statement
Mobile view
Edit preview settings
Search
Search
Wilson's theorem
38 languagesAdd topic |
14128 | https://www.quora.com/If-x-y-16-and-xy-55-what-is-the-value-of-x-and-y | If x+y=16 and xy = 55, what is the value of x and y? - Quora
Something went wrong. Wait a moment and try again.
Try again
Skip to content
Skip to search
Sign In
Mathematics
Solving Quadratic Equatio...
Algebraic Expressions
Problem Solving
Systems of Linear Equatio...
Algebra Class
Mathematical Problems
Basic Algebra
Algebra
5
If x+y=16 and xy = 55, what is the value of x and y?
All related (55)
Sort
Recommended
Gayatri Balantrapu
Studied Information Technology (Graduated 2021)
·7y
x +y =16 ->eq (1)
xy=55->eq(2)
from (2)
x=55/y
from 1 & 2
55/y+y=16
55+y^2=16y
y^2–16y+55=0
the above equation is in the form of quadratic equation
y^2–11y-5y+55=0
y(y-11)-5(y-11)=0
(y-5)(y-11)=0
therefore y=5 or 11
case -1:y=5 from 1
x=11
case 2:y=11 from 1
x=5
therefore the values of x and y are (11,5),(5,11)
Upvote ·
9 4
Promoted by Webflow
Metis Chan
Works at Webflow
·Aug 12
What are the best AI website builders now?
When it comes to AI website builders, there are a growing number of options, but a few stand out for their power, flexibility, and ability to grow with your needs.
Webflow’s AI Site Builder is a top choice for small businesses, in-house teams, and agencies who want the speed of AI and the freedom to fully customize every part of their site. With Webflow, you can:
Describe your business or idea and instantly generate a unique, production-ready website—no coding required.
Edit visually in a powerful no-code canvas, customize layouts, and add advanced interactions.
Collaborate with your team in real
Continue Reading
When it comes to AI website builders, there are a growing number of options, but a few stand out for their power, flexibility, and ability to grow with your needs.
Webflow’s AI Site Builder is a top choice for small businesses, in-house teams, and agencies who want the speed of AI and the freedom to fully customize every part of their site. With Webflow, you can:
Describe your business or idea and instantly generate a unique, production-ready website—no coding required.
Edit visually in a powerful no-code canvas, customize layouts, and add advanced interactions.
Collaborate with your team in real time, streamline feedback, and manage all your content in one place.
Publish instantly on enterprise-grade hosting with built-in SEO, security, and the flexibility to scale as you grow.
Many other tools offer AI-powered templates or quick site launches, but Webflow stands out by letting you take control—so your site never feels generic, and you can easily update, expand, or redesign as your needs change.
Want to see what AI-powered site building can really do? Try Webflow AI Site Builder for free today.
Upvote ·
99 15
Related questions
More answers below
What is the value of xy if x-y= 16 and x+y= 20?
What are the value of x x and y y in x y+x 2 y 2+x 3 y 3=14 x y+x 2 y 2+x 3 y 3=14 and x+y=3 x+y=3?
If x+y=5 and x-y=10, what are x and y?
If x+y=xy, what would (x-y) be?
If x+y=8 and xy=6, how much is x and y?
Manny August FitzStephen Bono
Worked at Saint-Gobain (1967–2010) · Author has 402 answers and 953.3K answer views
·6y
x+ y = 16
xy = 55
y = 16 - x
Then:
x (16 - x) = 55
We have the equation:
Root plot:
Alternate forms:
Number line:
Solutions for x:
x = 11
x = 5
Step-by-step solution:
STEP 1
STEP 2
STEP 3
STEP 4
STEP 5
For y:
x + y = 16
x = 11 ; y = 16 - x —-> 16 - 11 = 5
x = 5 ; y = 16 - 5 = 11
Answer for y: 5 and 11.
R/.
Continue Reading
x+ y = 16
xy = 55
y = 16 - x
Then:
x (16 - x) = 55
We have the equation:
Root plot:
Alternate forms:
Number line:
Solutions for x:
x = 11
x = 5
Step-by-step solution:
STEP 1
STEP 2
STEP 3
STEP 4
STEP 5
For y:
x + y = 16
x = 11 ; y = 16 - x —-> 16 - 11 = 5
x = 5 ; y = 16 - 5 = 11
Answer for y: 5 and 11.
R/.
Upvote ·
David Joyce
Ph.D. in Mathematics, University of Pennsylvania (Graduated 1979) · Upvoted by
Terry Moore
, M.Sc. Mathematics, University of Southampton (1968) · Author has 9.9K answers and 68.4M answer views
·Updated 6y
It’s best to take advantage of symmetries when you find them. In this example, you can reduce the number of unknowns by one using a certain symmetry. This is, in fact, the way Diophantus solved problems like this 1800 years ago.
One of x x and y y is 8+z 8+z and the other is 8−z 8−z where z z is some number. So (8+z)(8−z)=55.(8+z)(8−z)=55. That equation is equivalent to 64−z 2=55,64−z 2=55, so z 2=9,z 2=9, and z=±3.z=±3.
Therefore, the two numbers x x and y y are 5 5 and 11.11. (Either could be 5 5 and the other 11 11.)
Upvote ·
99 34
99 14
9 2
Assistant
Bot
·
1y
To find the values of x x and y y given the equations:
x+y=16 x+y=16
x y=55 x y=55
We can use these two equations to form a quadratic equation. From the first equation, we can express y y in terms of x x:
y=16−x y=16−x
Substituting y y into the second equation:
x(16−x)=55 x(16−x)=55
Expanding this gives:
16 x−x 2=55 16 x−x 2=55
Rearranging the equation results in:
x 2−16 x+55=0 x 2−16 x+55=0
Now, we can solve this quadratic equation using the quadratic formula:
x=−b±√b 2−4 a c 2 a x=−b±b 2−4 a c 2 a
where a=1 a=1, b=−16 b=−16, and c=55 c=55.
Calculating the discriminant:
b 2−4 a c=(−16)2−4⋅1⋅55=256−220=36 b 2−4 a c=(−16)2−4⋅1⋅55=256−220=36
Now substituting back into the quadr
Continue Reading
To find the values of x x and y y given the equations:
x+y=16 x+y=16
x y=55 x y=55
We can use these two equations to form a quadratic equation. From the first equation, we can express y y in terms of x x:
y=16−x y=16−x
Substituting y y into the second equation:
x(16−x)=55 x(16−x)=55
Expanding this gives:
16 x−x 2=55 16 x−x 2=55
Rearranging the equation results in:
x 2−16 x+55=0 x 2−16 x+55=0
Now, we can solve this quadratic equation using the quadratic formula:
x=−b±√b 2−4 a c 2 a x=−b±b 2−4 a c 2 a
where a=1 a=1, b=−16 b=−16, and c=55 c=55.
Calculating the discriminant:
b 2−4 a c=(−16)2−4⋅1⋅55=256−220=36 b 2−4 a c=(−16)2−4⋅1⋅55=256−220=36
Now substituting back into the quadratic formula:
x=16±√36 2⋅1=16±6 2 x=16±36 2⋅1=16±6 2
This gives two possible solutions for x x:
x=22 2=11 x=22 2=11
x=10 2=5 x=10 2=5
Now, using y=16−x y=16−x:
If x=11 x=11, then y=16−11=5 y=16−11=5.
If x=5 x=5, then y=16−5=11 y=16−5=11.
Thus, the values of x x and y y are:
(x,y)=(11,5)or(5,11)(x,y)=(11,5)or(5,11)
Upvote ·
Related questions
More answers below
If f(x + y, x – y) = xy, what is the value of f(x, y)?
If 2^x+y=2^x-y=16, what is the value of y?
If x+y=10 and x·y = 16, what is the value of x?
If x = 4 and 3x + 2y = 30, what is the value of y?
If x+y = 18 and x y = 72, then what is the value of (x) ² + (y) ² :?
Digvijay Singh Thakur
Lives in Shimla, Himachal Pradesh, India
·7y
X + Y = 16. Eq1
XY = 55
X = 55 / Y
Now put value of X in eq1
55 / Y + Y = 16
(55 + Y^2) / Y = 16
Y^2 - 16Y + 55 = 0
Y^2 -11Y -5Y + 55 = 0
Y(Y - 11) -5(Y - 11) = 0
(Y - 5)(Y - 11) = 0
Hence Y = 5 and Y = 11
Now put values of Y in eq1…
For Y = 5
X = 16 - 5 = 11
For Y = 11
X = 16 - 11 = 5
Thanks
Upvote ·
9 1
Sponsored by Grammarly
Stuck on the blinking cursor?
Move your great ideas to polished drafts without the guesswork. Try Grammarly today!
Download
99 34
The Chosen One
Service Desk Analyst at Samsung SDS (2007–present) · Author has 14.7K answers and 5.6M answer views
·1y
x + y = 16 (1)
xy = 55 (2)
From (1), y = 16 - x
Substitute this into (2)
x(16 - x) = 55
-x^2 + 16x - 55 = 0
x^2 - 16x + 55 = 0
Using the quadratic formula:
x = 5 or 11
So the numbers are 5 and 11
Continue Reading
x + y = 16 (1)
xy = 55 (2)
From (1), y = 16 - x
Substitute this into (2)
x(16 - x) = 55
-x^2 + 16x - 55 = 0
x^2 - 16x + 55 = 0
Using the quadratic formula:
x = 5 or 11
So the numbers are 5 and 11
Upvote ·
9 1
Shivangi Dwivedi
Btech in ECE (Specialization in Embedded Systems), College of Engineering, Pranveer Singh Institute of Technology (Graduated 2022)
·7y
The easiest way to answer this question whould be by the Dharacharya method.
thank you!
Continue Reading
The easiest way to answer this question whould be by the Dharacharya method.
thank you!
Upvote ·
9 1
Sponsored by All Out
Kill Dengue, Malaria and Chikungunya with New 30% Faster All Out.
Chance Mat Lo, Naya All Out Lo - Recommended by Indian Medical Association.
Shop Now
999 616
Mac J
Studied Construction Engineering and Management&Enjoys Mathematics (Graduated 2018)
·7y
x+y=16
=>x=16-y ; eq.(i)
xy=55
=>(16-y)×y=55 ; using x=16-y from eq.(i)
=>16y–y^2=55
=>y^2–16y+55=0 ; shifting all terms to r.h.s
=>y^2–(5+11)y+55=0 ; using middle term factorization
=>y^2–5y-11y+55=0
=>y(y-5)-11(y-5)=0 ; taking y common from the first two terms and -11 from last two terms
=>(y-5)(y-11)=0 ; taking y-5 common
=>y-5=0 =>y=5 or y-11=0 =>y=11
using y=5 in eq.(i)
x=16–5
=>x=11
using y=11 in eq.(i)
x=16–11
=>x=5
so x=11, 5 and y=5, 11
Upvote ·
9 1
Alex Spongeburg
Author has 658 answers and 145.4K answer views
·6y
The algorithm is to use substitution. Either way
Set Y = 16- X. From equation 1 and
Plug X(16-X) = 55 into equation 2.
Foil, solve for X. It’s a quadratic
Or you can have y = 55/x equation 2
Plug X + (55/X) = 16. Multiply all terms by X, move all terms to one side,
either way you land X^2 - 16X + 55 = 0
You don’t need to use quadratic formula since (X-11) (X-5) satisfies the terms -11+-5=-16. And -11-5=55. So 5, and 11.
But let’s step back.
Any time you have X+Y = a number
And XY = a different number
We know immediately that X and Y can be swapped around both X and Y have the same exact 2 solutions
They
Continue Reading
The algorithm is to use substitution. Either way
Set Y = 16- X. From equation 1 and
Plug X(16-X) = 55 into equation 2.
Foil, solve for X. It’s a quadratic
Or you can have y = 55/x equation 2
Plug X + (55/X) = 16. Multiply all terms by X, move all terms to one side,
either way you land X^2 - 16X + 55 = 0
You don’t need to use quadratic formula since (X-11) (X-5) satisfies the terms -11+-5=-16. And -11-5=55. So 5, and 11.
But let’s step back.
Any time you have X+Y = a number
And XY = a different number
We know immediately that X and Y can be swapped around both X and Y have the same exact 2 solutions
They will be integers whenever you can factor out the left expression for
X^2 - the number X + the different number = 0
When you can’t
X =0.5 times. [the number +- ( sqrt (the number-squared) - 4times the different number]
Upvote ·
9 1
Sponsored by LPU Online
Career Ka Turning Point with LPU Online.
100% Online UGC-Entitled programs with LIVE classes, recorded content & placement support.
Apply Now
999 259
Anushree Ajgaonkar
Ph.D. in Biochemistry&Biomedical Engineering, Yale University (Graduated 2010)
·7y
Since xy=55 we need to find 55’s factors. The possible factors for 55 are (1,55) and (5,11). Since the addition of 5 and 11 are 16 x could equal 5 or 11 and the same goes for y
Upvote ·
9 4
Varadarajan Parthasarathy
B.sc in Mathematics, University of Madras (Graduated 1976) · Author has 5.3K answers and 2.5M answer views
·6y
x-y=√(X+y)^2–4xy
=√16^2–4×55
=√256–220
=√36
=+or-6
Now X+y=16
x-y=6
Solving these two equations we get X=11and y=5
Solving X+y=16 andx-y=-6 we get X=5 and y=11
Upvote ·
9 1
Naveen
intermediate at Designers (2019–present) · Author has 155 answers and 146K answer views
·7y
given,
x + y = 16
xy = 55
y= 16 -x
x (16-x) =55
16x -x^2 =55
x^2-16x +55=0
x^2 -11x - 5x +55=0
x(x-11) -5(x - 11) = 0
(x -5) (x-11)=0
hence, X=11 and 5
so, y=11 and 5
Upvote ·
Kiwayo Meshack
Bcom Marketing in Bachelor of Commerce in Marketing&Accountancy Commerce Economics, University of Dar Es Salaam (Graduated 2019)
·5y
X+y=16…..(1)
Xy=55……(2)
Make x or y subject from eq 1
X= 16-y……. (3)
Substitute in equation (2)
(16-y)y=55
16y+y^2=55
From ax^2+bx+c=o
Y^2+16y-55=0
You can use general formula to solve this quadratic equation.
Upvote ·
Related questions
What is the value of xy if x-y= 16 and x+y= 20?
What are the value of x x and y y in x y+x 2 y 2+x 3 y 3=14 x y+x 2 y 2+x 3 y 3=14 and x+y=3 x+y=3?
If x+y=5 and x-y=10, what are x and y?
If x+y=xy, what would (x-y) be?
If x+y=8 and xy=6, how much is x and y?
If f(x + y, x – y) = xy, what is the value of f(x, y)?
If 2^x+y=2^x-y=16, what is the value of y?
If x+y=10 and x·y = 16, what is the value of x?
If x = 4 and 3x + 2y = 30, what is the value of y?
If x+y = 18 and x y = 72, then what is the value of (x) ² + (y) ² :?
What is the value of x and y if x+y=xy=x/y?
If x+y=6 and x-y=3, what is x's y's values?
If 2x + y7 = 16, then what is the value of x and y?
Is there any integer solution to the equation x y=y x,x≠y x y=y x,x≠y
If x+y=5 and x^y+y^x=17, what is the value of x and y?
Related questions
What is the value of xy if x-y= 16 and x+y= 20?
What are the value of x x and y y in x y+x 2 y 2+x 3 y 3=14 x y+x 2 y 2+x 3 y 3=14 and x+y=3 x+y=3?
If x+y=5 and x-y=10, what are x and y?
If x+y=xy, what would (x-y) be?
If x+y=8 and xy=6, how much is x and y?
If f(x + y, x – y) = xy, what is the value of f(x, y)?
Advertisement
About · Careers · Privacy · Terms · Contact · Languages · Your Ad Choices · Press ·
© Quora, Inc. 2025 |
14129 | https://brainly.com/question/35387018 | [FREE] Agar impression material is a reversible hydrocolloid substance used for dental impressions. It is called - brainly.com
4
Search
Learning Mode
Cancel
Log in / Join for free
Browser ExtensionTest PrepBrainly App Brainly TutorFor StudentsFor TeachersFor ParentsHonor CodeTextbook Solutions
Log in
Join for free
Tutoring Session
+56,5k
Smart guidance, rooted in what you’re studying
Get Guidance
Test Prep
+47,2k
Ace exams faster, with practice that adapts to you
Practice
Worksheets
+7,9k
Guided help for every grade, topic or textbook
Complete
See more
/
Biology
Expert-Verified
Expert-Verified
Agar impression material is a reversible hydrocolloid substance used for dental impressions. It is called reversible because it can change its physical state and be reused for multiple impressions. Agar is a hydrophilic colloid derived from various seaweeds and is a sulfated galactose polymer with a complex structure. It is a mucilaginous substance that melts at high temperatures (around 100 degrees Celsius) and forms a gel at lower temperatures (approximately 36 degrees Celsius).
Agar offers excellent detail reproduction and accurately records undercut areas. It prevents distortion upon removal due to its elastic recovery and can be reused. However, it cannot be electroplated, and thin areas of the impression are prone to tearing. Unlike elastomeric impression materials, multiple models cannot be poured from a single impression. Additionally, using agar requires specialized equipment, gypsum must be solidified, and disinfecting the impression is challenging.
1
See answer Explain with Learning Companion
NEW
Asked by TayJoker4294 • 08/07/2023
0:00
/
0:15
Read More
Community
by Students
Brainly
by Experts
ChatGPT
by OpenAI
Gemini
Google AI
Community Answer
This answer helped 3966232 people
3M
0.0
0
Upload your school material for a more relevant answer
Agar is a hydrophilic colloid made from seaweeds and is used as a reversible hydrocolloid impression substance in dentistry. It has excellent detail reproduction, accurately records undercut regions, and can be re-utilized.
Explanation
Agar is a hydrophilic colloid made from a variety of seaweeds. It is used as a reversible hydrocolloid impression substance in dentistry. The name 'reversible' comes from its ability to reverse its physical condition, allowing it to be reused for a large number of impressions.
Agar has a complicated structure and is a sulfated galactose polymer. It is a mucilaginous substance that melts at high temperatures, around 100 degrees Celsius, and forms into a gel at lower temperatures, approximately 36 degrees Celsius.
One of the key advantages of agar as an impression material is its excellent detail reproduction. It can accurately record undercut regions and prevent distortion upon removal due to its flexible recovery properties. Another notable characteristic of agar is its ability to be re-utilized, making it cost-effective.
However, agar does have limitations. It cannot be electroplated, which is a process used to create a metal replica of the impression. Agar is also prone to tearing in thin areas of the impression, which can affect the accuracy of the final cast. Pouring multiple models with agar is challenging compared to elastomeric impression materials. Additionally, agar requires special armamentarium and the solidification of gypsum for cast development. _Disinfection_ of agar impressions can also be difficult.
Learn more about characteristics and limitations of agar as an impression material here:
brainly.com/question/30713317
SPJ14
Answered by ConnorRobert •21.9K answers•4M people helped
Thanks 0
0.0
(0 votes)
Expert-Verified⬈(opens in a new tab)
This answer helped 3966232 people
3M
0.0
0
Upload your school material for a more relevant answer
Agar impression material is a reversible hydrocolloid used in dentistry for creating accurate dental impressions. It offers excellent detail reproduction and can be reused, but has limitations, including challenges with electroplating and disinfection. Understanding its properties and limitations is essential for effective use in dental applications.
Explanation
Agar impression material is a versatile and significant substance in the field of dentistry, particularly in creating dental impressions. It is defined as a reversible hydrocolloid, meaning it can transition between a liquid and a gel state, allowing it to be reused for multiple impressions.
Composition and Properties:
Agar is derived from various seaweeds and consists of a complex polymer known as sulfated galactose. When heated, agar melts at temperatures around 100 degrees Celsius, and upon cooling (approximately 36 degrees Celsius), it forms a gel. This unique property of melting and cooling makes agar ideal for making impressions that accurately reflect the dental architecture.
Advantages of Agar Impressions:
Detail Reproduction: Agar provides excellent detail reproduction, capturing intricate features such as undercuts in the dental anatomy, which is crucial for creating accurate dental prosthetics.
Elastic Recovery: The material's elastic nature helps in preventing distortion when the impression is removed from the mouth, ensuring that the shape of the impression is retained.
Reusability: Agar can be reused for making multiple impressions, which helps in reducing material costs in a dental practice.
Limitations of Agar Impressions:
Electroplating: Agar cannot be electroplated, which limits its use in certain applications where a metal replica is required.
Tearing in Thin Areas: The material is prone to tearing if the impression is too thin, which can compromise its quality.
Single Model Casting: Unlike some elastomeric materials, agar allows only a single model to be poured from one impression, making it less versatile in model production.
Specialized Equipment Needed: Using agar requires specific equipment for melting and storage, adding complexity to its application.
Disinfection Challenges: Disinfecting agar impressions can be difficult, which is an important consideration for dental hygiene.
Ultimately, while agar impression materials are beneficial in dental practices for their accuracy and adaptability, practitioners must be aware of their limitations and the specific conditions required for their effective use.
Examples & Evidence
An example of agar's application could be in making impressions for dentures; the material captures the precise contours of the gums and teeth. Another example is in orthodontics, where agar impressions help create accurate molds for braces and aligners.
Agar's properties as a reversible hydrocolloid and its common usage in dentistry are well-documented in dental material literature, illustrating its effectiveness and limitations.
Thanks 0
0.0
(0 votes)
Advertisement
TayJoker4294 has a question! Can you help?
Add your answer See Expert-Verified Answer
### Free Biology solutions and answers
Community Answer 1 When a food handler can effectively remove soil from equipment using normal methods, the equipment is considered what?
Community Answer 1 Gene got Medicare before he turned 65 and enrolled into a Medicare Advantage plan. He calls in February the month before his 65th birthday and is unhappy with his current plan. On the date of the call, what can Gene do about his coverage?
Community Answer 3 3. Which plant food must be transported to the serving site at 41F or below? A-chopped celery B-died tomatoes C-sliced cucumbers D-shredded carrots
Community Answer 50 A food worker is putting chemicals into clean spray bottles, what must a food worker include on the each spray bottle?
Community Answer 2 In the word search below are the names of several pieces of lab equipment. As you find each piece of equipment, record its name on the list. There are only 13 words out of the listBunsen burner,Pipestem triangle, Evaporating dish, Beaker, Utility clamp,Iron ring, Mortar and pestle, Crucible and cover, Gas bottle, Saftey goggles,Corks, Watch glass, Erlenmeyer flask, Wire gauze, Pipet, Buret,Triple beam balance, Test tube rack, Funnel, Scoopula,Well plate, Wire brush,File,Wash bottle, Graduated cylinder,Thanks
Community Answer 5.0 2 Which of the following is NOT approved for chemical sanitizing after washing and rinsing? Quaternary ammonium Chlorine lodine Detergent
Community Answer 5.0 2 which objective lens will still remain in focus when placed at the longest working distance from the specimen?
Community Answer 5.0 9 How should food workers protect food from contamination after it is cooked? O a. Refrigerate the food until it is served O b. Use single-use gloves to handle the food O c. Apply hand sanitizer before handling the food O d. Cover the food in plastic wrap until it is served
Community Answer 33 Suppose a one-year old child is playing with a toy near an electrical out-let. He sticks part of the toy into the outlet. He gets shocked, becomes frightened, and begins to cry. For several days after that experience, he shows fear when his mother gives hi.m the toy and he refuses to play with it. What are the UCS? U CR? CS? CR?
New questions in Biology
What are the main ideas behind the cell theory? A. Cells come from chemicals. B. Cells are the basic unit of structure and function. C. Cells come from other cells. D. Cells make up all living things. E. Cells come from nonliving things.
A species of moth has 2 varieties of wing color: brown and white. As winter approaches, the trees where the moths live lose their leaves. The moth's predators are birds who hunt for the moths as they rest on the dark tree bark. Every moth lays 100 eggs, but only about 10 from each egg cluster live to adulthood. Which moth variety do you think will be selected against? Which trait is favorable? Why? What are the variations in this population? How does this species overproduce? How will this species change over time?
Which of the following is a relatively avascular class of connective tissue? (A) Bone (B) Adipose (C) Areolar (D) Cartilage
26. Somatic hypermutation primarily occurs in: A. Bone marrow B. Germinal centers C. Thymus D. Peyer's patches 27. T-independent antigens (in B cell activation) are often: A. Peptides B. Lipopolysaccharides or polysaccharides C. Proteins requiring processing D. Presented by MHC II 28. Memory B cells are characterized by: A. Short lifespan B. IgM expression only C. Rapid antibody production upon re-exposure D. Lack of class-switching 29. What is the effect of BCR engagement without T cell help? A. Class switching to IgA B. B cell apoptosis or anergy C. Memory B cell development D. Hyper-IgM production 30. The isotype switch changes: A. Antigen specificity B. Heavy chain constant region C. Light chain sequence D. BCR signaling pathways 31. Which cytokine promotes class switching to IgE? A. IL-2 B. IL-4 C. IL-10 D. IL-12 32. The peptide-binding groove of MHC class I is formed by: A. a1 and a2 domains B. a1 and β1 domains C. β1 and β2 domains D. a2 and β2 domains 33. HLA-DP, DQ, and DR are associated with: A. MHC I B. MHC II C. TAP transporters D. Proteasome components 34. Which immunoglobulin is elevated during parasitic infections? A. IgM B. IgD
7. Which one is not a factor to determine the quality of baled hay:A. Type of forage B. Stage of harvesting C. Length of drying period D. Colour of hay 8. Which one is an ingredient for making homemade bar soap:A. Ash B. Sugar C. Vinegar D. Lemon 9. Trees can be grown by planting the following materials except:A. Seeds B. Bulbs
Previous questionNext question
Learn
Practice
Test
Open in Learning Companion
Company
Copyright Policy
Privacy Policy
Cookie Preferences
Insights: The Brainly Blog
Advertise with us
Careers
Homework Questions & Answers
Help
Terms of Use
Help Center
Safety Center
Responsible Disclosure Agreement
Connect with us
(opens in a new tab)(opens in a new tab)(opens in a new tab)(opens in a new tab)(opens in a new tab)
Brainly.com |
14130 | https://math.stackexchange.com/questions/4633753/solving-a-triangle-by-angle-circumradius-and-area | Skip to main content
Solving a triangle by angle, circumradius, and area
Ask Question
Asked
Modified
2 years, 6 months ago
Viewed
167 times
This question shows research effort; it is useful and clear
4
Save this question.
Show activity on this post.
The problem itself is as follows.
Consider a triangle ABC. The cosine of one of its interior angles is m, its circumradius is equal to R, and its area is equal to S. Solve this triangle: find its sides and angles.
By applying the sine theorem, I've got that the length of a side, opposite to the angle with the known cosine, which is 2R1−m2−−−−−−√. But I had no luck in advancing further, as it either results in too many unknowns. Most I could do is getting the product of sines of two unknown angles, from the formula S=2R2sin∠Asin∠Bsin∠C.
I'm looking for proofs that such triangle exists and is clearly defined, as well as the way to solve it if it is.
euclidean-geometry
triangles
circles
area
Share
CC BY-SA 4.0
Follow this question to receive notifications
asked Feb 6, 2023 at 18:14
RusuranoRusurano
1,06655 silver badges1414 bronze badges
4
Try using the best known formula for triangle area.
– Aaron Goldsmith
Commented
Feb 6, 2023 at 18:24
@AaronGoldsmith Half the product of two sides and sine of the angle between these sides? I've tried using it, but isn't 0.25abc/R=0.5absin∠C resulting in too many unknowns?
– Rusurano
Commented
Feb 6, 2023 at 18:41
After a round of thinking, it gives precisely nothing because what we want to find actually vanishes.
– Rusurano
Commented
Feb 6, 2023 at 19:11
I was thinking A=bh/2
– Aaron Goldsmith
Commented
Feb 6, 2023 at 20:16
Add a comment
|
2 Answers 2
Reset to default
This answer is useful
1
Save this answer.
Show activity on this post.
This is a sketch of a solution. Let's say wlog that cos∠A=m. We have a=2R1−m2−−−−−−√. We also have 2A=bc1−m2−−−−−−√ and b=2Rsin∠B, c=2Rsin∠C. On the other hand, a2=c2+b2−2bc⋅m.
Thus, 4R2(1−m2)=4R2sin2∠B+4R2sin2∠C−4A⋅m1−m2√.
Finally, sin∠C=sin(∠A+∠B)=msin∠B+1−m2−−−−−−√cos∠B. Substituting this into above will give us equation to find sin∠B.
Share
CC BY-SA 4.0
Follow this answer to receive notifications
answered Feb 6, 2023 at 19:58
VasiliVasili
11.6k11 gold badge1919 silver badges3131 bronze badges
1
Thanks! I've elaborated your solution in my answer, too
– Rusurano
Commented
Feb 8, 2023 at 11:04
Add a comment
|
This answer is useful
0
Save this answer.
Show activity on this post.
Below is my own answer on the problem I came up with. There may exist more elegant ways, but this is the most straightforward way of which I know.
Consider a triangle ABC with circumradius R, area S, and cos∠C=m.
Find the sine of ∠C by using the famous trigonometric identity sin2α+cos2α=1. As all interior angles of the triangle have positive sines, we take the positive value, thus sin∠C=1−cos2∠C−−−−−−−−−−√=1−m2−−−−−−√.
Find the length of side AB, opposite to ∠C, by using the law of sines. Thus, AB=2Rsin∠C=2R1−m2−−−−−−√.
Find the product of two other sides. For that, find the altitude of triangle ABC to side AB by using the formula hAB=2SAB. Now, if we equate two formulas for the area of a triangle, we get AB⋅BC⋅AC4R=12AB⋅hAB, which we can transform further:
AB⋅BC⋅AC4R=12AB⋅hAB ⇔ BC⋅AC2R=hAB⇔ BC⋅AC2R=2SAB⇔ BC⋅AC=4RSAB
Thus, BC=4RSAB⋅AC.
4. By using the law of cosines, we get AB2=BC2+AC2−2⋅BC⋅ACcos∠C. Here, we can substitute BC⋅AC=4RSAB, and BC=4RSAB⋅AC. We get:
AB2=(4RSAB⋅AC)2+AC2−2⋅4mRSAB
Here, we know everything except AC, and we can find both unknown sides by simplifying the last formula into the biquadratic equation, positive roots of which are sides BC and AC. Finally, to find the other angles, one can use the law of cosines if the given angle is obtuse (m<0), as there is only one obtuse angle in the triangle, or the law of cosines in all other cases.
Share
CC BY-SA 4.0
Follow this answer to receive notifications
edited Feb 8, 2023 at 7:56
answered Feb 8, 2023 at 7:45
RusuranoRusurano
1,06655 silver badges1414 bronze badges
Add a comment
|
You must log in to answer this question.
Start asking to get answers
Find the answer to your question by asking.
Ask question
Explore related questions
euclidean-geometry
triangles
circles
area
See similar questions with these tags.
Featured on Meta
Upcoming initiatives on Stack Overflow and across the Stack Exchange network...
Community help needed to clean up goo.gl links (by August 25)
Related
1
How to find area of trapezoid formed from line connecting feet of perpendiculars to angle bisectors?
3
Area of Triangle inside a Circle in terms of angle and radius
0
Prove that the ratio between the sines is equal to that of the sides.
1
ΔABC has heights AD,BE,CF and circumradius R, prove (DEF)=12R2sin2Asin2Bsin2C
0
Given that AIH = 90 degrees, find the circumradius of the triangle
1
Need help in solve a geometry question based on triangle.
4
Let ABC be a triangle and O be a point in its interior. ∠BAO=∠BCO,∠BOC=90∘ and ∠ABO=∠CAO,AC=2, find OC
Hot Network Questions
postgres-15 - WAL files being archived, but not recycled/removed from pg_wal
How can I flatten a circular dependancy using C++20 modules?
In "Computer Networks:A Top Down Approach" - can multiple applications using the same protocol use its designated port?
Why is the heliopause so hot?
SciFi story about father and son after world is destroyed
Is it possible that ethics is beyond language, and if so what would the implications be?
How to test kernel driver contributions without target hardware
Excel lookup from one matrix or array to another
Excessive flame on one burner
How does the marking of God’s servants protect them from the impending destruction in Revelation 7:3?
Can you ask the editor to send a partial review?
Using adverbs of frequency in the Future Simple and Present Continuous tenses
Why wrap fruitcake in grease-proof paper?
What would "Fruit Salad" mean in any other academic context than fruit salad?
What is the principle of non-liability in the European Union wrt the US Section 230 and social media?
Can this civilization land their biplanes in the air?
Can a nozzle-less engine be made efficient by clustering?
Need help understanding the value of this infinite continued fraction intuitively
NMinimize behaves strangely for this simple problem
Incoming water pipe has no apparent ground
My Canadian employer is sending me to Germany to work on a project. Do I need a visa or a work permit?
complex 3-clause conditional: 'I realized that if I do..., I will...' vs. 'I realized that if I did..., I would...'
Why does Wittgenstein use long, step-by-step chains of reasoning in his works?
Half-Life 1 launches on the wrong monitor and outside of the screen
Question feed
By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.
Cookie Consent Preference Center
When you visit any of our websites, it may store or retrieve information on your browser, mostly in the form of cookies. This information might be about you, your preferences, or your device and is mostly used to make the site work as you expect it to. The information does not usually directly identify you, but it can give you a more personalized experience. Because we respect your right to privacy, you can choose not to allow some types of cookies. Click on the different category headings to find out more and manage your preferences. Please note, blocking some types of cookies may impact your experience of the site and the services we are able to offer.
Cookie Policy
Manage Consent Preferences
Strictly Necessary Cookies
Always Active
These cookies are necessary for the website to function and cannot be switched off in our systems. They are usually only set in response to actions made by you which amount to a request for services, such as setting your privacy preferences, logging in or filling in forms. You can set your browser to block or alert you about these cookies, but some parts of the site will not then work. These cookies do not store any personally identifiable information.
Performance Cookies
These cookies allow us to count visits and traffic sources so we can measure and improve the performance of our site. They help us to know which pages are the most and least popular and see how visitors move around the site. All information these cookies collect is aggregated and therefore anonymous. If you do not allow these cookies we will not know when you have visited our site, and will not be able to monitor its performance.
Functional Cookies
These cookies enable the website to provide enhanced functionality and personalisation. They may be set by us or by third party providers whose services we have added to our pages. If you do not allow these cookies then some or all of these services may not function properly.
Targeting Cookies
These cookies are used to make advertising messages more relevant to you and may be set through our site by us or by our advertising partners. They may be used to build a profile of your interests and show you relevant advertising on our site or on other sites. They do not store directly personal information, but are based on uniquely identifying your browser and internet device. |
14131 | https://dl.acm.org/doi/abs/10.1007/s00454-018-0003-3 | Consent
Details
[#IABV2SETTINGS#]
About
This website uses cookies
We occasionally run membership recruitment campaigns on social media channels and use cookies to track post-clicks. We also share information about your use of our site with our social media, advertising and analytics partners who may combine it with other information that you’ve provided to them or that they’ve collected from your use of their services. Use the check boxes below to choose the types of cookies you consent to have stored on your device.
Show details
Necessary cookies help make a website usable by enabling basic functions like page navigation and access to secure areas of the website. The website cannot function properly without these cookies. These cookies do not gather information about you that could be used for marketing purposes and do not remember where you have been on the internet.
ACMLearn more about this provider
__cf_bm [x2]This cookie is used to distinguish between humans and bots. This is beneficial for the website, in order to make valid reports on the use of their website.
Maximum Storage Duration: 1 dayType: HTTP Cookie
_cfuvidThis cookie is a part of the services provided by Cloudflare - Including load-balancing, deliverance of website content and serving DNS connection for website operators.
Maximum Storage Duration: SessionType: HTTP Cookie
cf_chl_rc_mThis cookie is a part of the services provided by Cloudflare - Including load-balancing, deliverance of website content and serving DNS connection for website operators.
Maximum Storage Duration: 1 dayType: HTTP Cookie
JSESSIONIDPreserves users states across page requests.
Maximum Storage Duration: SessionType: HTTP Cookie
+ CookiebotLearn more about this provider
CookieConsentStores the user's cookie consent state for the current domain
Maximum Storage Duration: 1 yearType: HTTP Cookie
+ c.disquscdn.com
__jidUsed to add comments to the website and remember the user's Disqus login credentials across websites that use said service.
Maximum Storage Duration: SessionType: HTTP Cookie
disqusauthRegisters whether the user is logged in. This allows the website owner to make parts of the website inaccessible, based on the user's log-in status.
Maximum Storage Duration: SessionType: HTTP Cookie
Preference cookies enable a website to remember information that changes the way the website behaves or looks, like your preferred language or the region that you are in.
ACM
1Learn more about this provider
MACHINE_LAST_SEENPending
Maximum Storage Duration: 300 daysType: HTTP Cookie
+ Mopinion
1Learn more about this provider
mopDeployPending
Maximum Storage Duration: SessionType: HTML Local Storage
+ c.disquscdn.com
aet-dismissNecessary for the functionality of the website's comment-system.
Maximum Storage Duration: PersistentType: HTML Local Storage
drafts.queueNecessary for the functionality of the website's comment-system.
Maximum Storage Duration: PersistentType: HTML Local Storage
submitted_posts_cacheNecessary for the functionality of the website's comment-system.
Maximum Storage Duration: PersistentType: HTML Local Storage
Statistic cookies help website owners understand how visitors interact with websites by collecting and reporting information anonymously.
GoogleLearn more about this provider
Some of the data collected by this provider is for the purposes of personalization and measuring advertising effectiveness.
_gaRegisters a unique ID that is used to generate statistical data on how the visitor uses the website.
Maximum Storage Duration: 2 yearsType: HTTP Cookie
_ga_#Used by Google Analytics to collect data on the number of times a user has visited the website as well as dates for the first and most recent visit.
Maximum Storage Duration: 2 yearsType: HTTP Cookie
_gatUsed by Google Analytics to throttle request rate
Maximum Storage Duration: 1 dayType: HTTP Cookie
_gidRegisters a unique ID that is used to generate statistical data on how the visitor uses the website.
Maximum Storage Duration: 1 dayType: HTTP Cookie
+ Heap Analytics
3Learn more about this provider
_hp2_#Collects data on the user’s navigation and behavior on the website. This is used to compile statistical reports and heatmaps for the website owner.
Maximum Storage Duration: 1 dayType: HTTP Cookie
_hp2_id.#Collects data on the user’s navigation and behavior on the website. This is used to compile statistical reports and heatmaps for the website owner.
Maximum Storage Duration: 13 monthsType: HTTP Cookie
_hp2_ses_props.#Collects data on the user’s navigation and behavior on the website. This is used to compile statistical reports and heatmaps for the website owner.
Maximum Storage Duration: 1 dayType: HTTP Cookie
+ Hotjar
3Learn more about this provider
_hjSession_#Collects statistics on the visitor's visits to the website, such as the number of visits, average time spent on the website and what pages have been read.
Maximum Storage Duration: 1 dayType: HTTP Cookie
_hjSessionUser_#Collects statistics on the visitor's visits to the website, such as the number of visits, average time spent on the website and what pages have been read.
Maximum Storage Duration: 1 yearType: HTTP Cookie
_hjTLDTestRegisters statistical data on users' behaviour on the website. Used for internal analytics by the website operator.
Maximum Storage Duration: SessionType: HTTP Cookie
+ c.disquscdn.com
1
disqus_uniqueCollects statistics related to the user's visits to the website, such as number of visits, average time spent on the website and loaded pages.
Maximum Storage Duration: SessionType: HTTP Cookie
Marketing cookies are used to track visitors across websites. The intention is to display ads that are relevant and engaging for the individual user and thereby more valuable for publishers and third party advertisers.
Google
1Learn more about this provider
Some of the data collected by this provider is for the purposes of personalization and measuring advertising effectiveness.
NIDRegisters a unique ID that identifies a returning user's device. The ID is used for targeted ads.
Maximum Storage Duration: 6 monthsType: HTTP Cookie
+ Heap Analytics
2Learn more about this provider
api/telemetryCollects data on user behaviour and interaction in order to optimize the website and make advertisement on the website more relevant.
Maximum Storage Duration: SessionType: Pixel Tracker
hCollects data on user behaviour and interaction in order to optimize the website and make advertisement on the website more relevant.
Maximum Storage Duration: SessionType: Pixel Tracker
+ YouTube
23Learn more about this provider
#-#Used to track user’s interaction with embedded content.
Maximum Storage Duration: SessionType: HTML Local Storage
__Secure-ROLLOUT_TOKENUsed to track user’s interaction with embedded content.
Maximum Storage Duration: 180 daysType: HTTP Cookie
__Secure-YECStores the user's video player preferences using embedded YouTube video
Maximum Storage Duration: SessionType: HTTP Cookie
iU5q-!O9@$Registers a unique ID to keep statistics of what videos from YouTube the user has seen.
Maximum Storage Duration: SessionType: HTML Local Storage
LAST_RESULT_ENTRY_KEYUsed to track user’s interaction with embedded content.
Maximum Storage Duration: SessionType: HTTP Cookie
LogsDatabaseV2:V#||LogsRequestsStoreUsed to track user’s interaction with embedded content.
Maximum Storage Duration: PersistentType: IndexedDB
nextIdUsed to track user’s interaction with embedded content.
Maximum Storage Duration: SessionType: HTTP Cookie
remote_sidNecessary for the implementation and functionality of YouTube video-content on the website.
Maximum Storage Duration: SessionType: HTTP Cookie
requestsUsed to track user’s interaction with embedded content.
Maximum Storage Duration: SessionType: HTTP Cookie
ServiceWorkerLogsDatabase#SWHealthLogNecessary for the implementation and functionality of YouTube video-content on the website.
Maximum Storage Duration: PersistentType: IndexedDB
TESTCOOKIESENABLEDUsed to track user’s interaction with embedded content.
Maximum Storage Duration: 1 dayType: HTTP Cookie
VISITOR_INFO1_LIVETries to estimate the users' bandwidth on pages with integrated YouTube videos.
Maximum Storage Duration: 180 daysType: HTTP Cookie
YSCRegisters a unique ID to keep statistics of what videos from YouTube the user has seen.
Maximum Storage Duration: SessionType: HTTP Cookie
yt.innertube::nextIdRegisters a unique ID to keep statistics of what videos from YouTube the user has seen.
Maximum Storage Duration: PersistentType: HTML Local Storage
ytidb::LAST_RESULT_ENTRY_KEYUsed to track user’s interaction with embedded content.
Maximum Storage Duration: PersistentType: HTML Local Storage
YtIdbMeta#databasesUsed to track user’s interaction with embedded content.
Maximum Storage Duration: PersistentType: IndexedDB
yt-remote-cast-availableStores the user's video player preferences using embedded YouTube video
Maximum Storage Duration: SessionType: HTML Local Storage
yt-remote-cast-installedStores the user's video player preferences using embedded YouTube video
Maximum Storage Duration: SessionType: HTML Local Storage
yt-remote-connected-devicesStores the user's video player preferences using embedded YouTube video
Maximum Storage Duration: PersistentType: HTML Local Storage
yt-remote-device-idStores the user's video player preferences using embedded YouTube video
Maximum Storage Duration: PersistentType: HTML Local Storage
yt-remote-fast-check-periodStores the user's video player preferences using embedded YouTube video
Maximum Storage Duration: SessionType: HTML Local Storage
yt-remote-session-appStores the user's video player preferences using embedded YouTube video
Maximum Storage Duration: SessionType: HTML Local Storage
yt-remote-session-nameStores the user's video player preferences using embedded YouTube video
Maximum Storage Duration: SessionType: HTML Local Storage
Unclassified cookies are cookies that we are in the process of classifying, together with the providers of individual cookies.
ACM
12Learn more about this provider
10.1145%2F3519932_pdfPending
Maximum Storage Duration: PersistentType: HTML Local Storage
10.1145%2F3519937_pdfPending
Maximum Storage Duration: PersistentType: HTML Local Storage
accessPending
Maximum Storage Duration: SessionType: HTML Local Storage
accessTypePending
Maximum Storage Duration: SessionType: HTML Local Storage
book_reader_settingsPending
Maximum Storage Duration: PersistentType: HTML Local Storage
chapter_reader_settingsPending
Maximum Storage Duration: PersistentType: HTML Local Storage
doiPending
Maximum Storage Duration: SessionType: HTML Local Storage
issue_reader_settingsPending
Maximum Storage Duration: PersistentType: HTML Local Storage
MAIDPending
Maximum Storage Duration: 300 daysType: HTTP Cookie
tipKeyPending
Maximum Storage Duration: PersistentType: HTML Local Storage
titlePending
Maximum Storage Duration: SessionType: HTML Local Storage
typePending
Maximum Storage Duration: SessionType: HTML Local Storage
+ Cloudflare
1Learn more about this provider
cf.turnstile.uPending
Maximum Storage Duration: PersistentType: HTML Local Storage
+ Google
1Learn more about this provider
Some of the data collected by this provider is for the purposes of personalization and measuring advertising effectiveness.
GSPPending
Maximum Storage Duration: 400 daysType: HTTP Cookie
+ c.disquscdn.com
1
disqus.threadPending
Maximum Storage Duration: PersistentType: HTML Local Storage
Cross-domain consent1 Your consent applies to the following domains:
List of domains your consent applies to:
dl.acm.org
Cookie declaration last updated on 8/10/25 by Cookiebot
[#IABV2_TITLE#]
[#IABV2_BODY_INTRO#]
[#IABV2_BODY_LEGITIMATE_INTEREST_INTRO#]
[#IABV2_BODY_PREFERENCE_INTRO#]
[#IABV2_BODY_PURPOSES_INTRO#]
[#IABV2_BODY_PURPOSES#]
[#IABV2_BODY_FEATURES_INTRO#]
[#IABV2_BODY_FEATURES#]
[#IABV2_BODY_PARTNERS_INTRO#]
[#IABV2_BODY_PARTNERS#]
About
Cookies are small text files that can be used by websites to make a user's experience more efficient. Other than those strictly necessary for the operation of the site, we need your permission to store any type of cookies on your device. Learn more about ACM, how you can contact us, and how we process personal data in our Privacy Policy. Also please consult our Cookie Notice.
You can change or withdraw your consent from the Cookie Declaration on our website at any time by visiting the Cookie Declaration page. If contacting us regarding your consent, please state your consent ID and date from that page.
skip to main content
Advanced Search
Discrete & Computational Geometry
article
Share on
A Solution of the Erd?s---Ulam Problem on Rational Distance Sets Assuming the Bombieri---Lang Conjecture
Author: Jafar Shaffaf
Jafar Shaffaf
Department of Mathematical Sciences, Shahid Beheshti University, G.C., Tehran, Iran
View Profile
Authors Info & Claims
Discrete & Computational Geometry, Volume 60, Issue 2
Pages 283 - 293
Published: 01 September 2018 Publication History
Metrics
Total Citations2Total Downloads0
Last 12 Months0
Last 6 weeks0
Abstract
A rational distance set in the plane is a point set which has the property that all pairwise distances between its points are rational. Erd?s and Ulam conjectured in 1945 that there is no dense rational distance set in the plane. In this paper we associate an algebraic surface in $${\mathbb {P}}^3$$P3, that we call a distance surface, to any finite rational distance set in the plane. Under a mild condition, we prove that a distance surface is always a surface of general type. From this, we deduce that the Bombieri---Lang conjecture in arithmetic algebraic geometry (restricted to the classes of surfaces) implies an answer to the Erd?s---Ulam problem. Combined with the results of Solymosi and de Zeeuw, our proofs lead to the following stronger statement: for S a rational distance set with infinitely many points, we haveEither, all but at most four points of S are on a line,Or, all but at most three points of S are on a circle.
References
Anning, N.H., Erd?s, P.: Integral distances. Bull. Am. Math. Soc. 51(8), 598---600 (1945)
Crossref
Google Scholar
Bombieri, E., Gubler, W.: Heights in Diophantine Geometry. New Mathematical Monographs, vol. 4. Cambridge University Press, Cambridge (2006)
Google Scholar
Brass, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer, New York (2005)
Google Scholar
Caporaso, L.: Distribution of rational points and Kodaira dimension of fiber products. In: Dijkgraaf, R.H., et al. (eds.) The Moduli Space of Curves. Progress in Mathematics, vol. 129, pp. 1---12. Birkhäuser, Boston (1995)
Google Scholar
Caporaso, L., Harris, J., Mazur, B.: How many rational points can a curve have? In: Dijkgraaf, R.H., et al. (eds.) The Moduli Space of Curves. Progress in Mathematics, vol. 129, pp. 13---31. Birkhäuser, Boston (1995)
Google Scholar
Caporaso, L., Harris, J., Mazur, B.: Uniformity of rational points. J. Am. Math. Soc. 10(1), 1---35 (1997)
Crossref
Google Scholar
Erd?s, P.: Some combinatorial and metric problems in geometry. In: B?r?czky, K., Fejes Tóth, G. (eds.) Intuitive Geometry. Colloquia Mathematica Societatis János Bolyai, vol. 48, pp. 167---177. North-Holland, Amsterdam (1987)
Google Scholar
Guy, R.K.: Unsolved Problems in Number Theory. Problem Books in Mathematics, vol. 1, 3rd edn. Springer, New York (2004)
Google Scholar
Huff, G.: Diophantine problems in geometry and elliptic ternary forms. Duke Math. J. 15, 443---453 (1948)
Crossref
Google Scholar
Kemnitz, A.: Punktmengen mit ganzzahligen Abständen. Habilitationsschrift, TU Braunschweig (1988)
Google Scholar
Lang, S.: Hyperbolic and diophantine analysis. Bull. Am. Math. Soc. 14(2), 159---205 (1986)
Crossref
Google Scholar
Makhul, M., Shaffaf, J.: On uniform boundedness of a rational distance set in the plane. C. R. Math. Acad. Sci. Paris 350(3---4), 121---124 (2012)
Google Scholar
Peeples Jr., W.D.: Elliptic curves and rational distance sets. Proc. Am. Math. Soc. 5(1), 29---33 (1954)
Crossref
Google Scholar
Solymosi, J., de Zeeuw, F.: On a question of Erd?s and Ulam. Discrete Comput. Geom. 43(2), 393---401 (2010)
Digital Library
Google Scholar
Ulam, S.M.: A Collection of Mathematical Problems. Interscience Tracts in Pure and Applied Mathematics, vol. 8. Interscience, New York (1960)
Google Scholar
Cited By
View all
Solymosi J(2024)Integral and rational graphs in the planeGraphs and Combinatorics10.1007/s00373-024-02841-140:6Online publication date: 9-Oct-2024
Makhul M(2021)On the Number of Perfect Triangles with a Fixed AngleDiscrete & Computational Geometry10.1007/s00454-020-00227-766:3(1143-1149)Online publication date: 1-Oct-2021
A Solution of the Erd?s---Ulam Problem on Rational Distance Sets Assuming the Bombieri---Lang Conjecture
Computing methodologies
Computer graphics
Theory of computation
Randomness, geometry and discrete structures
Recommendations
### On a Question of Erdźs and Ulam
Ulam asked in 1945 if there is an everywhere dense rational set, i.e., 1 a point set
in the plane with all its pairwise distances rational. Erdźs conjectured that if a
set S has a dense rational subset, then S should be very special. The only known ...
Read More
### Representation of non-special curves of genus 5 as plane sextic curves and its application to finding curves with many rational points
Abstract
In algebraic geometry, it is important to provide effective parametrizations for families
of curves, both in theory and in practice. In this paper, we present such an effective
parametrization for the moduli of genus-5 curves that are neither ...
Read More
### Maximum number of points on an intersection of a cubic threefold and a non-degenerate Hermitian threefold
Abstract
It was conjectured by Edoukou in 2008 that a non-degenerate Hermitian threefold in
P 4 ( F q 2 ) has at most d ( q 5 + q 2 ) + q 3 + 1 points in common with a threefold
of degree d defined over F q 2. He proved the conjecture for d = 2. In this ...
Read More
Comments
Information & Contributors
Information
Published In
Discrete & Computational Geometry Volume 60, Issue 2
September 2018
275 pages
ISSN:0179-5376
Issue’s Table of Contents
Copyright © Copyright © 2018 Springer Science+Business Media, LLC, part of Springer Nature.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 01 September 2018
Author Tags
11G99
14G05
14J29
52C10
Bombieri---Lang conjecture
Erd?s problems in discrete geometry
Rational distances
Rational points
Surfaces of general type
Qualifiers
Article
Contributors
Other Metrics
View Article Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
2
Total Citations
View Citations
0
Total Downloads
Downloads (Last 12 months)0
Downloads (Last 6 weeks)0
Reflects downloads up to 20 Aug 2025
Other Metrics
View Author Metrics
Citations
Cited By
View all
Solymosi J(2024)Integral and rational graphs in the planeGraphs and Combinatorics10.1007/s00373-024-02841-140:6Online publication date: 9-Oct-2024
Makhul M(2021)On the Number of Perfect Triangles with a Fixed AngleDiscrete & Computational Geometry10.1007/s00454-020-00227-766:3(1143-1149)Online publication date: 1-Oct-2021
View Options
View options
Figures
References
References
Anning, N.H., Erd?s, P.: Integral distances. Bull. Am. Math. Soc. 51(8), 598---600 (1945)
Crossref
Google Scholar
Bombieri, E., Gubler, W.: Heights in Diophantine Geometry. New Mathematical Monographs, vol. 4. Cambridge University Press, Cambridge (2006)
Google Scholar
Brass, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer, New York (2005)
Google Scholar
Caporaso, L.: Distribution of rational points and Kodaira dimension of fiber products. In: Dijkgraaf, R.H., et al. (eds.) The Moduli Space of Curves. Progress in Mathematics, vol. 129, pp. 1---12. Birkhäuser, Boston (1995)
Google Scholar
Caporaso, L., Harris, J., Mazur, B.: How many rational points can a curve have? In: Dijkgraaf, R.H., et al. (eds.) The Moduli Space of Curves. Progress in Mathematics, vol. 129, pp. 13---31. Birkhäuser, Boston (1995)
Google Scholar
Caporaso, L., Harris, J., Mazur, B.: Uniformity of rational points. J. Am. Math. Soc. 10(1), 1---35 (1997)
Crossref
Google Scholar
Erd?s, P.: Some combinatorial and metric problems in geometry. In: B?r?czky, K., Fejes Tóth, G. (eds.) Intuitive Geometry. Colloquia Mathematica Societatis János Bolyai, vol. 48, pp. 167---177. North-Holland, Amsterdam (1987)
Google Scholar
Guy, R.K.: Unsolved Problems in Number Theory. Problem Books in Mathematics, vol. 1, 3rd edn. Springer, New York (2004)
Google Scholar
Huff, G.: Diophantine problems in geometry and elliptic ternary forms. Duke Math. J. 15, 443---453 (1948)
Crossref
Google Scholar
Kemnitz, A.: Punktmengen mit ganzzahligen Abständen. Habilitationsschrift, TU Braunschweig (1988)
Google Scholar
Lang, S.: Hyperbolic and diophantine analysis. Bull. Am. Math. Soc. 14(2), 159---205 (1986)
Crossref
Google Scholar
Makhul, M., Shaffaf, J.: On uniform boundedness of a rational distance set in the plane. C. R. Math. Acad. Sci. Paris 350(3---4), 121---124 (2012)
Google Scholar
Peeples Jr., W.D.: Elliptic curves and rational distance sets. Proc. Am. Math. Soc. 5(1), 29---33 (1954)
Crossref
Google Scholar
Solymosi, J., de Zeeuw, F.: On a question of Erd?s and Ulam. Discrete Comput. Geom. 43(2), 393---401 (2010)
Digital Library
Google Scholar
Ulam, S.M.: A Collection of Mathematical Problems. Interscience Tracts in Pure and Applied Mathematics, vol. 8. Interscience, New York (1960)
Google Scholar
Figure title goes here
Go to figure location within the article
Download figure
Share on social media
xrefBack.goTo
Request permissions
Authors Info & Affiliations
View Issue’s Table of Contents |
14132 | https://en.wikipedia.org/wiki/Proportional_navigation | Published Time: 2005-11-02T20:44:40Z
Proportional navigation - Wikipedia
Jump to content
[x] Main menu
Main menu
move to sidebar hide
Navigation
Main page
Contents
Current events
Random article
About Wikipedia
Contact us
Contribute
Help
Learn to edit
Community portal
Recent changes
Upload file
Special pages
Search
Search
[x] Appearance
Appearance
move to sidebar hide
Text
Small Standard Large
This page always uses small font size
Width
Standard Wide
The content is as wide as possible for your browser window.
Color (beta)
Automatic Light Dark
This page is always in light mode.
Donate
Create account
Log in
[x] Personal tools
Donate
Create account
Log in
Pages for logged out editors learn more
Contributions
Talk
[x] Toggle the table of contents
Contents
move to sidebar hide
(Top)
1 Description
2 Variants
3 In biology
4 See also
5 References
Proportional navigation
[x] 6 languages
Deutsch
فارسی
Bahasa Indonesia
עברית
தமிழ்
Українська
Edit links
Article
Talk
[x] English
Read
Edit
View history
[x] Tools
Tools
move to sidebar hide
Actions
Read
Edit
View history
General
What links here
Related changes
Upload file
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Edit interlanguage links
Print/export
Download as PDF
Printable version
In other projects
Wikidata item
From Wikipedia, the free encyclopedia
Concept in missile guidance systems
A missile (red) intercepts a target (blue) by maintaining constant bearing to it. Note that the lines of sight (grey) are parallel throughout the flight.
Proportional navigation (also known as PN or Pro-Nav) is a guidance law (analogous to proportional control) used in some form or another by most homing air target missiles. It is based on the fact that two objects are on a collision course when their line of sight (LOS) does not change direction as the range closes. Proportional navigation dictates that the missile should accelerate (such as by steering with its control surfaces) at a rate proportional to the line of sight's rotation rate, and in the same direction. This gradually nullifies the LOS rotation and keeps the missile on a collision course.
A rather simple hardware implementation of this guidance law can be found in early AIM-9 Sidewinder missiles. These missiles use a rapidly rotating parabolic mirror as a seeker. Simple electronics detect the directional error the seeker has with its target (an IR source), and apply a moment to this gimballed mirror to keep it pointed at the target. Since the mirror is in fact a gyroscope it will keep pointing at the same direction if no external force or moment is applied, regardless of the movements of the missile. The voltage applied to the mirror while keeping it locked on the target is then also used (although amplified) to deflect the control surfaces that steer the missile, thereby making missile velocity vector rotation proportional to line of sight rotation. Although this does not result in a rotation rate that is always exactly proportional to the LOS rate (which would require a constant airspeed), this implementation is effective and simple to implement.[citation needed]
The basis of proportional navigation is used at sea to avoid collisions between ships, and is referred to as constant bearing, decreasing range: if an object viewed from a ship is getting closer but maintaining bearing, a collision will occur unless action is taken.
Description
[edit]
2D pure proportional navigation:
If the line of sight is rotating to the right, the missile should accelerate to its right at a rate proportional to the LOS rate λ˙{\textstyle {\dot {\lambda }}}.
In 2D, such as a planar engagement, pure proportional navigation can be represented as:
a n=N λ˙V{\displaystyle a_{n}=N{\dot {\lambda }}V}
where the scalar a n{\displaystyle a_{n}} is the acceleration perpendicular to the missile's instantaneous velocity vector, N{\displaystyle N} is the proportionality constant generally having an integer value 3-5 (dimensionless), λ˙{\displaystyle {\dot {\lambda }}} is the line of sight rotation rate, and V{\textstyle V} is the closing velocity.
Since the line of sight is not in general co-linear with the missile velocity vector, the applied acceleration does not necessarily preserve the missile kinetic energy. In practice, in the absence of engine throttling capability, this type of control may not be possible.
In 3D, proportional navigation can be achieved using an acceleration a→{\textstyle {\vec {a}}} normal to the instantaneous relative velocity:
a→=N V→r×Ω→{\displaystyle {\vec {a}}=N{\vec {V}}{r}\times {\vec {\Omega }}}Ω→=R→×V→r R→⋅R→{\displaystyle {\vec {\Omega }}={\frac {{\vec {R}}\times {\vec {V}}{r}}{{\vec {R}}\cdot {\vec {R}}}}}
where Ω{\displaystyle \Omega } is the rotation vector of the line of sight, V→r=V→t−V→m{\displaystyle {\vec {V}}{r}={\vec {V}}{t}-{\vec {V}}{m}} is the target velocity relative to the missile, and R→=R→t−R→m{\displaystyle {\vec {R}}={\vec {R}}{t}-{\vec {R}}{m}} is the relative position of the target. This acceleration depends explicitly on the relative velocity vector, which may be difficult to obtain in practice. By contrast, in the expressions that follow, dependence is only on the change of the line of sight and the magnitude of the closing velocity. In _true proportional navigation, the acceleration a→{\textstyle {\vec {a}}} is perpendicular to the line of sight, and is given by:
a→=−N|V→r|R→|R→|×Ω→{\displaystyle {\vec {a}}=-N|{\vec {V}}_{r}|{\frac {\vec {R}}{|{\vec {R}}|}}\times {\vec {\Omega }}}
If energy conserving control is required (as is the case when only using control surfaces), the following acceleration, which is normal to the missile velocity, may be used:
a→=−N|V→r|V→m|V→m|×Ω→{\displaystyle {\vec {a}}=-N|{\vec {V}}{r}|{\frac {{\vec {V}}{m}}{|{\vec {V}}_{m}|}}\times {\vec {\Omega }}}
Variants
[edit]
No guidance law is optimal in all situations. Optimal missile guidance requires accurately predicting the target's behavior. Since this is generally not possible, proportional navigation as been adapted into a variety of guidance laws to improve its flexibility. The types described above are pure and true proportional navigation. There exist also:
Generalized proportional navigation, where the acceleration a→{\displaystyle {\vec {a}}} is not necessarily normal to the LOS vector, but maintains a constant angle to it.
Augmented proportional navigation, which adds a term to compensate for target acceleration (if it can be measured).
Other guidance laws, especially ones designed using optimal control theory, may outperform proportional navigation under specific assumptions.
In biology
[edit]
Holcocephala fusca and Coenosia attenuata are two species of predatory flies that use proportional navigation to reach their prey. The former uses N ≈ 3 with a time delay of ≈ 28 ms, which is suitable for its long-range intercepts and minimizes the control effort required. The latter uses N ≈ 1.5 with a time delay of ≈ 18 ms, which is adapted to its short-range hunts and helps reduce overcompensation.
A guidance law resulting in motion camouflage is used by a number of predator species. By setting up the chase so that the predator either appears stationary relative to the background while growing larger (real-point motion camouflage), or always appears at a fixed bearing (infinite-point motion camouflage), the predator reduces its chance of being detected. Such a guidance law is also mathematically related to proportional navigation and similarly provides an efficiency benefit over pure pursuit guidance. The infinite-point case (or "parallel navigation") can be viewed as pure proportional navigation with a distance-dependent N.
See also
[edit]
Motion camouflage
References
[edit]
^ Jump up to: abcYanushevsky, Rafael (September 17, 2018). Modern Missile Guidance (2nd ed.). CRC Press. pp.4–12. ISBN9781351202947.
^ Jump up to: abSiouris, George M. (2004). Missile guidance and control systems. New York: Springer. ISBN978-0-387-00726-7.
^Cockcroft, A. N.; Lameijer, J. N. F. (17 December 2003). A Guide to the Collision Avoidance Rules (6th ed.). Butterworth-Heinemann. p.36. ISBN9780750661799.
^ Jump up to: abShukla, U.S.; Mahapatra, P.R. (March 1990). "The proportional navigation dilemma-pure or true?". IEEE Transactions on Aerospace and Electronic Systems. 26 (2): 382–392. doi:10.1109/7.53445.
^Berglund, Erik (2001). "Guidance and Control Technology".
^Palumbo, NF; Blauwkamp, RA; Lloyd, JM (2010). "Basic Principles of Homing Guidance"(PDF). Johns Hopkins APL Technical Digest. 29 (1): 39.
^Fabian, Samuel T.; Sumner, Mary E.; Wardill, Trevor J.; Rossoni, Sergio; Gonzalez-Bellido, Paloma T. (October 2018). "Interception by two predatory fly species is explained by a proportional navigation feedback controller". Journal of the Royal Society Interface. 15 (147): 20180466. doi:10.1098/rsif.2018.0466. PMC6228472.{{cite journal}}: CS1 maint: article number as page number (link)
^Justh, E.W; Krishnaprasad, P.S (8 December 2006). "Steering laws for motion camouflage". Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 462 (2076): 3629–3643. arXiv:math/0508023. doi:10.1098/rspa.2006.1742.
Retrieved from "
Categories:
Navigation
Missile guidance
Hidden categories:
CS1 maint: article number as page number
Articles with short description
Short description matches Wikidata
All articles with unsourced statements
Articles with unsourced statements from September 2025
This page was last edited on 6 September 2025, at 23:44(UTC).
Text is available under the Creative Commons Attribution-ShareAlike 4.0 License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.
Privacy policy
About Wikipedia
Disclaimers
Contact Wikipedia
Code of Conduct
Developers
Statistics
Cookie statement
Mobile view
Edit preview settings
Search
Search
[x] Toggle the table of contents
Proportional navigation
6 languagesAdd topic |
14133 | https://www.youtube.com/watch?v=DI0bQecqEcs | Mathematical Induction Proof with Recursively Defined Function
The Math Sorcerer
1160000 subscribers
174 likes
Description
10274 views
Posted: 8 Dec 2020
Mathematical Induction Proof with Recursively Defined Function
If you enjoyed this video please consider liking, sharing, and subscribing.
Udemy Courses Via My Website:
My FaceBook Page:
There are several ways that you can help support my channel:)
Consider becoming a member of the channel:
My GoFundMe Page:
My Patreon Page:
Donate via PayPal:
Udemy Courses(Please Use These Links If You Sign Up!)
Abstract Algebra Course
Advanced Calculus Course
Calculus 1 Course
Calculus 2 Course
Calculus 3 Course
Calculus Integration Insanity
Differential Equations Course
College Algebra Course
How to Write Proofs with Sets Course
How to Write Proofs with Functions Course
Statistics with StatCrunch Course
Math Graduate Programs, Applying, Advice, Motivation
Daily Devotionals for Motivation with The Math Sorcerer
Thank you:)
17 comments
Transcript:
Introduction in this problem we're going to do an induction proof so we have a function it's defined from the set of positive integers into the set of positive integers by this recursive definition so f of one is equal to one and f of n plus one is equal to f of n plus 2 to the n for all positive integers this is called a recursive definition because the function values are defined in terms of previous function values you could think of it as a sequence remember every sequence is actually a function whose domain is a set of positive integers so this is really a recursive sequence Proof and we have to prove this statement so this is what we have to prove so this is our s sub n so we have to show that f of n is equal to this based off of this definition so let's go through it very very carefully so proof so i like to break up my induction proofs in two steps so the first step is the base case or the base step and this is when you show your statement is true for n is equal to one so basically have to show that when we plug in one into our function well what what do we need to get well we need to get something that matches this formula so if you plug in 1 here you get 2 to the 1 which is 2 so you get 2 minus 1 which is 1. so note by definition of the function so f of one is equal to one which is equal to two to the one minus one so this agrees with this right so we have that f of one equals one and that agrees with this definition so this means s sub 1 is true right because we have f of 1 and that's equal to 2 to the 1 minus 1. so the statement is true when n equals 1. okay now we're going to do the rest of the proof so some people just jumble it into one step i break it up into two so this is going to be what's called the induction hypothesis or simply ih and this is where you assume that your statement is true for some positive integer k so i'm going to say suppose that we have s sub k being true what does that mean well that means if we plug in k we get 2 to the k minus 1. we have that this is the formula for the function for some positive integer k so for sum positive integer k again we're trying to prove just to really emphasize this we're trying to prove that this formula is valid for this function right the function is given by this definition that's why the base case was a little bit different right we we plugged in one here we got 1 using this definition and we showed that it matches the formula so the formula is satisfied when n is equal to Induction 1. now we're assuming the formula is satisfied for some positive integer k and that leads us to the last step which is the induction step where we have to show the formula is satisfied for k plus 1. so this is the induction step and it's very very helpful to write down what you're trying to prove and so when you do that in an induction proof you need to tell the reader that you're doing that so i'm going to put it in parentheses and say we need to show so nts this is not part of the proof okay this is just what we're trying to do so this is just for our own personal benefit so we nts need to show that this formula is true for k plus 1. so in other words that if we have f of k plus 1 that that is equal to 2 to the k plus 1 minus 1. that's what we have to show in this problem okay so let's do it so then and let's be fun let's switch colors here just to have a little bit of fun so f of k plus one so we can use the induction hypothesis in fact we have to use it that is extremely important but we can't use it yet so what where do we look well at our recursive definition right here f of n plus 1 is f of n plus 2 to the n so we can use that because this is true for all n right so in certainly true for this k so this is f of k plus 2 to the k and this is by definition of the function right by definition of our recursive definition the recursive definition of our function rather this next step is key because now we're going to use the induction hypothesis we're going to replace f of k with 2 to the k minus 1 plus 2 to the k and i'm going to indicate that by putting in quotes over here so this is by ih which is our induction hypothesis and we have to show that this is true right so we're almost there here we have 2 to the k here we have 2 to the k that means we have 2 2 to the k and then minus 1. if that step's confusing think of it as x we have x minus 1 plus x x plus x is 2x minus 1. 2 to the k plus 2 to the k is 2 times 2 to the k minus 1. a lot of people have a really hard time with that problem it's totally normal how do we deal with this there's a one here and then properties of exponents say that when the bases are the same and we multiply we add the exponents this is 2 to the k plus 1 minus 1. so we have that f of k plus one is equal to two to the k plus one minus one this is exactly what it means for s sub k plus one to be true so here we assumed sub k was true here we showed it's true uh when when n is k plus one so we finished all three parts of the uh induction proof so at the end we just say thus by the principle of mathematical principle of mathematical induction we have f of n equals and it was 2 to the n minus 1 for all positive integers and that completes our induction proof it's not a hard proof but it does require a little bit of finesse because you really have to think about what you're trying to show it's a little bit different than the other induction proofs you're trying to show that this formula is true okay you're trying to prove this formula for the function which is a little different so given a recursive definition and you're trying to prove a formula is true i hope this video has been helpful to anyone out there in the world who is trying to learn uh some induction proofs good luck and take care |
14134 | https://www.cuemath.com/ncert-solutions/what-is-the-maximum-value-of-the-function-sin-x-cos-x/ | What is the maximum value of the function sin x + cos x?
Solution:
Maxima and minima are known as the extrema of a function.
Maxima and minima are the maximum or the minimum value of a function within the given set of ranges.
Let f (x) = sin x + cos x
Therefore,
On differentiating wrt x, we get
f' (x) = cos x - sin x
Now,
f' (x) = 0
⇒ cos x - sin x = 0
⇒ sin x = cos x
On dividing both sides by cos x, we get
⇒ tan x = 1
⇒ x = π / 4, 5π / 4, ...
Hence,
On further differentiating,
f" (x) = - sin x - cos x
= - (sin x + cos x)
Now, f" (x) will be negative when (sin x + cos x) is positive i.e., when sin x and cos x are both positive.
Also, we know that sin x and cos x both are positive in the first quadrant.
Then, f" (x) will be negative when x ∈ (, π / 2)
Thus, we consider x = π / 4
f" (π/4) = - sin (π/4) - cos (π/4)
= (- 2/√2)
= - √2 < 0
By the second derivative test, f will be the maximum at x = π/4 and the maximum value of f is
f (π/4) = sin (π/4) + cos (π/4)
= 1/√2 + 1/√2
= 2/√2
= √2
NCERT Solutions Class 12 Maths - Chapter 6 Exercise 6.5 Question 9
What is the maximum value of the function sin x + cos x?
Summary:
The maximum value of the function sin x + cos x is √2. Maxima and minima are the maximum or the minimum value of a function within the given set of ranges |
14135 | https://interviewmania.com/tutorials/aptitude/unitary-method | Unitary Method - Interviewmania
Academic ResourceAptitudeData InterpretationVerbal ReasoningNon Verbal ReasoningVerbal AbilityProgrammingGeneral KnowledgePuzzle
Online TestAptitude TestData Interpretation TestVerbal Reasoning TestNon Verbal Reasoning TestVerbal Ability Test
Moreहिंदी
Unitary Method
Aptitude Tutorial
Co-Ordinate Geometry
Aptitude test books
Words Problem Based on Numbers
Simplification
Number System
Fractions
LCM and HCF
Discount
Quadratic Equation
Linear Equation
Unitary Method
Approximation
Surds and Indices
Percentage
Square root and cube root
Work and Wages
Profit and Loss
Ratio, Proportion
Partnership
Alligation or Mixture
Time and Work
Pipes and Cistern
Speed, Time and Distance
Problem on Trains
Height and Distance
Boats and Streams
Races and games
Problems on Ages
Clocks and Calendars
Simple interest
Compound Interest
Sets and Functions
Area and Perimeter
Volume and Surface Area of Solid Figures
Sequences and Series
Plane Geometry
Probability
Permutation and Combination
Trigonometry
The unitary method is a method to solve arithmetic problems based on variation in quantities. In this method we find the value of a unit and then the value of a required number of units.
Ex- If the price of 6 apples is ₹ 30 and you have to buy 10 apples, then find the price of 10 apples.
first you have to find the price of 1 apple, then find the price of 10 apples
∵ Price of 6 apples = ₹ 30
∴ Price of 1 apple = 30 ÷ 6 = ₹ 5
∴ Price of 10 apples = 5 × 10 = ₹ 50
Value of one article =Value of the given number of articles
Number of articles
Value of required number of articles = Value of one article × Required number of articles
Direct Proportion :-
Direct proportion is the relation between two quantities if on increasing a quantity, then the other quantity also increase, then both quantities are said to be in direct proportion to each other.
For example- If the speed of a car is increase then the distance covered is also increase.
i.e, first quantity ∝ second quantity
Let the first quantity be x and other y, then
∴x 1=x 2=x 3= .......... =x n
y 1 y 2 y 3 y n
Ex- If the price of 9 bananas is ₹ 72, then find out the price of 12 bananas.
Solution:- Price of 9 bananas = 72
Price of 1 banana =72
9
Price of 12 bananas =72× 12 = ₹ 96
9
By Formula,
More bananas, More price so it is direct proportion
Let the price of 12 bananas be ₹ x
∴x 1=x 2=x 3= .......... =x n
y 1 y 2 y 3 y n
⇒9=12
72 x
⇒ x = 12 ×72= 12 × 8 = ₹ 96
9
Ex– Mohan walks 120 m everyday, how many kilometers will he walk in 5 weeks.
Solution:- 1 day walk = 120 m
Total days = 5 × 7
= 35 days
Total walking distance = 120 × 35
= 4200 m
= 4.2 km ( 1 km = 1000 m )
By formula,
Let the walking distance in 5 weeks or 35 days = x m
More days, more walking distance so it is direct proportion.
⇒x 1=x 2
y 1 y 2
⇒120=x
1 35
⇒ x = 120 × 35
∴ x = 4200 = 4.2 km
Indirect Proportion :-
Indirect proportion is the relation between two quantities if on increasing a quantity, then the other quantity decreases then both quantities are said to be in indirect proportion.
For example- If the speed of car is increase, then time taken is decrease.
i.e, first quantity ∝1
second quantity
Let the first quantity be x and other y, then
x1× y1= x2× y2= x3× y3=…….xn× yn
Ex- If A travels at a speed of 50 km/h and covers a distance in 8 hours, then how much time will he take to travel the same distance at 80 km/h ?
Solution:- Distance = Speed × time
= 50 × 8
= 400 km
Now to cover the same distance at speed of 80 km/h
Time taken =Distance=400= 5 hours
speed 80
By formula,
More speed, Less time so it is indirect proportion
x 1 × y 1= x 2 × y 2 = x 3 × y 3 =…….x n × y n
or, 50 × 8 = 80 × x
⇒ x = 50 ×8= 5 hours
80
Ex- If 30 chains cost ₹ 4650, then how much do 50 chains cost?
Solution:- cost of 30 chains = 4650
cost of 1 chain =4650
30
cost of 50 chains =4650× 50 = 155 × 50 = ₹ 7750
30
By formula,
More chains, More cost so it is direct proportion
Let cost of 50 chairs be ₹ x.
∴x 1=x 2=x 3= .......... =x n
y 1 y 2 y 3 y n
⇒30=50
4650 x
⇒30=50
4650 x
x =( 50 × 4650 )= 155 × 50 = ₹ 7750
30
Formula- If M 1 can do W 1 work in D 1 days T 1 hours per day and M 2 person can do W 2 work in D 2 days T 2 hours per day, then
∴M 1 D 1 T 1=M 2 D 2 T 2
W 1 W 2
Ex- If 15 men working 12 h per day can reap a field in 24 days, in how many days can 27 men reap the field working 10 h per day ?
Solution:- Let the work completed in x days.
Given, M 1 = 15, D 1 = 24, T 1 = 12, M 2 = 27, T 2 = 10, D 2 = ?
∴M 1 D 1 T 1=M 2 D 2 T 2
W 1 W 2
⇒15 × 24 × 12=27 × x × 10
1 1
⇒ x = 15 × 24 ×12× 10
27
∴ x = 16 days
Ex- 22 men can complete a job in 16 days. In how many days, will 32 men complete that job?
Solution:- Let the work completed in x days.
given, M 1 = 22, D 1 = 16, M 2 = 32, D 2 = ?
∴M 1 D 1 T 1=M 2 D 2 T 2
W 1 W 2
⇒ 22 × 16 = 32 × x
⇒ x = 22 ×16= 11
32
∴ x = 11 days
Study Zone
Aptitude
Data Interpretation
Verbal Reasoning
Non Verbal Reasoning
Verbal Ability
Programming
General Knowledge
Puzzle
Online Test
Aptitude Test
Data Interpretation Test
Verbal Reasoning Test
Non Verbal Reasoning Test
Verbal Ability Test
Other Links
About Us
Contact Us
Privacy Policy
Terms Of Use
Copyright Policy
Interviewmania is the world's largest collection of interview and aptitude questions and provides a comprehensive guide to students appearing for placements in India's most coveted companies.
Copyright 2018 InterviewMania.com - All rights reserved. |
14136 | https://cs.stackexchange.com/questions/60677/set-with-maximum-sum-consisting-of-mutually-co-prime-numbers | Skip to main content
set with maximum sum consisting of mutually co-prime numbers
Ask Question
Asked
Modified
9 years, 1 month ago
Viewed
2k times
This question shows research effort; it is useful and clear
3
Save this question.
Show activity on this post.
Definitions. Let n be a natural number and S be a subset of distinct natural numbers all less than n, and mutually co-prime. Then find the maximum sum the set S can have.
Example. Let n=10, then the maximum sum S can have is 30 corresponding to S={1,5,7,8,9}.
What I tried. I tried to implement the following greedy algorithm.
First I divide primes ≤n into 3 lists: list1 containing primes ≤⌊n−−√⌋, list2 containing primes in range (⌊(√n)⌋,⌊n2⌋) and finally list3 containing prime in the range [⌊n2⌋+1,n].
Next I define a function largest(a,b,n), which returns the largest number of the form a∗br less than equal to n.
If there exist two numbers l1∈list1 and l2∈list2 such that diff=largest(l2,l1,n)−(largest(1,l1,n)+l2)>0, I chose the pair (l1,l2) such that diff is maximised. I delete l1 from list1, l2 from list2 and append largest(l2,l1,n) in list2 and repeat step 3. If no such pair (l1,l2) exists such that diff>0, I go to step 4.
I don't change anything in list3.
In the end {1}∪{lr1|l1∈list1 and largest(1,l1,n)=r}∪list2∪list3 is my desired set S and I report the sum of it's elements.
Running example of my algorithm. If n=30,
```
list_1 = {2,3,5}
list_2 = {7,11,13}
list_3 = {17,19,23,29}
The first time step 3 is evaluated I get l_1 = 2 and l_2 = 7 ..
.. as diff = ( 28 - ( 16 + 7 ) ) = 5 > 0 and diff is maximised
so I delete 2 from list_1 and 7 from list_2 and append 28 in list_2
When step 3 is evaluated again no such pair (l_1,l_2) is found
So our desired list becomes S={1,27,25,11,13,28,17,19,23,29} with sum 193.
```
But my algorithm only seems to give correct for few simple cases only. Plus I am not able to prove/disprove or modify any of my assumptions .Now I am hopelessly stuck at the problem and I am not making any progress. But I still believe that some greedy algorithm is at work here.
PS: The question is from project Euler max-sum co-prime set. I would really appreciate just some hint or new direction to think.
greedy-algorithms
number-theory
Share
CC BY-SA 3.0
Improve this question
Follow this question to receive notifications
edited Jul 17, 2016 at 13:12
advocateofnone
asked Jul 17, 2016 at 12:52
advocateofnoneadvocateofnone
3,36411 gold badge2727 silver badges4949 bronze badges
7
think it would be nice to have some gesture on bkg/ motivation on the problem
– vzn
Commented
Jul 17, 2016 at 14:47
That's Euler Problem #355, which means it is tough. They ask for the solution for N = 200,000 which makes me expect a O (n^2) solution :-)
– gnasher729
Commented
Jul 17, 2016 at 18:03
Did you notice that elements in the maximal sum subset do not have more than two unique prime factors?
– Abhigyan Mehra
Commented
Jul 17, 2016 at 18:08
@AbhigyanMehra: That might be coincidence.
– gnasher729
Commented
Jul 17, 2016 at 18:08
Have you considered making a graph?
– Evil
Commented
Jul 18, 2016 at 2:02
|
Show 2 more comments
2 Answers 2
Reset to default
This answer is useful
5
Save this answer.
Show activity on this post.
Project Euler asks you to solve the problems yourself, without help. So dont read on if you want to submit a solution for Project Euler; that would be cheating.
Since the numbers are mutually co-prime, each prime number p is a factor of at most one element of S. On the other hand, if p is small enough then a number could have a factor p2, p3, p4 and so on. We also know that every prime number p ≤ N is used (if p is not used as a factor of any number in the set then we just add p). And don't forget to include the number 1 in the set S :-)
A number x ≤ N cannot have two prime factors greater than N1/2. Therefore the set S contains among other numbers one number xp ≤ N which is a multiple of a prime p>N1/2. That's a good start for finding the optimal set S. We then take the primes q≤N1/2, and either multiply one of the numbers xp by a power of q, or we add a new number xq which is some power of q.
In the Project Euler project with N = 200,000, there are fewer than 90 primes q≤N1/2. We can take each of these primes q in turn, and either multiply one of the existing xp by a power of q, or add a new number xq. We would try to do this achieving the highest possible increase in the sum. If no two q, q' achieve the highest increase in the same way, we can pick the optimal way for each.
In the example N = 30, we would start with xp = 7, 11, 13, 17, 19, 23, 29. We can use q = 2 to change 7 -> 28. q = 3 -> 27, q = 5 -> 25. The gains are 21, 27, 25. Each gain is > N/2. So an optimal solution cannot include a number created by two or more of the q's - that number would be ≤ N, but we would give up two gains > N/2, so this wouldn't be optimal. So in the simple example, we multiply 7 by 22 and add 33 and 52.
With N = 100, we would have xp = 11, 13, 17, 19, 23, ... and q = 2, 3, 5, 7. q = 2: 11 -> 88 gains 77. q = 3: 11 -> 99 gains 88. q = 5: 19 -> 95 gains 76. q = 7: 13 -> 91 gains 78. Unfortunately we have a conflict; q = 2 and q = 3 would both use x11. If we use 11->88 (gain 77), then q = 3: 31->93 with a gain of 62; total gain 139. If we use 11->99 (gain 88) then q = 2: 23->92 (gain 69) has a total gain of 157. So optimal for N = 100 is
```
S = { 1, 99, 91, 17, 95, 92, 29, 31, 37, 41, ,,, }
```
So here is the algorithm: Start with xp = primes > N1/2. Find the primes q≤N1/2. For each q, find the maximum gain that can be achieved using q: Either qk by adding the number qk, or p∗(qk−1) by multiplying xp by qk. If each optimal gain is achieved in a different way, and each gain is ≥ N/2, then we found the optimal solution.
Otherwise, we choose one set of q's that use the same xp. For each of these q's: We assume that this q uses xp, find the optimal solution under the restriction that no other q uses this xp, and choose which q using xp gives the best total.
If there is a case where the two smallest gains add up to less than N, ask someone for a more complex solution :-)
Share
CC BY-SA 3.0
Improve this answer
Follow this answer to receive notifications
edited Jul 18, 2016 at 12:45
answered Jul 17, 2016 at 20:37
gnasher729gnasher729
32.4k3636 silver badges5656 bronze badges
7
Could you add a hint and hide the soln time in yellow region?
– advocateofnone
Commented
Jul 18, 2016 at 13:24
1
This is computer science, not puzzling.
– gnasher729
Commented
Jul 18, 2016 at 20:24
@sasha, Well, the idea behind the Euler project is to encourage/enable people to explore for themselves and discover neat mathematics on their own. The pedagogical principle behind it is to create opportunities for people to experience what it is like to discover new mathematics on their own, by patiently exploring on their own (in the context of a carefully-crafted problem that is likely to reward exploration). It's about failing, failing, failing, but keeping trying, and eventually experiencing the joy of discovering something new yourself.
– D.W.
♦
Commented
Jul 18, 2016 at 22:18
So, ultimately, it seems to me that asking for hints is a bit at odds with the goals and pedagogical principles underlying the Euler project (if I understand them correctly). (See, e.g., meta.math.stackexchange.com/a/21390/14578.) Of course you're welcome to use the Euler problems for whatever purposes you might have, and that's fine -- I'm not judging. But I don't see any reason why others should feel constrained to alter their answers in this way, given that even asking this question seems in some tension with the philosophy of the Project Euler founders.
– D.W.
♦
Commented
Jul 18, 2016 at 22:20
2
@sasha, great, I look forward to your discussion on meta! I'm not proposing to close this question (as I see it, it's not our job to enforce Project Euler's philosophy). I'm just saying, it's up to the answerer how they want to format their answer.
– D.W.
♦
Commented
Jul 19, 2016 at 8:06
|
Show 2 more comments
This answer is useful
2
Save this answer.
Show activity on this post.
I did not follow gnasher729 completely on how he resolved the conflicts he mentions in his answer ( will look into it now ). So as suggested by D.W. I spent more on it and finally solved it. I followed the same algorithm described in my question except for the fact, that in place of doing greedy, one has to use maximum weighted bipartite matching ( a suggestion by Evil ), while trying to pair up a prime less than (√n) with a prime greater than (√n). But as I did not know how to implement maximum weight bipartite matching, I looked closely and the bi-partite graph formed in this case was too easy and one could resolve the conflicts and thus solve for maximum weight manually ( by pen and paper calculator :), the bipartite graph formed had interesting patterns too ). Finally the solution rests on a conjecture I am still unable to proof ( which I assumed in my post ) : to increase the sum of set S you can pair up a prime less than n−−√ with exactly one prime greater equal to n−−√.
Share
CC BY-SA 3.0
Improve this answer
Follow this answer to receive notifications
answered Jul 20, 2016 at 17:36
advocateofnoneadvocateofnone
3,36411 gold badge2727 silver badges4949 bronze badges
5
it is fantastic that you have tried several schemes. You can model the whole problem as bipartite, but taking only part as subproblem is so much better. Try full gnasher729 solution - it works and is based on the same conjecture. It might look like backtracking but it is used on several numbers, so it runs very fast. I would like to encourage you about proving conjecture or posting it (probably at Math) and second - please try some heavy mod - do it for 1000000 and 10000000 - it still runs under 10 seconds ;). Hints only is not very bad, but since answer is full you should acknowledge it.
– Evil
Commented
Jul 20, 2016 at 18:10
@Evil yes I will surely read and implement gnasher729's method.
– advocateofnone
Commented
Jul 20, 2016 at 18:13
I actually think there's a bug in it :-) It might not give an optimal solution if there are several sets of different conflicts and resolving one conflict interferes with another. On the other hand I think conflicts will be rare so this might never happen.
– gnasher729
Commented
Jul 21, 2016 at 7:50
@gnasher729 yes there were only 5 conflicts for N=200000, which I resolved manually. But the elegant way would be to use maximum weighted bipartite matching.
– advocateofnone
Commented
Jul 21, 2016 at 10:37
1
Yeah, 5 conflicts - and automatic resolution even the crude one is fast, hey even backtracking for several groups is still far better than bigger runtime in terms of n.
– Evil
Commented
Jul 21, 2016 at 19:23
Add a comment
|
Start asking to get answers
Find the answer to your question by asking.
Ask question
Explore related questions
greedy-algorithms
number-theory
See similar questions with these tags.
Featured on Meta
Upcoming initiatives on Stack Overflow and across the Stack Exchange network...
Linked
1
Estimating the complexity of an algorithm by looking at code
Related
11
Least Common Non-Divisor
7
Sum of divisors summatory function with Erathosthenes' sieve
3
N numbers, N/2 pairs. Minimizing the maximum sum of a pairing. Proving greedy algorithm
0
How to get the numbers in the Sieve of Eratosthenes with wheel factorisation?
3
Deciding whether a linear combination of logarithm of primes is positive
0
The longest continuous subarray with an integer geometric mean
Hot Network Questions
Pennies to Dollars
SF authors plagued by weird events (pre-1970s story)
Why \bar with unicode-math was shifted right even with latin modern math by default?
Did the success of "Star Wars" contribute to the decision to make "Strangers" starring Don Henderson?
How to adjust recipes when substituting browned or clarified butter for regular butter?
Spectral sequences every mathematician should know
What is the principle of non-liability in the European Union wrt the US Section 230 and social media?
Can you ask the editor to send a partial review?
How can i get high viability of cells on cell culture?
Can an AI model license determine which governing law and jurisdiction apply to the users of this model?
complex 3-clause conditional: 'I realized that if I do..., I will...' vs. 'I realized that if I did..., I would...'
Modifying structures based on imaginary frequencies in Avogadro2
Exam Question: Bank angle/Turn radius change with identical plane with reduction in weight
How can I explain 15 years no work history on my resume as a NEET?
Would a peace treaty between Russia and Ukraine be illegal, according to international law?
SciFi story about father and son after world is destroyed
Using adverbs of frequency in the Future Simple and Present Continuous tenses
Ethical considerations of line editing
Will NASA send Juno to investigate 3i/Atlas?
Aircraft propelled by Liquid Rocket Engines
What is the meaning of "Iesou Christou" genitive in 1 Peter 1:2?
Do strong winds also cause a hovering creature to fall?
Excessive flame on one burner
Michael Huemer's paper argues reincarnation is real: Is there any flaw in his reasoning?
Question feed
By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy. |
14137 | https://my.clevelandclinic.org/health/diseases/16234-gaucher-disease | Abu Dhabi|Canada|Florida|London|Nevada|Ohio|
Home/
Health Library/
Diseases & Conditions/
Gaucher Disease
AdvertisementAdvertisement
Gaucher Disease
Gaucher disease is an inherited genetic disorder. It causes bone pain, anemia, enlarged organs, a swollen, painful belly, and bruising and bleeding problems. There are three types of the disease. Some types of Gaucher disease can lead to severe brain damage and death. But Gaucher disease type 1 (the most common in the U.S.) is treatable.
Advertisement
Cleveland Clinic is a non-profit academic medical center. Advertising on our site helps support our mission. We do not endorse non-Cleveland Clinic products or services.Policy
Care at Cleveland Clinic
Schedule Genetic Counseling
Find a Doctor and Specialists
Make an Appointment
ContentsOverviewSymptoms and CausesDiagnosis and TestsManagement and TreatmentOutlook / PrognosisPreventionLiving With
Overview
What is Gaucher disease?
Gaucher disease (pronounced “go-shay”) is an inherited lysosomal storage disorder (LSD), a type of disease that causes fatty substances (sphingolipids) to build up in your bone marrow, liver and spleen. The sphingolipids weaken bones and enlarge your organs, so they can’t work as they should. There’s no cure for Gaucher disease, but treatments can relieve symptoms and greatly improve quality of life.
Advertisement
Cleveland Clinic is a non-profit academic medical center. Advertising on our site helps support our mission. We do not endorse non-Cleveland Clinic products or services.Policy
Types of Gaucher disease
There are three types of Gaucher disease (or Gaucher’s disease). All of them cause similar symptoms in your organs and bones. Some forms of the disease also affect your brain and neurologic system.
Gaucher disease type 1
The most common type in the U.S., Gaucher disease type 1 affects your spleen, liver, blood and bones. It doesn’t affect your brain or spinal cord. Gaucher disease type 1 is treatable, but there’s no cure. For some people, symptoms are mild. Other people experience severe bruising, fatigue and pain, especially in their bones and belly (abdomen). Symptoms can appear at any age, from early childhood to late adulthood.
Gaucher disease type 2
A rare form of the disorder, Gaucher disease type 2 appears in babies younger than 6 months old. It causes an enlarged spleen, movement problems and severe brain damage. There’s no treatment for Gaucher disease type 2. Babies with this condition usually pass away within two to three years.
Gaucher disease type 3
Worldwide, Gaucher disease type 3 is the most common form, but it’s rare in the U.S. It appears before age 10 and causes bone and organ abnormalities and neurological (brain) problems. Treatments can help many people with Gaucher disease type 3 live into their 20s or 30s.
How common is Gaucher disease?
Gaucher disease is rare. About 6,000 people in the U.S. have the disorder. About 95% of people with Gaucher disease in the U.S. have type 1.
Advertisement
Symptoms and Causes
What causes Gaucher disease?
Gaucher disease is an inherited metabolic disorder. A genetic change (mutation) in the GBA gene causes the disease. The GBA gene is responsible for making an enzyme called glucocerebrosidase (GCase). People with Gaucher disease don’t have enough of this enzyme. Enzymes like GCase are proteins that perform several tasks, including breaking down fats (sphingolipids) in your body.
If your body doesn’t have enough of these enzymes, fatty chemicals (called Gaucher cells) build up in your organs, bone marrow and brain. The excess fats cause a wide range of problems and symptoms. They affect how your organs work, and they destroy blood cells and weaken bones.
What are the symptoms of Gaucher disease type 1?
Gaucher disease symptoms vary from person to person. Some people with Gaucher disease have mild symptoms or none at all. In other people, symptoms can lead to serious health problems and death.
Problems affecting your organs and blood
As fatty chemicals build up in your body, you may experience a range of symptoms in your blood and organs. Sometimes your skin develops brown, pigmented spots. Symptoms range from mild to severe and include:
Anemia: As lipids build up in bone marrow, they destroy red blood cells. Red blood cells carry oxygen throughout your body. Having too few red blood cells is called anemia.
Enlarged organs: Your spleen and liver get bigger as fatty chemicals build up, which causes your belly to become enlarged and tender. An enlarged spleen destroys platelets (blood cells that help blood clot), leading to a low platelet count and bleeding problems.
Bruising, bleeding and clotting issues: A low platelet count causes people with Gaucher disease to bruise easily. Their blood doesn’t clot like it should. They’re at risk of heavy or prolonged bleeding, even after minor injuries, surgery or nosebleeds.
Fatigue: As a result of anemia, people with Gaucher disease often experience fatigue (feeling tired all the time).
Lung problems: Fatty chemicals accumulate in your lungs and make it difficult to breathe.
Problems affecting your bones
Your bones get weak and break down when they don’t get enough blood, oxygen and nutrients. People with Gaucher disease may have symptoms in their bones and joints, including:
Pain: Decreased blood flow causes pain in your bones. Arthritis, joint pain and joint damage are common signs of Gaucher disease.
Osteonecrosis: This condition, also known as avascular necrosis, results from a lack of oxygen reaching your bones. Without enough oxygen, bone tissue fractures into tiny pieces and dies.
Bones that fracture easily: Gaucher disease causes osteoporosis, a condition that occurs when your bones don’t get enough calcium. With osteoporosis (and osteopenia, a mild form of osteoporosis), bones can break easily. Weakened bones can lead to skeletal abnormalities.
Problems affecting your brain and brain stem
In addition to blood, organ and bone symptoms, Gaucher disease types 2 and 3 also cause neurological (brain) problems. Infants with Gaucher disease type 2 develop these symptoms within the first six months of life. They may have skin abnormalities at birth. Symptoms of Gaucher disease type 3 appear by age 10 and become more severe over time.
Neurological symptoms of Gaucher disease types 2 and 3 include:
Feeding challenges and developmental delays (in babies with Gaucher disease type 2).
Cognitive difficulties.
Eye problems, specifically when moving your eyes from side to side.
Problems with gross motor skills and coordination.
Seizures, muscle spasms and quick, jerky movements.
Advertisement
Who is likely to get Gaucher disease?
Anyone can have the disorder, but people with Ashkenazi Jewish ancestry are more likely to have Gaucher disease type 1. Of all people of Ashkenazi (or Ashkenazic) Jewish descent, nearly 1 in 450 has the disorder, and 1 in 10 carries the gene change that causes Gaucher disease.
Ancestry doesn’t play a role in who gets Gaucher disease types 2 and 3. The disorder affects people of all ethnicities.
Diagnosis and Tests
How is Gaucher disease diagnosed?
To diagnose Gaucher disease, your healthcare provider will examine you and ask about your symptoms. Providers diagnose Gaucher disease using a blood test that checks for enzyme levels or a DNA test to see if the gene mutations causing Gaucher disease are present.
To determine if you’re a carrier for Gaucher disease, your provider will perform a DNA test using your saliva or blood. Gaucher disease carriers don’t have any symptoms, but they can pass the disease to their children. If you’re a carrier and considering having children, your provider will refer you to a genetic counselor so you can decide on a plan for your family.
Management and Treatment
Can Gaucher disease be treated?
With regular therapy, Gaucher disease type 1 is treatable. Gaucher disease treatment either increases enzyme levels or decreases the fatty substance that builds up in your body. There’s no treatment for the neurological damage from Gaucher disease types 2 and 3.
Advertisement
Treatment for Gaucher disease type 1 includes:
Enzyme replacement therapy (ERT)
People with Gaucher disease need ERT regularly (every two weeks) for treatment to be effective. Your healthcare provider will give you an enzyme infusion intravenously (through a vein in your arm).
You may receive infusions at an infusion center, or (if you’re tolerating the infusions well) they can be given in your home. During ERT, the enzyme is delivered directly into your bloodstream from where it can reach your organs and bones. Then it breaks down fatty chemicals so they can’t build up.
Substrate reduction therapy (SRT)
This treatment decreases fatty chemicals so they can’t build up in your body. You take SRT medication orally (by mouth). You must continue taking the medication regularly to prevent damage to your body.
Researchers are actively developing several new therapies using genetic engineering and stem cell technologies.
Care at Cleveland Clinic
Schedule Genetic Counseling
Find a Doctor and Specialists
Make an Appointment
Outlook / Prognosis
What is the outlook for people who have Gaucher disease?
With treatment, people with Gaucher disease type 1 can manage the disorder and lead full lives. It’s essential to work with a specialist and continue long-term treatments. Without treatment, Gaucher disease can cause permanent damage.
Treatments can help people with Gaucher disease type 3 live to their 20s or 30s. But the treatment for Gaucher disease type 3 only addresses problems affecting the blood, organs and bones. It doesn’t improve brain function or reverse neurological damage. Due to severe brain damage, babies with Gaucher disease type 2 pass away within the first three years.
Advertisement
Prevention
Can Gaucher disease be prevented?
There’s no way to prevent Gaucher disease if you have the genetic mutation. It’s wise to have testing if you’re at risk. Early treatment may prevent damage to bones and organs from Gaucher disease type 1.
If a DNA test shows that you’re a Gaucher carrier, and you’re planning on starting a family, talk to your healthcare provider. A genetic counselor can give you more information and help you make a plan to decrease the chance of passing on the gene.
Living With
When should I see my healthcare provider?
If you or your child has symptoms of Gaucher disease, see your healthcare provider. You and your children should get tested if you have a family history of the disease or if you have a child who has tested positive for Gaucher disease. Because the disorder runs in families, you should notify your siblings and other family members if you or your child is diagnosed with Gaucher disease.
If you’re of Ashkenazi Jewish descent and considering having children, talk to your provider. A DNA test can determine if you’re a carrier for Gaucher disease. This information will help you plan a family and ensure that your child gets prompt treatment if they have the disease.
A note from Cleveland Clinic
A diagnosis of Gaucher disease can be overwhelming. You may worry about your child’s future or what this means for your well-being, but effective treatments — and promising research — offer hope. By sticking to a treatment plan and working closely with your healthcare provider, you can relieve symptoms and prevent long-term damage. Talk to your provider about how to manage the disease and monitor your health.
Care at Cleveland Clinic
Do certain health conditions seem to run in your family? Are you ready to find out if you’re at risk? Cleveland Clinic’s genetics team can help.
Schedule Genetic Counseling
Find a Doctor and Specialists
Make an Appointment
Medically Reviewed
Last reviewed on 08/21/2023.
Learn more about the Health Library and our editorial process.
AdvertisementAdvertisement
Ad
Questions216.444.2538
Appointments & Locations
Request an Appointment
Find a Primary Care Provider
Rendered: Mon Sep 29 2025 05:46:41 GMT+0000 (Coordinated Universal Time) |
14138 | https://byjus.com/maths/square-root-of-300/ | The square root of 300 is an irrational number. The square root of a number is a number that, when multiplied by itself, gives the perfect square number. The square root of 300 in radical form is written as √300, where ‘√’ is called the radical sign. The square root of 300 in exponential form is written as (300)½ or (300)0.5 . Since the square root of 300 is not a whole number, 300 is not a perfect square number. In this article, we shall learn how to find the square root of 300.
Square Root of 300 Indecimal form: 17.320508 (approx.)
In radical form: ± 10√3
Square of 30090,000
What Is the Square Root of 300?
The square root of 300 is a number whose square is 300. Let x be a real number, such that
x × x = x 2 = 300. Now, we have to determine the value of x.
Thus, we can also express the square root of 300 as the roots of the quadratic equation x 2 – 300 = 0
x 2 – 300 = 0
⇒ x 2 = 300 (taking square roots on both sides)
⇒ x = √(300)
⇒ x = ± 10√3
We can verify that by squaring ± 10√3. Thus, we get 300.
Check out the properties of perfect square numbers.
How to Find the Square Root of 300?
Let us calculate the square root of 300 using different methods:
Repeated subtraction method
Prime factorisation method
Long division method
Approximation Method
Repeated Subtraction Method
To find the square root using this method, we shall successively subtract odd numbers from the given number until we get zero. The nth odd number for which we get the result zero, the square root of 300 will be n.
Step 1 300–1=299
Step 2 299–3=296
Step 3 296–5=291
Step 4 291–7=284
Step 5 284–9=275
Step 6 275–11=264
Step 7 264–13=251
Step 8 251–15=236
Step 9 236–17=219
Step 10 219–19=200
Step 11 200–21=179
Step 12 179–23=156
Step 13 156–25=131
Step 14 131–27=104
Step 15 104–29=75
Step 16 75–31=44
Step 17 44–33=11
Step 18 11–35=-24
In the 18th step, we get a negative integer instead of zero. Hence, the square root of 300 cannot be calculated using this method. We can estimate that root 300 is an irrational number between 17 and 18.
Prime Factorisation Method
We shall prime factorise the given, then make pairs of two for each number to find the square root of the number.
Prime factorisation of 300 = 2 × 2 × 3 × 5 × 5
√300 = √[(2 × 2) × 3 × (5 × 5)] = 2 × 5 × √3 = 10√3
Thus, to find the square root of any number by the prime factorisation method, the following are steps:
Prime factorise the given number
Make pairs of two for each of the prime factors.
Take only one prime factor for each pair.
If any prime remains unpaired, then the number is not a perfect square.
Long Division Method
To calculate the square root of 300 by the long division method, we make pairs of digits of 300 from right to left. Then, perform the division as follows:
To learn how to find the square root of any number by the long division method, click here.
Approximation Method
We shall use Newton’s formula to find an approximate value of the square root of any number, perfect square or not. The formula is given as
X=1 2(X A+A)
Where,
X = Number whose square root needs to be calculated
A = Guess value of the square root of the given number; we generally take the number whose square is nearest to X.
Here, X = 300, A = 17 as 17 2 = 289 < 300. Substituting these values in the formula, we get
300=1 2(300 17+17)=17.32(a p p r o x.).
Video Lessons
Visualising square roots
10,362
Finding Square roots
69,163
Related Articles
Trick to Find Square Root
Square Root of Decimals
Square Root Table
Square Root Calculator
Solved Examples on Square Root of 300
Example 1:
Find the smallest number, which must be multiplied by 300 to make it a perfect square number. Also, find the square root of the perfect square number.
Solution:
Prime factorisation of 300 = (2 × 2) × 3 × (5 × 5)
We observe that only 3 remain unpaired. Thus, 3 must be multiplied by 300.
∴ 300 × 3 = 900 is the perfect square number.
Square root of 900 = √[(2 × 2) × (3 × 3) × (5 × 5)] = 2 × 3 × 5 = 30
Example 2:
There are 300 chairs in an auditorium hall. They are arranged in equal numbers of rows and columns of chairs. Find out how many chairs will be left after doing so.
Solution:
The greatest perfect square number less than 300 is 289, which is the square of 17.
Thus, there will be 17 rows and columns of chairs.
The number of chairs left = 300 – 289 = 11
Example 3:
Find the diameter of the sphere whose total surface area is 3768 mm 2 (Use 𝜋 = 3.14).
Solution:
Let r be the radius of the sphere.
The total surface area of the sphere = 4𝜋r 2 = 3768 mm 2
⇒ r 2 = (3768)/( 4 × 3.14) = 300
⇒ r = √300 ≈ 17.32 cm
∴ diameter of the sphere is 2 × 17.32 = 34.64 cm
Frequently Asked Questions on Square Root of 300
Q1
What is the square root 300?
The square root of 300 is ± 17.3205 (approx.).
Q2
Is 300 a perfect square number?
No, 300 is not a perfect square number, as there is no such integer whose square is 300.
Q3
What is the prime factorisation of 300?
The prime factorisation of 300 is 2 × 2 × 3 × 5 × 5.
Q4
How to simplify the square root of 300?
The square root of 300 can be easily simplified using the prime factorisation and long division method.
Q5
What is the square of 300?
The square of 300 is 90,000 or 9 × 10 4.
Q6
What is the cube root of 300?
The cube root of 300 is 6.6943295.
Register with BYJU'S & Download Free PDFs
Send OTP
Download Now
Register with BYJU'S & Watch Live Videos
Send OTP
Watch Now
×
To continue watching the video please share the details.
Send OTP
Did not receive OTP?
Request OTP on Voice Call
Play Now |
14139 | https://www.scribd.com/document/699414643/Question-Bank-Economics-Rsg | Question Bank Economics RSG
Question Bank Economics RSG
Uploaded by
AI-enhanced title and description
Question Bank Economics RSG
The document provides information about Rahul Sir's classes on MA ECO(ENTRANCE) Mathematics. It includes 31 practice questions covering topics like algebra, quadratic equations, inequalities, and other math concepts.
The questions have multiple choice answers and range from relatively basic to more advanced. They are meant to help students prepare for entrance exams through problem solving practice.
Rahul Sir provides his contact information for those interested in joining his study group classes. The document serves as an overview of the types of math problems and concepts covered in the classes.
Question Bank Economics RSG
Question Bank Economics RSG
Uploaded by
AI-enhanced title and description
Share this document
Footer menu
About
Support
Legal
Social
Get our free apps
About
Legal
Support
Social
Get our free apps |
14140 | https://artofproblemsolving.com/wiki/index.php/Dao_Thanh_Oai_geometric_results?srsltid=AfmBOopZvSTgi-83rWivRuY3gsOCQR-K8Ea1TOGzGNRt0uS9XhntsSdw | Page
Toolbox
Search
Dao Thanh Oai geometric results
Dao Thanh Oai was born in Vietnam in 1986. He is an engineer with many innovative solutions for Vietnam Electricity and mathematician with a large number of remarkable discoveries in classical geometry. Some of his results are shown and proven below.
Page made by vladimir.shelomovskii@gmail.com, vvsss
Contents
Dao bisectors theorem
Let a convex quadrilateral be given. Let and be the bisector and the midpoint of and respectively. Let intersect at the point inside Denote
Let point be the point inside such that
Let be the point at ray such that Define similarly.
Prove that
Prove that
Let points and be the points symmetric with respect and and be the points symmetric with respect and
Prove that and
Proof
The spiral similarity taking to and to has center and angle Therefore spiral similarity taking to and to has the same center and angle
so maps into segment parallel
Let be the spiral similarity centered at with angle and coefficient
Let be spiral similarity centered at with angle and coefficient
It is trivial that
It is known ( Superposition of two spiral similarities) that is the point with properties
Note: If superposition of two spiral similarities is possible, the result is valid even for positions of point outside the quadrilateral and for a non-convex quadrilateral.
Bottema's theorem
Let triangle be given. Let triangles be the isosceles rectangular triangles (see diagram).
Prove that and be the midpoints of and respectively.
Proof
For given point one can find points using rotation point around at the in counterclockwise (clockwise) direction. One can find point using simmetry with respect
We use Dao bisectors theorem for quadrilateral with and get existence given triangle with need properties.
Napoleon's theorem
Let isosceles triangles with an angle of 120 degrees at the apex be constructed on the sides of an arbitrary triangle in the outer direction. The triangle with vertices at the apex those triangles names outer Napoleon triangle. Napoleon's theorem states that it is the equilateral triangle.
Let triangle be given. Let triangles be the isosceles triangles with angles (see diagram).
Prove that is the equilateral triangle.
Proof
For given point one can find points using rotation point around at the in counterclockwise (clockwise) direction and homothety with coefficient
We use Dao bisectors theorem for quadrilateral with and get
Note: Napoleon's theorem can also be proved for the inner triangle using the method of a pair of spiral symmetries (see diagram).
Finsler - Hadwiger theorem
Let two squares with common vertex be given. The theorem states that the quadrilateral of midpoints is (the Finsler–Hadwiger) square.
Let and be diagonals of given squares with common vertex Let and be the midpoints of and respectively, and let and be the centers of these squares.
Prove that is square.
Proof
Quadrilateral of midpoints is the parallelogram
We use Dao bisectors theorem for quadrilateral with and get
is the square.
Brahmagupta's theorem
Let a cyclic quadrilateral with be given, be the midpoint
Prove that (Brahmagupta's theorem).
Proof
is circumcenter
We use Dao bisectors theorem for quadrilateral with and get
Van Aubel's theorem
Let squares constructed on the sides of a quadrilateral be given.
Let be the midpoints and
Notation is shown in the diagram.
Prove that
Prove that and are the perpendicular diameters of the circle centered at centroid of and points and lies on this circle.
Proof
Denote the centers of given squares
the centroid of
It is evident that
Vectors with sign ' are the rotations of the vectors without this sign in counterclockwise direction, so and
Similarly,
and are the results of rotation and in counterclockwise direction at therefore is the result of rotation in counterclockwise direction at
Similarly about and
Similarly,
Van Aubel - Dao theorem
Let right similar triangles
constructed on the sides of a quadrilateral be given. Denote
Prove that
Proof
Let be the midpoint
We use Dao bisectors theorem for quadrilateral with and get
We use Dao bisectors theorem for quadrilateral with and get
If we get Van Aubel’s theorem.
Thébault - Dao's problem I
Let the quadrilateral in Van Aubel - Dao theorem be the parallelogram.
Prove that is the rectangle.
Proof
is symmetrical to with respect to
and are collinear, therefore is the rectangle.
vladimir.shelomovskii@gmail.com, vvsss
Something appears to not have loaded correctly.
Click to refresh. |
14141 | http://media.opencurriculum.org/resources/The_Division_Algorithm-_Converting_Decimal_Division_into_Whole_Number_Division_Using_Fractions.pdf | Lesson 14: The Division Algorithm—Converting Decimal Division into Whole Number Division Using Fractions Date: 9/16/13 127 © 2013 Common Core, Inc. Some rights reserved. commoncore.org This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. NYS COMMON CORE MATHEMATICS CURRICULUM 6•2 Lesson 14 Lesson 14: The Division Algorithm—Converting Decimal Division into Whole Number Division Using Fractions Student Outcomes Students use the algorithm to divide multi-digit numbers with and without remainders. Students compare their answer to estimates to justify reasonable quotients. Students understand that when they “bring down” the next digit in the algorithm, they are distributing, recording, and shifting to the next place value. Classwork Example 1 (4 minutes) Students will review how to divide a whole number by a number that is not a factor resulting in a non-whole number quotient. They will first estimate the quotient. Then they will use the division algorithm to get an exact answer. Finally, they will compare the two to decide if the answer is reasonable. Example 1 Divide: 𝟑𝟏, 𝟐𝟏𝟖÷ 𝟏𝟑𝟐 Estimate the quotient. Answers may vary. Possible estimates include the following: 30,000 ÷ 100 = 300 or 30,000 ÷ 150 = 200. How was solving this question similar to the questions you solved in Lessons 12 and 13? Answers may vary. To get the quotient in all questions, I used the division algorithm where I divided two whole numbers. MP.2 As we divide, we can use our knowledge of place value to guide us. 𝟑𝟏𝟐 hundreds ÷ 𝟏𝟑𝟐: 𝟐 hundreds 𝟒𝟖𝟏 tens ÷ 𝟏𝟑𝟐: 𝟑 tens 𝟖𝟓𝟖 ones ÷ 𝟏𝟑𝟐: 𝟔 ones 𝟔𝟔𝟎 tenths ÷ 𝟏𝟑𝟐: 𝟓 tenths Lesson 14: The Division Algorithm—Converting Decimal Division into Whole Number Division Using Fractions Date: 9/16/13 128 © 2013 Common Core, Inc. Some rights reserved. commoncore.org This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. NYS COMMON CORE MATHEMATICS CURRICULUM 6•2 Lesson 14 How was solving this question different than the questions you solved in Lessons 12 and 13? Answers may vary. In this example, the divisor is not a factor of the dividend. I know this because the quotient was not a whole number. When I got to the ones place, I still had a remainder, so I placed a zero in the tenths place so that I could continue dividing. Then I divided 660 tenths by 132 ones. The answer to this question had a decimal in the quotient where the other lessons had whole number quotients. Example 2 (4 minutes) We have seen questions with decimals in the quotient. Now let’s discuss how we would divide when there are decimals in the dividend and divisor. (Please note that this question is quite difficult. Students will most likely struggle with this question for quite some time. You may want to offer this question as a challenge.) Example 2 Divide: 𝟗𝟕𝟒. 𝟖𝟑𝟓÷ 𝟏𝟐. 𝟒𝟓 Point out that all whole number division has involved dividing two quantities that are ultimately counting with the same unit: ones (e.g , 32,218 ones divided by 132 ones) Now let’s take a look at what this question is asking including the units. 974 ones and 835 thousandths, 12 ones and 45 hundredths What do you notice about these two numbers? They do not have the same unit. How could we rewrite these numbers, so that they have the same units? 974.835 ÷ 12.450 974,835 thousandths, 12 ,450 thousandths Now, the division problem that we need to solve is 974,835 thousandths ÷ 12,450 thousandths MP.2 Lesson 14: The Division Algorithm—Converting Decimal Division into Whole Number Division Using Fractions Date: 9/16/13 129 © 2013 Common Core, Inc. Some rights reserved. commoncore.org This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. NYS COMMON CORE MATHEMATICS CURRICULUM 6•2 Lesson 14 Example 3 (4 minutes) Example 3 A plane travels 𝟑, 𝟔𝟐𝟓. 𝟐𝟔 miles in 𝟔. 𝟗 hours. What is the plane’s unit rate? What is this question asking us to do? This question is asking me to divide the miles by hours so that I can find out how many miles the plane went in 1 hour, like we did in Module 1. How can we rewrite 3,625.26 (362,526 hundredths) and 6.9 (69 tenths) using the same units? First, I would rewrite the question as 3,625.26 ÷ 6.90. This is the same as 362,526 hundredths ÷ 690 hundredths. Now we can solve by dividing 362,526 ÷ 690. Let’s check our answer to ensure that it is reasonable. What are some different ways that we can do this? We can multiply the quotient with the original divisor and see if we get the original dividend. 6.9 × 525.4 = 3,625.26. We could also estimate to check our answer. 3,500 ÷ 7 = 500. Because we rounded down, we should expect our estimate to be a little less than the actual answer. Exercises 1–7 (20 minutes) Students can work on the problem set alone or in partners. Students should be estimating the quotient first and using the estimate to justify the reasonableness of their answer. Exercises 1. Daryl spent $𝟒. 𝟔𝟖 on each pound of trail mix. He spent a total of $𝟏𝟒. 𝟎𝟒. How many pounds of trail mix did he purchase? Estimate 𝟏𝟓÷ 𝟓= 𝟑 𝟏𝟒. 𝟎𝟒÷ 𝟒. 𝟔𝟖 𝟏, 𝟒𝟎𝟒 hundredths ÷ 𝟒𝟔𝟖 hundredths 𝟏, 𝟒𝟎𝟒÷ 𝟒𝟔𝟖= 𝟑 Daryl purchased 𝟑 pounds of trail mix. Our estimate of 𝟑 shows that our answer of 𝟑 is reasonable. Lesson 14: The Division Algorithm—Converting Decimal Division into Whole Number Division Using Fractions Date: 9/16/13 130 © 2013 Common Core, Inc. Some rights reserved. commoncore.org This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. NYS COMMON CORE MATHEMATICS CURRICULUM 6•2 Lesson 14 2. Kareem purchased several packs of gum to place in gift baskets for $𝟏. 𝟐𝟔 each. He spent a total of $𝟖. 𝟖𝟐. How many packs of gum did he buy? Estimate 𝟗÷ 𝟏= 𝟗 𝟖. 𝟖𝟐÷ 𝟏. 𝟐𝟔 𝟖𝟖𝟐 hundredths ÷ 𝟏𝟐𝟔 hundredths 𝟖𝟖𝟐÷ 𝟏𝟐𝟔= 𝟕 packs of gum Our estimate of 𝟗 shows that our answer of 𝟕 is reasonable. 3. Jerod is making candles from beeswax. He has 𝟏𝟑𝟐. 𝟕𝟐 ounces of beeswax. If each candle uses 𝟖. 𝟒 ounces of beeswax, how many candles can he make? Will there be any wax left over? Estimate 𝟏𝟐𝟎÷ 𝟖= 𝟏𝟓 𝟏𝟑𝟐. 𝟕𝟐÷ 𝟖. 𝟒 𝟏𝟑, 𝟐𝟕𝟐 hundredths ÷ 𝟖𝟒 tenths 𝟏𝟑, 𝟐𝟕𝟐 hundredths ÷ 𝟖𝟒𝟎 hundredths 𝟏𝟑, 𝟐𝟕𝟐÷ 𝟖𝟒𝟎= 𝟏𝟓 candles with wax leftover Our estimate of 𝟏𝟓 shows that our answer of 𝟏𝟓. 𝟖 is reasonable. 4. There are 𝟐𝟎. 𝟓 cups of batter in the bowl. If each cupcake uses 𝟎. 𝟒 cups of batter, how many cupcakes can be made? Estimate 𝟐𝟎÷ 𝟎. 𝟓= 𝟒𝟎 𝟐𝟎. 𝟓÷ 𝟎. 𝟒 𝟐𝟎𝟓 tenths ÷ 𝟒 tenths Only 𝟓𝟏 cupcakes can be made. There is not quite enough for 𝟓𝟐. Our estimate of 𝟒𝟎 shows that our answer of 𝟓𝟏. 𝟐𝟓 is reasonable. 5. In Exercises 3 and 4, how were the remainders, or extra parts, interpreted? In both Exercises 3 and 4, the remainders show that there was not quite enough to make another candle or cupcake. In the candle example, there was wax left over that could be saved for the next time there is more wax. However, in the cupcake example, the leftover batter could be used to make a smaller cupcake, but it would not count as another whole cupcake. Lesson 14: The Division Algorithm—Converting Decimal Division into Whole Number Division Using Fractions Date: 9/16/13 131 © 2013 Common Core, Inc. Some rights reserved. commoncore.org This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. NYS COMMON CORE MATHEMATICS CURRICULUM 6•2 Lesson 14 6. 𝟏𝟓𝟗. 𝟏𝟐÷ 𝟔. 𝟖 Estimate 𝟏𝟔𝟎÷ 𝟖= 𝟐𝟎 𝟏𝟓𝟗. 𝟏𝟐÷ 𝟔. 𝟖 𝟏𝟓, 𝟗𝟏𝟐 hundredths ÷ 𝟔𝟖 tenths 𝟏𝟓, 𝟗𝟏𝟐 hundredths ÷ 𝟔𝟖𝟎 hundredths Our estimate of 𝟐𝟎 shows that our answer of 𝟐𝟑. 𝟒 is reasonable. 7. 𝟏𝟔𝟕. 𝟔𝟕÷ 𝟖. 𝟏 Estimate 𝟏𝟔𝟎÷ 𝟖= 𝟐𝟎 𝟏𝟔𝟕. 𝟔𝟕÷ 𝟖. 𝟏 𝟏𝟔, 𝟕𝟔𝟕 hundredths ÷ 𝟖𝟏 tenths 𝟏𝟔, 𝟕𝟔𝟕 hundredths ÷ 𝟖𝟏𝟎 hundredths Our estimate of 𝟐𝟎 shows that our answer of 𝟐𝟎. 𝟕 is reasonable. Closing (3 minutes) Describe the steps that you use to change a division question with decimals to a division question with whole numbers? If the divisor and or the dividend are not whole numbers, we find the largest common unit, smaller than one, that allows us to rewrite each as a whole number multiple of this common unit. Example: 1,220.934 ones ÷ 54.34 ones 12,209.34 tenths ÷ 543.4 tenths 122,093.4 hundredths ÷ 5,434 hundredths 1,220,934 thousandths ÷ 54,340 thousandths We could keep going, and both the dividend and divisor would still be whole numbers, but we were looking for the largest common unit that would make this happen. Exit Ticket (5 minutes) Lesson 14: The Division Algorithm—Converting Decimal Division into Whole Number Division Using Fractions Date: 9/16/13 132 © 2013 Common Core, Inc. Some rights reserved. commoncore.org This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. NYS COMMON CORE MATHEMATICS CURRICULUM 6•2 Lesson 14 Name _________ Date________ Lesson 14: The Division Algorithm—Converting Decimal Division into Whole Number Division Using Fractions Exit Ticket 1. Lisa purchased almonds for $3.50 per pound. She spent a total of $14.70. How many pounds of almonds did she purchase? 2. Divide 125.01 ÷ 5.4. Then check your answer for reasonableness. Lesson 14: The Division Algorithm—Converting Decimal Division into Whole Number Division Using Fractions Date: 9/16/13 133 © 2013 Common Core, Inc. Some rights reserved. commoncore.org This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. NYS COMMON CORE MATHEMATICS CURRICULUM 6•2 Lesson 14 Exit Ticket Sample Solutions 1. Lisa purchased almonds for $𝟑. 𝟓𝟎 per pound. She spent a total of $𝟏𝟒. 𝟕𝟎. How many pounds of almonds did she purchase? Lisa purchased 𝟒. 𝟐 pounds of almonds. 2. Divide: 𝟏𝟐𝟓. 𝟎𝟏÷ 𝟓. 𝟒 The quotient of 𝟏𝟐𝟓. 𝟎𝟏 and 𝟓. 𝟒 is 𝟐𝟑. 𝟏𝟓. Estimate 𝟏𝟐𝟓÷ 𝟓= 𝟐𝟓 My estimate of 𝟐𝟓 is near 𝟐𝟑, which shows that my answer is reasonable. Problem Set Sample Solutions 1. Aslan purchased 𝟑. 𝟓 lbs. of his favorite mixture of dried fruits to use in a trail mix. The total cost was $𝟏𝟔. 𝟖𝟕. How much does the fruit cost per pound? 𝟏𝟔. 𝟖𝟕 ÷ 𝟑. 𝟓 𝟏, 𝟔𝟖𝟕 hundredths ÷ 𝟑𝟓𝟎 hundredths The dried fruit costs $𝟒. 𝟖𝟐 per pound. Lesson 14: The Division Algorithm—Converting Decimal Division into Whole Number Division Using Fractions Date: 9/16/13 134 © 2013 Common Core, Inc. Some rights reserved. commoncore.org This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. NYS COMMON CORE MATHEMATICS CURRICULUM 6•2 Lesson 14 2. Divide: 𝟗𝟗𝟒. 𝟏𝟒÷ 𝟏𝟖. 𝟗 𝟗𝟗𝟒. 𝟏𝟒÷ 𝟏𝟖. 𝟗 𝟗𝟗, 𝟒𝟏𝟒 hundredths ÷ 𝟏, 𝟖𝟗𝟎 hundredths 𝟗𝟗𝟒. 𝟏𝟒÷ 𝟏𝟖. 𝟗= 𝟓𝟐. 𝟔 |
14142 | https://www.imaios.com/en/e-anatomy/anatomical-structures/spinal-accessory-nerve-120993232 | Spinal accessory nerve - e-Anatomy - IMAIOS
Big News: Our Website is Now Accessible from China!
Seamless browsing, local payment options, and dedicated support.
Access IMAIOS directly via imaios.cn
Menu
Sign in
MY ACCOUNT
My account
Profile
My training coursesMy cases
SecurityInvoicesSubscriptionsAdministration
Log out
SUBSCRIBE
PRODUCTS
DAILY PRACTICE
e-Anatomy
IMAIOS DICOM Viewer
vet-Anatomy
Anatomical structures
LEARNING
Healthcare e-learning
e-MRI
QEVLAR
Breast imaging learning tool
COMMUNITY
e-Cases
zoo-Paedia
PRICING
SOLUTIONS
ORGANIZATION TYPE
University, library, school
Hospital, clinic, healthcare network
Residency program
Association, society
Imaging center, Group practice
Medical imaging vendor
PROFESSION
Radiologist
Radiology resident
Student
Veterinarian
RESOURCES
Blog News, opinions & thoughts of anatomy, medical imaging
Scientific press Articles talking about IMAIOS and its products
Users feedback What our users say about us
Why trust us? Our commitments
Help Center Get help with your subscription, account and more
Contact us Other questions?
languages
English
Español
Français
Português
Deutsch
Polski
Italiano
日本語
中文 (简体)
한국어
Русский
CONTACT US
Sign in
Sign in ProfileMy training coursesMy cases SecurityInvoicesSubscriptionsAdministrationLog out
Contact us
Languages EnglishEspañolFrançaisPortuguêsDeutschPolskiItaliano日本語中文 (简体)한국어Русский
[x]
PRODUCTS
DAILY PRACTICE
e-Anatomy Human anatomy atlas
IMAIOS DICOM Viewer Free DICOM viewer
vet-Anatomy Veterinary anatomy atlas
Anatomical structures Human and veterinary anatomical nomenclature
LEARNING
Healthcare e-learning Medical training 100% online
e-MRI MRI step-by-step, interactive course on magnetic resonance imaging
QEVLAR App to prepare the Core Exam
Breast imaging learning tool App to train reading breast tomosynthesis images
COMMUNITY
e-Cases Imaging clinical cases
zoo-Paedia Imaging veterinary cases
PRICING
SOLUTIONS
ORGANIZATION TYPE
University, library, school
Hospital, clinic, healthcare network
Residency program
Association, society
Imaging center, Group practice
Medical imaging vendor
PROFESSION
Radiologist
Radiology resident
Student
Veterinarian
RESOURCES
BlogNews, opinions & thoughts of anatomy, medical imaging
Scientific pressArticles talking about IMAIOS and its products
Users feedbackWhat our users say about us
Why trust us?Our commitments
Help CenterGet help with your subscription, account and more
Contact usOther questions?
SUBSCRIBE
e-Anatomy The Anatomy of Imaging
HOME
e-Anatomy
Anatomical structures
...
Trunk of accessory nerve
External branch
Human anatomy 2
ha2
Human body
General Anatomy
View the module
Spinal accessory nerve
Nervus accessorius spinalis
Latin synonym: Ramus externus nervi accessorius
Synonym: External branch of accessory nerve
Related terms: External branch; External branch (Accessory nerve [XI])
Definition
Muhammad A. Javaid
Spinal accessory nerve refers to the spinal component of the accessory nerve, which innervates the sternocleidomastoid and trapezius muscles.
The accessory nerve is the eleventh cranial nerve, which is purely somatic motor. It comprises of spinal and cranial sub-components. The spinal sub-component (a.k.a. spinal accessory nerve) arises as nerve filaments from the C1-C6 cervical spinal motor nerve roots. These nerve filaments coalesce and ascend via foramen magnum to enter the cranial cavity. Here, the spinal accessory nerve combines with the cranial sub-component of the accessory nerve. The latter arises from caudal part of medulla oblongata (nucleus ambiguous). Together, they form the accessory nerve that exits the cranial cavity via the jugular foramen.
Outside the skull, the two sub-components, once again, separate to form cranial and spinal accessorynerves. The spinal sub-component innervates trapezius and sternocleidomastoid muscles. Whereas, the cranial sub-component adjoins the vagus nerve to form a pharyngeal plexus that innervates pharyngeal muscles.
References
AlShareef, S. and Newton, B.W. Accessory Nerve Injury. [Updated 2022 May 1]. In: StatPearls [Internet]. Treasure Island (FL): StatPearls Publishing; 2022 Jan-. Available from:
Gallery
View the module
Anatomical hierarchy
Human anatomy 2
Human body>
Integrating systems>
Nervous system>
Peripheral nervous system>
Cranial nerves>
Accessory nerve>
Spinal accessory nerve
Underlying structures: There are no anatomical children for this anatomical part
Human anatomy 1
Systemic anatomy>
Nervous system>
Peripheral nervous system>
Cranial nerves>
Accessory nerve [XI]>
Trunk of accessory nerve>
External branch
Underlying structures:
Muscular branches
Human neuroanatomy
Peripheral nervous system>
Cranial nerves>
Accessory nerve>
Trunk of accessory nerve>
External branch
Underlying structures:
Muscular branches
Translations
MEDIASTINUM-HEART
CT chestCT
PREMIUM
CT axial chestCT
PREMIUM
CTA coronary arteriesCT
PREMIUM
MediastinumIllustrations
PREMIUM
HeartIllustrations
FREE
CoronarographyAngiography
PREMIUM
CT body (lymph nodes)CT
PREMIUM
FDG-PET/CT whole bodyPET-CT
PREMIUM
Radiography chest abdomen pelvisRadiographs
FREE
ABDOMEN
Female abdomen-pelvis CTCT
PREMIUM
CT axial male abdomen and pelvisCT
PREMIUM
CT body (lymph nodes)CT
PREMIUM
CT peritoneal cavityCT
PREMIUM
FDG-PET/CT whole bodyPET-CT
PREMIUM
Digestive systemIllustrations
PREMIUM
Radiography chest abdomen pelvisRadiographs
FREE
Magnetic Resonance CholangiopancreatographyMRI
PREMIUM
PELVIS
MRI female pelvisMRI
PREMIUM
MRI male pelvisMRI
PREMIUM
Female pelvisIllustrations
PREMIUM
Male pelvisIllustrations
PREMIUM
CT axial male abdomen and pelvisCT
PREMIUM
CT body (lymph nodes)CT
PREMIUM
CT peritoneal cavityCT
PREMIUM
FDG-PET/CT whole bodyPET-CT
PREMIUM
Radiography chest abdomen pelvisRadiographs
FREE
SHOULDER
MR arthrography shoulderMRI
PREMIUM
MRI shoulderMRI
PREMIUM
CT arthrography shoulderCT arthrogram
PREMIUM
MRI upper extremityMRI
PREMIUM
Radiography upper extremityRadiographs
PREMIUM
Upper extremityIllustrations
PREMIUM
MRI brachial plexusMRI
PREMIUM
ELBOW
MRI elbowMRI
PREMIUM
CT arthrography elbowCT arthrogram
PREMIUM
MRI upper extremityMRI
PREMIUM
Radiography upper extremityRadiographs
PREMIUM
Upper extremityIllustrations
PREMIUM
WRIST-HAND
MRI wristMRI
PREMIUM
MRI handMRI
PREMIUM
MRI thumbMRI
PREMIUM
MRI finger of handMRI
PREMIUM
MRI upper extremityMRI
PREMIUM
Radiography upper extremityRadiographs
PREMIUM
Upper extremityIllustrations
PREMIUM
HIP
Hip MRIMRI
PREMIUM
MRI lower extremityMRI
PREMIUM
Radiography lower extremityRadiographs
FREE
Lower extremityIllustrations
PREMIUM
KNEE
Knee MRIMRI
PREMIUM
CT arthrography kneeCT arthrogram
PREMIUM
MRI lower extremityMRI
PREMIUM
Radiography lower extremityRadiographs
FREE
Lower extremityIllustrations
PREMIUM
ANKLE-FOOT
MRI ankle and hindfootMRI
PREMIUM
Forefoot MRIMRI
PREMIUM
MRI lower extremityMRI
PREMIUM
Radiography lower extremityRadiographs
FREE
Lower extremityIllustrations
PREMIUM
UPPER LIMB
MRI upper extremityMRI
PREMIUM
MRI shoulderMRI
PREMIUM
MRI wristMRI
PREMIUM
MRI elbowMRI
PREMIUM
MRI handMRI
PREMIUM
Radiography upper extremityRadiographs
PREMIUM
Upper extremityIllustrations
PREMIUM
Arteriography upper extremityAngiography
FREE
Visible Human ProjectPhotography
PREMIUM
LOWER LIMB
Lower extremityIllustrations
PREMIUM
Radiography lower extremityRadiographs
FREE
MRI lower extremityMRI
PREMIUM
Hip MRIMRI
PREMIUM
Knee MRIMRI
PREMIUM
CT arthrography kneeCT arthrogram
PREMIUM
MRI ankle and hindfootMRI
PREMIUM
Forefoot MRIMRI
PREMIUM
Lower limb CTACT
PREMIUM
Leg arteries and bonesCT
FREE
Arteriography lower extremityAngiography
FREE
Select a zone
WHOLE BODY
CT body (lymph nodes)CT
PREMIUM
FDG-PET/CT whole bodyPET-CT
PREMIUM
Visible Human ProjectPhotography
PREMIUM
SPINE
MRI cervical spineMRI
PREMIUM
MRI lumbar spineMRI
PREMIUM
CT lumbar spineCT
PREMIUM
MRI brachial plexusMRI
PREMIUM
SpineIllustrations
PREMIUM
Spinal cordIllustrations
PREMIUM
Radiography spineRadiographs
FREE
CT head and neckCT
PREMIUM
MRI head and neckMRI
PREMIUM
HEAD AND NECK
CT head and neckCT
PREMIUM
CT brainCT
PREMIUM
MRI brainMRI
PREMIUM
MRI axial brainMRI
FREE
CT faceCT
PREMIUM
MRI head and neckMRI
PREMIUM
MRA brainMRI
PREMIUM
BrainIllustrations
PREMIUM
CT temporal boneCT
PREMIUM
SkullIllustrations
PREMIUM
BRAIN
CT brainCT
PREMIUM
MRI brainMRI
PREMIUM
MRI axial brainMRI
FREE
MRA brainMRI
PREMIUM
BrainIllustrations
PREMIUM
Cranial nervesIllustrations
PREMIUM
Arteriography brainAngiography
PREMIUM
MR cerebral venographyMRI
PREMIUM
MRI inner ear and IACMRI
PREMIUM
Cranial nerves MRIMRI
PREMIUM
EYE
EyeIllustrations
FREE
Orbit MRIMRI
PREMIUM
MRI brainMRI
PREMIUM
CT head and neckCT
PREMIUM
CT faceCT
PREMIUM
Cranial nervesIllustrations
PREMIUM
EAR
CT temporal boneCT
PREMIUM
MRI inner ear and IACMRI
PREMIUM
EarIllustrations
PREMIUM
Temporomandibular jointMRI
FREE
CT head and neckCT
PREMIUM
MOUTH AND NOSE
CT head and neckCT
PREMIUM
CT faceCT
PREMIUM
Dental CBCTCT
PREMIUM
TeethIllustrations
FREE
Oral cavityIllustrations
FREE
Nasal cavityIllustrations
FREE
Nasal fibroscopyEndoscopy
FREE
NECK
CT head and neckCT
PREMIUM
MRI head and neckMRI
PREMIUM
Carotid artery - Surgical approachPhotography
FREE
CT body (lymph nodes)CT
PREMIUM
FDG-PET/CT whole bodyPET-CT
PREMIUM
CHEST
CT chestCT
PREMIUM
CT body (lymph nodes)CT
PREMIUM
CT axial chestCT
PREMIUM
FDG-PET/CT whole bodyPET-CT
PREMIUM
Radiography chest abdomen pelvisRadiographs
FREE
LungsIllustrations
PREMIUM
Thoracic wall-BreastIllustrations
PREMIUM
BronchoscopyEndoscopy
FREE
MEDIASTINUM-HEART
CT chestCT
PREMIUM
CT axial chestCT
PREMIUM
CTA coronary arteriesCT
PREMIUM
MediastinumIllustrations
PREMIUM
HeartIllustrations
FREE
CoronarographyAngiography
PREMIUM
CT body (lymph nodes)CT
PREMIUM
FDG-PET/CT whole bodyPET-CT
PREMIUM
Radiography chest abdomen pelvisRadiographs
FREE
ABDOMEN
Female abdomen-pelvis CTCT
PREMIUM
CT axial male abdomen and pelvisCT
PREMIUM
CT body (lymph nodes)CT
PREMIUM
CT peritoneal cavityCT
PREMIUM
FDG-PET/CT whole bodyPET-CT
PREMIUM
Digestive systemIllustrations
PREMIUM
Radiography chest abdomen pelvisRadiographs
FREE
Magnetic Resonance CholangiopancreatographyMRI
PREMIUM
PELVIS
MRI female pelvisMRI
PREMIUM
MRI male pelvisMRI
PREMIUM
Female pelvisIllustrations
PREMIUM
Male pelvisIllustrations
PREMIUM
CT axial male abdomen and pelvisCT
PREMIUM
CT body (lymph nodes)CT
PREMIUM
CT peritoneal cavityCT
PREMIUM
FDG-PET/CT whole bodyPET-CT
PREMIUM
Radiography chest abdomen pelvisRadiographs
FREE
SHOULDER
MR arthrography shoulderMRI
PREMIUM
MRI shoulderMRI
PREMIUM
CT arthrography shoulderCT arthrogram
PREMIUM
MRI upper extremityMRI
PREMIUM
Radiography upper extremityRadiographs
PREMIUM
Upper extremityIllustrations
PREMIUM
MRI brachial plexusMRI
PREMIUM
ELBOW
MRI elbowMRI
PREMIUM
CT arthrography elbowCT arthrogram
PREMIUM
MRI upper extremityMRI
PREMIUM
Radiography upper extremityRadiographs
PREMIUM
Upper extremityIllustrations
PREMIUM
WRIST-HAND
MRI wristMRI
PREMIUM
MRI handMRI
PREMIUM
MRI thumbMRI
PREMIUM
MRI finger of handMRI
PREMIUM
MRI upper extremityMRI
PREMIUM
Radiography upper extremityRadiographs
PREMIUM
Upper extremityIllustrations
PREMIUM
HIP
Hip MRIMRI
PREMIUM
MRI lower extremityMRI
PREMIUM
Radiography lower extremityRadiographs
FREE
Lower extremityIllustrations
PREMIUM
KNEE
Knee MRIMRI
PREMIUM
CT arthrography kneeCT arthrogram
PREMIUM
MRI lower extremityMRI
PREMIUM
Radiography lower extremityRadiographs
FREE
Lower extremityIllustrations
PREMIUM
ANKLE-FOOT
MRI ankle and hindfootMRI
PREMIUM
Forefoot MRIMRI
PREMIUM
MRI lower extremityMRI
PREMIUM
Radiography lower extremityRadiographs
FREE
Lower extremityIllustrations
PREMIUM
UPPER LIMB
MRI upper extremityMRI
PREMIUM
MRI shoulderMRI
PREMIUM
MRI wristMRI
PREMIUM
MRI elbowMRI
PREMIUM
MRI handMRI
PREMIUM
Radiography upper extremityRadiographs
PREMIUM
Upper extremityIllustrations
PREMIUM
Arteriography upper extremityAngiography
FREE
Visible Human ProjectPhotography
PREMIUM
LOWER LIMB
Lower extremityIllustrations
PREMIUM
Radiography lower extremityRadiographs
FREE
MRI lower extremityMRI
PREMIUM
Hip MRIMRI
PREMIUM
Knee MRIMRI
PREMIUM
CT arthrography kneeCT arthrogram
PREMIUM
MRI ankle and hindfootMRI
PREMIUM
Forefoot MRIMRI
PREMIUM
Lower limb CTACT
PREMIUM
Leg arteries and bonesCT
FREE
Arteriography lower extremityAngiography
FREE
Select a zone
WHOLE BODY
CT body (lymph nodes)CT
PREMIUM
FDG-PET/CT whole bodyPET-CT
PREMIUM
Visible Human ProjectPhotography
PREMIUM
SPINE
MRI cervical spineMRI
PREMIUM
MRI lumbar spineMRI
PREMIUM
CT lumbar spineCT
PREMIUM
MRI brachial plexusMRI
PREMIUM
SpineIllustrations
PREMIUM
Spinal cordIllustrations
PREMIUM
Radiography spineRadiographs
FREE
CT head and neckCT
PREMIUM
MRI head and neckMRI
PREMIUM
HEAD AND NECK
CT head and neckCT
PREMIUM
CT brainCT
PREMIUM
MRI brainMRI
PREMIUM
MRI axial brainMRI
FREE
CT faceCT
PREMIUM
MRI head and neckMRI
PREMIUM
MRA brainMRI
PREMIUM
BrainIllustrations
PREMIUM
CT temporal boneCT
PREMIUM
SkullIllustrations
PREMIUM
BRAIN
CT brainCT
PREMIUM
MRI brainMRI
PREMIUM
MRI axial brainMRI
FREE
MRA brainMRI
PREMIUM
BrainIllustrations
PREMIUM
Cranial nervesIllustrations
PREMIUM
Arteriography brainAngiography
PREMIUM
MR cerebral venographyMRI
PREMIUM
MRI inner ear and IACMRI
PREMIUM
Cranial nerves MRIMRI
PREMIUM
EYE
EyeIllustrations
FREE
Orbit MRIMRI
PREMIUM
MRI brainMRI
PREMIUM
CT head and neckCT
PREMIUM
CT faceCT
PREMIUM
Cranial nervesIllustrations
PREMIUM
EAR
CT temporal boneCT
PREMIUM
MRI inner ear and IACMRI
PREMIUM
EarIllustrations
PREMIUM
Temporomandibular jointMRI
FREE
CT head and neckCT
PREMIUM
MOUTH AND NOSE
CT head and neckCT
PREMIUM
CT faceCT
PREMIUM
Dental CBCTCT
PREMIUM
TeethIllustrations
FREE
Oral cavityIllustrations
FREE
Nasal cavityIllustrations
FREE
Nasal fibroscopyEndoscopy
FREE
NECK
CT head and neckCT
PREMIUM
MRI head and neckMRI
PREMIUM
Carotid artery - Surgical approachPhotography
FREE
CT body (lymph nodes)CT
PREMIUM
FDG-PET/CT whole bodyPET-CT
PREMIUM
CHEST
CT chestCT
PREMIUM
CT body (lymph nodes)CT
PREMIUM
CT axial chestCT
PREMIUM
FDG-PET/CT whole bodyPET-CT
PREMIUM
Radiography chest abdomen pelvisRadiographs
FREE
LungsIllustrations
PREMIUM
Thoracic wall-BreastIllustrations
PREMIUM
BronchoscopyEndoscopy
FREE
MEDIASTINUM-HEART
CT chestCT
PREMIUM
CT axial chestCT
PREMIUM
CTA coronary arteriesCT
PREMIUM
MediastinumIllustrations
PREMIUM
HeartIllustrations
FREE
CoronarographyAngiography
PREMIUM
CT body (lymph nodes)CT
PREMIUM
FDG-PET/CT whole bodyPET-CT
PREMIUM
Radiography chest abdomen pelvisRadiographs
FREE
‹›
Spotted a mistake?
Don't hesitate to suggest a correction, translation or content improvement.
Report a problem
Report a problem
Your feedback helps us to improve the content. Do not hesitate to suggest a correction, we will examine it carefully.
Please could you describe the error
CANCEL Send
GET THE APP
IMAIOS is a company which aims to assist and train human and animal practitioners. Serving healthcare professionals through interactive anatomy atlases, medical imaging, collaborative database of clinical cases, online courses...
COMPANY
About us
Join us
Partners
USEFUL LINKS
Support
IP subscription support
FIND YOUR SOLUTION
© 2008-2025 IMAIOS SAS All rights reserved
Conditions of Access and UsePrivacy policySubscription Terms and ConditionsAccessibilityCreditsCookies Preferences
Cookie preferences
Continue without accepting
IMAIOS and selected third parties, use cookies or similar technologies, in particular for audience measurement. Cookies allow us to analyze and store information such as the characteristics of your device as well as certain personal data (e.g., IP addresses, navigation, usage or geolocation data, unique identifiers). This data is processed for the following purposes: analysis and improvement of the user experience and/or our content offering, products and services, audience measurement and analysis, interaction with social networks, display of personalized content, performance measurement and content appeal. For more information, see our privacy policy.
You can freely give, refuse or withdraw your consent at any time by accessing our cookie settings tool. If you do not consent to the use of these technologies, we will consider that you also object to any cookie storage based on legitimate interest. You can consent to the use of these technologies by clicking "accept all cookies".
Accept all cookies Manage cookies
Cookie settings
When you visit IMAIOS, cookies are stored on your browser.
Some of them require your consent. Click on a category of cookies to activate or deactivate it. To benefit from all the features, it’s recommended to keep the different cookie categories activated.
Essential technical cookies
These are cookies that ensure the proper functioning of the website and allow its optimization (detect browsing problems, connect to your IMAIOS account, online payments, debugging and website security). The website cannot function properly without these cookies, which is why they are not subject to your consent.
Analytics cookies
Accept Refuse
These cookies are used to measure audience: it allows to generate usage statistics useful for the improvement of the website.
Google Analytics
Save and continue Cancel |
14143 | https://courses.lumenlearning.com/suny-physics/chapter/27-6-limits-of-resolution-the-rayleigh-criterion/ | Wave Optics
Limits of Resolution: The Rayleigh Criterion
Learning Objectives
By the end of this section, you will be able to:
Discuss the Rayleigh criterion.
Light diffracts as it moves through space, bending around obstacles, interfering constructively and destructively. While this can be used as a spectroscopic tool—a diffraction grating disperses light according to wavelength, for example, and is used to produce spectra—diffraction also limits the detail we can obtain in images. Figure 1a shows the effect of passing light through a small circular aperture. Instead of a bright spot with sharp edges, a spot with a fuzzy edge surrounded by circles of light is obtained. This pattern is caused by diffraction similar to that produced by a single slit. Light from different parts of the circular aperture interferes constructively and destructively. The effect is most noticeable when the aperture is small, but the effect is there for large apertures, too.
Figure 1. (a) Monochromatic light passed through a small circular aperture produces this diffraction pattern. (b) Two point light sources that are close to one another produce overlapping images because of diffraction. (c) If they are closer together, they cannot be resolved or distinguished.
How does diffraction affect the detail that can be observed when light passes through an aperture? Figure 1b shows the diffraction pattern produced by two point light sources that are close to one another. The pattern is similar to that for a single point source, and it is just barely possible to tell that there are two light sources rather than one. If they were closer together, as in Figure 1c, we could not distinguish them, thus limiting the detail or resolution we can obtain. This limit is an inescapable consequence of the wave nature of light.
There are many situations in which diffraction limits the resolution. The acuity of our vision is limited because light passes through the pupil, the circular aperture of our eye. Be aware that the diffraction-like spreading of light is due to the limited diameter of a light beam, not the interaction with an aperture. Thus light passing through a lens with a diameter D shows this effect and spreads, blurring the image, just as light passing through an aperture of diameter D does. So diffraction limits the resolution of any system having a lens or mirror. Telescopes are also limited by diffraction, because of the finite diameter D of their primary mirror.
Take-Home Experiment: Resolution of the Eye
Draw two lines on a white sheet of paper (several mm apart). How far away can you be and still distinguish the two lines? What does this tell you about the size of the eye’s pupil? Can you be quantitative? (The size of an adult’s pupil is discussed in Physics of the Eye.)
Just what is the limit? To answer that question, consider the diffraction pattern for a circular aperture, which has a central maximum that is wider and brighter than the maxima surrounding it (similar to a slit) (see Figure 2a). It can be shown that, for a circular aperture of diameter D, the first minimum in the diffraction pattern occurs at [latex]\theta=1.22\frac{\lambda}{D}\[/latex] (providing the aperture is large compared with the wavelength of light, which is the case for most optical instruments). The accepted criterion for determining the diffraction limit to resolution based on this angle was developed by Lord Rayleigh in the 19th century. The Rayleigh criterion for the diffraction limit to resolution states that two images are just resolvable when the center of the diffraction pattern of one is directly over the first minimum of the diffraction pattern of the other. See Figure 2b. The first minimum is at an angle of [latex]\theta=1.22\frac{\lambda}{D}\[/latex], so that two point objects are just resolvable if they are separated by the angle
[latex]\displaystyle\theta=1.22\frac{\lambda}{D}\[/latex],
where λ is the wavelength of light (or other electromagnetic radiation) and D is the diameter of the aperture, lens, mirror, etc., with which the two objects are observed. In this expression, θ has units of radians.
Figure 2. (a) Graph of intensity of the diffraction pattern for a circular aperture. Note that, similar to a single slit, the central maximum is wider and brighter than those to the sides. (b) Two point objects produce overlapping diffraction patterns. Shown here is the Rayleigh criterion for being just resolvable. The central maximum of one pattern lies on the first minimum of the other.
Making Connections: Limits to Knowledge
All attempts to observe the size and shape of objects are limited by the wavelength of the probe. Even the small wavelength of light prohibits exact precision. When extremely small wavelength probes as with an electron microscope are used, the system is disturbed, still limiting our knowledge, much as making an electrical measurement alters a circuit. Heisenberg’s uncertainty principle asserts that this limit is fundamental and inescapable, as we shall see in quantum mechanics.
Example 1. Calculating Diffraction Limits of the Hubble Space Telescope
The primary mirror of the orbiting Hubble Space Telescope has a diameter of 2.40 m. Being in orbit, this telescope avoids the degrading effects of atmospheric distortion on its resolution.
What is the angle between two just-resolvable point light sources (perhaps two stars)? Assume an average light wavelength of 550 nm.
If these two stars are at the 2 million light year distance of the Andromeda galaxy, how close together can they be and still be resolved? (A light year, or ly, is the distance light travels in 1 year.)
Strategy
The Rayleigh criterion stated in the equation [latex]\theta=1.22\frac{\lambda}{D}\[/latex] gives the smallest possible angle θ between point sources, or the best obtainable resolution. Once this angle is found, the distance between stars can be calculated, since we are given how far away they are.
Solution for Part 1
The Rayleigh criterion for the minimum resolvable angle is [latex]\theta=1.22\frac{\lambda}{D}\[/latex].
Entering known values gives
[latex]\begin{array}{lll}\theta&=&1.22\frac{550\times10^{-9}\text{ m}}{2.40\text{ m}}\\text{ }&=&2.80\times10^{-7}\text{ rad}\end{array}\[/latex]
Solution for Part 2
The distance s between two objects a distance r away and separated by an angle θ is s= rθ.
Substituting known values gives
[latex]\begin{array}{lll}s&=&\left(2.0\times10^6\text{ ly}\right)\left(2.80\times10^{-7}\text{ rad}\right)\\text{ }&=&0.56\text{ ly}\end{array}\[/latex]
Discussion
The angle found in Part 1 is extraordinarily small (less than 1/50,000 of a degree), because the primary mirror is so large compared with the wavelength of light. As noticed, diffraction effects are most noticeable when light interacts with objects having sizes on the order of the wavelength of light. However, the effect is still there, and there is a diffraction limit to what is observable. The actual resolution of the Hubble Telescope is not quite as good as that found here. As with all instruments, there are other effects, such as non-uniformities in mirrors or aberrations in lenses that further limit resolution. However, Figure 3 gives an indication of the extent of the detail observable with the Hubble because of its size and quality and especially because it is above the Earth’s atmosphere.
Figure 3. These two photographs of the M82 galaxy give an idea of the observable detail using the Hubble Space Telescope compared with that using a ground-based telescope. (a) On the left is a ground-based image. (credit: Ricnun, Wikimedia Commons) (b) The photo on the right was captured by Hubble. (credit: NASA, ESA, and the Hubble Heritage Team (STScI/AURA))
The answer in Part 2 indicates that two stars separated by about half a light year can be resolved. The average distance between stars in a galaxy is on the order of 5 light years in the outer parts and about 1 light year near the galactic center. Therefore, the Hubble can resolve most of the individual stars in Andromeda galaxy, even though it lies at such a huge distance that its light takes 2 million years for its light to reach us. Figure 4 shows another mirror used to observe radio waves from outer space.
Figure 4. A 305-m-diameter natural bowl at Arecibo in Puerto Rico is lined with reflective material, making it into a radio telescope. It is the largest curved focusing dish in the world. Although D for Arecibo is much larger than for the Hubble Telescope, it detects much longer wavelength radiation and its diffraction limit is significantly poorer than Hubble’s. Arecibo is still very useful, because important information is carried by radio waves that is not carried by visible light. (credit: Tatyana Temirbulatova, Flickr)
Diffraction is not only a problem for optical instruments but also for the electromagnetic radiation itself. Any beam of light having a finite diameter D and a wavelength λ exhibits diffraction spreading. The beam spreads out with an angle θ given by the equation [latex]\theta=1.22\frac{\lambda}{D}\[/latex]. Take, for example, a laser beam made of rays as parallel as possible (angles between rays as close to θ= 0º as possible) instead spreads out at an angle [latex]\theta=1.22\frac{\lambda}{D}\[/latex], where D is the diameter of the beam and λ is its wavelength. This spreading is impossible to observe for a flashlight, because its beam is not very parallel to start with. However, for long-distance transmission of laser beams or microwave signals, diffraction spreading can be significant (see Figure 5). To avoid this, we can increase D. This is done for laser light sent to the Moon to measure its distance from the Earth. The laser beam is expanded through a telescope to make D much larger and θ smaller.
Figure 5.
In Figure 5 we see that the beam produced by this microwave transmission antenna will spread out at a minimum angle [latex]\theta=1.22\frac{\lambda}{D}\[/latex] due to diffraction. It is impossible to produce a near-parallel beam, because the beam has a limited diameter.
In most biology laboratories, resolution is presented when the use of the microscope is introduced. The ability of a lens to produce sharp images of two closely spaced point objects is called resolution. The smaller the distance x by which two objects can be separated and still be seen as distinct, the greater the resolution. The resolving power of a lens is defined as that distance x. An expression for resolving power is obtained from the Rayleigh criterion. In Figure 6a we have two point objects separated by a distance x. According to the Rayleigh criterion, resolution is possible when the minimum angular separation is
[latex]\displaystyle\theta=1.22\frac{\lambda}{D}=\frac{x}{d}\[/latex]
where d is the distance between the specimen and the objective lens, and we have used the small angle approximation (i.e., we have assumed that x is much smaller than d), so that tan θ ≈ sin θ ≈ θ.
Therefore, the resolving power is
[latex]\displaystyle{x}=1.22\frac{\lambda{d}}{D}\[/latex]
Figure 6. (a) Two points separated by at distance x and a positioned a distance d away from the objective. (credit: Infopro, Wikimedia Commons) (b) Terms and symbols used in discussion of resolving power for a lens and an object at point P. (credit: Infopro, Wikimedia Commons)
Another way to look at this is by re-examining the concept of Numerical Aperture (NA) discussed in Microscopes. There, NA is a measure of the maximum acceptance angle at which the fiber will take light and still contain it within the fiber. Figure 6b shows a lens and an object at point P. The NA here is a measure of the ability of the lens to gather light and resolve fine detail. The angle subtended by the lens at its focus is defined to be θ= 2α. From the Figure and again using the small angle approximation, we can write
[latex]\displaystyle\sin\alpha=\frac{\frac{D}{2}}{d}=\frac{D}{2d}\[/latex]
The NA for a lens is NA = n sin α, where n is the index of refraction of the medium between the objective lens and the object at point P.
From this definition for NA, we can see that
[latex]\displaystyle{x}=1.22\frac{\lambda{d}}{D}=1.22\frac{\lambda}{2\sin\alpha}=0.61\frac{\lambda{n}}{NA}\[/latex]
In a microscope, NA is important because it relates to the resolving power of a lens. A lens with a large NA will be able to resolve finer details. Lenses with larger NA will also be able to collect more light and so give a brighter image. Another way to describe this situation is that the larger the NA, the larger the cone of light that can be brought into the lens, and so more of the diffraction modes will be collected. Thus the microscope has more information to form a clear image, and so its resolving power will be higher.
One of the consequences of diffraction is that the focal point of a beam has a finite width and intensity distribution. Consider focusing when only considering geometric optics, shown in Figure 7a. The focal point is infinitely small with a huge intensity and the capacity to incinerate most samples irrespective of the NA of the objective lens. For wave optics, due to diffraction, the focal point spreads to become a focal spot (see Figure 7b) with the size of the spot decreasing with increasing NA. Consequently, the intensity in the focal spot increases with increasing NA. The higher the NA, the greater the chances of photodegrading the specimen. However, the spot never becomes a true point.
Figure 7. (a) In geometric optics, the focus is a point, but it is not physically possible to produce such a point because it implies infinite intensity. (b) In wave optics, the focus is an extended region.
Section Summary
Diffraction limits resolution.
For a circular aperture, lens, or mirror, the Rayleigh criterion states that two images are just resolvable when the center of the diffraction pattern of one is directly over the first minimum of the diffraction pattern of the other.
This occurs for two point objects separated by the angle [latex]\theta=1.22\frac{\lambda}{D}\[/latex], where λ is the wavelength of light (or other electromagnetic radiation) and D is the diameter of the aperture, lens, mirror, etc. This equation also gives the angular spreading of a source of light having a diameter D.
Conceptual Questions
A beam of light always spreads out. Why can a beam not be created with parallel rays to prevent spreading? Why can lenses, mirrors, or apertures not be used to correct the spreading?
Problems & Exercises
The 300-m-diameter Arecibo radio telescope pictured in Figure 4 detects radio waves with a 4.00 cm average wavelength. (a) What is the angle between two just-resolvable point sources for this telescope? (b) How close together could these point sources be at the 2 million light year distance of the Andromeda galaxy?
Assuming the angular resolution found for the Hubble Telescope in Example 1, what is the smallest detail that could be observed on the Moon?
Diffraction spreading for a flashlight is insignificant compared with other limitations in its optics, such as spherical aberrations in its mirror. To show this, calculate the minimum angular spreading of a flashlight beam that is originally 5.00 cm in diameter with an average wavelength of 600 nm.
(a) What is the minimum angular spread of a 633-nm wavelength He-Ne laser beam that is originally 1.00 mm in diameter? (b) If this laser is aimed at a mountain cliff 15.0 km away, how big will the illuminated spot be? (c) How big a spot would be illuminated on the Moon, neglecting atmospheric effects? (This might be done to hit a corner reflector to measure the round-trip time and, hence, distance.)
A telescope can be used to enlarge the diameter of a laser beam and limit diffraction spreading. The laser beam is sent through the telescope in opposite the normal direction and can then be projected onto a satellite or the Moon. (a) If this is done with the Mount Wilson telescope, producing a 2.54-m-diameter beam of 633-nm light, what is the minimum angular spread of the beam? (b) Neglecting atmospheric effects, what is the size of the spot this beam would make on the Moon, assuming a lunar distance of 3.84 × 108 m?
The limit to the eye’s acuity is actually related to diffraction by the pupil. (a) What is the angle between two just-resolvable points of light for a 3.00-mm-diameter pupil, assuming an average wavelength of 550 nm? (b) Take your result to be the practical limit for the eye. What is the greatest possible distance a car can be from you if you can resolve its two headlights, given they are 1.30 m apart? (c) What is the distance between two just-resolvable points held at an arm’s length (0.800 m) from your eye? (d) How does your answer to (c) compare to details you normally observe in everyday circumstances?
What is the minimum diameter mirror on a telescope that would allow you to see details as small as 5.00 km on the Moon some 384,000 km away? Assume an average wavelength of 550 nm for the light received.
You are told not to shoot until you see the whites of their eyes. If the eyes are separated by 6.5 cm and the diameter of your pupil is 5.0 mm, at what distance can you resolve the two eyes using light of wavelength 555 nm?
(a) The planet Pluto and its Moon Charon are separated by 19,600 km. Neglecting atmospheric effects, should the 5.08-m-diameter Mount Palomar telescope be able to resolve these bodies when they are 4.50 × 109 km from Earth? Assume an average wavelength of 550 nm. (b) In actuality, it is just barely possible to discern that Pluto and Charon are separate bodies using an Earth-based telescope. What are the reasons for this?
The headlights of a car are 1.3 m apart. What is the maximum distance at which the eye can resolve these two headlights? Take the pupil diameter to be 0.40 cm.
When dots are placed on a page from a laser printer, they must be close enough so that you do not see the individual dots of ink. To do this, the separation of the dots must be less than Raleigh’s criterion. Take the pupil of the eye to be 3.0 mm and the distance from the paper to the eye of 35 cm; find the minimum separation of two dots such that they cannot be resolved. How many dots per inch (dpi) does this correspond to?
Unreasonable Results. An amateur astronomer wants to build a telescope with a diffraction limit that will allow him to see if there are people on the moons of Jupiter. (a) What diameter mirror is needed to be able to see 1.00 m detail on a Jovian Moon at a distance of 7.50 × 108 km from Earth? The wavelength of light averages 600 nm. (b) What is unreasonable about this result? (c) Which assumptions are unreasonable or inconsistent?
Construct Your Own Problem. Consider diffraction limits for an electromagnetic wave interacting with a circular object. Construct a problem in which you calculate the limit of angular resolution with a device, using this circular object (such as a lens, mirror, or antenna) to make observations. Also calculate the limit to spatial resolution (such as the size of features observable on the Moon) for observations at a specific distance from the device. Among the things to be considered are the wavelength of electromagnetic radiation used, the size of the circular object, and the distance to the system or phenomenon being observed.
Glossary
Rayleigh criterion: two images are just resolvable when the center of the diffraction pattern of one is directly over the first minimum of the diffraction pattern of the other
Selected Solutions to Problems & Exercises
1. (a) 1.63 × 10−4 rad; (b) 326 ly
3. 1.46 × 10−5 rad
5. (a) 3.04 × 10−7 rad; (b) Diameter of 235 m
7. 5.15 cm
9. (a) Yes. Should easily be able to discern; (b) The fact that it is just barely possible to discern that these are separate bodies indicates the severity of atmospheric aberrations.
Candela Citations
CC licensed content, Shared previously
College Physics. Authored by: OpenStax College. Located at: License: CC BY: Attribution. License Terms: Located at License
Licenses and Attributions
CC licensed content, Shared previously
College Physics. Authored by: OpenStax College. Located at: License: CC BY: Attribution. License Terms: Located at License |
14144 | https://www.britannica.com/place/Indian-subcontinent | SUBSCRIBE
SUBSCRIBE
Home
History & Society
Science & Tech
Biographies
Animals & Nature
Geography & Travel
Arts & Culture
ProCon
Money
Games & Quizzes
Videos
On This Day
One Good Fact
Dictionary
New Articles
History & Society
Lifestyles & Social Issues
Philosophy & Religion
Politics, Law & Government
World History
Science & Tech
Health & Medicine
Science
Technology
Biographies
Browse Biographies
Animals & Nature
Birds, Reptiles & Other Vertebrates
Bugs, Mollusks & Other Invertebrates
Environment
Fossils & Geologic Time
Mammals
Plants
Geography & Travel
Geography & Travel
Arts & Culture
Entertainment & Pop Culture
Literature
Sports & Recreation
Visual Arts
Image Galleries
Podcasts
Summaries
Top Questions
Britannica Kids
Ask the Chatbot Games & Quizzes History & Society Science & Tech Biographies Animals & Nature Geography & Travel Arts & Culture ProCon Money Videos
Indian subcontinent
References & Edit History Related Topics
Images & Videos
Indian subcontinent
region, Asia
print Print
Please select which sections you would like to print:
verifiedCite
While every effort has been made to follow citation style rules, there may be some discrepancies. Please refer to the appropriate style manual or other sources if you have any questions.
Select Citation Style
Share
Share to social media
Facebook X
URL
Feedback
Thank you for your feedback
Our editors will review what you’ve submitted and determine whether to revise the article.
External Websites
Humanities LibreTexts - Indian Sub-Continent Origins
Ministry of Foreign Affairs of Japan - Situation in the Indian Subcontinent
Pressbooks - A Brief History of the World Since 1500 - The Indian Subcontinent
Nature - Journal of Human Hypertension - Spotlight on hypertension in the Indian subcontinent
Maps of India - Indian Subcontinent
Colorado Community College System Pressbooks - PPSC HIS 1120: The World: 1500-Present - The Indian Subcontinent
Written by
Written by
Adam Zeidan
Adam Zeidan is an Assistant Managing Editor, having joined Encyclopædia Britannica in 2018. He covers a range of topics related primarily to the Middle East and North Africa.
Adam Zeidan
Fact-checked by
Fact-checked by
The Editors of Encyclopaedia Britannica
Encyclopaedia Britannica's editors oversee subject areas in which they have extensive knowledge, whether from years of experience gained by working on that content or via study for an advanced degree....
The Editors of Encyclopaedia Britannica
Last Updated: •Article History
Indian subcontinent, subregion of Asia, consisting at least of India, Pakistan, and Bangladesh. Afghanistan, Bhutan, Nepal, and other areas may also be included in some uses of the term, which is frequently, but not always, interchangeable with the term South Asia.
The region was called simply “India” in many historical sources, which used the term to refer broadly to the regions surrounding and southeast of the Indus River. Many historians continue to use the term India to refer to the whole of the Indian subcontinent in discussions of history up until the era of the British raj (1858–1947), when “India” came to refer to a distinct political entity that later became a nation-state in its own right. The term “Indian subcontinent” thus provides a distinction between the geographic region once broadly called India and the modern country named India. The Indian subcontinent is among the most densely populated areas on Earth; it is home to some 1.8 billion people.
Geography
The Indian subcontinent is geologically bounded by the Himalayas to the north and by the Indian Ocean to the south. It is characterized by a north-south divide between the Indo-Gangetic Plain in the north, which includes the Indus, Ganges (Ganga), and Brahmaputra river systems, and the Deccan plateau in the south, whose major river systems include the Mahanadi, Godavari, Krishna, and Kaveri rivers.
The subcontinent’s geography gives it the world’s most pronounced monsoon climate (see Indian monsoon). The seasonal change in wind direction leads to high atmospheric instability with the onset of the summer monsoon, typically in June, when warm moist air from the Indian Ocean blows in from the southwest. By October the wind direction reverses and brings cooler air from the northeast, but both the intensity and moisture of the winter monsoon are deflected by the Himalayas. The result is a mostly dry season.
History
The subcontinent enjoys a rich history as one of the earliest and most extensive centers of civilization (see Indus civilization). With the spread of new military technologies in the Central Asian Steppe, the language and culture of Indo-European tribes spread southward in the 2nd millennium bce and began to overtake the earlier customs of the subcontinent. Vedic literature, composed in Sanskrit, was one of the early products of the incoming culture. Its influence persists today in Hinduism, and the northern populations of the subcontinent continue to speak some variety of Indo-European languages, including Hindi, Urdu, Bengali, Punjabi, and Marathi.
The subcontinent first became a political unit under the rule of the Mauryan dynasty (321–185 bce), whose empire, at its peak, stretched from the southern portions of modern Afghanistan to much of Karnataka state. During this period, the extensive cultural exchange throughout the subcontinent allowed it to be inundated with some of the common symbols and ideas that continue to characterize the subcontinent into the modern age.
That the Mauryan dynasty later disintegrated reflects the difficulty of bridging such a vast and diverse territory, however, and the subcontinent did not again achieve any semblance of unity until the rise of the Guptas in the 4th century ce. Many of the cultural and intellectual achievements of classical South Asian art developed under Gupta patronage, but the empire’s reach remained confined to the northern parts of the subcontinent.
Access for the whole family!
Bundle Britannica Premium and Kids for the ultimate resource destination.
Until the Mauryans, South India remained largely untouched by Indo-European cultures and has remained a bastion of Dravidian peoples into the present day. Tamilakam, the abode of the Tamils, consisted of the Pandya dynasty (in Madurai), the Chera dynasty (on the Malabar Coast), and the Chola dynasty (in Thanjavur and the Kaveri valley). The Sangam literature of the early Common Era attests to a strong academic milieu and a flourishing production of culture in southern India.
In the 16th century the Mughals, a Turkic Muslim dynasty from Central Asia, arrived in Delhi. Although the Mughals neither introduced Islam to the region nor were they the first Muslim rulers in the subcontinent, their early accommodation of local customs and elites helped the dynasty expand its rule to an extent not seen since the Mauryan period. Whereas emperors such as Akbar the Great and Jahāngīr helped the empire to prosper, hubris and decadence, exemplified in the repressive rule of Aurangzeb, led to the Mughals’ eventual decline. Although Mughal contributions left a tremendous impact on the sociocultural milieu of the subcontinent’s Muslims and Hindus alike, many trace today’s communal disputes to the grievances that arose in the late Mughal era.
The arrival of the British East India Company in the 18th century, followed by the imposition of the British raj in 1858, again brought most of the subcontinent under unitary control. But, while Muslims and Hindus cooperated in the decades-long movement for independence, several incidents led some within the Muslim minority to call for a separate state for Muslims. The result was the partition between India and Pakistan in 1947, in which an unprecedented population transfer of 15 million people took place in a span of just nine weeks.
The partition of India and Pakistan produced two independent countries in the subcontinent that each have large, ethnically diverse populations. Partition also determined the predominant religious identity of each country. The population of India became primarily Hindu, and today Hindus represent about four-fifths of India’s population while Muslims are about one-seventh (the second largest group, as defined by religious belief). Ethnic identity was a factor in the split between Pakistan’s Eastern and Western provinces in the decades after partition, which led to war and ultimately resulted in Bangladesh’s independence in 1971, while Pakistan’s overtly Muslim identity contributed to its 1947 support for armed incursions into Kashmir on behalf of its predominantly Muslim population, initiating a dispute over Kashmir’s status that continues to ignite hostility between India and Pakistan today. Within India, tensions between Hindu and Muslim communities, often referred to by the term communalism, have remained a significant dimension of political life, and these tensions have been expressed in sometimes violent ways even after India was constituted as a country that favors neither Hinduism nor Islam in public life.
Adam Zeidan |
14145 | https://pubs.acs.org/doi/10.1021/ed042p654 | The difference between Cp and Cv for liquids and solids | Journal of Chemical Education
Opens in a new window Opens an external website Opens an external website in a new window
This website utilizes technologies such as cookies to enable essential site functionality, as well as for analytics, personalization, and targeted advertising. To learn more, view the following link: Privacy Policy
Manage Preferences
Recently Viewedclose modal
ACS
ACS Publications
C&EN
CAS
Access through institution
Log In
The difference between Cp and Cv for liquids and solids
Cite
Citation
Citation and abstract
Citation and references
More citation options
Share
Share on
Facebook
X
Wechat
LinkedIn
Reddit
Email
Bluesky
Jump to
Abstract
Cited By
Expand Collapse
Back to top
Close quick search form clear search
J. Chem. Educ. All Publications/Website
Read
Journals Peer-reviewed chemistry research
Subjects Specific research topics from across the ACS portfolio
Books & References eBooks, monographs, and references
C&EN News and analysis in chemistry and chemical engineering
Publish
Submit a Manuscript Prepare, submit, and track manuscripts
Author Resources Author guidelines, templates, publishing policies, and more
Purchase Author Services Expert editing, formatting, and graphics support
Explore Open Access Open access tools, resources, and news
Subscribe
Librarians & Account Managers
Open Science for Institutions
Inquire About Access
Help
Support FAQ Quick answers to common questions
Live Chat with Agent Get real-time help from a support representative
Open quick search form Open menu Close menu
Read
Journals
Subjects
Books & References
C&EN
Publish
Submit a Manuscript
Author Resources
Purchase Author Services
Explore Open Access
Subscribe
Librarians & Account Managers
Open Science for Institutions
Inquire About Access
Help
Support FAQ
Live Chat with Agent
Tutorials & Demos
Account
My Profile
Log in
Log out
Close
Publications
CONTENT TYPES
All Types
SUBJECTS
Publications: All Types
Skip to articleSkip to sidebar
Close
Next Previous
Download Hi-Res ImageDownload to MS-PowerPointCite This:J. Chem. Educ. 1965, 42, 12, 654
ADVERTISEMENT
Info
Metrics
Journal of Chemical Education
Vol 42/Issue 12
Article
Get e-Alerts
Cite
Citation
Citation and abstract
Citation and references
More citation options
Share
Share on
Facebook
X
WeChat
LinkedIn
Reddit
Email
Bluesky
Jump to
Abstract
Cited By
Expand Collapse
Article December 1, 1965
The difference between Cp and Cv for liquids and solids
Click to copy article link Article link copied!
Norman O. Smith
Access Through Access is not provided via Institution Name Loading Institutional Login Options... Access Through Your Institution
Add or Change Institution
Explore subscriptions for institutions
Other Access Options
Journal of Chemical Education
Cite this: J. Chem. Educ. 1965, 42, 12, 654
Click to copy citation Citation copied!
Published December 1, 1965
Publication History
Received
3 August 2009
Published
online 1 December 1965
Published
in issue 1 December 1965
research-article
© American Chemical Society and Division of Chemical Education, Inc.
Request reuse permissions
Article Views
1540
Altmetric
-
Citations
10
Learn about these metrics
close
Article Views are the COUNTER-compliant sum of full text article downloads since November 2008 (both PDF and HTML) across all institutions and individuals. These metrics are regularly updated to reflect usage leading up to the last few days.
Citations are the number of other articles citing this article, calculated by Crossref and updated daily.Find more information about Crossref citation counts.
The Altmetric Attention Score is a quantitative measure of the attention that a research article has received online. Clicking on the donut icon will load a page at altmetric.com with additional details about the score and the social media presence for the given article. Find more information onthe Altmetric Attention Score and how the score is calculated.
Abstract
Click to copy section link Section link copied!
Cp - Cv is appreciable for many liquids and some solids.
ACS Publications
© American Chemical Society and Division of Chemical Education, Inc.
Keywords (Audience)
what are keywords
Article keywords are supplied by the authors and highlight key terms and topics of the paper.
Upper-Division Undergraduate
Keywords (Domain)
what are keywords
Article keywords are supplied by the authors and highlight key terms and topics of the paper.
Physical Chemistry
Keywords (Feature)
what are keywords
Article keywords are supplied by the authors and highlight key terms and topics of the paper.
Textbook Errors Index
Keywords (Subject)
what are keywords
Article keywords are supplied by the authors and highlight key terms and topics of the paper.
Liquids
Read this article
To access this article, please review the available access options below.
Recommended
Access through Your Institution
You may have access to this article through your institution.
Your institution does not have access to this content. Add or change your institution or let them know you’d like them to include access.
Access Through Recommend Publication Institution Name Loading Institutional Login Options... Access Through Your Institution
Add or Change Institution
Explore subscriptions for institutions
Get instant access
Purchase Access
Read this article for 48 hours. Check out below using your ACS ID or as a guest.
Purchase AccessRestore my guest access
Recommended
Log in to Access
You may have access to this article with your ACS ID if you have previously purchased it or have ACS member benefits. Log in below.
Login with ACS ID
Purchase access Purchase this article for 48 hours $48.00 Add to cart Purchase this article for 48 hours Checkout
Cited By
Click to copy section link Section link copied!
Citation Statements
beta
Smart citations byscite.aiinclude citation statements extracted from the full text of the citing article. The number of the statements may be higher than the number of citations provided by ACS Publications if one paper cites another multiple times or lower if scite has not yet processed some of the citing articles.
Supporting Supporting 1 Mentioning Mentioning 3 Contrasting Contrasting 0
Explore this article's citation statements onscite.ai
powered by
This article is cited by 10 publications.
Yingbin Ge, Samuel L. Montgomery, Gabriel L. Borrello. Can CP Be Less Than CV?. ACS Omega2021, 6 (16) , 11083-11085.
Liang-Wei Hu, Wei Cao, Jun-Feng Jin, Xiao-Long Sun, Xiao-Lu Zhu, Wen-Hao Xie, Yue Hou, Zi-Yu Wang, Rui Xiong. Enhancing pyroelectric detection performance of Na0.5Bi0.5TiO3-based lead-free ceramics via thermoelectric effect. Rare Metals2025, 44 (7) , 4947-4958.
Md Gulzar Ali, Nepal Sahu, Sourav Sarkar, Chandrashekhar Azad, Uday Kumar. Machine learning approach towards the prediction of Heat capacity of materials. 2025, 610-615.
Adel Bandar Alruqi, Nicholas O. Ongwen. A Comparative Thermodynamic Study of AlF3, ScF3, Al0.5Sc0.5F3, and In0.5Sc0.5F3 for Optical Coatings: A Computational Study. Coatings2023, 13 (11) , 1840.
Prem K. Solanki, Yoed Rabin. Is isochoric vitrification feasible?. Cryobiology2023, 111, 9-15.
Valery P. Vassiliev, Alex F. Taldrik. Description of the heat capacity of solid phases by a multiparameter family of functions. Journal of Alloys and Compounds2021, 872, 159682.
Faezeh Pousaneh, Olle Edholm, Anna Maciołek. Molecular dynamics simulation of a binary mixture near the lower critical point. The Journal of Chemical Physics2016, 145 (1)
J. F. Chaney, V. Ramdas, C. R. Rodriguez, M. H. Wu. Bibliography. 1982, 213-719.
J. F. Chaney, V. Ramdas, C. R. Rodriguez, M. H. Wu. Bibliography. 1982, 311-577.
Sergio Cabani, Giovanni Conti, Enrico Matteoli. Apparent Molal Isochoric Heat Capacities of Electrolytes and Non-electrolytes in Aqueous Solution at 25 °C. Zeitschrift für Physikalische Chemie1979, 115 (1) , 121-124.
Get e-Alerts
Get e-Alerts
Journal of Chemical Education
Cite this: J. Chem. Educ. 1965, 42, 12, 654
Click to copy citation Citation copied!
Published December 1, 1965
Publication History
Received
3 August 2009
Published
online 1 December 1965
Published
in issue 1 December 1965
© American Chemical Society and Division of Chemical Education, Inc.
Request reuse permissions
Article Views
1540
Altmetric
-
Citations
10
Learn about these metrics
close
Article Views are the COUNTER-compliant sum of full text article downloads since November 2008 (both PDF and HTML) across all institutions and individuals. These metrics are regularly updated to reflect usage leading up to the last few days.
Citations are the number of other articles citing this article, calculated by Crossref and updated daily.Find more information about Crossref citation counts.
The Altmetric Attention Score is a quantitative measure of the attention that a research article has received online. Clicking on the donut icon will load a page at altmetric.com with additional details about the score and the social media presence for the given article. Find more information onthe Altmetric Attention Score and how the score is calculated.
Recommended Articles
### Can C P Be Less Than C V? April 14, 2021 ACS Omega Yingbin Ge , Samuel L. Montgomery ,and Gabriel L. Borrello
ADVERTISEMENT
read
Journals
Books & References
C&EN
publish
Submit a Manuscript
Author Resources
Peer Review
Purchase Author Services
Explore Open Access
subscribe
Librarians & Account Managers
Open Science for Institutions
Inquire About Access
help
Support FAQ
Live Chat with Agent
resources
About ACS Publications
ChemRxiv
Blog
Events
Join ACS
For Advertisers
1155 Sixteenth Street N.W.Washington, DC 20036
Copyright © 2025 American Chemical Society.
Terms of Use
Privacy Policy
Accessibility
Facebook
X
Bluesky
YouTube
RSS
Monday, September 29, 2025
We’re upgrading the ACS Publications homepage to enhance your experience with improved navigation, search, and accessibility.
During this time, some features may be temporarily unavailable.
We appreciate your patience and look forward to delivering a newer improved homepage.
✓
Thanks for sharing!
AddToAny
More…
Live Chat |
14146 | https://www.youtube.com/watch?v=pikpfrwRCVo | Estimating Inventory: Gross Profit and Retail Methods
Finally Learn
7730 subscribers
8 likes
Description
973 views
Posted: 25 Oct 2021
Sometimes we need to estimate inventory. There are two methods to estimate inventory:
► 1 Gross Profit Method
► 2 Retail Method
ACCOUNTING FOR INVENTORY
✅ Inventory and Cost of Goods Sold
✅ Inventory FIFO, LIFO, & Weighted Average
✅ Inventory Errors
✅ Estimating Inventory
LEARN MORE
✅ Subscribe to Finally Learn
🖥 Visit Finally Learn:
💵 Time Value of Money Playlist:
👩💻 Excel Basics for Beginners Playlist:
📚 Intermediate Accounting Study Guide
📕 Intermediate Accounting 1 Playlist:
📗 Intermediate Accounting 2 Playlist:
BOOKS I RECOMMEND
📕 The Little Book of Common Sense Investing (Jack Bogle is the father of index fund investing)
📗 A Random Walk Down Wall Street (Burton Malkiel's book on why index funds beat the investing pros)
📘 The Boglehead's Guide to the Three-Fund Portfolio (Simplifying your portfolio with just three funds)
SAY HI ON SOCIAL
🖥 Website:
📸 Instagram:
📰 Twitter:
🖥 YouTube:
MY GEAR
🎙 Microphone
💻 Laptop
💼 Laptop Backpack
💵 Financial Calculator
🎧 Earbuds
📓 Journal Notebook
🖊 Archival Ink Pens
CHAPTERS
00:00 Intro
00:40 Gross profit method
04:55 Retail method
ABOUT ME
My name is Jeff Mankin. I teach accounting, finance, and Excel. I started my website FinallyLearn.com and my channel to teach more people financial topics. I have a passion for teaching financial topics using Excel. I have articles and videos on many financial topics. My goal is to help you finally learn financial skills! Check out the playlists on accounting basics, time value of money, and Intermediate Accounting. I hope you join me on the Finally Learn channel!
DISCLAIMERS & DISCLOSURES
This content is for education and entertainment purposes only. Finally Learn does not provide accounting, tax, financial planning, or investment advice. The information is being presented without consideration of the investment objectives, risk tolerance, or financial circumstances of any specific investor and might not be suitable for all investors. Past performance is not indicative of future results. All investing involves risk, including the possible loss of principal.
This description contains affiliate links that allow you to find the items mentioned in this video and support the channel at no cost to you. Finally Learn is a participant in the Amazon Services LLC Associates Program, an affiliate advertising program designed to provide a means for sites to earn advertising fees by advertising and linking to www.amazon.com. Thank you for your support!
finallylearn #jeffmankin
865 Subscribers
10/25/2021
1 comments
Transcript:
Intro hello and welcome today we're working on how to estimate ending inventory in accounting now we use two methods the gross profit method and the retail method i've got two examples of each one so let's get started hello my name is jeff from finally learn.com where i help you finally learn financial literacy like accounting excel and so on so first of all why do we need to estimate well sometimes it takes a long time to count inventory so the count is too long sometimes we have a way we can't count it because there's a fire that's damaged the items or theft or flood and it's just a quick way to know so let's get started with the gross profit method so here's what we need to know on Gross profit method the gross profit method so problem one blaze company has a fire with a total loss of inventory so we can't count so what is the cost of that inventory that is lost so we need to know things like what is our beginning inventory how much do we purchase what's our sales and then the other thing we have to pick up is what is our estimated gross profit for the last several months or for the last year or so so we're going to estimate what our gross profit is now our sales are always going to be 100 so we're going to plug in that gross profit to be 40 and our cost of goods sold then will be 100 minus the 40 percent so we're assuming if our gross profit is 40 our cost of goods sold is 60 so we plug in our sales of 157 000 our cost of goods sold is going to be 157 times the 60 so we assume it's 60 and our gross profit here is 157 times the 40 or we simply can subtract out whichever way is easier we can take the 157 minus the 94 200. so that's our first step let's go back and figure out we're not trying to figure out our cost of goods sold and our gross profit we're trying to figure out our ending inventory so our beginning inventory is 25 000. our purchases are 90 000. so we have a total in available of 115 000 and we don't know our ending inventory that's what we're trying to estimate but we do know we just calculated our cost of goods sold so it's the 94 000. so if we take the 115 minus the 94 hundred and we get twenty thousand eight hundred so if we had a fire we lost all our inventory we can estimate that a cost of our ending inventory is twenty thousand eight hundred now the good thing about doing it in excel is you could change numbers right so you could say well what if our cost gross profit is 42 percent well that changes then the amount of ending inventory everything gets updated you could also change hey we had beginning inventory of 35 000 not 25 000 everything then would get updated based on that number okay so let's look at the second problem for using the gross profit method just new numbers and we'll do a very similar format so sometimes you'll get a problem that just has this information it says hey solve and try to calculate ending inventory so you want to put it in a format that you know so i would set up sales minus cost of goods sold gives you gross profit we know that our beginning number is always sales 100 so we know that's the first thing we do i'm going to point to the gross profit that's 34 percent that means our cost of goods sold is going to be 66 percent so if our sales are in this case 202 000 our cost of goods sold is 202 times the 66 percent and then we can simply subtract out 202 minus that 133 and we have gross profit of 68 680. so we plug in our beginning inventory which is 47 000. and our purchases are a hundred and fourteen thousand that means we have goods available of a hundred and sixty one thousand we're trying to figure out ending inventory which we don't know but we do know cost of goods sold so our cost of goods sold is 133. so we take 161 minus the 133 and so our estimate for ending inventory then is 276 so this is one way to estimate ending inventory using the gross profit method so we have to know some information some accounting information and then we need to estimate our gross profit percentage now there's another way to do Retail method this and it's called the retail method and so here's what we're thinking about we have the fletcher company here has information we're trying to figure out what is the cost of ending inventory so we have similar kind of idea we have the cost of beginning inventory and purchases and then we have the retail prices of beginning inventory and purchases so let's add up our total cost here let's give us a line here so we know that it's a summation here so we have the total cost of inventory is 169 000 under the cost the retail prices now think about this we have purchased inventory that cost about 170 000 and we're going to sell it for about 167 000 i'm sorry 267 000. so we have a markup this is shows the markup the retail prices versus our cost so here's what we need to calculate we need to calculate a cost to retail ratio or a cost retail ratio so we're going to take the cost of 169 divided by the 266 and we end up with not a dollar amount we're going to end up with a percentage and i recommend that you go to a couple of decimal places so it's 63.41 so that means for every dollar we have in retail prices then we it costs us 63 and a half cents essentially so we can calculate if we know that our sales are 212 000 we can say 266 is what we had available the retail prices minus the 212. so our ending inventory at our cost we don't know but we know our retail prices our retail price means we have inventory we would sell at fifty four thousand five hundred so we need to back in and multiply times that cost retail ratio we're gonna take fifty four thousand times the sixty three percent and that would give us the estimate of the cost of ending inventory is 34 561. now here it may come to pennies we don't need pennies we just round to the whole dollar and so the cost of our inventory is thirty four thousand five sixty one and our retail prices of our ending inventory would be fifty four thousand five hundred let's do another one you'll see how the retail method works abdul company has the following information what is the estimated cost of any inventory same kind of thing here we need to figure out what is the cost of our items so our cost is 330 330 000 and our retail prices are 649 600. so we're going to take our cost to retail ratio so let's say our cost divided by our retail prices we're going to get a percentage here this percentage and let's hang on to it 50.81 so we have a bigger markup here on this problem than we did on the previous problem and um the sales i think i um i changed that and copied it so let's assume the sales let's make the sales 512 000 rather than that 212 000. so let's say our sales are 512 000 so what is our ending inventory at retail prices well it is 649 600 minus the five hundred and twelve thousand that's a hundred and thirty seven thousand six hundred well what would the cost of that be so we have to estimate the cost well we're assuming that the cost the one thirty seven 000 cost about 51 50.8 percent so the cost is 69 910 so we have two ways to estimate ending inventory the gross profit method and the retail method both are fine and we've got two examples that now you know how to do it hey see you on the next video thanks for watching |
14147 | https://artofproblemsolving.com/wiki/index.php/Stewart%27s_Theorem?srsltid=AfmBOoosqjYLKHCJs6uj0okOTxdkz-jQqPsg7pzkKl_TBbUTZDZh9OMj | Art of Problem Solving
Stewart's Theorem - AoPS Wiki
Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical CampusVisit the Virtual Campus
Sign In
Register
online school
Class ScheduleRecommendationsOlympiad CoursesFree Sessions
books tore
AoPS CurriculumBeast AcademyOnline BooksRecommendationsOther Books & GearAll ProductsGift Certificates
community
ForumsContestsSearchHelp
resources
math training & toolsAlcumusVideosFor the Win!MATHCOUNTS TrainerAoPS Practice ContestsAoPS WikiLaTeX TeXeRMIT PRIMES/CrowdMathKeep LearningAll Ten
contests on aopsPractice Math ContestsUSABO
newsAoPS BlogWebinars
view all 0
Sign In
Register
AoPS Wiki
ResourcesAops Wiki Stewart's Theorem
Page
ArticleDiscussionView sourceHistory
Toolbox
Recent changesRandom pageHelpWhat links hereSpecial pages
Search
Stewart's Theorem
Contents
1 Statement
2 Proof
2.1 Proof 1
2.2 Proof 2 (Pythagorean Theorem)
3 Proof 3 (Barycentrics)
4 Video Proof
5 See Also
Statement
Given any triangle with sides of length and opposite vertices, , , respectively, then if cevian is drawn so that , and , we have that . (This is also often written , a phrase which invites mnemonic memorization, i.e. "A man and his dad put a bomb in the sink.") That is Stewart's Theorem.
Proof
Proof 1
Applying the Law of Cosines in triangle at angle and in triangle at angle , we get the following equations:
Because angles and are supplementary, . We can therefore solve both equations for the cosine term. Using the trigonometric identity gives us
Setting the two left-hand sides equal and clearing denominators, we arrive at the equation: . However, so and This simplifies our equation to yield as desired.
Proof 2 (Pythagorean Theorem)
Let the altitude from to meet at . Let , , and .
We can apply the Pythagorean Theorem on and to yield and then solve for to get .
Doing the same for and gives us:
then we solve for to get .
Now multiple the first expression by and the second by :
m b 2=m d 2+m(x 2−y 2)n c 2=n d 2+m 2 n+2 m n y
Next, we add these two expressions:
Then simplify as follows (we reapply a few times while factoring):
m b 2+n c 2=(m+n)d 2+m(x+y)(x−y)+m n(n+2 y)=(m+n)d 2+m n(x−y)+m n(n+2 y)=(m+n)d 2+m n(x+y+n)=(m+n)d 2+m n(m+n)=(m+n)(d 2+m n).
Rearranging the equation gives Stewart's Theorem: .
Proof 3 (Barycentrics)
Let the following points have the following coordinates:
Our displacement vector has coordinates . Plugging this into the barycentric distance formula, we obtain Multiplying by , we get . Substituting with , we find Stewart's Theorem:
Video Proof
TheBeautyofMath
See Also
Menelaus' theorem
Ceva's theorem
Geometry
Angle Bisector Theorem
This article is a stub. Help us out by expanding it.
Retrieved from "
Categories:
Geometry
Theorems
Stubs
Art of Problem Solving is an
ACS WASC Accredited School
aops programs
AoPS Online
Beast Academy
AoPS Academy
About
About AoPS
Our Team
Our History
Jobs
AoPS Blog
Site Info
Terms
Privacy
Contact Us
follow us
Subscribe for news and updates
© 2025 AoPS Incorporated
© 2025 Art of Problem Solving
About Us•Contact Us•Terms•Privacy
Copyright © 2025 Art of Problem Solving
Something appears to not have loaded correctly.
Click to refresh. |
14148 | https://brainly.com/question/12475582 | [FREE] Evaluate C(7, 3). A. 4 B. 35 C. 70 - brainly.com
Advertisement
Search
Learning Mode
Cancel
Log in / Join for free
Browser ExtensionTest PrepBrainly App Brainly TutorFor StudentsFor TeachersFor ParentsHonor CodeTextbook Solutions
Log in
Join for free
Tutoring Session
+85,1k
Smart guidance, rooted in what you’re studying
Get Guidance
Test Prep
+21,2k
Ace exams faster, with practice that adapts to you
Practice
Worksheets
+6,8k
Guided help for every grade, topic or textbook
Complete
See more
/
Mathematics
Textbook & Expert-Verified
Textbook & Expert-Verified
Evaluate C(7,3).
A. 4
B. 35
C. 70
2
See answers Explain with Learning Companion
NEW
Asked by kyky012602 • 04/12/2019
0:00
/
--
Read More
Community
by Students
Brainly
by Experts
ChatGPT
by OpenAI
Gemini
Google AI
Community Answer
This answer helped 73016880 people
73M
4.9
15
Upload your school material for a more relevant answer
option B
35
Explanation
Combinations are a way to calculate the total outcomes of an event where order of the outcomes does not matter.
Formula to calculate combination
nCr = n! / r! (n - r)!
We are given C(7,3)
here n = 7
r = 3
So plug values in the formula
7C3 = 7! / 3! (7 - 3)!
= (7x6x5x4x3x2) / (3x2)(4x3x2)
= (7x6x5) / (3x2)
= 210 / 6
= 35
Answered by ShyzaSling •5.2K answers•73M people helped
Thanks 15
4.9
(12 votes)
Textbook &Expert-Verified⬈(opens in a new tab)
This answer helped 73016880 people
73M
4.9
15
Chemical Thermodynamics - Andrea Allgood Carter
Thermodynamics and Chemical Equilibrium - Paul Ellgen
Introduction to Sociology: Understanding and Changing the Social World - LibreTexts
Upload your school material for a more relevant answer
The calculation for C(7, 3) results in 35, which is the number of ways to choose 3 items from a set of 7 without regard to order. This is determined using the combination formula nCk = n! / (k!(n-k)!). Therefore, the correct answer is option B.
Explanation
To evaluate C(7, 3), we will use the formula for combinations:
nCk = n! / (k! × (n - k)!)
In this formula:
n is the total number of items (in this case, 7).
k is the number of items to choose (in this case, 3).
Now, plugging in the values:
7C3 = 7! / (3! × (7 - 3)!)
Calculating this step-by-step:
Calculate 7 - 3 = 4
Therefore, we need to calculate:
7C3 = 7! / (3! × 4!)
Recognizing that:
7! = 7 × 6 × 5 × 4 × 3 × 2 × 1
3! = 3 × 2 × 1 = 6
4! = 4 × 3 × 2 × 1 = 24
So now we have:
7C3 = (7 × 6 × 5 × 4!) / (3! × 4!)
The 4! cancels out:
7C3 = (7 × 6 × 5) / (3 × 2 × 1)
Now, simplifying further:
7 × 6 × 5 = 210
3 × 2 × 1 = 6
Thus:
7C3 = 210 / 6 = 35
Therefore, the value of C(7, 3) is 35. The correct answer is option B.
Examples & Evidence
For example, if you wanted to choose 3 fruits from a basket of 7 different fruits, C(7, 3) tells you how many unique sets of fruits you can create without considering the arrangement of those fruits.
The combination formula is based on combinatorial mathematics, where C(n, r) produces distinct groups, thereby validating the evaluation and the application of factorials as shown in the computation steps.
Thanks 15
4.9
(12 votes)
Advertisement
Community Answer
This answer helped 513156 people
513K
0.0
0
Final answer:
The value of C(7, 3), which is the number of combinations of 7 items taken 3 at a time, is 35. The calculation uses the combinations formula C(n, k) = n! / (k! (n - k)!), simplifying the factorials and the result is determined.
Explanation:
To evaluate C(7, 3), we need to calculate the number of combinations of 7 items taken 3 at a time. The formula for a combination is given as:
C(n, k) = n! / (k! (n - k)!)
Here, n represents the total number of items and k represents the number of items to choose. Let's plug in the values to calculate this:
C(7, 3) =7!/(3!∗(7−3)!)=7!/(3!∗4!) = (7 x 6 x 5 x 4 x 3 x 2 x 1) / ((3 x 2 x 1) (4 x 3 x 2 x 1))
After canceling the matching factorial terms, we get:
C(7, 3) = (7 x 6 x 5) / (3 x 2 x 1) = 210 / 6 = 35
Therefore, the value of C(7, 3) is 35.
Answered by BishopBriggs •7K answers•513.2K people helped
Thanks 0
0.0
(0 votes)
Advertisement
### Free Mathematics solutions and answers
Community Answer 4.6 12 Jonathan and his sister Jennifer have a combined age of 48. If Jonathan is twice as old as his sister, how old is Jennifer
Community Answer 11 What is the present value of a cash inflow of 1250 four years from now if the required rate of return is 8% (Rounded to 2 decimal places)?
Community Answer 13 Where can you find your state-specific Lottery information to sell Lottery tickets and redeem winning Lottery tickets? (Select all that apply.) 1. Barcode and Quick Reference Guide 2. Lottery Terminal Handbook 3. Lottery vending machine 4. OneWalmart using Handheld/BYOD
Community Answer 4.1 17 How many positive integers between 100 and 999 inclusive are divisible by three or four?
Community Answer 4.0 9 N a bike race: julie came in ahead of roger. julie finished after james. david beat james but finished after sarah. in what place did david finish?
Community Answer 4.1 8 Carly, sandi, cyrus and pedro have multiple pets. carly and sandi have dogs, while the other two have cats. sandi and pedro have chickens. everyone except carly has a rabbit. who only has a cat and a rabbit?
Community Answer 4.1 14 richard bought 3 slices of cheese pizza and 2 sodas for $8.75. Jordan bought 2 slices of cheese pizza and 4 sodas for $8.50. How much would an order of 1 slice of cheese pizza and 3 sodas cost? A. $3.25 B. $5.25 C. $7.75 D. $7.25
Community Answer 4.3 192 Which statements are true regarding undefinable terms in geometry? Select two options. A point's location on the coordinate plane is indicated by an ordered pair, (x, y). A point has one dimension, length. A line has length and width. A distance along a line must have no beginning or end. A plane consists of an infinite set of points.
Community Answer 4 Click an Item in the list or group of pictures at the bottom of the problem and, holding the button down, drag it into the correct position in the answer box. Release your mouse button when the item is place. If you change your mind, drag the item to the trashcan. Click the trashcan to clear all your answers. Express In simplified exponential notation. 18a^3b^2/ 2ab
New questions in Mathematics
If 24 out of 32 students prefer iPhones, how many out of 500 students in the school would be expected to prefer them?
Choose an equivalent expression for 1 2 3⋅1 2 9⋅1 2 4⋅1 2 2. A. 1 2 4 B. 1 2 18 C. 1 2 35 D. 1 2 216
Choose an equivalent expression for 1 0 6÷1 0 4. A. 1 0 2 B. 1 0 3 C. 1 0 10 D. 1 0 24
How would you write 1 2−3 using a positive exponent? A. 1 2 3 B. 1 2 0 C. 1 1 2 3 D. 1 2 3 1
Is this equation correct? 6 3⋅7 3=4 2 3
Previous questionNext question
Learn
Practice
Test
Open in Learning Companion
Company
Copyright Policy
Privacy Policy
Cookie Preferences
Insights: The Brainly Blog
Advertise with us
Careers
Homework Questions & Answers
Help
Terms of Use
Help Center
Safety Center
Responsible Disclosure Agreement
Connect with us
(opens in a new tab)(opens in a new tab)(opens in a new tab)(opens in a new tab)(opens in a new tab)
Brainly.com
Dismiss
Materials from your teacher, like lecture notes or study guides,
help Brainly adjust this answer to fit your needs.
Dismiss |
14149 | https://www.opentextbookstore.com/buscalc/buscalc/chapter2/section2-6.php | ≡
×
Section 2.6: Second Derivative and Concavity
Second Derivative and Concavity
Graphically, a function is concave up if its graph is curved with the opening upward (Figure 1a). Similarly, a function is concave down if its graph opens downward (Figure 1b).
This figure shows the concavity of a function at several points. Notice that a function can be concave up regardless of whether it is increasing or decreasing.
For example, an epidemic: Suppose an epidemic has started, and you, as a member of congress, must decide whether the current methods are effectively fighting the spread of the disease or whether more drastic measures and more money are needed. In Figure 2 below, f(x) is the number of people who have the disease at time x, and two different situations are shown. In both Figure 2a and Figure 2b, the number of people with the disease, f(now), and the rate at which new people are getting sick, f′(now), are the same. The difference in the two situations is the concavity of f, and that difference in concavity might have a big effect on your decision.
In Figure 2a, f is concave down at "now", the slopes are decreasing, and it looks as if it is tailing off. We can say "f is increasing at a decreasing rate." It appears that the current methods are starting to bring the epidemic under control.
In Figure 2b, f is concave up, the slopes are increasing, and it looks as if it will keep increasing faster and faster. It appears that the epidemic is still out of control.
The differences between the graphs come from whether the derivative is increasing or decreasing
The derivative of a function f is a function that gives information about the slope of f. The derivative tells us if the original function is increasing or decreasing.
Because f′ is a function, we can take its derivative. This second derivative also gives us information about our original function f. The second derivative gives us a mathematical way to tell how the graph of a function is curved. The second derivative tells us if the original function is concave up or down.
Second Derivative
Let y=f(x). The second derivative of f is the derivative of y′=f′(x).
Using prime notation, this is f′′(x) or y′′. You can read this aloud as "f double prime of x" or "y double prime."
Using Leibniz notation, the second derivative is written d2ydx2 or d2fdx2. This is read aloud as "the second derivative of y (or f)."
Derivatives and the Graph of a Function
The first derivative tells us if a function is increasing or decreasing
If f′(x) is positive on an interval, the graph of y=f(x) is increasing on that interval.
If f′(x) is negative on an interval, the graph of y=f(x) is decreasing on that interval.
The second derivative tells us if a function is concave up or concave down
If f′′(x) is positive on an interval, the graph of y=f(x) is concave up on that interval. We can say that f is increasing (or decreasing) at an increasing rate.
If f′′(x) is negative on an interval, the graph of y=f(x) is concave down on that interval. We can say that f is increasing (or decreasing) at a decreasing rate.
Example 1
Find f′′(x) for f(x)=3x7.
First, we need to find the first derivative: f′(x)=21x6.
Then we take the derivative of that function: f′′(x)=ddx(f′(x))=ddx(21x6)=126x5.
If f(x) represents the position of a particle at time x, then v(x)=f′(x) will represent the velocity (rate of change of the position) of the particle and a(x)=v′(x)=f′′(x) will represent the acceleration (the rate of change of the velocity) of the particle.
You are probably familiar with acceleration from driving or riding in a car. The speedometer tells you your velocity (speed). When you leave from a stop and press down on the accelerator, you are accelerating – increasing your speed.
Example 2
The height (feet) of a particle at time t seconds is f(t)=t3–4t2+8t. Find the height, velocity and acceleration of the particle when t= 0, 1, and 2 seconds.
f(t)=t3–4t2+8t so f(0)=0 feet, f(1)=5 feet, and f(2)=8 feet.
The velocity is v(t)=f′(t)=3t2–8t+8 so v(0)=8 ft/s, v(1)=3 ft/s, and v(2)=4 ft/s. At each of these times the velocity is positive and the particle is moving upward, increasing in height.
The acceleration is a(t)=f′′(t)=6t–8 so a(0)=–8 ft/s2, a(1)=–2 ft/s2 and a(2)=4 ft/s2.
At time 0 and 1, the acceleration is negative, so the particle's velocity would be decreasing at those points - the particle was slowing down. At time 2, the velocity is positive, so the particle was increasing in speed.
Inflection Points
Definition (Inflection Point)
An inflection point is a point on the graph of a function where the concavity of the function changes, from concave up to down or from concave down to up.
Example 3
Which of the labeled points in the graph below are inflection points?
The concavity changes at points b and g. At points a and h, the graph is concave up on both sides, so the concavity does not change. At points c and f, the graph is concave down on both sides. At point e, even though the graph looks strange there, the graph is concave down on both sides – the concavity does not change.
Inflection points happen when the concavity changes. Because we know the connection between the concavity of a function and the sign of its second derivative, we can use this to find inflection points.
Working Definition
An inflection point is a point on the graph where the second derivative changes sign.
In order for the second derivative to change signs, it must either be zero or be undefined. So to find the inflection points of a function we only need to check the points where f′′(x) is 0 or undefined.
Note that it is not enough for the second derivative to be zero or undefined. We still need to check that the sign of f′′ changes sign. The functions in the next example illustrate what can happen.
Example 4
Let f(x)=x3, g(x)=x4 and h(x)=x1/3. For which of these functions is the point (0,0) an inflection point?
Graphically, it is clear that the concavity of f(x)=x3 and h(x)=x1/3 changes at (0,0), so (0,0) is an inflection point for f and h. The function g(x)=x4 is concave up everywhere so (0,0) is not an inflection point of g.
We can also compute the second derivatives and check the sign change.
If f(x)=x3, then f′(x)=3x2 and f′′(x)=6x. The only point at which f′′(x)=0 or is undefined (f′ is not differentiable) is at x=0. If x<0, then f′′(x)<0 so f is concave down. If x>0, then f′′(x)>0 so f is concave up. At x=0 the concavity changes so the point (0,f(0))=(0,0) is an inflection point of f(x)=x3.
If g(x)=x4, then g′(x)=4x3 and g′′(x)=12x2. The only point at which g′′(x)=0 or is undefined is at x=0. If x<0, then g′′(x)>0 so g is concave up. If x>0, then g′′(x)>0 so g is also concave up. At x=0 the concavity does not change so the point (0,g(0))=(0,0) is not an inflection point of g(x)=x4. Keep this example in mind!
If h(x)=x1/3, then h′(x)=13x−2/3 and h′′(x)=−29x−5/3. h′′ is not defined if x=0, but h′′(negative number)>0 and h′′(positive number)<0 so h changes concavity at (0,0) and (0,0) is an inflection point of h.
Example 5
Sketch the graph of a function with f(2)=3, f′(2)=1, and an inflection point at (2,3).
Two possible solutions are shown here. |
14150 | https://math.libretexts.org/Bookshelves/Precalculus/Trigonometry_(Yoshiwara)/10%3A_Polar_Coordinates_and_Complex_Numbers/10.01%3A_Polar_Graphs | Skip to main content
10.1: Polar Graphs
Last updated
: Mar 4, 2023
Save as PDF
10.0: Polar Coordinates
10.2: Complex Numbers
Page ID
: 112449
Katherine Yoshiwara
Los Angeles Pierce College
( \newcommand{\kernel}{\mathrm{null}\,})
Graphing in Polar Coordinates
When we plot points in Cartesian coordinates, we start at the origin and move a distance right or left given by the -coordinate of the point, then move up or down according to the -coordinate. When we sketch the graph of an equation or function, we think of drawing the graph from left to right, with the "height" of the graph at each -value given by the function, as shown in figure (a).
In polar coordinates, however, the dependent variable, , gives not a height but a distance from the pole in direction , as shown in figure (b). When graphing an equation in polar coordinates, we think of sweeping around the pole in the counterclockwise direction, and at each angle the -value tells us how far the graph is from the pole.
Example 10.17
Graph the polar equation .
Answer
: We make a table of values, choosing the special values for . For each value of , we evaluate .
| | | | | | | | | | |
--- --- --- --- --- |
| | 0 | | | | | | | | |
| | 0 | 1 | | | 2 | | | 1 | 0 |
First, we'll plot the points in the first quadrant. Observe that as increases from 0 to , increases from 0 to 2. Starting at the pole, we connect the points in order of increasing . Imagine a radial line sweeping around the graph through the first quadrant: as the angle increases, the length of the segment increases, so that its tip traces out the graph shown in figure (a).
Now continue plotting the points in the table as increases from to . In the second quadrant, decreases as increases, as shown in figure (b). The graph we obtain is, in fact, a circle, which we will prove algebraically shortly. However, we have not yet plotted points for between 0 and . Because is negative in the third and fourth quadrants, all the -values for these angles are negative.
| | | | | | | | | | |
--- --- --- --- --- |
| | | | | | | | | | |
| | 0 | -1 | | | -2 | | | -1 | 0 |
When we plot the points in this table, we see that the original graph is traced out again. For example, the point is the same as the point , the point is the same as the point , and so on, around the circle. Thus, the graph of is a circle, traced twice for .
To prove that the graph in Example 1 is really a circle, we convert the equation to Cartesian form. First, multiply both sides by to obtain
Next, replace by and by , to get
This equation is quadratic in two variables, so its graph is a conic section. We put the equation in standard form by completing the square in .
We have the equation of a circle with center (0, 1) and radius 1.
Checkpoint 10.18
Graph the polar equation .
Answer
Using a Graphing Calculator
You are familiar with the graphs of many equations in Cartesian coordinates, including lines, parabolas and other conic sections, and the graphs of basic functions. You should now become familiar with some standard graphs in polar coordinates. These include circles and roses, cardioids and limaçons, lemniscates, and spirals.
At the end of this section you will find a Catalog of the basic polar graphs and their properties. You can use your calculator, set in Polar mode, to experiment with these graphs.
Example 10.19
Graph the Archimedean spiral , for .
Answer
: After setting the calculator in Polar mode, we enter the equation and enter the window settings
We then press Zoom 5 to set a square window.
The graph is shown below.
Studying a table of values can help us understand the shape of the graph.
| | | | | | |
--- --- --- |
| | 0.25 | 0.50 | 0.75 | 1.00 | 1.25 |
| | 0.50 | 1.00 | 1.50 | 2.00 | 2.50 |
As increases, increases also, at a constant rate. We wind our way around the pole, steadily increasing our distance from the pole as we go. We spiral outwards, tracing the graph shown above.
Checkpoint 10.20
Use a calculator to graph the polar equation . Use the window settings
Answer
It is important to connect the points on the graph in order of increasing .
Example 10.21
Graph the polar equation .
Answer
: We’ll graph the equation in stages in order to see how the graph is traced out. Begin with the window settings
Watch as your calculator produces the graph shown in figure (a).
Observe that, as increases from 0 to first increases, reaching its maximum value of 2 at and then decreases back to 0. You can verify the values in the table below, which shows the points at multiples of . These points create the first loop of the graph.
| | | | | | | | |
--- --- --- --- |
| | 0 | | | | | | |
| | 0 | | | | | | |
| | 0 | 1 | | 2 | | 1 | 0 |
Next, change to , and graph again. This time the calculator traces out two loops, as shown in figure (b). For between and is negative, so the second loop lies in the third and fourth quadrants.
| | | | | | | | |
--- --- --- --- |
| | | | | | | | |
| | | | | | | | |
| | 0 | -1 | | -2 | | -1 | 0 |
Finally, change to , and graph again. For between and , the graph traces out a third loop, as shown in figure (c). For between and , the entire graph is traced a second time. The finished graph is a rose with 3 petals of length 2.
Checkpoint 10.22
a Use your calculator to graph the polar equation .
b Complete the table of values for the function.
| | | | | | | | |
--- --- --- --- |
| | 0 | | | | | | |
| | | | | | | | |
c Sketch the graph by hand on the grid below.
Answer
Sketching Familiar Equations
You should also be able to sketch the standard polar graphs by hand. Once you recognize an equation as a particular type of graph, say a rose or a limaçon, you can sketch the graph quickly by finding just a few well-chosen guidepoints. The next example demonstrates a technique for sketching a rose.
Example 10.23
Graph the polar equation .
Answer
: Referring to the Catalog of Polar Graphs, we see that the graph of this equation is a rose, with petal length and four petals, because . If we can locate the tips of the petals, we can use them as guidepoints to sketch the graph.
Now, the points at the tips of the petals have , so we substitute into the equation of the rose to find the values of at those points.
Thus, one of the petal tips is located at . Because the 4 petals are evenly spaced around the pole, the angle between the petals is , and the other petal tips occur at
We plot the tips of the petals as guidepoints, at and . Now we can sketch a rose with 4 petals of length 3, as shown below.
Checkpoint 10.24
Graph the polar equation .
Answer
The limaçons, and , are another family of polar graphs. In particular, the cardioid is a special case of a limaçon with .
Example 10.25
Graph the polar equation .
Answer
: This is the equation for a limaçon, with and . Because , the limaçon will have a dent, like a lima bean, rather than a loop. As guide points, we locate the points at the four quadrantal angles.
| | |
--- |
| | |
| 0 | 5 |
| | 3 |
| | 1 |
| | 3 |
We plot the guide points and connect them in order with a smooth curve, as shown below. Note that this limaçon involving cosine is symmetric about the -axis; limaçons involving sine are symmetric about the -axis.
Checkpoint 10.26
Graph the polar equation .
Answer
You should also be able to identify a polar graph and write its equation.
Example 10.27
Give a polar equation for each of the graphs below.
Answer
: a The graph is a circle centered at (-2,0) and with radius 2, so we choose the equation , with . Thus, .
b The graph is a cardioid with its axis of symmetry on the -axis, and the "bottom" of the heart points in the positive direction, so its equation has the form . At , so we can solve for :
Thus, and we choose the equation .
Checkpoint 10.28
Give a polar equation for each of the graphs below.
Answer
: a
b
Finding Intersection Points
To find the intersection points of two graphs, we solve the system made up of their equations. If the equations are and , we simply solve the equation . For example, we find the intersection points of and by solving the equation to get
These are the -coordinates of the intersection points, and we can find the -coordinates by substituting these values into either equation.
For , we find .
For , we find .
Thus, the intersection points are (2, 4) and (−1, 1), as shown below.
To find the intersection points of the polar graphs and we solve the equation .
Example 10.29
Find all intersection points of the graphs of and .
Answer
: We equate the two expressions for and solve for .
We evaluate either expression for to find the other coordinate of the intersection point.
when
when
Thus, two of the intersection points are and , as shown below. However, you can see in the figure that the graphs also appear to intersect at the pole. To verify that the pole indeed lies on both graphs, we can solve for in each equation when .
However, you can see in the figure that the graphs also appear to intersect at the pole. To verify that the pole indeed lies on both graphs, we can solve for in each equation when .
Both points, and , represent the pole. Thus, the graphs intersect at three points: , and the pole.
Caution 10.30
As we saw in the previous Example, solving a system of equations and will not always reveal an intersection at the pole, because may be equal to zero for different values of in the two equations. We should always check separately whether the pole is a point on both graphs.
Checkpoint 10.31
Find all intersection points of the graphs of and .
Answer
Review the following skills you will need for this section.
Skills Refresher 10.2
Solve each equation. Give two solutions, .
1
2
3
4
5
6
7
8
Skills Refresher Answers
: 1
2
3
4
5
6
7
8
A Catalog of Polar Curves
The Coordinate Curves
( a constant)
A line through the pole.
gives the angle of inclination of the line (in radians).
( a constant)
A circle centered at the pole.
is the radius of the circle.
Circles
A circle with center (0, ) on the -axis, and radius .
A circle with center on the -axis, and radius .
Roses
A rose with petal length .
petals if is odd; petals if is even.
A rose with petal length .
petals if is odd; petals if is even.
Limaçons
, with a dent.
, with a loop.
, a cardioid.
Lemniscates
Spirals
Archimedean spiral
Logarithmic spiral
Section 10.2 Summary
Vocabulary
• Rose
• Limaçon
• Cardioid
• Lemniscate
Concepts
1 When graphing an equation in polar coordinates, we think of sweeping around the pole in the counterclockwise direction, and at each angle the -value tells us how far the graph is from the pole.
2 Standard graphs in polar coordinates include circles and roses, cardioids and limaçons, lemniscates, and spirals.
3 To find the intersection points of the polar graphs and we solve the equation . In addition, we should always check whether the pole is a point on both graphs.
Study Questions
1 Delbert says that the graph of in the first example cannot be correct, because there are no points on the graph for angles between and . How do you respond?
2 Is it possible to have a rose with only two petals? What would its equation be?
3 Francine says that a circle of the form is just a special case of a limaçon. Support or refute her statement.
4 There are no points on the graph of for angles between and Why is that?
Skills
1 Describe the effect of parameters in polar curves #1–16, 83–84
2 Compare polar and Cartesian graphs #21–24
3 Sketch standard polar graphs #17–20, 25–42, 75–82
4 Identify standard polar graphs #43–58
5 Write equations for standard polar graphs #59–66
6 Find intersection points of polar graphs #67–74
Homework 10-2
In Problems 1-4, use your calculator to graph the equations.
1
a Graph , for . How does the graph change for different values of ?
b Write a Cartesian equation for each graph in part (a).
2
a Graph , for . How does these graphs compare to the graphs in Problem 1?
b Write a Cartesian equation for each graph in part (a).
3
a Graph , for . How does the graph change for different values of ?
b Write a Cartesian equation for each graph in part (a).
4
a Graph , for . How does the graph change for different values of ?
b Write a Cartesian equation for each graph in part (a).
Complete the table of values for each equation. Plot the points in order of increasing . What is different about the two graphs?
Equation 1:
| | | | | | | | | |
--- --- --- ---
| | 0 | | | | | | | |
| | | | | | | | | |
Equation 2:
| | | | | | | | | |
--- --- --- ---
| | 0 | | | | | | | |
| | | | | | | | | |
Graph each line, and label the points with their coordinates. How are the points on the two lines related?
Equation 1:
| | | | | | |
--- --- --- |
| | | | | | |
| | -2 | -1 | 0 | 1 | 2 |
Equation 1:
| | | | | | |
--- --- --- |
| | | | | | |
| | -2 | -1 | 0 | 1 | 2 |
7.
a Graph the circle . Label the points corresponding to , and .
b Complete the table of values. What happens to the graph as increases from to ?
| | | | | | |
--- --- --- |
| | | | | | |
| | | | | | |
c Find the center and radius of the circle.
d Give the Cartesian equation of the circle.
8.
a Graph the circle . Label the points corresponding to , and .
b Complete the table of values. What happens to the graph as increases from to ?
| | | | | | |
--- --- --- |
| | | | | | |
| | | | | | |
c Find the center and radius of the circle.
d Give the Cartesian equation of the circle.
9.
a Graph for .
b How do the graphs change for different values of ?
10.
a Graph for .
b How do the graphs change for different values of ?
Complete the table of values for each cardioid, and graph the equation.
| | | | | | |
--- --- --- |
| | 0 | | | | |
| | | | | | |
a
b
c
d
Complete the table of values for each cardioid, and graph the equation.
| | | | | | |
--- --- --- |
| | 0 | | | | |
| | | | | | |
a
b
c
d
Complete the table of values for each limaçon, and graph the equation.
| | | | | | |
--- --- --- |
| | 0 | | | | |
| | | | | | |
a
b
c
d
Complete the table of values for each limaçon, and graph the equation.
| | | | | | |
--- --- --- |
| | 0 | | | | |
| | | | | | |
a
b
c
d
15.
a Graph the following roses and compare. How is the number of petals related to the value of in the equation ?
b For each graph above, list the values of where the tips of the petals occur.
c Graph for , and 3. How does the value of affect the graph?
16.
a Graph the following roses and compare. How is the number of petals related to the value of in the equation ?
b For each graph above, list the values of where the tips of the petals occur.
c Graph for , and 3 . How does the value of affect the graph?
17.
a Solve for . (You should get two equations for .)
b Graph both equations together. Change step to 0.02 to see the whole graph.
c How does the value of affect the graph of ?
18.
a Solve for . (You should get two equations for .)
b Graph both equations together. Change step to 0.02 to see the whole graph.
c How does this graph differ from the graph in Problem 17?
Graph the Archimedean spiral . Set your window to
Then graph by pressing Zoom 5.
Graph the logarithmic spiral . Set your window to
Then graph by pressing Zoom 5.
21.
a Complete the table and graph the equation in Cartesian coordinates, for .
| | | | | | | | | | |
--- --- --- --- --- |
| | | | | | | | | | |
| | 0 | | | | | | | | |
| | | | | | | | | | |
b Complete the table and graph the equation in polar coordinates, for .
| | | | | | | | | | |
--- --- --- --- --- |
| | | | | | | | | | |
| | 0 | | | | | | | | |
| | | | | | | | | | |
22.
a Complete the table and graph the equation in Cartesian coordinates, for .
| | | | | | | | | | |
--- --- --- --- --- |
| | | | | | | | | | |
| | 0 | | | (\dfrac{3\pi}{4}\0 | | | | | |
| | | | | | | | | | |
b Complete the table and graph the equation in polar coordinates, for .
| | | | | | | | | | |
--- --- --- --- --- |
| | | | | | | | | | |
| | 0 | | | | | | | | |
| | | | | | | | | | |
23.
a Complete the table and graph the equation in Cartesian coordinates, for .
| | | | | | | | | | |
--- --- --- --- --- |
| | 0 | | | | | | | | |
| | | | | | | | | | |
b Complete the table and graph the equation in polar coordinates, for .
| | | | | | | | | | |
--- --- --- --- --- |
| | 0 | | | | | | | | |
| | | | | | | | | | |
24.
a Complete the table and graph the equation in Cartesian coordinates, for .
| | | | | | | | | | |
--- --- --- --- --- |
| | 0 | | | | | | | | |
| | | | | | | | | | |
b Complete the table and graph the equation in polar coordinates, for .
| | | | | | | | | | |
--- --- --- --- --- |
| | 0 | | | | | | | | |
| | | | | | | | | | |
For Problems 25-42, use the catalog of polar graphs to help you identify and sketch the following curves. Check your work by graphing with a calculator.
25.
26.
27.
28.
29.
30.
31.
32.
33.
34.
35.
36.
37.
38.
39.
40.
41.
42.
For Problems 43–52, identify each curve, and graph it.
43.
44.
45.
46.
47.
48.
49.
50.
51.
52.
For Problems 53–58, graph the following polar curves. Do you recognize them?
53.
54.
55.
56.
57.
58.
For Problems 59–66, write a polar equation for the graph.
For Problems 67–74, find the coordinates of the intersection points of the two curves analytically. Then graph the curves to verify your answers.
67.
68.
69.
70.
71.
72.
73.
74.
For Problems 75–82, graph the polar curve.
75.
76.
(conchoid)
(kappa curve)
(strophoid)
(cissoid)
81.
82.
Graph the polar curves for . Explain how the value of the parameter affects the curve.
Graph the polar curves for . Explain how the value of the parameter affects the curve.
10.0: Polar Coordinates
10.2: Complex Numbers |
14151 | https://eng.libretexts.org/Bookshelves/Electrical_Engineering/Electronics/Microwave_and_RF_Design_IV%3A_Modules_(Steer)/02%3A_Filters/2.05%3A_The_Chebyshev_Lowpass_Approximation | 2.5: The Chebyshev Lowpass Approximation - Engineering LibreTexts
Skip to main content
Table of Contents menu
search Search build_circle Toolbar fact_check Homework cancel Exit Reader Mode
school Campus Bookshelves
menu_book Bookshelves
perm_media Learning Objects
login Login
how_to_reg Request Instructor Account
hub Instructor Commons
Search
Search this book
Submit Search
x
Text Color
Reset
Bright Blues Gray Inverted
Text Size
Reset
+-
Margin Size
Reset
+-
Font Type
Enable Dyslexic Font - [x]
Downloads expand_more
Download Page (PDF)
Download Full Book (PDF)
Resources expand_more
Periodic Table
Physics Constants
Scientific Calculator
Reference expand_more
Reference & Cite
Tools expand_more
Help expand_more
Get Help
Feedback
Readability
x
selected template will load here
Error
This action is not available.
chrome_reader_mode Enter Reader Mode
2: Filters
Microwave and RF Design IV: Modules (Steer)
{ }
{ "2.01:Introduction" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "2.02:_Singly_and_Doubly_Terminated_Networks" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "2.03:_The_Lowpass_Filter_Prototype" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "2.04:_The_Maximally_Flat(Butterworth)_Lowpass_Approximation" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "2.05:_The_Chebyshev_Lowpass_Approximation" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "2.06:_Element_Extraction" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "2.07:_Butterworth_and_Chebyshev_Filters" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "2.08:_Impedance_and_Admittance_Inverters" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "2.09:_Filter_Transformations" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "2.10:_Cascaded_Line_Realization_of_Filters" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "2.11:_Butterworth_and_Chebyshev_Bandpass_Filters" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "2.12:_Richardss_Transformation" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "2.13:_Kurodas_and_Nortons_Network_Identities" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "2.14:_Inter-resonator_Coupled_Bandpass_Filters" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "2.15:_Bandpass_Filter_Topologies" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "2.16:_Case_Study-_Design_of_a_Bandstop_Filter" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "2.17:_Active_Filters" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "2.18:_Transient_Response_of_a_Bandpass_Filter" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "2.19:_Summary" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "2.20:_References" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "2.21:_Exercises" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1" }
{ "00:_Front_Matter" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "01:_Introduction_to_RF_and_Microwave_Modules" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "02:_Filters" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "03:_Parallel_Coupled-Line_Filters" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "04:_Noise_Distortion_and_Dynamic_Range" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "05:_Passive_Modules" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "06:_Mixer_and_Source_Modules" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "07:_Cascade_of_Modules" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "zz:_Back_Matter" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1" }
Thu, 24 Oct 2024 00:35:18 GMT
2.5: The Chebyshev Lowpass Approximation
46100
46100
Joshua Halpern
{ }
Anonymous
Anonymous User
2
false
false
[ "article:topic", "autonumheader:yes1" ]
[ "article:topic", "autonumheader:yes1" ]
Search site Search Search Go back to previous article
Sign in
Username Password Sign in
Sign in
Sign in
Forgot password
Contents
1. Home
2. Bookshelves
3. Electrical Engineering
4. Electronics
5. Microwave and RF Design IV: Modules (Steer)
6. 2: Filters
7. 2.5: The Chebyshev Lowpass Approximation
Expand/collapse global location
Microwave and RF Design IV: Modules (Steer)
Front Matter
1: Introduction to RF and Microwave Modules
2: Filters
3: Parallel Coupled-Line Filters
4: Noise, Distortion, and Dynamic Range
5: Passive Modules
6: Mixer and Source Modules
7: Cascade of Modules
Back Matter
2.5: The Chebyshev Lowpass Approximation
Last updated Oct 24, 2024
Save as PDF
2.4: The Maximally Flat (Butterworth) Lowpass Approximation
2.6: Element Extraction
Page ID 46100
( \newcommand{\kernel}{\mathrm{null}\,})
Table of contents
1. Chebyshev Filter Design
2. Chebyshev Approximation and Recursion
3. Bandwidth Consideration
The maximally flat approximation to the ideal lowpass filter response is best near the origin but not so good near the band edge. Chebyshev filters have better responses near the band edge, with lower insertion loss near the edges, but at the cost of ripples in the passband. Example reflection and transmission responses are shown in Figure 2.4.2 for a seventh-order and a sixth-order Chebyshev lowpass filter.
Chebyshev Filter Design
The general form of the Chebyshev transmission coefficient is
(2.5.1)|T(s)|2=1 1+ε 2|K(s)|2
where ε is the ripple factor and defines the passband ripple (PBR):
(2.5.2)PBR=1+ε 2,or in decibels R dB=PBR|dB=10log(1+ε 2)
The PBR can be seen in the transmission response, |T(s)|2, in Figure 2.4.2. In the passband the peaks of the lossless filter response have |T(s)|2=1 and the minimums of the ripple response all have |T(s)|2=1/(1+ε 2)=1/PBR. Consequently Chebyshev filters are also known as equirippleall-pole lowpass filters. Also note that the corner radian frequency, ω=1 for the lowpass filter prototype, has a transmission response (i.e., insertion loss IL) of |T(s)|2=1/(1+ε 2), whereas the Butterworth transmission response was at half power at the corner frequency. For the Chebyshev filter, the insertion loss at the corner frequency is the ripple:
(2.5.3)IL=1R dB=10log(1+ε 2)
For the n th-order Chebyshev (lowpass filter) approximation, the square of the characteristic function is
(2.5.4)|K n(ω)|2={cos 2[ncos−1(ω)]−1≤ω≤1 cosh 2[ncosh−1(|ω|)]ω≤−1,ω≥1
which can be expressed as a polynomial. For example, with n=3,
(2.5.5)K 3(ω)=4ω 3−3ω,for all ω
(This equivalence was derived by Pafnuty Chebyshev.) It is surprising that the trigonometric expression has such a simple polynomial equivalence. From Equation (2.2.11) the transmission coefficient is (for −1≤ω≤1)
(2.5.6)|T(ω)|2=1 1+ε 2cos 2[ncos−1(ω)]
and the reflection coefficient is
(2.5.7)|Γ 1(ω)|2=ε 2cos 2[ncos−1(ω)]1+ε 2cos 2[ncos−1(ω)]
Factorizing the denominator of either Equation (2.5.6) or Equation (2.5.7) yields the following roots (of the denominators of Γ 1(s) and T(s)):
s i=sin[(2i−1)π 2n]sinh1 nsinh−1(1 ε)+ȷcos[(2i−1)π 2n]cosh[1 nsinh−1(1 ε)]i=1,2,…,n
The roots of the numerator of Γ 1(s) in the s plane are
(2.5.9)s k=ȷcos(2k−1)π 2n k=1,2,…,n
Equations (2.5.8) and (2.5.9) can be used to obtain the reflection and transmission coefficients directly in the s domain.
Chebyshev Approximation and Recursion
The characteristic function of the Chebyshev approximation can be obtained from the recursion formula,
(2.5.10)K n(ω)=2ωK n−1(ω)−K n−2(ω)
| Response 1 dB down |
| Ripple | n=3 | n=5 | n=7 | n=9 |
| 0.01 dB | 1.564 | 1.192 | 1.097 | 1.058 |
| 0.1 dB | 1.202 | 1.071 | 1.036 | 1.022 |
| 0.2 dB | 1.127 | 1.045 | 1.023 | 1.014 |
| 1 dB | 1.000 | 1.000 | 1.000 | 1.000 |
| 3 dB | − | − | − | − |
| Response 3 dB down |
| Ripple | n=3 | n=5 | n=7 | n=9 |
| 0.01 dB | 1.877 | 1.291 | 1.145 | 1.087 |
| 0.1 dB | 1.389 | 1.134 | 1.068 | 1.041 |
| 0.2 dB | 1.284 | 1.099 | 1.050 | 1.030 |
| 1 dB | 1.095 | 1.0338 | 1.017 | 1.010 |
| 3 dB | 1.000 | 1.000 | 1.000 | 1.000 |
Table 2.5.1: Radian frequencies at which the transmission response of an n th Chebyshev filter is down 1 dB and 3 dB for a corner frequency ω 0=1 rad/s. (Note that ω 0 is the radian frequency at which the transmission response of a Chebyshev filter is down by the ripple, see Figure 2.4.2.)
with
(2.5.11)K 1(ω)=ω;K 2(ω)=2ω 2−1
For example, with n=3,
(2.5.12)K 3(ω)=2ωK 3−1(ω)−K 3−2(ω)(2.5.13)=2ω(2ω 2−1)−ω=4ω 3−2ω−ω=4ω 3−3ω
Bandwidth Consideration
At the corner frequency of the Chebyshev filter the transmission response is down by the amount of the ripple. This can be seen in Figure 2.4.2. However, the bandwidth of a filter is usually specified in terms of its 1 dB or 3 dB bandwidth at which the transmission response is down 1 dB or 3 dB, respectively, from its maximum response. The radian frequencies at which the responses of various orders of Chebyshev filters are 1 dB down and 3 dB down are given in Table 2.5.1. By frequency scaling the Chebyshev response, the filter can be designed for a specified 1 dB or 3 dB bandwidth.
2.5: The Chebyshev Lowpass Approximation is shared under a not declared license and was authored, remixed, and/or curated by LibreTexts.
Back to top
2.4: The Maximally Flat (Butterworth) Lowpass Approximation
2.6: Element Extraction
Was this article helpful?
Yes
No
Recommended articles
2.10: Cascaded Line Realization of Filters
2.11: Butterworth and Chebyshev Bandpass Filters
2.12: Richards’s Transformation
2.13: Kuroda’s and Norton’s Network Identities
Article typeSection or PageAutonumber Section Headingstitle with space delimiters
Tags
This page has no tags.
© Copyright 2025 Engineering LibreTexts
Powered by CXone Expert ®
?
The LibreTexts libraries arePowered by NICE CXone Expertand are supported by the Department of Education Open Textbook Pilot Project, the UC Davis Office of the Provost, the UC Davis Library, the California State University Affordable Learning Solutions Program, and Merlot. We also acknowledge previous National Science Foundation support under grant numbers 1246120, 1525057, and 1413739. Privacy Policy. Terms & Conditions. Accessibility Statement.For more information contact us atinfo@libretexts.org.
Support Center
How can we help?
Contact Support Search the Insight Knowledge Base Check System Status×
contents readability resources tools
☰
2.4: The Maximally Flat (Butterworth) Lowpass Approximation
2.6: Element Extraction |
14152 | https://openstax.org/books/biology-ap-courses/pages/11-1-the-process-of-meiosis | Skip to ContentGo to accessibility pageKeyboard shortcuts menu
Biology for AP® Courses
11.1 The Process of Meiosis
Biology for AP® Courses11.1 The Process of Meiosis
Search for key terms or text.
Learning Objectives
In this section, you will explore the following questions:
How do chromosomes behave during meiosis?
What cellular events occur during meiosis?
What are the similarities and differences between meiosis and mitosis?
How can the process of meiosis generate genetic variation?
Connection for AP® Courses
As we explored the cell cycle and mitosis in a previous chapter, we learned that cells divide to grow, replace other cells, and reproduce asexually. Without mutation, or changes in the DNA, the daughter cells produced by mitosis receive a set of genetic instructions that is identical to that of the parent cell. Because changes in genes drive both the unity and diversity of life, organisms without genetic variation cannot evolve through natural selection. Evolution occurs only because organisms have developed ways to vary their genetic material. This occurs through mutations in DNA, recombination of genes during meiosis, and meiosis followed by fertilization in sexually reproducing organisms.
Sexual reproduction requires that diploid (2n) organisms produce haploid (1n) cells through meiosis and that these haploid cells fuse to form new, diploid offspring. The union of these two haploid cells, one from each parent, is fertilization. Although the processes of meiosis and mitosis share similarities, their end products are different. Recall that eukaryotic DNA is contained in chromosomes, and that chromosomes occur in homologous pairs (homologues). At fertilization, the male parent contributes one member of each homologous pair to the offspring, and the female parent contributes the other. With the exception of the sex chromosomes, homologous chromosomes contain the same genes, but these genes can have different variations, called alleles. (For example, you might have inherited an allele for brown eyes from your father and an allele for blue eyes from your mother.) As in mitosis, homologous chromosomes are duplicated during the S-stage (synthesis) of interphase. However, unlike mitosis, in which there is just one nuclear division, meiosis has two complete rounds of nuclear division—meiosis I and meiosis II. These result in four nuclei and (usually) four daughter cells, each with half the number of chromosomes as the parent cell (1n). The first division, meiosis I, separates homologous chromosomes, and the second division, meiosis II, separates chromatids. (Remember: during meiosis, DNA replicates ONCE but divides TWICE, whereas in mitosis, DNA replicates ONCE but divides only ONCE.).
Although mitosis and meiosis are similar in many ways, they have different outcomes. The main difference is in the type of cell produced: mitosis produces identical cells, allowing growth or repair of tissues; meiosis generates reproductive cells, or gametes. Gametes, often called sex cells, unite with other sex cells to produce new, unique organisms.
Genetic variation occurs during meiosis I, in which homologous chromosomes pair and exchange non-sister chromatid segments (crossover). Here the homologous chromosomes separate into different nuclei, causing a reduction in “ploidy.” During meiosis II—which is more similar to a mitotic division—the chromatids separate and segregate into four haploid sex cells. However, because of crossover, the resultant daughter cells do not contain identical genomes. As in mitosis, external factors and internal signals regulate the meiotic cell cycle. As we will explore in more detail in a later chapter, errors in meiosis can cause genetic disorders, such as Down syndrome.
Information presented and the examples highlighted in the section support concepts and learning objectives outlined in Big Idea 3 of the AP® Biology Curriculum Framework. The learning objectives listed in the Curriculum Framework provide a transparent foundation for the AP® Biology course, an inquiry-based laboratory experience, instructional activities, and AP® exam questions. A learning objective merges required content with one or more of the seven science practices.
| | |
--- |
| Big Idea 3 | Living systems store, retrieve, transmit and respond to information essential to life processes. |
| Enduring Understanding 3.A | Heritable information provides for continuity of life. |
| Essential Knowledge | 3.A.2 In eukaryotes, heritable information is passed to the next generation via processes that include the cell cycle and mitosis or meiosis plus fertilization. |
| Science Practice | 6.2 The student can construct explanations of phenomena based on evidence produced through scientific practices. |
| Learning Objective | 3.9 The student is able to construct an explanation, using visual representations or narratives, as to how DNA in chromosomes is transmitted to the next generation via mitosis, or meiosis followed by fertilization. |
| Essential Knowledge | 3.A.2 In eukaryotes, heritable information is passed to the next generation via processes that include the cell cycle and mitosis or meiosis plus fertilization. |
| Science Practice | 7.1 The student can connect phenomena and models across spatial and temporal scales. |
| Learning Objective | 3.10 The student is able to represent the connection between meiosis and increased genetic diversity necessary for evolution. |
The Science Practice Challenge Questions contain additional test questions for this section that will help you prepare for the AP exam. These questions address the following standards:[APLO 1.9][APLO 2.15][APLO 2.39][APLO 3.11][APLO 3.9]
Teacher Support
The process of meiosis can be confusing, especially if it is taught as just a series of steps. Initially, discuss the goal of the process. Explain that meiosis serves to produce reproductive cells with exactly half the number of chromosomes, and that once these haploid cells are fused during fertilization, a complete set of genetic instructions for a new individual is formed. Meiosis starts in a cell with chromosomes in pairs. Each chromosome has already been duplicated and the two sister strands are held together. Therefore, each pair consists of four chromatids. Because students have already learned about mitosis (the process whereby chromosomes are sorted and allocated to daughter cells), it might be helpful to teach meiosis as a special case of mitosis. The first division separates the pairs of chromosomes, reducing the number of duplicated chromosomes in the daughter cells by half. The second division separates the chromatids, creating daughter cells that each has one half of the total number of chromosomes of the original cell. An added benefit to an organism using meiosis is the increase in genetic variation that occurs during the process. Each individual born as a result of sexual reproduction truly has a unique assortment of genes.
You read that fertilization is the union of two sex cells from two individual organisms. If these two cells each contain one set of chromosomes, the resulting fertilized cell contains two sets of chromosomes. Haploid cells contain one set of chromosomes. Cells containing two sets of chromosomes are called diploid. The number of sets of chromosomes in a cell is called its ploidy level. If the reproductive cycle is to continue, a diploid cell must reduce the number of its chromosome sets before fertilization can occur again. Otherwise, the number of chromosome sets would double, and continue to double in every generation. So, in addition to fertilization, sexual reproduction includes a nuclear division that reduces the number of chromosome sets.
Most animals and plants are diploid, containing two sets of chromosomes. In an organism’s somatic cells, sometimes referred to as “body” cells (all cells of a multicellular organism except the reproductive cells), the nucleus contains two copies of each chromosome, called homologous chromosomes. Homologous chromosomes are matched pairs containing the same genes in identical locations along their length. Diploid organisms inherit one copy of each homologous chromosome from each parent; all together, they are considered a full set of chromosomes. Haploid cells, containing a single copy of each homologous chromosome, are found only within an organism’’s reproductive structures, such as the ovaries and testes. Haploid cells can be either gametes or spores. Male gametes are sperm and female gametes are eggs. All animals and most plants produce gametes. Spores are haploid cells that can produce a haploid organism or can fuse with another spore to form a diploid cell. Some plants and all fungi produce spores.
As you have learned, the nuclear division that forms haploid cells—meiosis—is closely related to mitosis. Mitosis is the part of a cell reproduction cycle that results in identical daughter nuclei that are also genetically identical to the original parent nucleus. In mitosis, both the parent and the daughter nuclei are at the same ploidy level—diploid for most plants and animals. Meiosis employs many of the same mechanisms as mitosis. However, the starting nucleus is always diploid and the nuclei that result at the end of a meiotic cell division are haploid. To achieve this reduction in chromosome number, meiosis consists of one round of chromosome duplication and two rounds of nuclear division. Because the events that occur during each of the division stages are analogous to the events of mitosis, the same stage names are assigned. However, because there are two rounds of division, the major process and the stages are designated with a “I” or a “II.” Thus, meiosis I is the first round of meiotic division and consists of prophase I, prometaphase I, and so on. Meiosis II, in which the second round of meiotic division takes place, includes prophase II, prometaphase II, and so on.
Teacher Support
Meiosis I has the same steps as mitosis, with the exception that the chromosome pairs, not the chromatids, are separated at anaphase I. Two other events occur during the first cell division to produce the genetic variation that results. In prophase I, when the pairs of chromosomes condense and tentatively join, parts of the arms and legs of the chromosomes can crossover, or exchange places, with corresponding parts on the other homologous chromosome. The resulting pair now has a configuration that was not present initially. The pairs line up in a double line during metaphase I, but the distribution of the pairs at the equator is random. Half of the original chromosomes came from one parent, half from the other. As the chromosomes line up and are pulled apart during anaphase I, each daughter cell will receive a chromosome mixture that was not present in the original germ cells. Figure 11.3 illustrates crossing over and Figure 11.4 illustrates the random distribution of pairs of chromosomes. Also use the Link to Learning: Meiosis: An Interactive Animation. Meiosis II finishes the process and closely resembles mitosis, except for the number of chromosomes present, as compared to somatic cells.
Teacher Support
Comparing meiosis and mitosis should be a review of the two processes, with a reinforcement of the similarities and differences.
Meiosis I
Meiosis is preceded by an interphase consisting of the G1, S, and G2 phases, which are nearly identical to the phases preceding mitosis. The G1 phase, which is also called the first gap phase, is the first phase of the interphase and is focused on cell growth. The S phase is the second phase of interphase, during which the DNA of the chromosomes is replicated. Finally, the G2 phase, also called the second gap phase, is the third and final phase of interphase; in this phase, the cell undergoes the final preparations for meiosis.
During DNA duplication in the S phase, each chromosome is replicated to produce two identical copies, called sister chromatids, that are held together at the centromere by cohesin proteins. Cohesin holds the chromatids together until anaphase II. The centrosomes, which are the structures that organize the microtubules of the meiotic spindle, also replicate. This prepares the cell to enter prophase I, the first meiotic phase.
Prophase I
Early in prophase I, before the chromosomes can be seen clearly microscopically, the homologous chromosomes are attached at their tips to the nuclear envelope by proteins. As the nuclear envelope begins to break down, the proteins associated with homologous chromosomes bring the pair close to each other. Recall that, in mitosis, homologous chromosomes do not pair together. In mitosis, homologous chromosomes line up end-to-end so that when they divide, each daughter cell receives a sister chromatid from both members of the homologous pair. The synaptonemal complex, a lattice of proteins between the homologous chromosomes, first forms at specific locations and then spreads to cover the entire length of the chromosomes. The tight pairing of the homologous chromosomes is called synapsis. In synapsis, the genes on the chromatids of the homologous chromosomes are aligned precisely with each other. The synaptonemal complex supports the exchange of chromosomal segments between non-sister homologous chromatids, a process called crossing over. Crossing over can be observed visually after the exchange as chiasmata (singular = chiasma) (Figure 11.2).
In species such as humans, even though the X and Y sex chromosomes are not homologous (most of their genes differ), they have a small region of homology that allows the X and Y chromosomes to pair up during prophase I. A partial synaptonemal complex develops only between the regions of homology.
Figure 11.2 Early in prophase I, homologous chromosomes come together to form a synapse. The chromosomes are bound tightly together and in perfect alignment by a protein lattice called a synaptonemal complex and by cohesin proteins at the centromere.
Located at intervals along the synaptonemal complex are large protein assemblies called recombination nodules. These assemblies mark the points of later chiasmata and mediate the multistep process of crossover—or genetic recombination—between the non-sister chromatids. Near the recombination nodule on each chromatid, the double-stranded DNA is cleaved, the cut ends are modified, and a new connection is made between the non-sister chromatids. As prophase I progresses, the synaptonemal complex begins to break down and the chromosomes begin to condense. When the synaptonemal complex is gone, the homologous chromosomes remain attached to each other at the centromere and at chiasmata. The chiasmata remain until anaphase I. The number of chiasmata varies according to the species and the length of the chromosome. There must be at least one chiasma per chromosome for proper separation of homologous chromosomes during meiosis I, but there may be as many as 25. Following crossover, the synaptonemal complex breaks down and the cohesin connection between homologous pairs is also removed. At the end of prophase I, the pairs are held together only at the chiasmata (Figure 11.3) and are called tetrads because the four sister chromatids of each pair of homologous chromosomes are now visible.
The crossover events are the first source of genetic variation in the nuclei produced by meiosis. A single crossover event between homologous non-sister chromatids leads to a reciprocal exchange of equivalent DNA between a maternal chromosome and a paternal chromosome. Now, when that sister chromatid is moved into a gamete cell it will carry some DNA from one parent of the individual and some DNA from the other parent. The sister recombinant chromatid has a combination of maternal and paternal genes that did not exist before the crossover. Multiple crossovers in an arm of the chromosome have the same effect, exchanging segments of DNA to create recombinant chromosomes.
Figure 11.3 Crossover occurs between non-sister chromatids of homologous chromosomes. The result is an exchange of genetic material between homologous chromosomes.
Prometaphase I
The key event in prometaphase I is the attachment of the spindle fiber microtubules to the kinetochore proteins at the centromeres. Kinetochore proteins are multiprotein complexes that bind the centromeres of a chromosome to the microtubules of the mitotic spindle. Microtubules grow from centrosomes placed at opposite poles of the cell. The microtubules move toward the middle of the cell and attach to one of the two fused homologous chromosomes. The microtubules attach at each chromosomes' kinetochores. With each member of the homologous pair attached to opposite poles of the cell, in the next phase, the microtubules can pull the homologous pair apart. A spindle fiber that has attached to a kinetochore is called a kinetochore microtubule. At the end of prometaphase I, each tetrad is attached to microtubules from both poles, with one homologous chromosome facing each pole. The homologous chromosomes are still held together at chiasmata. In addition, the nuclear membrane has broken down entirely.
Metaphase I
During metaphase I, the homologous chromosomes are arranged in the center of the cell with the kinetochores facing opposite poles. The homologous pairs orient themselves randomly at the equator. For example, if the two homologous members of chromosome 1 are labeled a and b, then the chromosomes could line up a-b, or b-a. This is important in determining the genes carried by a gamete, as each will only receive one of the two homologous chromosomes. Recall that homologous chromosomes are not identical. They contain slight differences in their genetic information, causing each gamete to have a unique genetic makeup.
This randomness is the physical basis for the creation of the second form of genetic variation in offspring. Consider that the homologous chromosomes of a sexually reproducing organism are originally inherited as two separate sets, one from each parent. Using humans as an example, one set of 23 chromosomes is present in the egg donated by the mother. The father provides the other set of 23 chromosomes in the sperm that fertilizes the egg. Every cell of the multicellular offspring has copies of the original two sets of homologous chromosomes. In prophase I of meiosis, the homologous chromosomes form the tetrads. In metaphase I, these pairs line up at the midway point between the two poles of the cell to form the metaphase plate. Because there is an equal chance that a microtubule fiber will encounter a maternally or paternally inherited chromosome, the arrangement of the tetrads at the metaphase plate is random. Any maternally inherited chromosome may face either pole. Any paternally inherited chromosome may also face either pole. The orientation of each tetrad is independent of the orientation of the other 22 tetrads.
This event—the random (or independent) assortment of homologous chromosomes at the metaphase plate—is the second mechanism that introduces variation into the gametes or spores. In each cell that undergoes meiosis, the arrangement of the tetrads is different. The number of variations is dependent on the number of chromosomes making up a set. There are two possibilities for orientation at the metaphase plate; the possible number of alignments therefore equals 2n, where n is the number of chromosomes per set. Humans have 23 chromosome pairs, which results in over eight million (223) possible genetically-distinct gametes. This number does not include the variability that was previously created in the sister chromatids by crossover. Given these two mechanisms, it is highly unlikely that any two haploid cells resulting from meiosis will have the same genetic composition (Figure 11.4).
To summarize the genetic consequences of meiosis I, the maternal and paternal genes are recombined by crossover events that occur between each homologous pair during prophase I. In addition, the random assortment of tetrads on the metaphase plate produces a unique combination of maternal and paternal chromosomes that will make their way into the gametes.
Figure 11.4 Random, independent assortment during metaphase I can be demonstrated by considering a cell with a set of two chromosomes (n = 2). In this case, there are two possible arrangements at the equatorial plane in metaphase I. The total possible number of different gametes is 2n, where n equals the number of chromosomes in a set. In this example, there are four possible genetic combinations for the gametes. With n = 23 in human cells, there are over 8 million possible combinations of paternal and maternal chromosomes.
Anaphase I
In anaphase I, the microtubules pull the linked chromosomes apart. The sister chromatids remain tightly bound together at the centromere. The chiasmata are broken in anaphase I as the microtubules attached to the fused kinetochores pull the homologous chromosomes apart (Figure 11.5).
Telophase I and Cytokinesis
In telophase, the separated chromosomes arrive at opposite poles. The remainder of the typical telophase events may or may not occur, depending on the species. In some organisms, the chromosomes decondense and nuclear envelopes form around the chromatids in telophase I. In other organisms, cytokinesis—the physical separation of the cytoplasmic components into two daughter cells—occurs without reformation of the nuclei. In nearly all species of animals and some fungi, cytokinesis separates the cell contents via a cleavage furrow (constriction of the actin ring that leads to cytoplasmic division). In plants, a cell plate is formed during cell cytokinesis by Golgi vesicles fusing at the metaphase plate. This cell plate will ultimately lead to the formation of cell walls that separate the two daughter cells.
Two haploid cells are the end result of the first meiotic division. The cells are haploid because at each pole, there is just one of each pair of the homologous chromosomes. Therefore, only one full set of the chromosomes is present. This is why the cells are considered haploid—there is only one chromosome set, even though each homolog still consists of two sister chromatids. Recall that sister chromatids are merely duplicates of one of the two homologous chromosomes (except for changes that occurred during crossing over). In meiosis II, these two sister chromatids will separate, creating four haploid daughter cells.
Link to Learning
Watch this video about meiosis to review the process.
Human males typically have XY chromosomes and females have XX chromosomes, but there are rare instances in which a male can inherit an XXY or an XYY, or a female can have three X chromosomes. Provide evidence identifying phases and processes of meiosis to explain how an error in meiosis can cause these aberrations.
Errors can arise only during the recombination process, which may result in deletions, duplications or translocations causing such abnormalities.
Errors occur when a pair of homologous chromosomes fails to separate during anaphase I or when sister chromatids fail to separate during anaphase II, producing daughter cells with unequal numbers of chromosomes.
Errors occur only during anaphase I of meiosis as chromosomes separate prematurely, triggering aberrations that result in unequal numbers of chromosomes in daughter cells.
Errors during meiosis introduce variations in the DNA sequence that cause changes throughout the phases of meiosis, the intensity of which depend specifically on the size of the variant.
Meiosis II
In some species, cells enter a brief interphase, or interkinesis, before entering meiosis II. Interkinesis lacks an S phase, so chromosomes are not duplicated. The two cells produced in meiosis I go through the events of meiosis II in synchrony. During meiosis II, the sister chromatids within the two daughter cells separate, forming four new haploid gametes. The mechanics of meiosis II is similar to mitosis, except that each dividing cell has only one set of homologous chromosomes. Therefore, each cell has half the number of sister chromatids to separate out as a diploid cell undergoing mitosis.
Prophase II
If the chromosomes decondensed in telophase I, they condense again. If nuclear envelopes were formed, they fragment into vesicles. The centrosomes that were duplicated during interkinesis move away from each other toward opposite poles, and new spindles are formed.
Prometaphase II
The nuclear envelopes are completely broken down, and the spindle is fully formed. Each sister chromatid forms an individual kinetochore that attaches to microtubules from opposite poles.
Metaphase II
The sister chromatids are maximally condensed and aligned at the equator of the cell.
Anaphase II
The sister chromatids are pulled apart by the kinetochore microtubules and move toward opposite poles. Non-kinetochore microtubules elongate the cell.
Figure 11.5 The process of chromosome alignment differs between meiosis I and meiosis II. In prometaphase I, microtubules attach to the fused kinetochores of homologous chromosomes, and the homologous chromosomes are arranged at the midpoint of the cell in metaphase I. In anaphase I, the homologous chromosomes are separated. In prometaphase II, microtubules attach to the kinetochores of sister chromatids, and the sister chromatids are arranged at the midpoint of the cells in metaphase II. In anaphase II, the sister chromatids are separated.
Telophase II and Cytokinesis
The chromosomes arrive at opposite poles and begin to decondense. Nuclear envelopes form around the chromosomes. Cytokinesis separates the two cells into four unique haploid cells. At this point, the newly formed nuclei are both haploid. The cells produced are genetically unique because of the random assortment of paternal and maternal homologs and because of the recombining of maternal and paternal segments of chromosomes (with their sets of genes) that occurs during crossover. The entire process of meiosis is outlined in Figure 11.6.
Figure 11.6 An animal cell with a diploid number of four (2n = 4) proceeds through the stages of meiosis to form four haploid daughter cells.
Comparing Meiosis and Mitosis
Mitosis and meiosis are both forms of division of the nucleus in eukaryotic cells. They share some similarities, but also exhibit distinct differences that lead to very different outcomes (Figure 11.7). Mitosis is a single nuclear division that results in two nuclei that are usually partitioned into two new cells. The nuclei resulting from a mitotic division are genetically identical to the original nucleus. They have the same number of sets of chromosomes, one set in the case of haploid cells and two sets in the case of diploid cells. In most plants and all animal species, it is typically diploid cells that undergo mitosis to form new diploid cells. In contrast, meiosis consists of two nuclear divisions resulting in four nuclei that are usually partitioned into four new cells. The nuclei resulting from meiosis are not genetically identical and they contain one chromosome set only. This is half the number of chromosome sets in the original cell, which is diploid.
The main differences between mitosis and meiosis occur in meiosis I, which is a very different nuclear division than mitosis. In meiosis I, the homologous chromosome pairs become associated with each other, are bound together with the synaptonemal complex, develop chiasmata and undergo crossover between sister chromatids, and line up along the metaphase plate in tetrads with kinetochore fibers from opposite spindle poles attached to each kinetochore of a homolog in a tetrad. All of these events occur only in meiosis I.
When the chiasmata resolve and the tetrad is broken up with the homologs moving to one pole or another, the ploidy level—the number of sets of chromosomes in each future nucleus—has been reduced from two to one. For this reason, meiosis I is referred to as a reduction division. There is no such reduction in ploidy level during mitosis.
Meiosis II is much more analogous to a mitotic division. In this case, the duplicated chromosomes (only one set of them) line up on the metaphase plate with divided kinetochores attached to kinetochore fibers from opposite poles. During anaphase II, as in mitotic anaphase, the kinetochores divide and one sister chromatid—now referred to as a chromosome—is pulled to one pole while the other sister chromatid is pulled to the other pole. If it were not for the fact that there had been crossover, the two products of each individual meiosis II division would be identical (like in mitosis). Instead, they are different because there has always been at least one crossover per chromosome. Meiosis II is not a reduction division because although there are fewer copies of the genome in the resulting cells, there is still one set of chromosomes, as there was at the end of meiosis I.
Figure 11.7 Meiosis and mitosis are both preceded by one round of DNA replication; however, meiosis includes two nuclear divisions. The four daughter cells resulting from meiosis are haploid and genetically distinct. The daughter cells resulting from mitosis are diploid and identical to the parent cell.
Evolution Connection
The Mystery of the Evolution of Meiosis
Some characteristics of organisms are so widespread and fundamental that it is sometimes difficult to remember that they evolved like other simpler traits. Meiosis is such an extraordinarily complex series of cellular events that biologists have had trouble hypothesizing and testing how it may have evolved. Although meiosis is inextricably entwined with sexual reproduction and its advantages and disadvantages, it is important to separate the questions of the evolution of meiosis and the evolution of sex, because early meiosis may have been advantageous for different reasons than it is now. Thinking outside the box and imagining what the early benefits from meiosis might have been is one approach to uncovering how it may have evolved.
Meiosis and mitosis share obvious cellular processes and it makes sense that meiosis evolved from mitosis. The difficulty lies in the clear differences between meiosis I and mitosis. Adam Wilkins and Robin Holliday1 summarized the unique events that needed to occur for the evolution of meiosis from mitosis. These steps are homologous chromosome pairing, crossover exchanges, sister chromatids remaining attached during anaphase, and suppression of DNA replication in interphase. They argue that the first step is the hardest and most important, and that understanding how it evolved would make the evolutionary process clearer. They suggest genetic experiments that might shed light on the evolution of synapsis.
There are other approaches to understanding the evolution of meiosis in progress. Different forms of meiosis exist in single-celled protists. Some appear to be simpler or more “primitive” forms of meiosis. Comparing the meiotic divisions of different protists may shed light on the evolution of meiosis. Marilee Ramesh and colleagues2 compared the genes involved in meiosis in protists to understand when and where meiosis might have evolved. Although research is still ongoing, recent scholarship into meiosis in protists suggests that some aspects of meiosis may have evolved later than others. This kind of genetic comparison can tell us what aspects of meiosis are the oldest and what cellular processes they may have borrowed from in earlier cells.
Which of the following events occurs in both mitosis and meiosis I?
Homologous chromosomes pair together.
Crossover occurs between chromosomes.
Chromosomes line up at the metaphase plate.
Sister chromatids remain attached during anaphase.
Link to Learning
Click through the steps of this interactive animation to compare the meiotic process of cell division to that of mitosis: How Cells Divide.
Single-celled organisms, like amoebas, reproduce by mitosis. Explain how the genetic makeup of these organisms differs from organisms that undergo meiosis.
Organisms reproducing through mitosis produce genetically different daughter cells whereas those producing through meiosis have genetically identical daughter cells.
Crossing over or mixing of chromosomes does not occur in meiosis whereas it is prevalent in mitosis.
Mitosis is a process of asexual reproduction in which the number of chromosomes are reduced by half producing two haploid cells whereas in meiosis two diploid cells are produced by cell division.
Organisms producing through mitosis create genetically identical offspring as only a single parent copies its entire genetic material to the offspring. In meiosis, two parents produces gametes and the offspring have only half the number of chromosomes of each parent and hence genetic variation is introduced.
Science Practice Connection for AP® Courses
Activity
Create a series of diagrams with annotations to compare and contrast the processes of mitosis and meiosis in an organism with a haploid number of six. Then, using specific examples, explain how meiosis followed by fertilization increases genetic variation in a family of organisms.
Teacher Support
This activity is an application of Learning Objectives 3.9 and science practice 6.2, Learning Objectives 3.10 and science practice 7.1, and Learning Objectives 3.28 and science practice 6.2 because students are creating a visual representation to show how DNA is transmitted to the next generation by mitosis and meiosis followed by fertilization and then are using the representation to explain how meiosis increases genetic variation.
Footnotes
1Adam S. Wilkins and Robin Holliday, “The Evolution of Meiosis from Mitosis,” Genetics 181 (2009): 3–12.
2Marilee A. Ramesh, Shehre-Banoo Malik and John M. Logsdon, Jr, “A Phylogenetic Inventory of Meiotic Genes: Evidence for Sex in Giardia and an Early Eukaryotic Origin of Meiosis,” Current Biology 15 (2005):185–91.
PreviousNext
Order a print copy
Citation/Attribution
This book may not be used in the training of large language models or otherwise be ingested into large language models or generative AI offerings without OpenStax's permission.
Want to cite, share, or modify this book? This book uses the Creative Commons Attribution License and you must attribute OpenStax.
Attribution information
If you are redistributing all or part of this book in a print format, then you must include on every physical page the following attribution:
Access for free at
If you are redistributing all or part of this book in a digital format, then you must include on every digital page view the following attribution:
Access for free at
Citation information
Use the information below to generate a citation. We recommend using a citation tool such as this one.
Authors: Julianne Zedalis, John Eggebrecht
Publisher/website: OpenStax
Book title: Biology for AP® Courses
Publication date: Mar 8, 2018
Location: Houston, Texas
Book URL:
Section URL:
© Jul 7, 2025 OpenStax. Textbook content produced by OpenStax is licensed under a Creative Commons Attribution License . The OpenStax name, OpenStax logo, OpenStax book covers, OpenStax CNX name, and OpenStax CNX logo are not subject to the Creative Commons license and may not be reproduced without the prior and express written consent of Rice University. |
14153 | http://www.r-5.org/files/books/computers/hw-layers/hardware/digital-desigh/Charles_H_Roth_Larry_L_Kinney-Fundamentals_of_Logic_Design-EN.pdf | Fundamentals of Logic Design S E V E N T H E D I T I O N Charles H. Roth, Jr.
University of Texas at Austin Larry L. Kinney University of Minnesota, Twin Cities $XVWUDOLDä%UD]LOä-DSDQä.RUHDä0H[LFRä6LQJDSRUHä6SDLQä8QLWHG.LQJGRPä8QLWHG6WDWHV Fundamentals of Logic Design, Seventh Edition Charles H. Roth, Jr. and Larry L. Kinney 3XEOLVKHUOREDO(QJLQHHULQJ 7LP$QGHUVRQ 6HQLRU'HYHORSPHQWDO(GLWRU +LOGDRZDQV (GLWRULDO$VVLVWDQW 7DQ\D$OWLHUL 6HQLRU0DUNHWLQJ0DQDJHU .DWH,DQQRWWL 0HGLD(GLWRU &KULV9DOHQWLQH &RQWHQW3URMHFW0DQDJHU -HQQLIHU=LHJOHU 3URGXFWLRQ6HUYLFH 53.(GLWRULDO6HUYLFHV &RS\HGLWRU 3DWULFLD'DO\ 3URRIUHDGHU 0DUWKD0F0DVWHU ,QGH[HU 6KHOOHUJHU.QHFKWO &RPSRVLWRU GLDFUL7HFK 6HQLRU$UW'LUHFWRU 0LFKHOOH.XQNOHU ,QWHUQDO'HVLJQHU &DUPHOD3HULHUD &RYHU'HVLJQHU 5RVH$OFRUQ &RYHU,PDJH k.XGU\DVKND6KXWWHUVWRFNFRP kWRYRYDQ6KXWWHUVWRFNFRP 5LJKWV$FTXLVLWLRQV6SHFLDOLVW $PEHU+RVHD 7H[WDQG,PDJH3HUPLVVLRQV5HVHDUFKHU .ULVWLLQD3DXO 6HQLRU0DQXIDFWXULQJ3ODQQHU 'RXJ:LONH k20142010DQG2004&HQJDJH/HDUQLQJ $//5,+765(6(59('1RSDUWRIWKLVZRUNFRYHUHGE\WKH FRS\ULJKWKHUHLQPD\EHUHSURGXFHGWUDQVPLWWHGVWRUHGRUXVHG LQDQ\IRUPRUE\DQ\PHDQVJUDSKLFHOHFWURQLFRUPHFKDQLFDO LQFOXGLQJEXWQRWOLPLWHGWRSKRWRFRS\LQJUHFRUGLQJVFDQQLQJ GLJLWL]LQJWDSLQJZHEGLVWULEXWLRQLQIRUPDWLRQQHWZRUNVRU LQIRUPDWLRQVWRUDJHDQGUHWULHYDOV\VWHPVH[FHSWDVSHUPLWWHGXQGHU 6HFWLRQ107RU108RIWKH19768QLWHG6WDWHV&RS\ULJKW$FWZLWKRXW WKHSULRUZULWWHQSHUPLVVLRQRIWKHSXEOLVKHU )RUSURGXFWLQIRUPDWLRQDQGWHFKQRORJ\DVVLVWDQFHFRQWDFWXVDW Cengage Learning Customer & Sales Support, 1-800-354-9706 )RUSHUPLVVLRQWRXVHPDWHULDOIURPWKLVWH[WRUSURGXFWVXEPLWDOO UHTXHVWVRQOLQHDWwww.cengage.com/permissions )XUWKHUSHUPLVVLRQVTXHVWLRQVFDQEHHPDLOHGWR permissionrequest@cengage.com /LEUDU\RI&RQJUHVV&RQWURO1XPEHU 2012952056 ,6%113 978-1-133-62847-7 ,6%110 1133628478 Cengage Learning 200)LUVW6WDPIRUG3ODFH6XLWH400 6WDPIRUG&706902 86$ &HQJDJH/HDUQLQJLVDOHDGLQJSURYLGHURIFXVWRPL]HGOHDUQLQJ VROXWLRQVZLWKRėFHORFDWLRQVDURXQGWKHJOREHLQFOXGLQJ6LQJDSRUH WKH8QLWHG.LQJGRP$XVWUDOLD0H[LFR%UD]LODQG-DSDQ/RFDWH\RXU ORFDORėFHDW international.cengage.com/region &HQJDJH/HDUQLQJSURGXFWVDUHUHSUHVHQWHGLQ&DQDGDE\ 1HOVRQ(GXFDWLRQ/WG )RU\RXUFRXUVHDQGOHDUQLQJVROXWLRQVYLVLW www.cengage.com/engineering 3XUFKDVHDQ\RIRXUSURGXFWVDW\RXUORFDOFROOHJHVWRUHRUDWRXU SUHIHUUHGRQOLQHVWRUHwww.cengagebrain.com ([FHSWZKHUHRWKHUZLVHQRWHGDOOFRQWHQWLVk&HQJDJH/HDUQLQJ2014 Printed in the United States of America 1 2 3 4 5 6 7 16 15 14 13 Dedication Dedicated to the memory of Karen Kinney and our daughters, Laurie and Kristina. —Larry Kinney Brief Contents 1 Introduction Number Systems and Conversion 1 2 Boolean Algebra 29 3 Boolean Algebra (Continued) 60 4 Applications of Boolean Algebra Minterm and Maxterm Expansions 87 5 Karnaugh Maps 123 6 Quine-McCluskey Method 167 7 Multi-Level Gate Circuits NAND and NOR Gates 193 8 Combinational Circuit Design and Simulation Using Gates 225 9 Multiplexers, Decoders, and Programmable Logic Devices 252 viii Brief Contents 10 Introduction to VHDL 294 11 Latches and Flip-Flops 331 12 Registers and Counters 370 13 Analysis of Clocked Sequential Circuits 412 14 Derivation of State Graphs and Tables 453 15 Reduction of State Tables State Assignment 497 16 Sequential Circuit Design 545 17 VHDL for Sequential Logic 585 18 Circuits for Arithmetic Operations 626 19 State Machine Design with SM Charts 660 20 VHDL for Digital System Design 684 Appendices 713 ix Contents Preface xvii How to Use This Book for Self-Study xxii About the Authors xxiii Unit 1 Introduction Number Systems and Conversion 1 Objectives 1 Study Guide 2 1.1 Digital Systems and Switching Circuits 6 1.2 Number Systems and Conversion 8 1.3 Binary Arithmetic 12 1.4 Representation of Negative Numbers 16 Sign and Magnitude Numbers 16 2’s Complement Numbers 16 Addition of 2’s Complement Numbers 17 1’s Complement Numbers 19 Addition of 1’s Complement Numbers 19 1.5 Binary Codes 21 Problems 24 Unit 2 Boolean Algebra 29 Objectives 29 Study Guide 30 2.1 Introduction 36 2.2 Basic Operations 37 2.3 Boolean Expressions and Truth Tables 39 x Contents 2.4 Basic Theorems 41 2.5 Commutative, Associative, Distributive, and DeMorgan’s Laws 43 2.6 Simplification Theorems 46 2.7 Multiplying Out and Factoring 49 2.8 Complementing Boolean Expressions 52 Problems 53 Unit 3 Boolean Algebra (Continued) 60 Objectives 60 Study Guide 61 3.1 Multiplying Out and Factoring Expressions 66 3.2 Exclusive-OR and Equivalence Operations 68 3.3 The Consensus Theorem 70 3.4 Algebraic Simplification of Switching Expressions 72 3.5 Proving Validity of an Equation 74 Programmed Exercises 77 Problems 82 Unit 4 Applications of Boolean Algebra Minterm and Maxterm Expansions 87 Objectives 87 Study Guide 88 4.1 Conversion of English Sentences to Boolean Equations 94 4.2 Combinational Logic Design Using a Truth Table 96 4.3 Minterm and Maxterm Expansions 97 4.4 General Minterm and Maxterm Expansions 100 4.5 Incompletely Specified Functions 103 4.6 Examples of Truth Table Construction 104 4.7 Design of Binary Adders and Subtracters 108 Problems 114 Unit 5 Karnaugh Maps 123 Objectives 123 Study Guide 124 5.1 Minimum Forms of Switching Functions 134 5.2 Two- and Three-Variable Karnaugh Maps 136 Contents xi 5.3 Four-Variable Karnaugh Maps 141 5.4 Determination of Minimum Expressions Using Essential Prime Implicants 144 5.5 Five-Variable Karnaugh Maps 149 5.6 Other Uses of Karnaugh Maps 152 5.7 Other Forms of Karnaugh Maps 153 Programmed Exercises 154 Problems 159 Unit 6 Quine-McCluskey Method 167 Objectives 167 Study Guide 168 6.1 Determination of Prime Implicants 173 6.2 The Prime Implicant Chart 176 6.3 Petrick’s Method 179 6.4 Simplification of Incompletely Specified Functions 181 6.5 Simplification Using Map-Entered Variables 182 6.6 Conclusion 184 Programmed Exercise 185 Problems 189 Unit 7 Multi-Level Gate Circuits NAND and NOR Gates 193 Objectives 193 Study Guide 194 7 .1 Multi-Level Gate Circuits 199 7 .2 NAND and NOR Gates 204 7 .3 Design of Two-Level NAND- and NOR-Gate Circuits 206 7 .4 Design of Multi-Level NAND- and NOR-Gate Circuits 209 7 .5 Circuit Conversion Using Alternative Gate Symbols 210 7 .6 Design of Two-Level, Multiple-Output Circuits 214 Determination of Essential Prime Implicants for Multiple-Output Realization 216 7 .7 Multiple-Output NAND- and NOR-Gate Circuits 217 Problems 218 xii Contents Unit 8 Combinational Circuit Design and Simulation Using Gates 225 Objectives 225 Study Guide 226 8.1 Review of Combinational Circuit Design 229 8.2 Design of Circuits with Limited Gate Fan-In 230 8.3 Gate Delays and Timing Diagrams 232 8.4 Hazards in Combinational Logic 234 8.5 Simulation and Testing of Logic Circuits 240 Problems 243 Design Problems 246 Seven-Segment Indicator 246 Unit 9 Multiplexers, Decoders, and Programmable Logic Devices 252 Objectives 252 Study Guide 253 9.1 Introduction 260 9.2 Multiplexers 261 9.3 Three-State Buffers 265 9.4 Decoders and Encoders 268 9.5 Read-Only Memories 271 9.6 Programmable Logic Devices 275 Programmable Logic Arrays 275 Programmable Array Logic 278 9.7 Complex Programmable Logic Devices 280 9.8 Field-Programmable Gate Arrays 282 Decomposition of Switching Functions 283 Problems 286 Unit 10 Introduction to VHDL 294 Objectives 294 Study Guide 295 10.1 VHDL Description of Combinational Circuits 299 10.2 VHDL Models for Multiplexers 304 10.3 VHDL Modules 306 Four-Bit Full Adder 308 Contents xiii 10.4 Signals and Constants 311 10.5 Arrays 312 10.6 VHDL Operators 315 10.7 Packages and Libraries 316 10.8 IEEE Standard Logic 318 10.9 Compilation and Simulation of VHDL Code 321 Problems 322 Design Problems 327 Unit 11 Latches and Flip-Flops 331 Objectives 331 Study Guide 332 11.1 Introduction 336 11.2 Set-Reset Latch 338 11.3 Gated Latches 342 11.4 Edge-Triggered D Flip-Flop 346 11.5 S-R Flip-Flop 349 11.6 J-K Flip-Flop 350 11.7 T Flip-Flop 351 11.8 Flip-Flops with Additional Inputs 352 11.9 Asynchronous Sequential Circuits 354 11.10 Summary 357 Problems 358 Programmed Exercise 367 Unit 12 Registers and Counters 370 Objectives 370 Study Guide 371 12.1 Registers and Register Transfers 376 Parallel Adder with Accumulator 378 12.2 Shift Registers 380 12.3 Design of Binary Counters 384 12.4 Counters for Other Sequences 389 Counter Design Using D Flip-Flops 393 12.5 Counter Design Using S-R and J-K Flip-Flops 395 12.6 Derivation of Flip-Flop Input Equations—Summary 398 Problems 402 xiv Contents Unit 13 Analysis of Clocked Sequential Circuits 412 Objectives 412 Study Guide 413 13.1 A Sequential Parity Checker 419 13.2 Analysis by Signal Tracing and Timing Charts 421 13.3 State Tables and Graphs 425 Construction and Interpretation of Timing Charts 430 13.4 General Models for Sequential Circuits 432 Programmed Exercise 436 Problems 441 Unit 14 Derivation of State Graphs and Tables 453 Objectives 453 Study Guide 454 14.1 Design of a Sequence Detector 457 14.2 More Complex Design Problems 463 14.3 Guidelines for Construction of State Graphs 467 14.4 Serial Data Code Conversion 473 14.5 Alphanumeric State Graph Notation 476 14.6 Incompletely Specified State Tables 478 Programmed Exercises 480 Problems 486 Unit 15 Reduction of State Tables State Assignment 497 Objectives 497 Study Guide 498 15.1 Elimination of Redundant States 505 15.2 Equivalent States 507 15.3 Determination of State Equivalence Using an Implication Table 509 15.4 Equivalent Sequential Circuits 512 15.5 Reducing Incompletely Specified State Tables 514 15.6 Derivation of Flip-Flop Input Equations 517 15.7 Equivalent State Assignments 519 15.8 Guidelines for State Assignment 523 15.9 Using a One-Hot State Assignment 528 Problems 531 Contents xv Unit 16 Sequential Circuit Design 545 Objectives 545 Study Guide 546 16.1 Summary of Design Procedure for Sequential Circuits 548 16.2 Design Example—Code Converter 549 16.3 Design of Iterative Circuits 553 Design of a Comparator 553 16.4 Design of Sequential Circuits Using ROMs and PLAs 556 16.5 Sequential Circuit Design Using CPLDs 559 16.6 Sequential Circuit Design Using FPGAs 563 16.7 Simulation and Testing of Sequential Circuits 565 16.8 Overview of Computer-Aided Design 570 Design Problems 572 Additional Problems 578 Unit 17 VHDL for Sequential Logic 585 Objectives 585 Study Guide 586 17 .1 Modeling Flip-Flops Using VHDL Processes 590 17 .2 Modeling Registers and Counters Using VHDL Processes 594 17 .3 Modeling Combinational Logic Using VHDL Processes 599 17 .4 Modeling a Sequential Machine 601 17 .5 Synthesis of VHDL Code 608 17 .6 More About Processes and Sequential Statements 611 Problems 613 Simulation Problems 624 Unit 18 Circuits for Arithmetic Operations 626 Objectives 626 Study Guide 627 18.1 Serial Adder with Accumulator 629 18.2 Design of a Binary Multiplier 633 18.3 Design of a Binary Divider 637 Programmed Exercises 644 Problems 648 xvi Contents Unit 19 State Machine Design with SM Charts 660 Objectives 660 Study Guide 661 19.1 State Machine Charts 662 19.2 Derivation of SM Charts 667 19.3 Realization of SM Charts 672 Problems 677 Unit 20 VHDL for Digital System Design 684 Objectives 684 Study Guide 685 20.1 VHDL Code for a Serial Adder 688 20.2 VHDL Code for a Binary Multiplier 690 20.3 VHDL Code for a Binary Divider 700 20.4 VHDL Code for a Dice Game Simulator 702 20.5 Concluding Remarks 705 Problems 706 Lab Design Problems 709 A Appendices 713 A MOS and CMOS Logic 713 B VHDL Language Summary 719 C Tips for Writing Synthesizable VHDL Code 724 D Proofs of Theorems 727 E Answers to Selected Study Guide Questions and Problems 729 References 785 Index 786 Description of the CD 792 xvii Preface Purpose of the Text This text is written for a first course in the logic design of digital systems. It is writ-ten on the premise that the student should understand and learn thoroughly certain fundamental concepts in a first course. Examples of such fundamental concepts are the use of Boolean algebra to describe the signals and interconnections in a logic circuit, use of systematic techniques for simplification of a logic circuit, interconnec-tion of simple components to perform a more complex logic function, analysis of a sequential logic circuit in terms of timing charts or state graphs, and use of a control circuit to control the sequence of events in a digital system.
The text attempts to achieve a balance between theory and application. For this reason, the text does not overemphasize the mathematics of switching theory; how-ever, it does present the theory that is necessary for understanding the fundamental concepts of logic design. After completing this text, the student should be prepared for a more advanced digital systems design course that stresses more intuitive con-cepts like the development of algorithms for digital processes, partitioning of digi-tal systems into subsystems, and implementation of digital systems using currently available hardware. Alternatively, the student should be prepared to go on to a more advanced course in switching theory that further develops the theoretical concepts that have been introduced here.
Contents of the Text After studying this text, students should be able to apply switching theory to the solution of logic design problems. They will learn both the basic theory of switch-ing circuits and how to apply it. After a brief introduction to number systems, they will study switching algebra, a special case of Boolean algebra, which is the basic mathematical tool needed to analyze and synthesize an important class of switching xviii Preface circuits. Starting from a problem statement, they will learn to design circuits of logic gates that have a specified relationship between signals at the input and output ter-minals. Then they will study the logical properties of flip-flops, which serve as mem-ory devices in sequential switching circuits. By combining flip-flops with circuits of logic gates, they will learn to design counters, adders, sequence detectors, and simi-lar circuits. They will also study the VHDL hardware description language and its application to the design of combinational logic, sequential logic, and simple digital systems.
As integrated circuit technology continues to improve to allow more components on a chip, digital systems continue to grow in complexity. Design of such complex systems is facilitated by the use of a hardware description language such as VHDL. This text introduces the use of VHDL in logic design and emphasizes the relation-ship between VHDL statements and the corresponding digital hardware. VHDL allows digital hardware to be described and simulated at a higher level before it is implemented with logic components. Computer programs for synthesis can convert a VHDL description of a digital system to a corresponding set of logic components and their interconnections. Even though use of such computer-aided design tools helps to automate the logic design process, we believe that it is important to under-stand the underlying logic components and their timing before writing VHDL code. By first implementing the digital logic manually, students can more fully appreciate the power and limitations of VHDL.
Although the technology used to implement digital systems has changed signifi-cantly since the first edition of this text was published, the fundamental principles of logic design have not. Truth tables and state tables still are used to specify the behav-ior of logic circuits, and Boolean algebra is still a basic mathematical tool for logic design. Even when programmable logic devices (PLDs) are used instead of indi-vidual gates and flip-flops, reduction of logic equations is still desirable in order to fit the equations into smaller PLDs. Making a good state assignment is still desirable, because without a good assignment, the logic equations may require larger PLDs.
Strengths of the Text Although many texts are available in the areas of switching theory and logic design, this text is designed so that it can be used in either a standard lecture course or in a self-paced course. In addition to the standard reading material and problems, study guides and other aids for self-study are included in the text. The content of the text is divided into 20 study units. These units form a logical sequence so that mastery of the material in one unit is generally a prerequisite to the study of succeeding units. Each unit consists of four parts. First, a list of objectives states precisely what you are expected to learn by studying the unit. Next, the study guide contains reading assignments and study questions. As you work through the unit, you should write out the answers to these study questions. The text material and problem set that follow Preface xix are similar to a conventional textbook. When you complete a unit, you should review the objectives and make sure that you have met them. Each of the units has undergone extensive class testing in a self-paced environment and has been revised based on student feedback.
The study units are divided into three main groups. The first 9 units treat Boolean algebra and the design of combinational logic circuits. Units 11 through 16, 18 and 19 are mainly concerned with the analysis and design of clocked sequential logic circuits, including circuits for arithmetic operations. Units 10, 17 , and 20 introduce the VHDL hardware description language and its application to logic design.
The text is suitable for both computer science and engineering students. Material relating to circuit aspects of logic gates is contained in Appendix A so that this mate-rial can conveniently be omitted by computer science students or other students with no background in electronic circuits. The text is organized so that Unit 6 on the Quine-McCluskey procedure may be omitted without loss of continuity. The three units on VHDL can be studied in the normal sequence, studied together after the other units, or omitted entirely.
Supplements and Resources This book comes with support materials for both the instructor and the student. The supplements are housed on the book’s companion website. To access the additional course materials, please visit www.cengagebrain.com. At the cengagebrain.com home page, search for the ISBN of your title (from the back cover of your book) using the search box at the top of the page. This will take you to the product page where these resources can be found.
Instructor Resources An instructor’s solution manual (ISM) is available that includes suggestions for using the text in a standard or self-paced course, quizzes on each of the units, and suggestions for laboratory equipment and procedures. The instructor’s manual also contains solutions to problems, to unit quizzes, and to lab exercises.
The ISM is available in both print and digital formats. The digital version is avail-able to registered instructors at the publisher’s website. This website also includes both a full set of PowerPoint slides containing all graphical images and tables in the text, and a set of Lecture Builder PowerPoint slides of all equations and example problems.
Student Resources Since the computer plays an important role in the logic design process, integration of computer usage into the first logic design course is very important. A computer-aided logic design program, called LogicAid, is included on the CD that accompanies this xx Preface text. LogicAid allows the student to easily derive simplified logic equations from minterms, truth tables, and state tables. This relieves the student of some of the more tedious computations and permits the solution of more complex design problems in a shorter time. LogicAid also provides tutorial help for Karnaugh maps and deriva-tion of state graphs.
Several of the units include simulation or laboratory exercises. These exercises provide an opportunity to design a logic circuit and then test its operation. The SimUaid logic simulator, also available on the book’s accompanying CD, may be used to verify the logic designs. The lab equipment required for testing either can be a breadboard with integrated circuit flip-flops and logic gates or a circuit board with a programmable logic device. If such equipment is not available, the lab exercises can be simulated with SimUaid or just assigned as design problems. This is especially important for Units 8, 16, and 20 because the comprehensive design problems in these units help to review and tie together the material in several of the preceding units.
The DirectVHDL software on the CD provides a quick way to check and simu-late VHDL descriptions of hardware. This software checks the syntax of the VHDL code as it is typed in so that most syntax errors can be corrected before the simula-tion phase.
Changes from Previous Editions The text has evolved considerably since the fifth edition. Programmable logic and the VHDL hardware description language were added, and an emphasis was placed on the role of simulation and computer-aided design of logic circuits. The discussion of VHDL, hazards, latches and one-hot state assignments was expanded. Numerous problems were added. Several additional changes have been made for the seventh edition. The discussion of number systems was reorganized so that one’s comple-ment number systems can be easily omitted. In the unit on Boolean algebra, the laws of switching algebra are first derived using switch networks and truth tables; these are used to define Boolean algebra and, then, further theorems of Boolean algebra are derived that are useful in simplifying switching algebra expressions. The discussion of adders is expanded to include carry-lookahead adders. Alterna-tive implementations of multiplexers are included and also a discussion of active high and active low signals. Other types of gated latches are discussed, and a brief introduction to asynchronous sequential circuits is included. There is more discus-sion of incompletely specified state tables and how they may occur, and reducing incompletely specified state tables is briefly discussed. Problems have been added throughout the book with an emphasis on more challenging problems than the typi-cal exercises. In addition, the logic design and simulation software that accompanies the text has been updated and improved.
Preface xxi Acknowledgments To be effective, a book designed for self-study cannot simply be written. It must be tested and revised many times to achieve its goals. We wish to express our appreciation to the many professors, proctors, and students who participated in this process. Special thanks go to Dr. David Brown, who helped teach the self-paced course, and who made many helpful suggestions for improving the fifth edition. Special thanks to graduate teaching assistant, Mark Story, who developed many new problems and solutions for the fifth edition and who offered many suggestions for improving the consistency and clarity of the presentation.
The authors especially thank the most recent reviewers of the text. Among others, they are Clark Guest, University of California, San Diego Jayantha Herath, St Cloud State University Nagarajan Kandasamy, Drexel University Avinash Karanth Kodi, Ohio University Jacob Savir, Newark College of Engineering Melissa C. Smith, Clemson University Larry M. Stephens, University of South Carolina Feedback from the readers, both critical and appreciative, is welcome. Please send your comments, concerns, and suggestions to globalengineering@cengage.com.
Charles H. Roth, Jr. Larry L. Kinney xxii If you wish to learn all of the material in this text to mastery level, the following study procedures are recommended for each unit: 1. Read the Objectives of the unit. These objectives provide a concise summary of what you should be able to do when you complete studying the unit.
2. Work through the Study Guide. After reading each section of the text, write out the answers to the corresponding study guide questions. In many cases, blank spaces are left in the study guide so that you can write your answers directly in this book. By doing this, you will have the answers conveniently available for later review. The study guide questions generally will help emphasize some of the important points in each section or will guide you to a better understanding of some of the more difficult points. If you cannot answer some of the study guide questions, this indicates that you need to study the corresponding section in the text more before proceeding. The answers to selected study guide ques-tions are given in the back of this book; answers to the remaining questions generally can be found within the text.
3. Several of the units (Units 3, 5, 6, 11, 13, 14, and 18) contain one or more pro-grammed exercises. Each programmed exercise will guide you step-by-step through the solution of one of the more difficult types of problems encountered in this text. When working through a programmed exercise, be sure to write down your answer for each part in the space provided before looking at the answer and continuing with the next part of the exercise.
4. Work the assigned Problems at the end of the unit. Check your answers against those at the end of the book and rework any problems that you missed.
5. Reread the Objectives of the unit to make sure that you can meet all of them. If in doubt, review the appropriate sections of the text.
6. If you are using this text in a self-paced course, you will need to pass a readi-ness test on each unit before proceeding with the next unit. The purpose of the readiness test is to make sure that you have mastered the objectives of one unit before moving on to the next unit. The questions on the test will relate directly to the objectives of the unit, so that if you have worked through the study guide and written out answers to all of the study guide questions and to the problems assigned in the study guide, you should have no difficulty passing the test.
How to Use This Book for Self-Study xxiii About the Authors Charles H. Roth, Jr. is Professor Emeritus of Electrical and Computer Engineering at the University of Texas at Austin. He has been on the UT faculty since 1961. He received his BSEE degree from the University of Minnesota, his MSEE and EE degrees from the Massachusetts Institute of Technology, and his PhD degree in EE from Stanford University. His teaching and research interests included logic design, digital systems design, switching theory, microprocessor systems, and computer-aided design. He developed a self-paced course in logic design which formed the basis of his textbook, Fundamentals of Logic Design. He is also the author of Digital Systems Design Using VHDL, two other textbooks, and several software packages. He is the author or co-author of more than 50 technical papers and reports. Six PhD students and 80 MS students have received their degrees under his supervision. He received several teaching awards including the 1974 General Dynamics Award for Outstanding Engineering Teaching.
Larry L. Kinney is Professor Emeritus in Electrical and Computer Engineering at the University of Minnesota Twin Cities. He received the BS, MS, and PhD in Electrical Engineering from the University of Iowa in 1964, 1965, and 1968, respec-tively, and joined the University of Minnesota in 1968. He has taught a wide variety of courses including logic design, microprocessor/microcomputer systems, com-puter design, switching theory, communication systems and error-correcting codes. His major areas of research interest are testing of digital systems, built-in self-test, computer design, microprocessor-based systems, and error-correcting codes.
1 Introduction Number Systems and Conversion U N I T 1 Objectives 1. Introduction The first part of this unit introduces the material to be studied later. In addition to getting an overview of the material in the first part of the course, you should be able to explain a. The difference between analog and digital systems and why digital systems are capable of greater accuracy b. The difference between combinational and sequential circuits c. Why two-valued signals and binary numbers are commonly used in digital systems 2. Number systems and conversion When you complete this unit, you should be able to solve the following types of problems: a. Given a positive integer, fraction, or mixed number in any base (2 through 16); convert to any other base. Justify the procedure used by using a power series expansion for the number.
b. Add, subtract, multiply, and divide positive binary numbers. Explain the addition and subtraction process in terms of carries and borrows.
c. Write negative binary numbers in sign and magnitude, 1’s complement, and 2’s complement forms. Add signed binary numbers using 1’s complement and 2’s complement arithmetic. Justify the methods used. State when an overflow occurs.
d. Represent a decimal number in binary-coded-decimal (BCD), 6-3-1-1 code, excess-3 code, etc. Given a set of weights, construct a weighted code.
2 Unit 1 Study Guide 1. Study Section 1.1, Digital Systems and Switching Circuits, and answer the follow-ing study questions: (a) What is the basic difference between analog and digital systems?
(b) Why are digital systems capable of greater accuracy than analog systems?
(c) Explain the difference between combinational and sequential switching circuits.
(d) What common characteristic do most switching devices used in digital systems have?
(e) Why are binary numbers used in digital systems?
2. Study Section 1.2, Number Systems and Conversion. Answer the following study questions as you go along: (a) Is the first remainder obtained in the division method for base conversion the most or least significant digit?
(b) Work through all of the examples in the text as you encounter them and make sure that you understand all of the steps.
(c) An easy method for conversion between binary and hexadecimal is illus-trated in Equation (1-1). Why should you start forming the groups of four bits at the binary point instead of the left end of the number?
(d) Why is it impossible to convert a decimal number to binary on a digit-by-digit basis as can be done for hexadecimal?
Number Systems and Conversion 3 (e) Complete the following conversion table.
Binary (base 2) Octal (base 8) Decimal (base 10) Hexadecimal (base 16) 0 0 0 0 1 10 11 100 101 110 111 1000 1001 1010 1011 1100 1101 1110 1111 10000 20 16 10 (f ) Work Problems 1.1, 1.2, 1.3, and 1.4.
3. Study Section 1.3, Binary Arithmetic.
(a) Make sure that you can follow all of the examples, especially the propaga-tion of borrows in the subtraction process.
(b) To make sure that you understand the borrowing process, work out a detailed analysis in terms of powers of 2 for the following example: 1100 −101 111 4. Work Problems 1.5, 1.6, and 1.17(a).
5. Study Section 1.4, Representation of Negative Numbers.
(a) In digital systems, why are 1’s complement and 2’s complement commonly used to represent negative numbers instead of sign and magnitude?
4 Unit 1 (b) State two different ways of forming the 1’s complement of an n-bit binary number.
(c) State three different ways of forming the 2’s complement of an n-bit binary number.
(d) If the word length is n = 4 bits (including sign), what decimal number does 10002 represent in sign and magnitude?
In 2’s complement?
In 1’s complement?
(e) Given a negative number represented in 2’s complement, how do you find its magnitude?
Given a negative number represented in 1’s complement, how do you find its magnitude?
(f ) If the word length is 6 bits (including sign), what decimal number does 1000002 represent in sign and magnitude?
In 2’s complement?
In 1’s complement?
(g) What is meant by an overflow? How can you tell that an overflow has occurred when performing 1’s or 2’s complement addition?
Does a carry out of the last bit position indicate that an overflow has occurred?
Number Systems and Conversion 5 (h) Work out some examples of 1’s and 2’s complement addition for various combinations of positive and negative numbers.
(i) What is the justification for using the end-around carry in 1’s complement addition?
(j) The one thing that causes the most trouble with 2’s complement numbers is the special case of the negative number which consists of a 1 followed by all 0’s (1000 . . . 000). If this number is n bits long, what number does it represent and why? (It is not negative zero.) (k) Work Problems 1.7 and 1.8.
6. Study Section 1.5, Binary Codes.
(a) Represent 187 in BCD code, excess-3 code, 6-3-1-1 code, and 2-out-of-5 code.
(b) Verify that the 6-3-1-1 code is a weighted code. Note that for some decimal digits, two different code combinations could have been used. For example, either 0101 or 0110 could represent 4. In each case the combination with the smaller binary value has been used.
(c) How is the excess-3 code obtained?
(d) How are the ASCII codes for the decimal digits obtained? What is the rela-tion between the ASCII codes for the capital letters and lowercase letters?
(e) Work Problem 1.9.
7. If you are taking this course on a self-paced basis, you will need to pass a readi-ness test on this unit before going on to the next unit. The purpose of the readi-ness test is to determine if you have mastered the material in this unit and are ready to go on to the next unit. Before you take the readiness test: (a) Check your answers to the problems against those provided at the end of this book. If you missed any of the problems, make sure that you under-stand why your answer is wrong and correct your solution.
(b) Make sure that you can meet all of the objectives listed at the beginning of this unit.
6 1.1 Digital Systems and Switching Circuits Digital systems are used extensively in computation and data processing, control systems, communications, and measurement. Because digital systems are capable of greater accuracy and reliability than analog systems, many tasks formerly done by analog systems are now being performed digitally.
In a digital system, the physical quantities or signals can assume only discrete values, while in analog systems the physical quantities or signals may vary continu-ously over a specified range. For example, the output voltage of a digital system might be constrained to take on only two values such as 0 volts and 5 volts, while the output voltage from an analog system might be allowed to assume any value in the range −10 volts to +10 volts.
Because digital systems work with discrete quantities, in many cases they can be designed so that for a given input, the output is exactly correct. For example, if we multiply two 5-digit numbers using a digital multiplier, the 10-digit product will be correct in all 10 digits. On the other hand, the output of an analog multiplier might have an error ranging from a fraction of one percent to a few percent depending on the accuracy of the components used in construction of the multiplier. Furthermore, if we need a product which is correct to 20 digits rather than 10, we can redesign the digital multiplier to process more digits and add more digits to its input. A similar improvement in the accuracy of an analog multiplier would not be possible because of limitations on the accuracy of the components.
The design of digital systems may be divided roughly into three parts—system design, logic design, and circuit design. System design involves breaking the overall system into subsystems and specifying the characteristics of each subsystem. For example, the system design of a digital computer could involve specifying the num-ber and type of memory units, arithmetic units, and input-output devices as well as the interconnection and control of these subsystems. Logic design involves deter-mining how to interconnect basic logic building blocks to perform a specific func-tion. An example of logic design is determining the interconnection of logic gates and flip-flops required to perform binary addition. Circuit design involves specifying the interconnection of specific components such as resistors, diodes, and transistors Introduction Number Systems and Conversion Number Systems and Conversion 7 to form a gate, flip-flop, or other logic building block. Most contemporary circuit design is done in integrated circuit form using appropriate computer-aided design tools to lay out and interconnect the components on a chip of silicon. This book is largely devoted to a study of logic design and the theory necessary for understand-ing the logic design process. Some aspects of system design are treated in Units 18 and 20. Circuit design of logic gates is discussed briefly in Appendix A.
Many of a digital system’s subsystems take the form of a switching circuit (Figure 1-1). A switching circuit has one or more inputs and one or more outputs which take on discrete values. In this text, we will study two types of switching circuits—combinational and sequential. In a combinational circuit, the output values depend only on the present value of the inputs and not on past values. In a sequential circuit, the outputs depend on both the present and past input values. In other words, in order to determine the output of a sequential circuit, a sequence of input values must be specified. The sequential circuit is said to have memory because it must “remember” something about the past sequence of inputs, while a combinational cir-cuit has no memory. In general, a sequential circuit is composed of a combinational circuit with added memory elements. Combinational circuits are easier to design than sequential circuits and will be studied first.
FIGURE 1-1 Switching Circuit © Cengage Learning 2014 Switching Circuit Inputs Outputs ...
Z1 Z2 ...
Zn X1 X2 Xm The basic building blocks used to construct combinational circuits are logic gates. The logic designer must determine how to interconnect these gates in order to convert the circuit input signals into the desired output signals. The relationship between these input and output signals can be described mathematically using Boolean algebra. Units 2 and 3 of this text introduce the basic laws and theorems of Boolean algebra and show how they can be used to describe the behavior of circuits of logic gates.
Starting from a given problem statement, the first step in designing a combina-tional logic circuit is to derive a table or the algebraic logic equations which describe the circuit outputs as a function of the circuit inputs (Unit 4). In order to design an economical circuit to realize these output functions, the logic equations which describe the circuit outputs generally must be simplified. Algebraic methods for this simplification are described in Unit 3, and other simplification methods (Karnaugh map and Quine-McCluskey procedure) are introduced in Units 5 and 6. Implemen-tation of the simplified logic equations using several types of gates is described in Unit 7 , and alternative design procedures using programmable logic devices are developed in Unit 9.
The basic memory elements used in the design of sequential circuits are called flip-flops (Unit 11). These flip-flops can be interconnected with gates to form coun-ters and registers (Unit 12). Analysis of more general sequential circuits using timing 8 Unit 1 diagrams, state tables, and graphs is presented in Unit 13. The first step in designing a sequential switching circuit is to construct a state table or graph which describes the relationship between the input and output sequences (Unit 14). Methods for going from a state table or graph to a circuit of gates and flip-flops are developed in Unit 15. Methods of implementing sequential circuits using programmable logic are discussed in Unit 16. In Unit 18, combinational and sequential design techniques are applied to the realization of systems for performing binary addition, multiplica-tion, and division. The sequential circuits designed in this text are called synchro-nous sequential circuits because they use a common timing signal, called a clock, to synchronize the operation of the memory elements.
Use of a hardware description language, VHDL, in the design of combinational logic, sequential logic, and digital systems is introduced in Units 10, 17 , and 20. VHDL is used to describe, simulate, and synthesize digital hardware. After writing VHDL code, the designer can use computer-aided design software to compile the hardware description and complete the design of the digital logic. This allows the completion of complex designs without having to manually work out detailed circuit descriptions in terms of gates and flip-flops.
The switching devices used in digital systems are generally two-state devices, that is, the output can assume only two different discrete values. Examples of switching devices are relays, diodes, and transistors. A relay can assume two states—closed or open—depending on whether power is applied to the coil or not. A diode can be in a conducting state or a nonconducting state. A transistor can be in a cut-off or satu-rated state with a corresponding high or low output voltage. Of course, transistors can also be operated as linear amplifiers with a continuous range of output voltages, but in digital applications greater reliability is obtained by operating them as two-state devices. Because the outputs of most switching devices assume only two differ-ent values, it is natural to use binary numbers internally in digital systems. For this reason binary numbers and number systems will be discussed first before proceeding to the design of switching circuits.
1.2 Number Systems and Conversion When we write decimal (base 10) numbers, we use a positional notation; each digit is multiplied by an appropriate power of 10 depending on its position in the number. For example, 953.7810 = 9 × 102 + 5 × 101 + 3 × 100 + 7 × 10−1 + 8 × 10−2 Similarly, for binary (base 2) numbers, each binary digit is multiplied by the appro-priate power of 2: 1011.112 = 1 × 23 + 0 × 22 + 1 × 21 + 1 × 20 + 1 × 2−1 + 1 × 2−2 = 8 + 0 + 2 + 1 + 1 2 + 1 4 = 113 4 = 11.7510 Number Systems and Conversion 9 Note that the binary point separates the positive and negative powers of 2 just as the decimal point separates the positive and negative powers of 10 for decimal numbers.
Any positive integer R (R > 1) can be chosen as the radix or base of a num-ber system. If the base is R, then R digits (0, 1, . . . , R − 1) are used. For example, if R = 8, then the required digits are 0, 1, 2, 3, 4, 5, 6, and 7. A number written in posi-tional notation can be expanded in a power series in R. For example, N = (a4 a3 a2 a1a0 . a−1a−2 a−3)R = a4 × R4 + a3 × R3 + a2 × R2 + a1 × R1 + a0 × R0 + a−1 × R−1 + a−2 × R−2 + a−3 × R−3 where ai is the coefficient of Ri and 0 ≤ai ≤R −1. If the arithmetic indicated in the power series expansion is done in base 10, then the result is the decimal equivalent of N. For example, 147.38 = 1 × 82 + 4 × 81 + 7 × 80 + 3 × 8−1 = 64 + 32 + 7 + 3 8 = 103.37510 The power series expansion can be used to convert to any base. For example, converting 14710 to base 3 would be written as 14710 = 1 × (101)2 + (11) × (101)1 + (21) × (101)0 where all the numbers on the right-hand side are base 3 numbers. (Note: In base 3, 10 is 101, 7 is 21, etc.) To complete the conversion, base 3 arithmetic would be used. Of course, this is not very convenient if the arithmetic is being done by hand. Similarly, if 14710 is being converted to binary, the calculation would be 14710 = 1 × (1010)2 + (100) × (1010)1 + (111) × (1010)0 Again this is not convenient for hand calculation but it could be done easily in a computer where the arithmetic is done in binary. For hand calculation, use the power series expansion when converting from some base into base 10.
For bases greater than 10, more than 10 symbols are needed to represent the digits. In this case, letters are usually used to represent digits greater than 9. For example, in hexadecimal (base 16), A represents 1010, B represents 1110, C represents 1210, D represents 1310, E represents 1410, and F represents 1510. Thus, A2F16 = 10 × 162 + 2 × 161 + 15 × 160 = 2560 + 32 + 15 = 260710 Next, we will discuss conversion of a decimal integer to base R using the division method. The base R equivalent of a decimal integer N can be represented as N = (an an−1 · · · a2 a1 a0)R = an Rn + an−1Rn−1 + · · · + a2R2 + a1R1 + a0 10 Unit 1 If we divide N by R, the remainder is a0: N R = an Rn−1 + an−1Rn−2 + · · · + a2 R1 + a1 = Q1, remainder a0 Then we divide the quotient Q1 by R: Q1 R = an Rn−2 + an−1Rn−3 + · · · + a3 R1 + a2 = Q2, remainder a1 Next we divide Q2 by R: Q2 R = an Rn−3 + an−1Rn−4 + · · · + a3 = Q3, remainder a2 This process is continued until we finally obtain an. Note that the remainder obtained at each division step is one of the desired digits and the least significant digit is obtained first.
Convert 5310 to binary.
2 y53 2 y26 rem. = 1 = a0 2 y13 rem. = 0 = a1 2 y6 rem. = 1 = a2 5310 = 1101012 2 y3 rem. = 0 = a3 2 y1 rem. = 1 = a4 0 rem. = 1 = a5 Conversion of a decimal fraction to base R can be done using successive multipli-cations by R. A decimal fraction F can be represented as F = (.a−1 a−2 a−3 · · · a−m)R = a−1R−1 + a−2 R−2 + a−3 R−3 + · · · + a−m R−m Multiplying by R yields FR = a−1 + a−2 R−1 + a−3 R−2 + · · · + a−m R−m+1 = a−1 + F1 where F1 represents the fractional part of the result and a−1 is the integer part. Multiplying F1 by R yields F1R = a−2 + a−3 R−1 + · · · + a−m R−m+2 = a−2 + F2 Example Number Systems and Conversion 11 Next, we multiply F2 by R: F2R = a−3 + · · · + a−m R−m+3 = a−3 + F3 This process is continued until we have obtained a sufficient number of digits. Note that the integer part obtained at each step is one of the desired digits and the most significant digit is obtained first.
Convert 0.62510 to binary.
F = .625 F1 = .250 F2 = .500 × 2 × 2 × 2 .62510 = .1012 1.250 0.500 1.000 (a−1 = 1) (a−2 = 0) (a−3 = 1) This process does not always terminate, but if it does not terminate, the result is a repeating fraction.
Convert 0.710 to binary. .7 2 (1).4 2 (0).8 2 (1).6 2 (1).2 2 (0).4 ⟵process starts repeating here because 0.4 was previously 2 obtained (0).8 0.710 = 0.1 0110 0110 0110 . . . 2 Conversion between two bases other than decimal can be done directly by using the procedures given; however, the arithmetic operations would have to be carried out using a base other than 10. It is generally easier to convert to decimal first and then convert the decimal number to the new base.
Example Example 12 Unit 1 Convert 231.34 to base 7 .
231.34 = 2 × 16 + 3 × 4 + 1 + 3 4 = 45.7510 7 y45 .75 7 y 6 rem. 3 7 0 rem. 6 (5).25 45.7510 = 63.5151 . . . 7 7 (1).75 7 (5).25 7 (1).75 Conversion from binary to hexadecimal (and conversely) can be done by inspec-tion because each hexadecimal digit corresponds to exactly four binary digits (bits). Starting at the binary point, the bits are divided into groups of four, and each group is replaced by a hexadecimal digit: 1001101.0101112 = (' 0100 4 (' 1101 D . (' 0101 5 (' 1100 C = 4D.5C16 (1-1) As shown in Equation (1-1), extra 0’s are added at each end of the bit string as needed to fill out the groups of four bits.
1.3 Binary Arithmetic Arithmetic operations in digital systems are usually done in binary because design of logic circuits to perform binary arithmetic is much easier than for decimal. Binary arithmetic is carried out in much the same manner as decimal, except the addition and multiplication tables are much simpler.
The addition table for binary numbers is 0 + 0 = 0 0 + 1 = 1 1 + 0 = 1 1 + 1 = 0 and carry 1 to the next column Carrying 1 to a column is equivalent to adding 1 to that column.
Example Number Systems and Conversion 13 Add 1310 and 1110 in binary.
1 1 1 1 ⟵carries 1310 = 1101 1110 = 1011 11000 = 2410 The subtraction table for binary numbers is 0 −0 = 0 0 −1 = 1 and borrow 1 from the next column 1 −0 = 1 1 −1 = 0 Borrowing 1 from a column is equivalent to subtracting 1 from that column.
Example (a) 1←⏤ (indicates (b) 1 1 1 1←⏤ borrows (c) 1 1 1←⏤ borrows 11101 a borrrow 10000 111001 ‒ 10011 from the ‒ 11 ‒ 1011 1010 3rd column) 1101 101110 Note how the borrow propagates from column to column in the second example. In order to borrow 1 from the second column, we must in turn borrow 1 from the third column, etc. An alternative to binary subtraction is the use of 2’s complement arithmetic, as discussed in Section 1.4.
Binary subtraction sometimes causes confusion, perhaps because we are so used to doing decimal subtraction that we forget the significance of the borrowing pro-cess. Before doing a detailed analysis of binary subtraction, we will review the bor-rowing process for decimal subtraction.
If we number the columns (digits) of a decimal integer from right to left (start-ing with 0), and then we borrow 1 from column n, what we mean is that we subtract 1 from column n and add 10 to column n −1. Because 1 × 10n = 10 × 10n−1, the value of the decimal number is unchanged, but we can proceed with the subtraction. Consider, for example, the following decimal subtraction problem: column 2 column 1 205 − 18 187 ⏤⟶ ↙ Examples of Binary Subtraction 14 Unit 1 A detailed analysis of the borrowing process for this example, indicating first a bor-row of 1 from column 1 and then a borrow of 1 from column 2, is as follows: 205 −18 = [2 × 102 + 0 × 101 + 5 × 100] −[ 1 × 101 + 8 × 100] note borrow from column 1 = [2 × 102 + (0 −1) × 101 + (10 + 5) × 100] −[ 1 × 101 + 8 × 100] note borrow from column 2 = [(2 −1) × 102 + (10 + 0 −1) × 101 + 15 × 100] −[ 1 × 101 + 8 × 100] = [1 × 102 + 8 × 101 + 7 × 100] = 187 The analysis of borrowing for binary subtraction is exactly the same, except that we work with powers of 2 instead of powers of 10. Thus for a binary number, borrowing 1 from column n is equivalent to subtracting 1 from column n and adding 2 (102) to col-umn n −1. The value of the binary number is unchanged because 1 × 2n = 2 × 2n−1.
A detailed analysis of binary subtraction example (c) follows. Starting with the rightmost column, 1 − 1 = 0. To subtract in the second column, we must borrow from the third column. Rather than borrow immediately, we place a 1 over the third column to indicate that a borrow is necessary, and we will actually do the borrowing when we get to the third column. (This is similar to the way borrow signals might propagate in a computer.) Now because we have borrowed 1, the second column becomes 10, and 10 − 1 = 1. In order to borrow 1 from the third column, we must borrow 1 from the fourth column (indicated by placing a 1 over column 4). Column 3 then becomes 10, subtracting off the borrow yields 1, and 1 − 0 = 1. Now in column 4, we subtract off the borrow leaving 0. In order to complete the subtraction, we must borrow from column 5, which gives 10 in column 4, and 10 − 1 = 1.
The multiplication table for binary numbers is 0 × 0 = 0 0 × 1 = 0 1 × 0 = 0 1 × 1 = 1 The following example illustrates multiplication of 1310 by 1110 in binary: 1101 1011 1101 1101 0000 1101 10001111 = 14310 Number Systems and Conversion 15 Note that each partial product is either the multiplicand (1101) shifted over the appropriate number of places or is zero.
When adding up long columns of binary numbers, the sum of the bits in a single column can exceed 112, and therefore the carry to the next column can be greater than 1. For example, if a single column of bits contains five 1’s, then adding up the 1’s gives 1012, which means that the sum bit for that column is 1, and the carry to the next column is 102. When doing binary multiplication, a common way to avoid carries greater than 1 is to add in the partial products one at a time as illustrated by the following example: 1111 multiplicand 1101 multiplier 1111 first partial product 0000 second partial product (01111) sum of first two partial products 1111 third partial product (1001011) sum after adding third partial product 1111 fourth partial product 11000011 final product (sum after adding fourth partial product) The following example illustrates division of 14510 by 1110 in binary: 1101 1011 ∣ 1001001 1011 1110 1011 1101 The quotient is 1101 with a remainder 1011 of 10. 10 Binary division is similar to decimal division, except it is much easier because the only two possible quotient digits are 0 and 1. In the above example, if we start by comparing the divisor (1011) with the upper four bits of the dividend (1001), we find that we cannot subtract without a negative result, so we move the divisor one place to the right and try again. This time we can subtract 1011 from 10010 to give 111 as a result, so we put the first quotient bit of 1 above 10010. We then bring down the next dividend bit (0) to get 1110 and shift the divisor right. We then subtract 1011 from 1110 to get 11, so the second quotient bit is 1. When we bring down the next dividend bit, the result is 110, and we cannot subtract the shifted divisor, so the third quotient bit is 0. We then bring down the last dividend bit and subtract 1011 from 1101 to get a final remainder of 10, and the last quotient bit is 1.
16 Unit 1 1.4 Representation of Negative Numbers Up to this point we have been working with unsigned positive numbers. The most common methods for representing both positive and negative numbers are sign and magnitude, 2’s complement, and 1’s complement. In each of these methods, the leftmost bit of a number is 0 for positive numbers and 1 for negative numbers. As discussed below, if n bits are used to represent numbers, then the sign and magni-tude and 1’s complement methods represent numbers in the range −(2(n−1) −1) to +(2(n−1) −1) and both have two representations for 0, a positive 0 and a negative 0. In 2’s complement, numbers in the range −2(n−1) to +(2(n−1) −1) are represented and there is only a positive 0. If an operation, such as addition or subtraction, is per-formed on two numbers and the result is outside the range of representation, then we say that an overflow has occurred.
Sign and Magnitude Numbers In an n-bit sign and magnitude system, a number is represented by a sign bit, 0 for positive and 1 for negative, followed by n −1 bits that represent the magnitude of the number. With n −1 bits the magnitude can be 0 to 2(n−1) −1. With the sign bit, numbers in the range −(2(n−1) −1) to +(2(n−1) −1) are represented including a posi-tive and negative 0. This is illustrated in Table 1-1 for n = 4. For example, 0011 repre-sents +3 and 1011 represents −3. Note that 1000 represents minus 0.
Designing logic circuits to perform arithmetic on sign and magnitude binary numbers is awkward. One method is to convert the numbers into 2’s (or 1’s) comple-ment and, after performing the arithmetic operation, convert the result back to sign and magnitude.
2’s Complement Numbers In the 2’s complement number system, a positive number, N, is represented by a 0 followed by the magnitude of N as in the sign and magnitude system; however, Positive Integers (all systems) Negative Integers +N −N Sign and Magnitude 2’s Complement N 1’s Complement N +0 0000 −0 1000 —— 1111 +1 0001 −1 1001 1111 1110 +2 0010 −2 1010 1110 1101 +3 0011 −3 1011 1101 1100 +4 0100 −4 1100 1100 1011 +5 0101 −5 1101 1011 1010 +6 0110 −6 1110 1010 1001 +7 0111 −7 1111 1001 1000 −8 —— 1000 —— TABLE 1-1 Signed Binary Integers (word length: n = 4) © Cengage Learning 2014 Number Systems and Conversion 17 a negative number, −N, is represented by its 2’s complement, N. If the word length is n bits, the 2’s complement of a positive integer N is defined as N = 2n −N (1-2) (Note that in this equation all numbers N, 2n, and N are treated as unsigned posi-tive numbers; if they are expressed in binary, n + 1 bits are required to represent 2n.) Table 1-1 shows the result for n = 4. In Table 1-1, the 2’s complement representation of negative numbers −1 through −7 can be obtained by taking the 2’s complement of positive numbers 1 through 7 (i.e., by subtracting from 16). For example, the 2’s complement of 5 is 16 − 5 = 11 or, using binary numbers, (10000) − (0101) = (1011). After completing the subtractions, all combinations of 4-bits have been used to rep-resent the numbers −7 , . . . , −1, 0, 1, . . . 7; the only unused combination is 1000. Since the leftmost bit of 1000 is 1, it should be a negative number. To determine its magni-tude, note that the magnitude of a negative number can be obtained by taking its 2’s complement; that is, from Equation (1-2), N = 2n −N (1-3) Applying Equation (1-3) to 1000 produces (10000) − (1000) = (1000) or, in decimal, 16 − 8 = 8. Hence, 1000 represents −8. In general, in an n-bit 2’s complement system the number 1 followed by all 0’s represents −2(n−1).
Using Equation (1-2) directly on binary numbers requires subtraction of n + 1 bit numbers. This can be avoided by noting that Equation (1-2) can be written as N = (2n −1 −N) + 1 In binary, 2n −1 consists of n 1’s. Subtracting a number from all 1’s does not produce any borrows, and the subtraction can be done by replacing 0’s with 1’s and 1’s with 0’s (i.e., simply complement N bit-by-bit). For example, if n = 7 and N = 0101100, 2n −1 = 1111111 − 0101100 1010011 + 0000001 N = 1010100 N is obtained by complementing N bit-by-bit and then adding 1. An alternative way to form the 2’s complement of N is to start at the right and leave any 0’s on the right end and the first 1 unchanged, then complement all bits to the left of the first 1. In the preceding example, the 100 on the right end of N is unchanged while the 0101 on the left is complemented bit-by-bit.
Addition of 2’s Complement Numbers The addition of n-bit signed binary numbers is straightforward using the 2’s comple-ment system. The addition is carried out just as if all the numbers were positive, and any carry from the sign position is ignored. This will always yield the correct result 18 Unit 1 except when an overflow occurs. When the word length is n bits, we say that an over-flow has occurred if the correct representation of the sum (including sign) requires more than n bits. The different cases which can occur are illustrated below for n = 4.
1. Addition of two positive numbers, sum < 2n−1 +3 0011 +4 0100 +7 0111 (correct answer) 2. Addition of two positive numbers, sum ≥2n−1 +5 0101 +6 0110 1011 ⟵ wrong answer because of overflow (+11 requires 5 bits including sign) 3. Addition of positive and negative numbers (negative number has greater magnitude) −5 0101 −6 1010 −1 1111 (correct answer) 4. Same as case 3 except positive number has greater magnitude +5 1011 +6 0110 +1 (1)0001 ⟵ correct answer when the carry from the sign bit is ignored (this is not an overflow) 5. Addition of two negative numbers, 0 sum 0 ≤2n−1 −3 1101 −4 1100 −7 (1)1001 ⟵ correct answer when the last carry is ignored (this is not an overflow) 6. Addition of two negative numbers, 0 sum 0 > 2n−1 −5 1011 −6 1010 (1)0101 ⟵ wrong answer because of overflow (−11 requires 5 bits including sign) Note that an overflow condition (cases 2 and 6) is easy to detect because in case 2 the addition of two positive numbers yields a negative result, and in case 6 the addition of two negative numbers yields a positive answer (for four bits).
Number Systems and Conversion 19 The proof that throwing away the carry from the sign bit always gives the correct answer follows for cases 4 and 5: Case 4: −A + B (where B > A) A + B = (2n −A) + B = 2n + (B −A) > 2n Throwing away the last carry is equivalent to subtracting 2n, so the result is (B −A), which is correct.
Case 5: −A −B (where A + B ≤2n−1) A + B = (2n −A) + (2n −B) = 2n + 2n −(A + B) Discarding the last carry yields 2n −(A + B) = (A + B), which is the correct rep-resentation of −(A + B).
1’s Complement Numbers In the 1’s complement system a negative number, −N, is represented by the 1’s com-plement of N, N, defined as N = (2n −1) −N (1-4) As explained above, (2n −1) consists of all 1’s, and subtracting a bit from 1 is the same as complementing the bit. Hence, the 1’s complement of N can be obtained by complementing N bit-by-bit. Table 1-1 illustrates 1’s complement for n = 4. Note that the 1’s complement of 0000 is 1111, which represents minus zero. Note that 1’s complement has two representations of 0, as does sign and magnitude.
Addition of 1’s Complement Numbers The addition of 1’s complement numbers is similar to 2’s complement except that instead of discarding the last carry, it is added to the n-bit sum in the position fur-thest to the right. This is referred to as an end-around carry. The addition of posi-tive numbers is the same as illustrated for cases 1 and 2 under 2’s complement. The remaining cases are illustrated below (n = 4).
3. Addition of positive and negative numbers (negative number with greater magnitude) +5 0101 −6 1001 −1 1110 (correct answer) 4. Same as case 3 except positive number has greater magnitude −5 1010 +6 0110 (1) 0000 1 (end-around carry) 0001 (correct answer, no overflow) 20 Unit 1 5. Addition of two negative numbers, 0 sum 0 < 2n−1 −3 1100 −4 1011 (1) 0111 1 (end-around carry) 1000 (correct answer, no overflow) 6. Addition of two negative numbers, |sum| ≥2n−1 −5 1010 −6 1001 (1) 0111 1 (end-around carry) 0100 (wrong answer because of overflow) Again, note that the overflow in case 6 is easy to detect because the addition of two negative numbers yields a positive result.
The proof that the end-around carry method gives the correct result follows for cases 4 and 5: Case 4: −A + B (where B > A) A + B = (2n −1 −A) + B = 2n + (B −A) −1 The end-around carry is equivalent to subtracting 2n and adding 1, so the result is (B − A), which is correct.
Case 5: −A −B (A + B < 2n−1) A + B = (2n −1 −A) + (2n −1 −B) = 2n + [2n −1 −(A + B)] −1 After the end-around carry, the result is 2n −1 −(A + B) = (A + B) which is the correct representation for −(A + B).
The following examples illustrate the addition of 1’s and 2’s complement num-bers for a word length of n = 8: 1. Add −11 and −20 in 1’s complement.
+11 = 00001011 +20 = 00010100 taking the bit-by-bit complement, −11 is represented by 11110100 and −20 by 11101011 11110100 (−11) 11101011 +(−20) (1) 11011111 1 (end-around carry) 11100000 = −31 Number Systems and Conversion 21 2. Add −8 and +19 in 2’s complement +8 = 00001000 complementing all bits to the left of the first 1, −8, is represented by 11111000 11111000 (−8) 00010011 +19 (1)00001011 = +11 (discard last carry) Note that in both cases, the addition produced a carry out of the furthest left bit position, but there is no overflow because the answer can be correctly represented by eight bits (including sign). A general rule for detecting overflow when adding two n-bit signed binary numbers (1’s or 2’s complement) to get an n-bit sum is: An overflow occurs if adding two positive numbers gives a negative answer or if adding two negative numbers gives a positive answer.
An alternative method for detecting overflow in 2’s complement addition is as follows: An overflow occurs if and only if the carry out of the sign position is not equal to the carry into the sign position.
1.5 Binary Codes Although most large computers work internally with binary numbers, the input-output equipment generally uses decimal numbers. Because most logic circuits only accept two-valued signals, the decimal numbers must be coded in terms of binary signals. In the simplest form of binary code, each decimal digit is replaced by its binary equivalent. For example, 937 .25 is represented by 9 3 7 . 2 5 1001 0011 0111 . 0010 0101 This representation is referred to as binary-coded-decimal (BCD) or more explicitly as 8-4-2-1 BCD. Note that the result is quite different than that obtained by convert-ing the number as a whole into binary. Because there are only ten decimal digits, 1010 through 1111 are not valid BCD codes.
C C C C C 22 Unit 1 Table 1-2 shows several possible sets of binary codes for the ten decimal dig-its. Many other possibilities exist because the only requirement for a valid code is that each decimal digit be represented by a distinct combination of binary digits. To translate a decimal number to coded form, each decimal digit is replaced by its cor-responding code. Thus 937 expressed in excess-3 code is 1100 0110 1010. The 8-4-2-1 (BCD) code and the 6-3-1-1 code are examples of weighted codes. A 4-bit weighted code has the property that if the weights are w3, w2, w1, and w0, the code a3a2a1a0 represents a decimal number N, where N = w3 a3 + w2 a2 + w1a1 + w0 a0 For example, the weights for the 6-3-1-1 code are w3 = 6, w2 = 3, w1 = 1, and w0 = 1. The binary code 1011 thus represents the decimal digit N = 6·1 + 3·0 + 1·1 + 1·1 = 8 The excess-3 code is obtained from the 8-4-2-1 code by adding 3 (0011) to each of the codes. The 2-out-of-5 code has the property that exactly 2 out of the 5 bits are 1 for every valid code combination. This code has useful error-checking properties because if any one of the bits in a code combination is changed due to a malfunc-tion of the logic circuitry, the number of 1 bits is no longer exactly two. The table shows one example of a Gray code. A Gray code has the property that the codes for successive decimal digits differ in exactly one bit. For example, the codes for 6 and 7 differ only in the fourth bit, and the codes for 9 and 0 differ only in the first bit. A Gray code is often used when translating an analog quantity, such as a shaft position, into digital form. In this case, a small change in the analog quantity will change only one bit in the code, which gives more reliable operation than if two or more bits changed at a time. The Gray and 2-out-of-5 codes are not weighted codes. In general, the decimal value of a coded digit cannot be computed by a simple formula when a non-weighted code is used.
Many applications of computers require the processing of data which contains numbers, letters, and other symbols such as punctuation marks. In order to transmit Decimal Digit 8-4-2-1 Code (BCD) 6-3-1-1 Code Excess-3 Code 2-out-of-5 Code Gray Code 0 0000 0000 0011 00011 0000 1 0001 0001 0100 00101 0001 2 0010 0011 0101 00110 0011 3 0011 0100 0110 01001 0010 4 0100 0101 0111 01010 0110 5 0101 0111 1000 01100 1110 6 0110 1000 1001 10001 1010 7 0111 1001 1010 10010 1011 8 1000 1011 1011 10100 1001 9 1001 1100 1100 11000 1000 TABLE 1-2 Binary Codes for Decimal Digits © Cengage Learning 2014 Number Systems and Conversion 23 such alpha numeric data to or from a computer or store it internally in a computer, each symbol must be represented by a binary code. One common alphanumeric code is the ASCII code (American Standard Code for Information Interchange). This is a 7-bit code, so 27(128) different code combinations are available to represent letters, numbers, and other symbols. Table 1-3 shows a portion of the ASCII code; the code combinations not listed are used for special control functions such as “form feed” or “end of transmission.” The word “Start” is represented in ASCII code as follows: 1010011 1110100 1100001 1110010 1110100 S t a r t TABLE 1-3 ASCII Code © Cengage Learning 2014 ASCII Code ASCII Code ASCII Code Character A6 A5 A4 A3 A2 A1 A0 Character A6 A5 A4 A3 A2 A1 A0 Character A6 A5 A4 A3 A2 A1 A0 space 0 1 0 0 0 0 0 @ 1 0 0 0 0 0 0 ’ 1 1 0 0 0 0 0 !
0 1 0 0 0 0 1 A 1 0 0 0 0 0 1 a 1 1 0 0 0 0 1 “ 0 1 0 0 0 1 0 B 1 0 0 0 0 1 0 b 1 1 0 0 0 1 0 # 0 1 0 0 0 1 1 C 1 0 0 0 0 1 1 c 1 1 0 0 0 1 1 $ 0 1 0 0 1 0 0 D 1 0 0 0 1 0 0 d 1 1 0 0 1 0 0 % 0 1 0 0 1 0 1 E 1 0 0 0 1 0 1 e 1 1 0 0 1 0 1 & 0 1 0 0 1 1 0 F 1 0 0 0 1 1 0 f 1 1 0 0 1 1 0 ′ 0 1 0 0 1 1 1 G 1 0 0 0 1 1 1 g 1 1 0 0 1 1 1 ( 0 1 0 1 0 0 0 H 1 0 0 1 0 0 0 h 1 1 0 1 0 0 0 ) 0 1 0 1 0 0 1 I 1 0 0 1 0 0 1 i 1 1 0 1 0 0 1 0 1 0 1 0 1 0 J 1 0 0 1 0 1 0 j 1 1 0 1 0 1 0 + 0 1 0 1 0 1 1 K 1 0 0 1 0 1 1 k 1 1 0 1 0 1 1 , 0 1 0 1 1 0 0 L 1 0 0 1 1 0 0 l 1 1 0 1 1 0 0 − 0 1 0 1 1 0 1 M 1 0 0 1 1 0 1 m 1 1 0 1 1 0 1 .
0 1 0 1 1 1 0 N 1 0 0 1 1 1 0 n 1 1 0 1 1 1 0 / 0 1 0 1 1 1 1 O 1 0 0 1 1 1 1 o 1 1 0 1 1 1 1 0 0 1 1 0 0 0 0 P 1 0 1 0 0 0 0 p 1 1 1 0 0 0 0 1 0 1 1 0 0 0 1 Q 1 0 1 0 0 0 1 q 1 1 1 0 0 0 1 2 0 1 1 0 0 1 0 R 1 0 1 0 0 1 0 r 1 1 1 0 0 1 0 3 0 1 1 0 0 1 1 S 1 0 1 0 0 1 1 s 1 1 1 0 0 1 1 4 0 1 1 0 1 0 0 T 1 0 1 0 1 0 0 t 1 1 1 0 1 0 0 5 0 1 1 0 1 0 1 U 1 0 1 0 1 0 1 u 1 1 1 0 1 0 1 6 0 1 1 0 1 1 0 V 1 0 1 0 1 1 0 v 1 1 1 0 1 1 0 7 0 1 1 0 1 1 1 W 1 0 1 0 1 1 1 w 1 1 1 0 1 1 1 8 0 1 1 1 0 0 0 X 1 0 1 1 0 0 0 x 1 1 1 1 0 0 0 9 0 1 1 1 0 0 1 Y 1 0 1 1 0 0 1 y 1 1 1 1 0 0 1 : 0 1 1 1 0 1 0 Z 1 0 1 1 0 1 0 z 1 1 1 1 0 1 0 ; 0 1 1 1 0 1 1 [ 1 0 1 1 0 1 1 { 1 1 1 1 0 1 1 < 0 1 1 1 1 0 0 \ 1 0 1 1 1 0 0 | 1 1 1 1 1 0 0 = 0 1 1 1 1 0 1 ] 1 0 1 1 1 0 1 } 1 1 1 1 1 0 1 > 0 1 1 1 1 1 0 ^ 1 0 1 1 1 1 0 ~ 1 1 1 1 1 1 0 ?
0 1 1 1 1 1 1 — 1 0 1 1 1 1 1 delete 1 1 1 1 1 1 1 24 Unit 1 Problems 1.1 Convert to hexadecimal and then to binary: (a) 757.2510 (b) 123.1710 (c) 356.8910 (d) 1063.510 1.2 Convert to octal. Convert to hexadecimal. Then convert both of your answers to decimal, and verify that they are the same.
(a) 111010110001.0112 (b) 10110011101.112 1.3 Convert to base 6: 3BA.2514 (do all of the arithmetic in decimal).
1.4 (a) Convert to hexadecimal: 1457.1110. Round to two digits past the hexadecimal point.
(b) Convert your answer to binary, and then to octal.
(c) Devise a scheme for converting hexadecimal directly to base 4 and convert your answer to base 4.
(d) Convert to decimal: DEC.A16.
1.5 Add, subtract, and multiply in binary: (a) 1111 and 1010 (b) 110110 and 11101 (c) 100100 and 10110 1.6 Subtract in binary. Place a 1 over each column from which it was necessary to borrow. (a) 11110100 − 1000111 (b) 1110110 − 111101 (c) 10110010 − 111101 1.7 Add the following numbers in binary using 2’s complement to represent negative numbers. Use a word length of 6 bits (including sign) and indicate if an overflow occurs. (a) 21 + 11 (b) (−14) + (−32) (c) (−25) + 18 (d) (−12) + 13 (e) (−11) + (−21) Repeat (a), (c), (d), and (e) using 1’s complement to represent negative numbers.
1.8 A computer has a word length of 8 bits (including sign). If 2’s complement is used to represent negative numbers, what range of integers can be stored in the computer? If 1’s complement is used? (Express your answers in decimal.) 1.9 Construct a table for 7-3-2-1 weighted code and write 3659 using this code.
1.10 Convert to hexadecimal and then to binary. (a) 1305.37510 (b) 111.3310 (c) 301.1210 (d) 1644.87510 1.11 Convert to octal. Convert to hexadecimal. Then convert both of your answers to decimal, and verify that they are the same. (a) 101111010100.1012 (b) 100001101111.012 Number Systems and Conversion 25 1.12 (a) Convert to base 3: 375.548 (do all of the arithmetic in decimal).
(b) Convert to base 4: 384.7410.
(c) Convert to base 9: A52.A411 (do all of the arithmetic in decimal).
1.13 Convert to hexadecimal and then to binary: 544.19.
1.14 Convert the decimal number 97.710 into a number with exactly the same value rep-resented in the following bases. The exact value requires an infinite repeating part in the fractional part of the number. Show the steps of your derivation. (a) binary (b) octal (c) hexadecimal (d) base 3 (e) base 5 1.15 Devise a scheme for converting base 3 numbers directly to base 9. Use your method to convert the following number to base 9: 1110212.202113 1.16 Convert the following decimal numbers to octal and then to binary: (a) 298363 ∕64 (b) 93.70 (c) 298331 ∕ 32 (d) 109.30 1.17 Add, subtract, and multiply in binary: (a) 1111 and 1001 (b) 1101001 and 110110 (c) 110010 and 11101 1.18 Subtract in binary. Place a 1 over each column from which it was necessary to borrow. (a) 10100100 −01110011 (b) 10010011 −01011001 (c) 11110011 −10011110 1.19 Divide in binary: (a) 11101001 ÷ 101 (b) 110000001 ÷ 1110 (c) 1110010 ÷ 1001 Check your answers by multiplying out in binary and adding the remainder.
1.20 Divide in binary: (a) 10001101 ÷ 110 (b) 110000011 ÷ 1011 (c) 1110100 ÷ 1010 1.21 Assume three digits are used to represent positive integers and also assume the fol-lowing operations are correct. Determine the base of the numbers. Did any of the additions overflow?
(a) 654 + 013 = 000 (b) 024 + 043 + 013 + 033 = 223 (c) 024 + 043 + 013 + 033 = 201 1.22 What is the lowest number of bits (digits) required in the binary number approxi-mately equal to the decimal number 0.611710 so that the binary number has the same or better precision?
1.23 Convert 0.363636 . . . 10 to its exact equivalent base 8 number.
26 Unit 1 1.24 (a) Verify that a number in base b can be converted to base b3 by partitioning the digits of the base b number into groups of three consecutive digits starting at the radix point and proceeding both left and right and converting each group into a base b3 digit. (Hint: Represent the base b number using the power series expansion.) (b) Verify that a number in base b3 can be converted to base b by expanding each digit of the base b3 number into three consecutive digits starting at the radix point and proceeding both left and right.
1.25 (a) Show how to represent each of the numbers (5 −1), (52 −1), and (53 −1) as base 5 numbers.
(b) Generalize your answers to part (a) and show how to represent (bn −1) as a base b number, where b can be any integer larger than 1 and n any integer larger than 0. Give a mathematical derivation of your result.
1.26 (a) Show that the number 121b, where b is any base greater than 2, is a perfect square (i.e., it is equal to the square of some number).
(b) Repeat part (a) for the number 12321b, where b > 3.
(c) Repeat part (a) for the number 14641b, where b > 6.
(d) Repeat part (a) for the number 1234321b, where b > 4.
1.27 (a) Convert (0.12)3 to a base 6 fraction.
(b) Convert (0.375)10 to a base 8 fraction.
(c) Let N = (0.a−1a−2 · · · a−m)R be an any base R fraction with at most m nonzero digits. Determine the necessary and sufficient conditions for N to be rep-resentable as a base S fraction with a finite number of nonzero digits; say N = (0.b−1b−2 · · · b−n)S. (Hint: Part (a) gives an example. Note that (a−1R−1 + a−2 R−2 + · · · a−m R−m)Sn must be an integer.) (d) Generalize part (a) to determine necessary and sufficient conditions for a spe-cific, but not every, base R fraction, N = (0.a−1a−2 · · · a−m)R, to be representable as a base S fraction with a finite number of nonzero digits.
1.28 Construct a table for 4-3-2-1 weighted code and write 9154 using this code.
1.29 Is it possible to construct a 5-3-1-1 weighted code? A 6-4-1-1 weighted code? Justify your answers.
1.30 Is it possible to construct a 5-4-1-1 weighted code? A 6-3-2-1 weighted code? Justify your answers.
1.31 Construct a 6-2-2-1 weighted code for decimal digits. What number does 1100 0011 represent in this code?
Number Systems and Conversion 27 1.32 Construct a 5-2-2-1 weighted code for decimal digits. What numbers does 1110 0110 represent in this code?
1.33 Construct a 7-3-2-1 code for base 12 digits. Write B4A9 using this code.
1.34 (a) It is possible to have negative weights in a weighted code for the decimal digits, e.g., 8, 4, −2, and −1 can be used. Construct a table for this weighted code.
(b) If d is a decimal digit in this code, how can the code for 9 − d be obtained?
1.35 Convert to hexadecimal, and then give the ASCII code for the resulting hexadecimal number (including the code for the hexadecimal point): (a) 222.2210 (b) 183.8110 1.36 Repeat 1.7 for the following numbers: (a) (−10) + (−11) (b) (−10) + (−6) (c) (−8) + (−11) (d) 11 + 9 (e) (−11) + (−4) 1.37 Because A −B = A + (−B), the subtraction of signed numbers can be accomplished by adding the complement. Subtract each of the following pairs of 5-bit binary num-bers by adding the complement of the subtrahend to the minuend. Indicate when an overflow occurs. Assume that negative numbers are represented in 1’s complement. Then repeat using 2’s complement. (a) 01001 −11010 (b) 11010 −11001 (c) 10110 −01101 (d) 11011 −00111 (e) 11100 −10101 1.38 Work Problem 1.37 for the following pairs of numbers: (a) 11010 −10100 (b) 01011 −11000 (c) 10001 −01010 (d) 10101 −11010 1.39 (a) A = 101010 and B = 011101 are 1’s complement numbers. Perform the follow-ing operations and indicate whether overflow occurs. (i) A + B (ii) A −B (b) Repeat part (a) assuming the numbers are 2’s complement numbers.
1.40 (a) Assume the integers below are 1’s complement integers. Find the 1’s comple-ment of each number, and give the decimal values of the original number and of its complement. (i) 0000000 (ii) 1111111 (iii) 00110011 (iv) 1000000 (b) Repeat part (a) assuming the numbers are 2’s complement numbers and finding the 2’s complement of them.
1.41 An alternative algorithm for converting a base 20 integer, dn−1dn−2 · · · d1d0, into a base 10 integer is stated as follows: Multiply di by 2i and add i 0’s on the right, and then add all of the results.
28 Unit 1 (a) Use this algorithm to convert GA720 to base 10. (G20 is 1610.) (b) Prove that this algorithm is valid.
(c) Consider converting a base 20 fraction, 0.d−1d−2 · · · d−n+1d−n, into a base 10 fraction. State an algorithm analogous to the one above for doing the conversion.
(d) Apply your algorithm of part (c) to 0.FA720.
1.42 Let A and B be positive integers, and consider the addition of A and B in an n-bit 2’s complement number system.
(a) Show that the addition of A and B produces the correct representation of the sum if the magnitude of (A + B) is < 2n−1 −1 but it produces a representation of a negative number of magnitude 2n −(A + B) if the magnitude of (A + B) is > 2n−1 −1.
(b) Show that the addition of A and (−B) always produces the correct representa-tion of the sum. Consider both the case where A ≥B and the case A < B.
(c) Show that the addition of (2n −A) + (2n −B), with the carry from the sign posi-tion ignored, produces the correct 2’s complement representation of −(A + B) if the magnitude of A + B is less than or equal to 2n−1. Also, show that it produces an incorrect sum representing the positive number 2n −(A + B) if the magni-tude of (A + B) > 2n−1.
1.43 Let A and B be integers and consider the addition of A and B in an n-bit 1’s comple-ment number system. Prove that addition of A and B using the end-around carry produces the correct representation of the sum provided overflow does not occur. Consider the four cases: A and B both positive, A positive and B negative with the magnitude of A greater than the magnitude of B, A positive and B negative with the magnitude of A less than or equal to the magnitude of B, and A and B both negative. 1.44 Prove that in a 2’s complement number system addition overflows if and only if the carry from the sign position does not equal the carry into the sign position. Consider the three cases: adding two positive numbers, adding two negative numbers, and adding two numbers of opposite sign.
1.45 Restate the method for detecting overflow of Problem 1.44 so that it applies to 1’s complement numbers.
1.46 Let B = bn−1bn−2 · · · b1b0 be an n-bit 2’s complement integer. Show that the deci-mal value of B is −bn−12n−1 + bn−22n−2 + bn−32n−3 + · · · + b12 + b0. (Hint: Con-sider positive (bn−1 = 0) and negative (bn−1 = 1) numbers separately, and note that the magnitude of a negative number is obtained by subtracting each bit from 1 (i.e., complementing each bit) and adding 1 to the result.) 29 Boolean Algebra Objectives A list of some of the laws of switching algebra, which is a special case of Boolean algebra, is given in Table 2-3. Additional theorems of Boolean algebra are given in Table 2-4. When you complete this unit, you should be familiar with and be able to use these laws and theorems of Boolean algebra.
1. Understand the basic operations and laws of Boolean algebra.
2. Relate these operations and laws to circuits composed of AND gates, OR gates, and INVERTERS. Also relate these operations and laws to circuits composed of switches.
3. Prove any of these laws in switching algebra using a truth table.
4. Apply these laws to the manipulation of algebraic expressions including: a. Multiplying out an expression to obtain a sum of products (SOP) b. Factoring an expression to obtain a product of sums (POS) c. Simplifying an expression by applying one of the laws d. Finding the complement of an expression U N I T 2 30 Unit 2 Study Guide 1. In this unit you will study Boolean algebra, the basic mathematics needed for the logic design of digital systems. Just as when you first learned ordinary algebra, you will need a fair amount of practice before you can use Boolean algebra effectively. However, by the end of the course, you should be just as comfortable with Boolean algebra as with ordinary algebra. Fortunately, many of the rules of Boolean algebra are the same as for ordinary algebra, but watch out for some surprises!
2. Study Sections 2.1 and 2.2, Introduction and Basic Operations.
(a) How does the meaning of the symbols 0 and 1 as used in this unit differ from the meaning as used in Unit 1?
(b) Two commonly used notations for the inverse or complement of A are A and A′. The latter has the advantage that it is much easier for typists, print-ers, and computers. (Have you ever tried to get a computer to print a bar over a letter?) We will use A′ for the complement of A. You may use either notation in your work, but please do not mix notations in the same equa-tion. Most engineers use +GPS03BOEr PSOPTZNCPM GPS"/%
BOEXF will follow this practice. An alternative notation, often used by mathemati-cians, is ∨for OR and ∧for AND.
(c) Many different symbols are used for AND, OR, and INVERTER logic blocks. Initially we will use 1 1 1 0 1 0 1 1 + + ...
...
for AND for OR for INVERTER + 0 1 0 1 1 0 + + The shapes of these symbols conform to those commonly used in industrial practice. We have added the +BOErGPSDMBSJUZ5IFTFTZNCPMTQPJOUJOUIF direction of signal flow. This makes it easier to read the circuit diagrams in comparison with the square or round symbols used in some books.
(d) Determine the output of each of the following gates: (e) Determine the unspecified inputs to each of the following gates if the out-puts are as shown: Boolean Algebra 31 3. Study Section 2.3, Boolean Expressions and Truth Tables.
(a) How many variables does the following expression contain?
How many literals?
A′BC′D + AB + B′CD + D′ (b) For the following circuit, if A = B = 0 and C = D = E = 1, indicate the output of each gate (0 or 1) on the circuit diagram: C D B E F A + + (c) Derive a Boolean expression for the circuit output. Then substitute A = B = 0 and C = D = E = 1 into your expression and verify that the value of F obtained in this way is the same as that obtained on the circuit diagram in (b).
(d) Write an expression for the output of the following circuit and complete the truth table: A B A′ A′B (A′B)′ A F = B F (e) When filling in the combinations of values for the variables on the left side of a truth table, always list the combinations of 0’s and 1’s in binary order. For example, for a three-variable truth table, the first row should be 000, the next row 001, then 010, 011, 100, 101, 110, and 111. Write an expression for the output of the following circuit and complete the truth table: B C A F = F + A B C B′ A + B′ C(A + B′) (f) Draw a gate circuit which has an output Z = [BC′ + F(E + AD′)]′ (Hint: Start with the innermost parentheses and draw the circuit for AD′ first.) 32 Unit 2 4. Study Section 2.4, Basic Theorems.
(a) Prove each of the Theorems (2-4) through (2-8D) by showing that it is valid for both X = 0 and X = 1.
(b) Determine the output of each of these gates: A A A A A′ A A′ A A 0 A A 1 0 1 A + + + + (c) State which of the basic theorems was used in simplifying each of the following expressions: (AB′ + C) · 0 = 0 A(B + C′) + 1 = 1 (BC′ + A)(BC′ + A) = BC′ + A X(Y′ + Z) + [X(Y′ + Z)]′ = 1 (X′ + YZ)(X′ + YZ)′ = 0 D′(E′ + F ) + D′(E′ + F ) = D′(E′ + F ) 5. Study Section 2.5, Commutative, Associative, Distributive, and DeMorgan’s Laws.
(a) State the associative law for OR.
(b) State the commutative law for AND.
(c) Simplify the following circuit by using the associative laws. Your answer should require only two gates.
(d) For each gate determine the value of the unspecified input(s): (e) Using a truth table, verify the distributive law, Equation (2-11).
1 1 1 0 0 1 1 0 0 0 + + A B C D E F G + + Boolean Algebra 33 (f) Illustrate the distributive laws, Equations (2-11) and (2-11D), using AND and OR gates.
(g) Verify Equation (2-3) using the second distributive law.
(h) Show how the second distributive law can be used to factor RS + T′.
6. Study Section 2.6, Simplification Theorems.
(a) By completing the truth table, prove that XY′ + Y = X + Y.
(b) Which one of Theorems in Table 2-4 was applied to simplify each of the following expressions? Identify X and Y in each case.
(A + B)(DE)′ + DE = A + B + DE AB′ + AB′C′D = AB′ (A′ + B)(CD + E′) + (A′ + B)(CD + E′)′ = A′ + B (A + BC′ + D′E)(A + D′E) = A + D′E X Y XY′ XY′ + Y X + Y 0 0 0 1 1 0 1 1 34 Unit 2 (c) Simplify the following circuit to a single gate: (d) Work Problems 2.1, 2.2, 2.3, and 2.4.
7. Study Section 2.7 , Multiplying Out and Factoring.
(a) Indicate which of the following expressions are in the product-of-sums form, sum-of-products form, or neither: AB′ + D′EF ′ + G (A + B′C′)(A′ + BC) AB′(C′ + D + E′)(F ′ + G) X′Y + WX(X′ + Z) + A′B′C′ Your answer should indicate one expression as a product-of-sums form, one as sum-of-products form, and two as neither, not necessarily in that order.
(b) When multiplying out an expression, why should the second distributive law be applied before the ordinary distributive law when possible?
(c) Factor as much as possible using the ordinary distributive law: AD + B′CD + B′DE Now factor your result using the second distributive law to obtain a prod-uct of sums.
(d) Work Problems 2.5, 2.6, and 2.7 .
8. Probably the most difficult part of the unit is using the second distributive law for factoring or multiplying out an expression. If you have difficulty with Problems 2.5 or 2.6, or you cannot work them quickly, study the examples in Section 2.7 again, and then work the following problems.
Multiply out: (a) (B′ + D + E)(B′ + D + A)(AE + C′) (b) (A + C′)(B′ + D)(C′ + D′)(C + D)E A B C C Z D + + Boolean Algebra 35 As usual, when we say multiply out, we do not mean to multiply out by brute force, but rather to use the second distributive law whenever you can to cut down on the amount of work required.
The answer to (a) should be of the following form: XX + XX + XX and (b) of the form: XXX + XXXXX, where each X represents a single variable or its complement.
Now factor your answer to (a) to see that you can get back the original expression.
9. Study Section 2.8, Complementing Boolean Expressions.
10. Find the complement of each of the following expressions as indicated. In your answer, the complement operation should be applied only to single variables.
(a) (ab′c′)′ = (b) (a′ + b + c + d′)′ = (c) (a′ + bc)′ = (d) (a′b′ + cd)′ = (e) [a(b′ + c′d)]′ = 11. Because (X′)′ = X, if you complement each of your answers to 10, you should get back the original expression. Verify that this is true.
(a) (b) (c) (d) (e) 12. Given that F = a′b + b′c, F′ = Complete the following truth table and verify that your answer is correct: a b c a′b b′c a′b + b′c (a + b′) (b + c′) F′ 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1 36 Unit 2 13. A fully simplified expression should have nothing complemented except the individual variables. For example, F = (X + Y)′(W + Z) is not a minimum product of sums. Find the minimum product of sums for F.
14. Work Problems 2.8 and 2.9.
15. Find the dual of (M + N′)P′.
16. Review the laws of Table 2-3 and the first three theorems of Table 2-4. Make sure that you can recognize when to apply them even if an expression has been substituted for a variable.
17. Reread the objectives of this unit. If you are satisfied that you can meet these objectives, take the readiness test.
[Note: You will be provided with a copy of Tables 2-3 and 2-4 when you take the readiness test this time. However, by the end of Unit 3, you should know all the laws and theorems by memory.] Boolean Algebra 2.1 Introduction The basic mathematics needed for the study of logic design of digital systems is Boolean algebra. George Boole developed Boolean algebra in 1847 and used it to solve problems in mathematical logic. Boolean algebra has many other applications, including set theory and mathematical logic; however, we primarily consider its appli-cation to switching circuits. All of the switching devices we will use are essentially two-state devices (e.g., switches which are open or closed and transistors with high or low Boolean Algebra 37 output voltages). Consequently, we will emphasize the special case of Boolean algebra in which all of the variables assume only one of two values; this two-valued Boolean algebra is often called switching algebra. Claude Shannon first applied Boolean alge-bra to the design of switching circuits in 1939. First, we develop some of the properties of switching algebra and use these to define a general Boolean algebra.
We will use a Boolean variable, such as X or Y, to represent the input or out-put of a switching circuit. We will assume that each of these variables can take on only two different values. The symbols “0” and “1” are used to represent these two different values. Thus, if X is a Boolean (switching) variable, then either X = 0 or X = 1.
The symbols “0” and “1” used in Boolean algebra do not have a numeric value; instead they represent two different states in a logic circuit and are the two values of a switching variable. In a logic gate circuit, 0 (usually) represents a range of low voltages, and 1 represents a range of high voltages. In a switch circuit, 0 (usually) represents an open switch, and 1 represents a closed circuit. In general, 0 and 1 can be used to represent the two states in any binary-valued system.
2.2 Basic Operations The basic operations of Boolean (switching) algebra are called AND, OR, and com-plement (or inverse). In the case of switch circuits these operations correspond to different configurations of switches. To apply switching algebra to a switch circuit, each switch contact is labeled with a variable. If contact X is open, the variable X is defined to be 0; if contact X is closed, the variable X is defined to be 1.
The contacts in a switch can be normally open (NO) or normally closed (NC). When the switch position is changed, the NO contact closes and the NC contact opens, so the NO and NC contacts are always in opposite states. If X is the variable assigned to the NO contact, then the variable assigned to the NC contact is the complement of X, denoted as X′, where the prime (′) denotes complementation.
The complement of 0 is 1, and the complement of 1 is 0. Symbolically, we write 0′ = 1 and 1′ = 0 X X = 0 → switch open X = 1 → switch closed A NO contact NC contact B 38 Unit 2 If Xis a switching variable, X′ = 1 if X = 0 and X′ = 0 if X = 1 An alternate name for complementation is inversion, and the electronic circuit which forms the inverse of X is referred to as an inverter. Symbolically, we represent an inverter by where the circle at the output indicates inversion. A low voltage at the inverter input produces a high voltage at the output and vice versa.
In a general switch circuit, the value 0 is assigned to the connection between two terminals in the circuit if there is no connection (open circuit) between the terminals, and a 1 is assigned if there is a connection (closed circuit) between the terminals. If the switch circuit only contains two switches, the switch contacts must be connected in series or in parallel. When switch contacts A and B are connected in series, there is an open circuit between the terminals if either A or B or both are open (0), and there is a closed circuit between the terminals only if both A and B are closed (1).
This is summarized in the following truth table: The operation defined by the table is called AND and it is written algebraically as C = A · B. The “·” symbol is frequently omitted in a Boolean expression, and we will usually write AB instead of A · B. The AND operation is also referred to as logical (or Boolean) multiplication.
When switches A and B are connected in parallel, there is a closed circuit between the terminals if either A or B is closed (1), and there is an open circuit between the terminals only if both A and B are open (0).
A B C = A · B 0 0 0 0 1 0 1 0 0 1 1 1 A B 1 2 X X′ A 1 B C = 0 → open circuit between terminals 1 and 2 C = 1 → closed circuit between terminals 1 and 2 2 Boolean Algebra 39 This is summarized in the following truth table: The operation defined by the table is called OR and it is written algebraically as C = A + B. This type of OR operation is sometimes referred to as inclusive OR as opposed to exclusive OR, which is defined later. The OR operation is also referred to as logical (or Boolean) addition.
Logic gates operate so that the voltage on inputs and outputs of a gate is either in a low voltage range or a high voltage range, except when the signals are changing. Switch-ing algebra can be applied to logic gates by assigning 0 and 1 to the two voltage ranges. Usually, a 0 is assigned to the low voltage range and a 1 to the high voltage range.
A logic gate which performs the AND operation is represented by The gate output is C = 1 if and only if the gate inputs A = 1 and B = 1.
A logic gate which performs the OR operation is represented by The gate output is C = 1 if and only if the gate inputs A = 1 or B = 1 (or both). Electronic circuits which realize inverters and AND and OR gates are described in Appendix A.
2.3 Boolean Expressions and Truth Tables Boolean expressions are formed by application of the basic operations to one or more variables or constants. The simplest expressions consist of a single constant or variable, such as 0, X, or Y′. More complicated expressions are formed by combin-ing two or more other expressions using AND or OR, or by complementing another expression. Examples of expressions are AB′ + C (2-1) [A(C + D)]′ + BE (2-2) Parentheses are added as needed to specify the order in which the operations are performed. When parentheses are omitted, complementation is performed first fol-lowed by AND and then OR. Thus in Expression (2-1), B′ is formed first, then AB′, and finally AB′ + C.
A B C = A + B 0 0 0 0 1 1 1 0 1 1 1 1 A B C = A B A B C = A + B + 40 Unit 2 Each expression corresponds directly to a circuit of logic gates. Figure 2-1 gives the circuits for Expressions (2-1) and (2-2).
An expression is evaluated by substituting a value of 0 or 1 for each variable. If A = B = C = 1 and D = E = 0, the value of Expression (2-2) is [A(C + D)]′ + BE = [1(1 + 0)]′ + 1 · 0 = [1(1)]′ + 0 = 0 + 0 = 0 Each appearance of a variable or its complement in an expression will be referred to as a literal. Thus, the following expression, which has three variables, has 10 literals: ab′c + a′b + a′bc′ + b′c′ When an expression is realized using logic gates, each literal in the expression cor-responds to a gate input.
A truth table (also called a table of combinations) specifies the values of a Boolean expression for every possible combination of values of the variables in the expression. The name truth table comes from a similar table which is used in sym-bolic logic to list the truth or falsity of a statement under all possible conditions. We can use a truth table to specify the output values for a circuit of logic gates in terms of the values of the input variables. The output of the circuit in Figure 2-2(a) is F = A′ + B. Figure 2-2(b) shows a truth table which specifies the output of the circuit for all possible combinations of values of the inputs A and B. The first two columns list the four combinations of values of A and B, and the next column gives the corresponding values of A′. The last column, which gives the values of A′ + B, is formed by ORing together corresponding values of A′ and B in each row.
FIGURE 2-2 Two-Input Circuit and Truth Table © Cengage Learning 2014 + A B F = A′ + B A′ (a) FIGURE 2-1 Circuits for Expressions (2-1) and (2-2) © Cengage Learning 2014 A A B BE E AB′ (AB′ + C) (C + D) A(C + D) [A(C + D)]′ [A(C + D)]′ + BE (a) (b) C B C D B′ + + + A B A′ F = A′ + B 0 0 1 1 0 1 1 1 1 0 0 0 (b) 1 1 0 1 Boolean Algebra 41 Next, we will use a truth table to specify the value of Expression (2-1) for all possible combinations of values of the variables A, B, and C. On the left side of Table 2-1, we list the values of the variables A, B, and C. Because each of the three variables can assume the value 0 or 1, there are 2 × 2 × 2 = 8 combinations of values of the variables. These combinations are easily obtained by listing the binary num-bers 000, 001, … , 111. In the next three columns of the truth table, we compute B′, AB′, and AB′ + C, respectively.
Two expressions are equal if they have the same value for every possible combi-nation of the variables. The expression (A + C)(B′ + C) is evaluated using the last three columns of Table 2-1. Because it has the same value as AB′ + C for all eight combinations of values of the variables A, B, and C, we conclude AB′ + C = (A + C)(B′ + C) (2-3) If an expression has n variables, and each variable can have the value 0 or 1, the number of different combinations of values of the variables is 2 × 2 × 2 × . . . n times = 2n Therefore, a truth table for an n-variable expression will have 2n rows.
2.4 Basic Theorems The following basic laws and theorems of Boolean algebra involve only a single variable: Operations with 0 and 1: TABLE 2-1 © Cengage Learning 2014 A B C B′ AB′ AB′ + C A + C B′ + C (A + C )(B′ + C ) 0 0 0 1 0 0 0 1 0 0 0 1 1 0 1 1 1 1 0 1 0 0 0 0 0 0 0 0 1 1 0 0 1 1 1 1 1 0 0 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 0 0 0 1 0 0 1 1 1 0 0 1 1 1 1 X + 0 = X (2-4) X · 1 = X (2-4D) X + 1 = 1 (2-5) X · 0 = 0 (2-5D) 42 Unit 2 Idempotent laws: X + X = X (2-6) X · X = X (2-6D) Involution law: (X′)′ = X (2-7) Laws of complementarity: X + X′ = 1 (2-8) X · X′ = 0 (2-8D) A A A A A A = Each of these theorems is easily proved by showing that it is valid for both of the possible values of X. For example, to prove X + X′ = 1, we observe that if X = 0, 0 + 0′ = 0 + 1 = 1, and if X = 1, 1 + 1′ = 1 + 0 = 1 Any expression can be substituted for the variable X in these theorems. Thus, by Theorem (2-5), (AB′ + D)E + 1 = 1 and by Theorem (2-8D), (AB′ + D)(AB′ + D)′ = 0 We will illustrate some of the basic theorems with circuits of switches. As before, 0 will represent an open circuit or open switch, and 1 will represent a closed circuit or closed switch. If two switches are both labeled with the variable A, this means that both switches are open when A = 0 and both are closed when A = 1. Thus the circuit can be replaced with a single switch: This illustrates the theorem A · A = A. Similarly, which illustrates the theorem A + A = A. A switch in parallel with an open circuit is equivalent to the switch alone A A = (A + 0 = A) Boolean Algebra 43 while a switch in parallel with a short circuit is equivalent to a short circuit.
If a switch is labeled A′, then it is open when A is closed and conversely. Hence, A in parallel with A′ can be replaced with a closed circuit because one or the other of the two switches is always closed.
Similarly, switch A in series with A′ can be replaced with an open circuit (why?).
2.5 Commutative, Associative, Distributive, and DeMorgan’s Laws Many of the laws of ordinary algebra, such as the commutative and associative laws, also apply to Boolean algebra. The commutative laws for AND and OR, which fol-low directly from the definitions of the AND and OR operations, are A (A + 1 = 1) = A A′ (A + A′ = 1) = (A A′ = 0) = A A′ XY = YX (2-9) X + Y = Y + X (2-9D) This means that the order in which the variables are written will not affect the result of applying the AND and OR operations.
The associative laws also apply to AND and OR: (XY)Z = X(YZ) = XYZ (2-10) (X + Y) + Z = X + (Y + Z) = X + Y + Z (2-10D) When forming the AND (or OR) of three variables, the result is independent of which pair of variables we associate together first, so parentheses can be omitted as indicated in Equations (2-10) and (2-10D).
44 Unit 2 When the preceding laws are interpreted as switch circuits, they simply indicate that the order in which switch contacts are connected does not change the logic operation of the circuit.
We will prove the associative law for AND by using a truth table (Table 2-2). On the left side of the table, we list all combinations of values of the variables X,Y, and Z. In the next two columns of the truth table, we compute XY and YZ for each combination of values of X, Y, and Z. Finally, we compute (XY)Z and X(YZ). Because (XY)Z and X(YZ) are equal for all possible combinations of values of the variables, we conclude that Equation (2-10) is valid.
Figure 2-3 illustrates the associative laws using AND and OR gates. In Figure 2-3(a) two two-input AND gates are replaced with a single three-input AND gate. Similarly, in Figure 2-3(b) two two-input OR gates are replaced with a single three-input OR gate.
When two or more variables are ANDed together, the value of the result will be 1 if all of the variables have the value 1. If any of the variables have the value 0, the result of the AND operation will be 0. For example, XYZ = 1 iff X = Y = Z = 1 When two or more variables are ORed together, the value of the result will be 1 if any of the variables have the value 1. The result of the OR operation will be 0 iff all of the variables have the value 0. For example, X + Y + Z = 0 iff X = Y = Z = 0 TABLE 2-2 Proof of Associative Law for AND © Cengage Learning 2014 X Y Z XY YZ (XY )Z X(YZ ) 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 1 1 0 1 0 0 1 0 0 0 0 0 0 1 0 1 0 0 0 0 1 1 0 1 0 0 0 1 1 1 1 1 1 1 FIGURE 2-3 Associative Laws for AND and OR © Cengage Learning 2014 A A B C B C = (AB) C = ABC (a) A A B C B C = (A + B) + C = A + B + C (b) + + + Boolean Algebra 45 Using a truth table, it is easy to show that the distributive law is valid: X(Y + Z) = XY + XZ (2-11) In addition to the ordinary distributive law, a second distributive law is valid for Boolean algebra but not for ordinary algebra: X + YZ = (X + Y)(X + Z) (2-11D) Proof of the second distributive law follows: (X + Y)(X + Z) = X(X + Z) + Y(X + Z) = XX + XZ + YX + YZ (by (2-11)) = X + XZ + XY + YZ = X · 1 + XZ + XY + YZ (by (2-6D) and (2-4D)) = X(1 + Z + Y) + YZ = X · 1 + YZ = X + YZ (by (2-11), (2-5), and (2-4D)) The ordinary distributive law states that the AND operation distributes over OR, while the second distributive law states that OR distributes over AND. This second law is very useful in manipulating Boolean expressions. In particular, an expression like A + BC, which cannot be factored in ordinary algebra, is easily factored using the second distributive law: A + BC = (A + B)(A + C) The next laws are called DeMorgan’s laws. (X + Y )′ = X′Y′ (2-12) (XY)′ = X′ + Y′ (2-13) We will verify these laws using a truth table: The laws we have derived for switching algebra are summarized in Table 2-3. One definition of Boolean algebra is a set containing at least two distinct elements with the operations of AND, OR, and complement defined on the elements that satisfy X Y X ′ Y′ X + Y (X + Y )′ X′Y′ XY (XY )′ X′ + Y′ 0 0 1 1 0 1 1 0 1 1 0 1 1 0 1 0 0 0 1 1 1 0 0 1 1 0 0 0 1 1 1 1 0 0 1 0 0 1 0 0 46 Unit 2 the laws in Table 2-3. This definition is not minimal (i.e., the laws are not independent since some can be derived from others). It is chosen for convenience so that other Boolean algebra theorems can be derived easily. One minimal set of laws referred to as Huntington’s postulates are operations with 0 and 1, commutative laws, distribu-tive laws, and complementation laws. The other laws can be algebraically derived from this minimal set.
The Boolean algebra laws were given in pairs to show the algebra satisfies a dual-ity. Given a Boolean algebra expression the dual of the expression is obtained by interchanging the constants 0 and 1 and interchanging the operations of AND and OR. Variables and complements are left unchanged. The laws listed in Table 2-3 show that given a Boolean algebra identity, another identity can be obtained by taking the dual of both sides of the identity. The dual of AND is OR and the dual of OR is AND: (XYZ. . .)D = X + Y + Z + · · · (X + Y + Z + · · ·)D = XYZ. . . (2-14) 2.6 Simplification Theorems The following theorems are useful in simplifying Boolean expressions: Uniting: XY + XY′ = X (2-15) (X + Y )(X + Y′) = X (2-15D) Absorption: X + XY = X (2-16) X(X + Y ) = X (2-16D) Operations with 0 and 1: 1. X + 0 = X 1D. X · 1 = X 2. X + 1 = 1 2D. X · 0 = 0 Idempotent laws: 3. X + X = X 3D. X · X = X Involution law: 4. (X′)′ = X Laws of complementarity: 5. X + X′ = 1 5D. X · X′ = 0 Commutative laws: 6. X + Y = Y + X 6D. XY = YX Associative laws: 7. (X + Y ) + Z = X + (Y + Z ) = X + Y + Z 7D. (XY )Z = X(YZ ) = XYZ Distributive laws: 8. X(Y + Z ) = XY + XZ 8D. X + YZ = (X + Y )(X + Z ) DeMorgan’s laws: 9. (X + Y )′ = X′Y′ 9D. (XY )′ = X′ + Y ′ TABLE 2-3 Laws of Boolean Algebra © Cengage Learning 2014 Boolean Algebra 47 Elimination: X + X ′Y = X + Y (2-17) X(X′ + Y ) = X Y (2-17D) Consensus: XY + X′Z + YZ = XY + X′Z (2-18) (X + Y )(X′ + Z)(Y + Z) = (X + Y )(X′ + Z) (2-18D) In each case, one expression can be replaced by a simpler one. Since each expression corresponds to a circuit of logic gates, simplifying an expression leads to simplifying the corresponding logic circuit.
In switching algebra, each of the above theorems can be proved by using a truth table. In a general Boolean algebra, they must be proved algebraically starting with the basic theorems.
Proof of (2-15): XY + XY′ = X(Y + Y′) = X(1) = X Proof of (2-16): X + XY = X · 1 + XY = X(1 + Y) = X · 1 = X Proof of (2-17): X + X′Y = (X + X′)(X + Y ) = 1(X + Y ) = X + Y Proof of (2-18): XY + X′Z + YZ = XY + X′Z + (1)YZ = XY + X′Z + (X + X′)YZ = XY + XYZ + X′Z + X′YZ = XY + X′Z (using absorption twice) After proving one theorem in a pair of theorems, the other theorem follows by the duality property of Boolean algebra. Alternatively, the other theorem can be proved using the dual steps used to prove the first theorem. For example, (2-16D) can be proved using the dual steps of the (2-16) proof.
Proof of (2-16D): X(X + Y ) = (X + 0)(X + Y ) = X + (0 · Y ) = X + 0 = X We will illustrate the elimination theorem using switches. Consider the following circuit: Its transmission is T = Y + XY′ because there is a closed circuit between the termi-nals if switch Y is closed or switch X is closed and switch Y′ is closed. The following circuit is equivalent because if Y is closed (Y = 1) both circuits have a transmission of 1; if Y is open (Y′ = 1) both circuits have a transmission of X.
The following example illustrates simplification of a logic gate circuit using one of the theorems. In Figure 2-4, the output of circuit (a) is F = A(A′ + B) Y X Y′ Y X 48 Unit 2 By the elimination theorem, the expression for F simplifies to AB. Therefore, circuit (a) can be replaced with the equivalent circuit (b).
Any expressions can be substituted for X and Y in the theorems.
FIGURE 2-4 Equivalent Gate Circuits © Cengage Learning 2014 A B A F A B F (a) (b) + Simplify Z = A′BC + A′ This expression has the same form as absorption theorem (2-16) if we let X = A′ and Y = BC.
Therefore, the expression simplifies to Z = X + XY = X = A′.
Simplify Z = [A + B′C + D + EF ] [A + B′C + (D + EF )′] Substituting: Z = [ X + Y ] [ X + Y′ ] Then, by the uniting theorem (2-15D), the expression reduces to Z = X = A + B′C Simplify Z = (AB + C) (B′D + C′E′) + (AB + C)′ Substituting: Z = X′ Y + X By the elimination theorem (2-17): Z = X + Y = B′D + C′E′ + (AB + C)′ Note that in this example we let X = (AB + C)′ rather than (AB + C) in order to match the form of the elimination theorem (2-17).
The theorems of Boolean algebra that we have derived are summarized in Table 2-4. The theorem for multiplying out and factoring is derived in Unit 3.
Example 1 Example 2 Example 3 Boolean Algebra 49 2.7 Multiplying Out and Factoring The two distributive laws are used to multiply out an expression to obtain a sum-of- products (SOP) form. An expression is said to be in sum-of-products form when all products are the products of single variables. This form is the end result when an expression is fully multiplied out. It is usually easy to recognize a sum-of-products expression because it consists of a sum of product terms: AB′ + CD′E + AC′E′ (2-19) However, in degenerate cases, one or more of the product terms may consist of a single variable. For example, ABC′ + DEFG + H (2-20) and A + B′ + C + D′E (2-21) are still considered to be in sum-of-products form. The expression (A + B)CD + EF is not in sum-of-products form because the A + B term enters into a product but is not a single variable.
When multiplying out an expression, apply the second distributive law first when possible. For example, to multiply out (A + BC )(A + D + E ) let X = A, Y = BC, Z = D + E Uniting theorems: 1. XY + XY′ = X 1D. (X + Y )(X + Y′) = X Absorption theorems: 2. X + XY = X 2D. X(X + Y ) = X Elimination theorems: 3. X + X′Y = X + Y 3D. X(X′ + Y ) = XY Duality: 4. (X + Y + Z + · · ·)D = XYZ. . .
4D. (XYZ. . . )D = X + Y + Z + · · · Theorems for multiplying out and factoring: 5. (X + Y )(X′ + Z ) = XZ + X′Y 5D. XY + X′Z = (X + Z )(X′ + Y ) Consensus theorems: 6. XY + YZ + X′Z = XY + X′Z 6D.(X + Y )(Y + Z )(X′ + Z ) = (X + Y )(X′ + Z ) TABLE 2-4 Theorems of Boolean Algebra © Cengage Learning 2014 50 Unit 2 Then (X + Y)(X + Z) = X + YZ = A + BC(D + E) = A + BCD + BCE Of course, the same result could be obtained the hard way by multiplying out the original expression completely and then eliminating redundant terms: (A + BC)(A + D + E) = A + AD + AE + ABC + BCD + BCE = A(1 + D + E + BC) + BCD + BCE = A + BCD + BCE You will save yourself a lot of time if you learn to apply the second distributive law instead of doing the problem the hard way.
Both distributive laws can be used to factor an expression to obtain a product-of-sums form. An expression is in product-of-sums (POS) form when all sums are the sums of single variables. It is usually easy to recognize a product-of-sums expression since it consists of a product of sum terms: (A + B′)(C + D′ + E)(A + C′ + E′) (2-22) However, in degenerate cases, one or more of the sum terms may consist of a single variable. For example, (A + B)(C + D + E)F (2-23) and AB′C(D′ + E) (2-24) are still considered to be in product-of-sums form, but (A + B)(C + D) + EF is not. An expression is fully factored iff it is in product-of-sums form. Any expression not in this form can be factored further.
The following examples illustrate how to factor using the second distributive law: Factor A + B′CD. This is of the form X + YZ where X = A, Y = B′, and Z = CD, so A + B′CD = (X + Y)(X + Z) = (A + B′)(A + CD) A + CD can be factored again using the second distributive law, so A + B′CD = (A + B′)(A + C)(A + D) Factor AB′ + C′D.
AB′ + C′D = (AB′ + C′)(AB′ + D) ←note how X + YZ = (X + Y)(X + Z) was applied here = (A + C′)(B′ + C′)(A + D)(B′ + D) ←the second distributive law was applied again to each term Example 1 Example 2 Boolean Algebra 51 Factor C′D + C′E′ + G′H.
C′D + C′E′ + G′H = C′(D + E′) + G′H ←first apply the ordinary distributive law, XY + XZ = X(Y + Z) = (C′ + G′H)((D + E′) + G′H) ←then apply the second distributive law = (C′ + G′)(C′ + H)(D + E′ + G′)(D + E′ + H) ←now identify X, Y, and Z in each expression and complete the factoring As in Example 3, the ordinary distributive law should be applied before the second law when factoring an expression.
A sum-of-products expression can always be realized directly by one or more AND gates feeding a single OR gate at the circuit output. Figure 2-5 shows the cir-cuits for Equations (2-19) and (2-21). Inverters required to generate the comple-mented variables have been omitted.
A product-of-sums expression can always be realized directly by one or more OR gates feeding a single AND gate at the circuit output. Figure 2-6 shows the cir-cuits for Equations (2-22) and (2-24). Inverters required to generate the comple-ments have been omitted.
The circuits shown in Figures 2-5 and 2-6 are often referred to as two-level cir-cuits because they have a maximum of two gates in series between an input and the circuit output.
FIGURE 2-5 Circuits for Equations (2-19) and (2-21) © Cengage Learning 2014 A A B′ C D′ E A C′ E′ B′ C D′ E + + FIGURE 2-6 Circuits for Equations (2-22) and (2-24) © Cengage Learning 2014 A A B′ C D′ E A C′ E′ B′ C D′ E + + + + Example 3 52 Unit 2 2.8 Complementing Boolean Expressions The inverse or complement of any Boolean expression can easily be found by suc-cessively applying DeMorgan’s laws.
DeMorgan’s laws are easily generalized to n variables: (X1 + X2 + X3 + · · · + Xn)′ = X1′X2′X3′ . . . Xn′ (2-25) (X1X2X3 . . . Xn)′ = X1′ + X2′ + X3′ + · · · + Xn′ (2-26) For example, for n = 3, (X1 + X2 + X3)′ = (X1 + X2)′X′3 = X′1X′2 X′3 Referring to the OR operation as the logical sum and the AND operation as logical product, DeMorgan’s laws can be stated as The complement of the product is the sum of the complements.
The complement of the sum is the product of the complements.
To form the complement of an expression containing both OR and AND operations, DeMorgan’s laws are applied alternately.
Example 1 To find the complement of (A′ + B)C′, first apply (2-13) and then (2-12).
[(A′ + B)C′]′ = (A′ + B)′ + (C′)′ = AB′ + C [(AB′ + C)D′ + E]′ = [(AB′ + C)D′]′E′ (by (2-12)) = [(AB′ + C)′ + D]E′ (by (2-13)) = [(AB′)′C′ + D]E′ (by (2-12)) = [(A′ + B)C′ + D]E′ (by (2-13)) (2-27) Note that in the final expressions, the complement operation is applied only to single variables.
Example 2 Boolean Algebra 53 The inverse of F = A′B + AB′ is F′ = (A′B + AB′)′ = (A′B)′(AB′)′ = (A + B′)(A′ + B) = AA′ + AB + B′A′ + BB′ = A′B′ + AB We will verify that this result is correct by constructing a truth table for F and F′: In the table, note that for every combination of values of A and B for which F = 0, F′ = 1; and whenever F = 1, F′ = 0.
The dual of an expression may be found by complementing the entire expression and then complementing each individual variable. For example, to find the dual of AB′ + C, (AB′ + C)′ = (AB′)′C′ = (A′ + B)′C′, so (AB′ + C)D = (A + B′)C Problems 2.1 Prove the following theorems algebraically: (a) X(X′ + Y) = XY (b) X + XY = X (c) XY + XY′ = X (d) (A + B)(A + B′) = A 2.2 Illustrate the following theorems using circuits of switches: (a) X + XY = X (b) X + YZ = (X + Y)(X + Z) In each case, explain why the circuits are equivalent.
2.3 Simplify each of the following expressions by applying one of the theorems. State the theorem used.
(a) X′Y′Z + (X′Y′Z)′ (b) (AB′ + CD)(B′E + CD) (c) ACF + AC′F (d) A(C + D′B) + A′ (e) (A′B + C + D)(A′B + D) (f) (A + BC) + (DE + F )(A + BC)′ 2.4 For each of the following circuits, find the output and design a simpler circuit having the same output. (Hint: Find the circuit output by first finding the output of each gate, going from left to right, and simplifying as you go.) A B A′B AB′ F = A′B + AB′ A′B′ AB F′ = A′B′ + AB 0 0 0 0 0 1 0 1 0 1 1 0 1 0 0 0 1 0 0 1 1 0 0 0 1 1 0 0 0 0 1 1 54 Unit 2 2.5 Multiply out and simplify to obtain a sum of products: (a) (A + B)(C + B)(D′ + B)(ACD′ + E) (b) (A′ + B + C′)(A′ + C′ + D)(B′ + D′) 2.6 Factor each of the following expressions to obtain a product of sums: (a) AB + C′D′ (b) WX + WY′X + ZYX (c) A′BC + EF + DEF′ (d) XYZ + W′Z + XQ′Z (e) ACD′ + C′D′ + A′C (f) A + BC + DE (The answer to (f) should be the product of four terms, each a sum of three variables.) 2.7 Draw a circuit that uses only one AND gate and one OR gate to realize each of the following functions: (a) (A + B + C + D)(A + B + C + E)(A + B + C + F ) (b) WXYZ + VXYZ + UXYZ 2.8 Simplify the following expressions to a minimum sum of products.
(a) [(AB)′ + C′D]′ (b) [A + B(C′ + D)]′ (c) ((A + B′)C)′(A + B)(C + A)′ 2.9 Find F and G and simplify: A B A B B B A A Y E F D B C 1 (a) (b) + + + + + + A A T T G P F B R T R S S (a) (b) + + + + + Boolean Algebra 55 2.10 Illustrate the following equations using circuits of switches: (a) XY + XY′ = X (b) (X + Y′)Y = XY (c) X + X′ZY = X + YZ (d) (A + B)C + (A + B)C′ = A + B (e) (X + Y)(X + Z) = X + YZ (f) X(X + Y) = X 2.11 Simplify each of the following expressions by applying one of the theorems. State the theorem used.
(a) (A′ + B′ + C)(A′ + B′ + C)′ (b) AB(C′ + D) + B(C′ + D) (c) AB + (C′ + D)(AB)′ (d) (A′BF + CD′)(A′BF + CEG) (e) AB′ + (C + D)′ + E′F (f) A′(B + C)(D′E + F )′ + (D′E + F ) 2.12 Simplify each of the following expressions by applying one of the theorems. State the theorem used.
(a) (X + Y′Z) + (X + Y′Z)′ (b) [W + X′(Y + Z)][W′ + X′(Y + Z)] (c) (V′W + UX)′(UX + Y + Z + V′W) (d) (UV′ + W′X)(UV′ + W′X + Y′Z) (e) (W′ + X)(Y + Z′) + (W′ + X)′(Y + Z′) (f) (V′ + U + W)[(W + X) + Y + UZ′] + [(W + X) + UZ′ + Y] 2.13 For each of the following circuits, find the output and design a simpler circuit that has the same output. (Hint: Find the circuit output by first finding the output of each gate, going from left to right, and simplifying as you go.) (a) (b) (c) A B F1 + + + F2 A B + A B C D A B F3 + + + 56 Unit 2 (d) 2.14 Draw a circuit that uses only one AND gate and one OR gate to realize each of the following functions: (a) ABCF + ACEF + ACDF (b) (V + W + Y + Z)(U + W + Y + Z)(W + X + Y + Z) 2.15 Use only DeMorgan’s relationships and Involution to find the complements of the following functions: (a) f(A, B, C, D) = [A + (BCD)′][(AD)′ + B(C′ + A)] (b) f(A, B, C, D) = AB′C + (A′ + B + D)(ABD′ + B′) 2.16 Using just the definition of the dual of a Boolean algebra expression, find the duals of the following expressions: (a) f(A, B, C, D) = [A + (BCD)′][(AD)′ + B(C′ + A)] (b) f(A, B, C, D) = AB′C + (A′ + B + D)(ABD′ + B′) 2.17 For the following switching circuit, find the logic function expression describing the cir-cuit by the three methods indicated, simplify each expression, and show they are equal.
(a) subdividing it into series and parallel connections of subcircuits until single switches are obtained (b) finding all paths through the circuit (sometimes called tie sets), forming an AND term for each path and ORing the AND terms together (c) finding all ways of breaking all paths through the circuit (sometimes called cut sets), forming an OR term for each cut set and ANDing the OR terms together.
2.18 For each of the following Boolean (or switching) algebra expressions, indicate which, if any, of the following terms describe the expression: product term, sum-of-products, sum term, and product-of-sums. (More than one may apply.) (a) X′Y (b) XY′ + YZ (c) (X′ + Y)(WX + Z) (d) X + Z (e) (X′ + Y)(W + Z)(X + Y′ + Z′) A B C D Z A B C + + + B′ A′ C B A C′ Boolean Algebra 57 2.19 Construct a gate circuit using AND, OR, and NOT gates that corresponds one to one with the following switching algebra expression. Assume that inputs are available only in uncomplemented form. (Do not change the expression.) (WX′ + Y)[(W + Z)′ + (XYZ′)] 2.20 For the following switch circuit: (a) derive the switching algebra expression that corresponds one to one with the switch circuit.
(b) derive an equivalent switch circuit with a structure consisting of a parallel connection of groups of switches connected in series. (Use 9 switches.) (c) derive an equivalent switch circuit with a structure consisting of a series connection of groups of switches connected in parallel. (Use 6 switches.) 2.21 In the following circuit, F = (A′ + B)C. Give a truth table for G so that H is as speci-fied in its truth table. If G can be either 0 or 1 for some input combination, leave its value unspecified.
2.22 Factor each of the following expressions to obtain a product of sums: (a) A′B′ + A′CD + A′DE′ (b) H′I′ + JK (c) A′BC + A′B′C + CD′ (d) A′B′ + (CD′ + E) (e) A′B′C + B′CD′ + EF′ (f) WX′Y + W′X′ + W′Y′ 2.23 Factor each of the following expressions to obtain a product of sums: (a) W + U′YV (b) TW + UY′ + V (c) A′B′C + B′CD′ + B′E′ (d) ABC + ADE′ + ABF′ 2.24 Simplify the following expressions to a minimum sum of products. Only individual variables should be complemented.
(a) [(XY′)′ + (X′ + Y)′Z] (b) (X + (Y′(Z + W)′)′)′ (c) [(A′ + B′)′ + (A′B′C)′ + C′D]′ (d) (A + B)CD + (A + B)′ B′ A′ C A C′ D + A F G B C A B C H A B C H 0 0 0 0 0 0 1 1 0 1 0 1 0 1 1 1 1 0 0 0 1 0 1 1 1 1 0 0 1 1 1 1 58 Unit 2 2.25 For each of the following functions find a sum-of-products expression for F′.
(a) F(P, Q, R, S) = (R′ + PQ)S (b) F(W, X, Y, Z) = X + YZ(W + X′) (c) F(A, B, C, D) = A′ + B′ + ACD 2.26 Find F, G, and H, and simplify: (a) A B B C F + + (b) A B C G + (c) W X Y Z H + 2.27 Draw a circuit that uses two OR gates and two AND gates to realize the following function: F = (V + W + X)(V + X + Y)(V + Z) 2.28 Draw a circuit to realize the function: F = ABC + A′BC + AB′C + ABC′ (a) using one OR gate and three AND gates. The AND gates should have two inputs.
(b) using two OR gates and two AND gates. All of the gates should have two inputs.
Boolean Algebra 59 2.29 Prove the following equations using truth tables: (a) (X + Y)(X′ + Z) = XZ + X′Y (b) (X + Y)(Y + Z)(X′ + Z) = (X + Y)(X′ + Z) (c) XY + YZ + X′Z = XY + X′Z (d) (A + C)(AB + C′) = AB + AC′ (e) W′XY + WZ = (W′ + Z)(W + XY) (Note: Parts (a), (b), and (c) are theorems that will be introduced in Unit 3.) 2.30 Show that the following two gate circuits realize the same function.
X Y + X Z f + F f + f + f + Y Z G (a) (b) 60 Boolean Algebra (Continued) U N I T 3 Objectives When you complete this unit, you should know from memory and be able to use any of the laws and theorems of Boolean algebra listed in Unit 2. Specifically, you should be able to 1. Apply these laws and theorems to the manipulation of algebraic expressions including: a. Simplifying an expression b. Finding the complement of an expression c. Multiplying out and factoring an expression 2. Prove any of the theorems using a truth table or give an algebraic proof.
3. Define the exclusive-OR and equivalence operations. State, prove, and use the basic theorems that concern these operations.
4. Use the consensus theorem to delete terms from and add terms to a switching algebra expression.
5. Given an equation, prove algebraically that it is valid or show that it is not valid.
Boolean Algebra (Continued) 61 Study Guide 1. Study Section 3.1, Multiplying Out and Factoring Expressions.
(a) List three laws or theorems which are useful when multiplying out or fac-toring expressions.
(b) Use Equation (3-3) to factor each of the following: ab′c + bd = abc + (ab)′d = (c) In the following example, first group the terms so that (3-2) can be applied two times. F1 = (x + y′ + z)(w′ + x′ + y)(w + x + y′)(w′ + y + z′) After applying (3-2), apply (3-3) and then finish multiplying out by using (3-1).
If we did not use (3-2) and (3-3) and used only (3-1) on the original F1 expression, we would generate many more terms: F1 = (w′x + w′y′ + w′z + xx′ + x′y′ + x′z + xy + yy′ + yz) (ww′ + w′x + w′y′ + wy + xy + yy′ + wz′ + xz′ + y′z′) = (w′x + w′xy′ + w′xz + · · · + yzy′z′) 49 terms in all This is obviously a very inefficient way to proceed! The moral to this story is to first group the terms and apply (3-2) and (3-3) where possible.
(d) Work Programmed Exercise 3.1. Then work Problem 3.6, being careful not to introduce any unnecessary terms in the process.
(e) In Unit 2 you learned how to factor a Boolean expression, using the two distributive laws. In addition, this unit introduced use of the theorem XY + X′Z = (X + Z)(X′ + Y) in the factoring process. Careful choice of the order in which these laws and theorems are applied may cut down the amount of work required to factor an expression. When factoring, it is best to apply Equation (3-1) first, 62 Unit 3 using as X the variable or variables which appear most frequently. Then Equations (3-2) and (3-3) can be applied in either order, depending on circumstances.
(f ) Work Programmed Exercise 3.2. Then work Problem 3.7 .
2. Checking your answers: A good way to partially check your answers for correctness is to substitute 0’s or 1’s for some of the variables. For example, if we substitute A = 1 in the first and last expression in Equation (3-5), we get 1 · C + 0 · BD′ + 0 · BE + 0 · C′DE = (1 + B + C′)(1 + B + D) · (1 + B + E)(1 + D′ + E )(0 + C ) C = 1 · 1 · 1 · 1 · C ✓ Similarly, substituting A = 0, B = 0, we get 0 + 0 + 0 + C′DE = (0 + C′)(0 + D)(0 + E )(D′ + E )(1 + C) = C′DE ✓ Verify that the result is also correct when A = 0 and B = 1.
3. The method which you use to get your answer is very important in this unit. If it takes you two pages of algebra and one hour of time to work a problem that can be solved in 10 minutes with three lines of work, you have not learned the mate-rial in this unit! Even if you get the correct answer, your work is not satisfactory if you worked the problem by an excessively long and time-consuming method. It is important that you learn to solve simple problems in a simple manner—otherwise, when you are asked to solve a complex problem, you will get bogged down and never get the answer. When you are given a problem to solve, do not just plunge in, but first ask yourself, “What is the easiest way to work this problem?” For example, when you are asked to multiply out an expression, do not just multiply it out by brute force, term by term. Instead, ask yourself, “How can I group the terms and which theorems should I apply first in order to reduce the amount of work?” (See Study Guide Part 1.) After you have worked out Problems 3.6 and 3.7 , compare your solutions with those in the solution book. If your solution required substan-tially more work than the one in the solution book, rework the problem and try to get the answer in a more straightforward manner.
Boolean Algebra (Continued) 63 4. Study Section 3.2, Exclusive-OR and Equivalence Operations.
(a) Prove Theorems (3-8) through (3-13). You should be able to prove these both algebraically and by using a truth table.
(b) Show that (xy′ + x′y)′ = xy + x′y′. Memorize this result.
(c) Prove Theorem (3-15).
(d) Show that (x ≡0) = x′, (x ≡x) = 1, and (x ≡y)′ = (x ≡y′).
(e) Express (x ≡y)′ in terms of exclusive OR.
(f ) Work Problems 3.8 and 3.9.
5. Study Section 3.3, The Consensus Theorem. The consensus theorem is an impor-tant method for simplifying switching functions.
(a) In each of the following expressions, find the consensus term and eliminate it: abc′d + a′be + bc′de (a′ + b + c)(a + d)(b + c + d) ab′c + a′bd + bcd′ + a′bc (b) Eliminate two terms from the following expression by applying the con-sensus theorem: A′B′C + BC′D′ + A′CD + AB′D′ + BCD + AC′D′ (Hint: First, compare the first term with each of the remaining terms to see if a consensus exists, then compare the second term with each of the remaining terms, etc.) 64 Unit 3 (c) Study the example given in Equations (3-22) and (3-23) carefully. Now let us start with the four-term form of the expression (Equation 3-22): A′C′D + A′BD + ABC + ACD′ Can this be reduced directly to three terms by the application of the consen-sus theorem? Before we can reduce this expression, we must add another term. Which term can be added by applying the consensus theorem?
Add this term, and then reduce the expression to three terms. After this reduction, can the term which was added be removed? Why not?
(d) Eliminate two terms from the following expression by applying the dual consensus theorem: (a′ + c′ + d)(a′ + b + c)(a + b + d)(a′ + b + d)(b + c′ + d) Use brackets to indicate how you formed the consensus terms. (Hint: First, find the consensus of the first two terms and eliminate it.) (e) Derive Theorem (3-3) by using the consensus theorem. (f) Work Programmed Exercise 3.3. Then work Problem 3.10.
6. Study Section 3.4, Algebraic Simplification of Switching Expressions.
(a) What theorems are used for: Combining terms?
Eliminating terms?
Eliminating literals?
Adding redundant terms?
Factoring or multiplying out?
(b) Note that in the example of Equation (3-27), the redundant term WZ′ was added and then was eliminated later after it had been used to eliminate another term. Why was it possible to eliminate WZ′ in this example?
Boolean Algebra (Continued) 65 If a term has been added by the consensus theorem, it may not always be possible to eliminate the term later by the consensus theorem. Why?
(c) You will need considerable practice to develop skill in simplifying switch-ing expressions. Work through Programmed Exercises 3.4 and 3.5.
(d) Work Problem 3.11.
(e) When simplifying an expression using Boolean algebra, two frequently asked questions are (1) Where do I begin?
(2) How do I know when I am finished?
In answer to (1), it is generally best to try simple techniques such as combining terms or eliminating terms and literals before trying more complicated things such as using the consensus theorem or adding redundant terms. Question (2) is gener-ally difficult to answer because it may be impossible to simplify some expressions without first adding redundant terms. We will usually tell you how many terms to expect in the minimum solution so that you will not have to waste time trying to simplify an expression which is already minimized. In Units 5 and 6, you will learn systematic techniques which will guarantee finding the minimum solution.
7. Study Section 3.5, Proving Validity of an Equation.
(a) When attempting to prove that an equation is valid, is it permissible to add the same expression to both sides? Explain.
(b) Work Problem 3.12.
(c) Show that (3-33) and (3-34) are true by considering both x = 0 and x = 1.
(d) Given that a′(b + d′) = a′(b + e′), the following “proof” shows that d = e: a′(b + d′) = a′(b + e′) a + b′d = a + b′e b′d = b′e d = e State two things that are wrong with the “proof.” Give a set of values for a, b, d, and e that demonstrates that the result is incorrect.
8. Reread the objectives of this unit. When you take the readiness test, you will be expected to know from memory the laws and theorems listed in Unit 2. Where appropriate, you should know them “forward and backward”; that is, given either side of the equation, you should be able to supply the other. Test yourself to see if you can do this. When you are satisfied that you can meet the objectives, take the readiness test.
66 In this unit we continue our study of Boolean algebra to learn additional methods for manipulating Boolean expressions. We introduce another theorem for multiplying out and factoring that facilitates conversion between sum-of-products and product-of-sums expressions. These algebraic manipulations allow us to realize a switching func-tion in a variety of forms. The exclusive-OR and equivalence operations are introduced along with examples of their use. The consensus theorem provides a useful method for simplifying an expression. Then methods for algebraic simplification are reviewed and summarized. The unit concludes with methods for proving the validity of an equation.
3.1 Multiplying Out and Factoring Expressions Given an expression in product-of-sums form, the corresponding sum-of-products expression can be obtained by multiplying out, using the two distributive laws: X(Y + Z) = XY + XZ (3-1) (X + Y)(X + Z) = X + YZ (3-2) In addition, the following theorem is very useful for factoring and multiplying out: $'& (X + Y )(X′ + Z) = XZ + X′Y (''''' (3-3) Note that the variable that is paired with X on one side of the equation is paired with X′ on the other side, and vice versa. In switching algebra, (3-3) can be proved by showing that both sides of the equation are the same for X = 0 and also for X = 1.
If X = 0, (3-3) reduces to Y(1 + Z ) = 0 + 1 · Y or Y = Y.
If X = 1, (3-3) reduces to (1 + Y )Z = Z + 0 · Y or Z = Z.
An algebraic proof valid in any Boolean algebra is (X + Y )(X′ + Z) = XX′ + XZ + X′Y + YZ = 0 + XZ + X′Y + YZ = XZ + X′Y (using consensus) The following example illustrates the use of Theorem (3-3) for f actoring: $ '' & AB + A′C = (A + C)(A′ + B) (''' Boolean Algebra (Continued) Boolean Algebra (Continued) 67 AC + A′BD′ + A′BE + A′C′DE = AC + A′(BD′ + BE + C′DE) XZ X′ Y = (A + BD′ + BE + C′DE)(A′ + C) = A + C′DE + B(D′ + E) X Y Z Note that the theorem can be applied when we have two terms, one which contains a variable and another which contains its complement.
Theorem (3-3) is very useful for multiplying out expressions. In the following example, we can apply (3-3) because one factor contains the variable Q, and the other factor contains Q′. (Q + AB′)(C′D + Q′) = QC′D + Q′AB′ If we simply multiplied out using the distributive law, we would get four terms instead of two: (Q + AB′)(C′D + Q′) = QC′D + QQ′ + AB′C′D + AB′Q′ Because the term AB′C′D is difficult to eliminate, it is much better to use (3-3) instead of the distributive law.
In general, when we multiply out an expression, we should use (3-3) along with (3-1) and (3-2). To avoid generating unnecessary terms when multiplying out, (3-2) and (3-3) should generally be applied before (3-1), and terms should be grouped to expedite their application.
Example (A + B + C′)(A + B + D)(A + B + E)(A + D′ + E)(A′ + C) = (A + B + C′D)(A + B + E)[AC + A′(D′ + E)] = (A + B + C′DE)(AC + A′D′ + A′E) = AC + ABC + A′BD′ + A′BE + A′C′DE (3-4) What theorem was used to eliminate ABC? (Hint: let X = AC.) In this example, if the ordinary distributive law (3-1) had been used to multiply out the expression by brute force, 162 terms would have been generated, and 158 of these terms would then have to be eliminated.
The same theorems that are useful for multiplying out expressions are useful for factoring. By repeatedly applying (3-1), (3-2), and (3-3), any expression can be con-verted to a product-of-sums form.
Example of Factoring a a a a a 68 Unit 3 = (A + B + C′DE)(A + C′DE + D′ + E)(A′ + C) = (A + B + C′)(A + B + D)(A + B + E)(A + D′ + E)(A′ + C) (3-5) This is the same expression we started with in (3-4).
3.2 Exclusive-OR and Equivalence Operations The exclusive-OR operation (⊕) is defined as follows: 0 ⊕ 0 = 0 0 ⊕ 1 = 1 1 ⊕ 0 = 1 1 ⊕ 1 = 0 The truth table for X ⊕ Y is From this table, we can see that X ⊕ Y = 1 iff X = 1 or Y = 1, but not both. The ordinary OR operation, which we have previously defined, is sometimes called inclu-sive OR because X + Y = 1 iff X = 1 or Y = 1, or both.
Exclusive OR can be expressed in terms of AND and OR. Because X ⊕ Y = 1 iff X is 0 and Y is 1 or X is 1 and Y is 0, we can write X ⊕ Y = X′Y + XY′ (3-6) The first term in (3-6) is 1 if X = 0 and Y = 1; the second term is 1 if X = 1 and Y = 0. Alternatively, we can derive Equation (3-6) by observing that X ⊕ Y = 1 iff X = 1 or Y = 1 and X and Y are not both 1. Thus, X ⊕ Y = (X + Y )(XY )′ = (X + Y )(X′ + Y′) = X′Y + XY′ (3-7) In (3-7), note that (XY)′ = 1 if X and Y are not both 1.
We will use the following symbol for an exclusive-OR gate: X Y X ⊕ Y 0 0 0 0 1 1 1 0 1 1 1 0 ⊕ X Y X ⊕ Y Boolean Algebra (Continued) 69 The following theorems apply to exclusive OR: X ⊕ 0 = X (3-8) X ⊕ 1 = X′ (3-9) X ⊕ X = 0 (3-10) X ⊕ X′ = 1 (3-11) X ⊕ Y = Y ⊕ X (commutative law) (3-12) (X ⊕ Y) ⊕ Z = X ⊕ (Y ⊕ Z) = X ⊕ Y ⊕ Z (associative law) (3-13) X(Y ⊕ Z) = XY ⊕ XZ (distributive law) (3-14) (X ⊕ Y)′ = X ⊕ Y′ = X′ ⊕ Y = XY + X′Y′ (3-15) Any of these theorems can be proved by using a truth table or by replacing X ⊕ Y with one of the equivalent expressions from Equation (3-7). Proof of the distributive law follows: XY ⊕ XZ = XY(XZ)′ + (XY )′XZ = XY(X′ + Z′) + (X′ + Y′)XZ = XYZ′ + XY′Z = X(YZ′ + Y′Z) = X(Y ⊕ Z ) The equivalence operation (≡) is defined by (0 ≡0) = 1 (0 ≡1) = 0 (1 ≡0) = 0 (1 ≡1) = 1 (3-16) The truth table for X ≡Y is From the definition of equivalence, we see that (X ≡Y) = 1 iff X = Y. Because (X ≡Y) = 1 iff X = Y = 1 or X = Y = 0, we can write (X ≡Y) = XY + X′Y′ (3-17) Equivalence is the complement of exclusive OR: (X ⊕ Y )′ = (X′Y + XY′)′ = (X + Y′)(X′ + Y ) = XY + X′Y′ = (X ≡Y ) (3-18) Just as for exclusive OR, equivalence is commutative and associative.
We will use the following symbol for an equivalence gate: X Y X ≡Y 0 0 1 0 1 0 1 0 0 1 1 1 X ≡ Y X Y 70 Unit 3 Because equivalence is the complement of exclusive OR, an alternate symbol for the equivalence gate is an exclusive-OR gate with a complemented output: The equivalence gate is also called an exclusive-NOR gate.
In order to simplify an expression which contains AND and OR as well as exclusive OR and equivalence, it is usually desirable to first apply (3-6) and (3-17) to eliminate the ⊕ and ≡operations. As an example, we will simplify F = (A′B ≡C) + (B ⊕ AC′) By (3-6) and (3-17), F = [(A′B)C + (A′B)′C′] + [B′(AC′) + B(AC′)′] = A′BC + (A + B′)C′ + AB′C′ + B(A′ + C) = B(A′C + A′ + C) + C′(A + B′ + AB′) = B(A′ + C) + C′(A + B′) When manipulating an expression that contains several exclusive-OR or equiva-lence operations, it is useful to note that (XY′ + X′Y)′ = XY + X′Y′ (3-19) For example, A′ ⊕ B ⊕ C = [A′B′ + (A′)′B] ⊕ C = (A′B′ + AB)C′ + (A′B′ + AB′)C (by (3-6)) = (A′B′ + AB)C′ + (A′B + AB′)C (by (3-19)) = A′B′C′ + ABC′ + A′BC + AB′C 3.3 The Consensus Theorem The consensus theorem is very useful in simplifying Boolean expressions. Given an expression of the form XY + X′Z + YZ, the term YZ is redundant and can be eliminated to form the equivalent expression XY + X′Z.
The term that was eliminated is referred to as the consensus term. Given a pair of terms for which a variable appears in one term and the complement of that vari-able in another, the consensus term is formed by multiplying the two original terms together, leaving out the selected variable and its complement. For example, the consensus of ab and a′c is bc; the consensus of abd and b′de′ is (ad)(de′) = ade′. The consensus of terms ab′d and a′bd′ is 0.
The consensus theorem, given in Equation (2-18), is XY + X′Z + YZ = XY + X′Z (3-20) ⊕ X Y (X ⊕ Y)′ = (X ≡ Y) Boolean Algebra (Continued) 71 The consensus theorem can be used to eliminate redundant terms from Boolean expressions. For example, in the following expression, b′c is the consensus of a′b′ and ac, and ab is the consensus of ac and bc′, so both consensus terms can be eliminated: a′b′ + ac + bc′ + b′c + ab = a′b′ + ac + bc′ The brackets indicate how the consensus terms are formed.
The dual form of the consensus theorem, given in Equation (2-18D), is (X + Y)(X′ + Z)(Y + Z) = (X + Y)(X′ + Z) (3-21) Note again that the key to recognizing the consensus term is to first find a pair of terms, one of which contains a variable and the other its complement. In this case, the consensus is formed by adding this pair of terms together leaving out the selected variable and its complement. In the following expression, (a + b + d′) is a consensus term and can be eliminated by using the dual consensus theorem: (a + b + c′)(a + b + d′)(b + c + d′) = (a + b + c′)(b + c + d′) The final result obtained by application of the consensus theorem may depend on the order in which terms are eliminated.
A′C′D + A′BD + BCD + ABC + ACD′ (3-22) ↓ Example First, we eliminate BCD as shown. (Why can it be eliminated?) Now that BCD has been eliminated, it is no longer there, and it cannot be used to eliminate another term. Checking all pairs of terms shows that no additional terms can be eliminated by the consensus theorem.
Now we start over again: A′C′D + A′BD + BCD + ABC + ACD′ (3-23) This time, we do not eliminate BCD; instead we eliminate two other terms by the consensus theorem. After doing this, observe that BCD can no longer be eliminated. Note that the expression reduces to four terms if BCD is eliminated first, but that it can be reduced to three terms if BCD is not eliminated.
Sometimes it is impossible to directly reduce an expression to a minimum number of terms by simply eliminating terms. It may be necessary to first add a term using the consensus theorem and then use the added term to eliminate other terms. For example, consider the expression F = ABCD + B′CDE + A′B′ + BCE′ If we compare every pair of terms to see if a consensus term can be formed, we find that the only consensus terms are ACDE (from ABCD and B′CDE) and A′CE′ 72 Unit 3 (from A′B′ and BCE′). Because neither of these consensus terms appears in the original expression, we cannot directly eliminate any terms using the consensus theorem. However, if we first add the consensus term ACDE to F, we get F = ABCD + B′CDE + A′B′ + BCE′ + ACDE Then, we can eliminate ABCD and B′CDE using the consensus theorem, and F reduces to F = A′B′ + BCE′ + ACDE The term ACDE is no longer redundant and cannot be eliminated from the final expression.
3.4 Algebraic Simplification of Switching Expressions In this section we review and summarize methods for simplifying switching expres-sions, using the laws and theorems of Boolean algebra. This is important because simplifying an expression reduces the cost of realizing the expression using gates. Later, we will learn graphical methods for simplifying switching functions, but we will learn algebraic methods first. In addition to multiplying out and factoring, three basic ways of simplifying switching functions are combining terms, eliminating terms, and eliminating literals.
1. Combining terms. Use the theorem XY + XY′ = X to combine two terms. For example, abc′d′ + abcd′ = abd′ [X = abd′, Y = c] (3-24) When combining terms by this theorem, the two terms to be combined should contain exactly the same variables, and exactly one of the variables should appear complemented in one term and not in the other. Because X + X = X, a given term may be duplicated and combined with two or more other terms. For example, ab′c + abc + a′bc = ab′c + abc + abc + a′bc = ac + bc The theorem still can be used, of course, when X and Y are replaced with more com-plicated expressions. For example, (a + bc)(d + e′) + a′(b′ + c′)(d + e′) = d + e′ [X = d + e′, Y = a + bc, Y′ = a′(b′ + c′)] Boolean Algebra (Continued) 73 2. Eliminating terms. Use the theorem X + XY = X to eliminate redundant terms if possible; then try to apply the consensus theorem (XY + X′Z + YZ = XY + X′Z) to eliminate any consensus terms. For example, a′b + a′bc = a′b [X = a′b] a′bc′ + bcd + a′bd = a′bc′ + bcd [X = c, Y = bd, Z = a′b] (3-25) 3. Eliminating literals. Use the theorem X + X′Y = X + Y to eliminate redundant literals. Simple factoring may be necessary before the theorem is applied.
Example A′B + A′B′C′D′ + ABCD′ = A′(B + B′C′D′) + ABCD′ = A′(B + C′D′) + ABCD′ = B(A′ + ACD′) + A′C′D′ = B(A′ + CD′) + A′C′D′ = A′B + BCD′ + A′C′D′ (3-26) The expression obtained after applying steps 1, 2, and 3 will not necessarily have a minimum number of terms or a minimum number of literals. If it does not and no further simplification can be made using steps 1, 2, and 3, the deliberate introduction of redundant terms may be necessary before further simplification can be made.
4. Adding redundant terms. Redundant terms can be introduced in several ways such as adding xx′, multiplying by (x + x′), adding yz to xy + x′z, or adding xy to x. When possible, the added terms should be chosen so that they will combine with or eliminate other terms.
WX + XY + X′Z′ + WY′Z′ (add WZ′ by consensus theorem) = WX + XY + X′Z′ + WY′Z′ + WZ′ (eliminate WY′Z′) = WX + XY + X′Z′ + WZ′ (eliminate WZ′) = WX + XY + X′Z′ (3-27) The following comprehensive example illustrates the use of all four methods: A′B′C′D′ + A′BC′D′ + A′BD + A′BC′D + ABCD + ACD′ + B′CD′ ➀A′C′D′ ➁ = A′C′D′ + BD(A′ + AC) + ACD′ + B′CD′ ➂ = A′C′D′ + A′BD + BCD + ACD′ + B′CD′ + ABC ➃ Example Example 74 Unit 3 consensus ACD′ = A′C′D′ + A′BD + BCD + ACD′ + B′CD′ + ABC consensus BCD = A′C′D′ + A′BD + B′CD′ + ABC (3-28) What theorems were used in steps 1, 2, 3, and 4?
If the simplified expression is to be left in a product-of-sums form instead of a sum-of-products form, the duals of the preceding theorems should be applied.
Example (A′ + B′ + C′)(A′ + B′ + C)(B′ + C)(A + C)(A + B + C) ➀(A′ + B′) ➁ = (A′ + B′)(B′ + C)(A + C) = (A′ + B′)(A + C) ➂ (3-29) What theorems were used in steps 1, 2, and 3?
In general, there is no easy way of determining when a Boolean expression has a minimum number of terms or a minimum number of literals. Systematic methods for finding minimum sum-of-products and minimum product-of-sums expressions will be discussed in Units 5 and 6.
3.5 Proving Validity of an Equation Often we will need to determine if an equation is valid for all combinations of values of the variables. Several methods can be used to determine if an equation is valid: 1. Construct a truth table and evaluate both sides of the equation for all combina-tions of values of the variables. (This method is rather tedious if the number of variables is large, and it certainly is not very elegant.) 2. Manipulate one side of the equation by applying various theorems until it is identical with the other side.
3. Reduce both sides of the equation independently to the same expression.
4. It is permissible to perform the same operation on both sides of the equation provided that the operation is reversible. For example, it is all right to com-plement both sides of the equation, but it is not permissible to multiply both sides of the equation by the same expression. (Multiplication is not reversible because division is not defined for Boolean algebra.) Similarly, it is not permis-sible to add the same term to both sides of the equation because subtraction is not defined for Boolean algebra.
Boolean Algebra (Continued) 75 To prove that an equation is not valid, it is sufficient to show one combination of values of the variables for which the two sides of the equation have different values. When using method 2 or 3 above to prove that an equation is valid, a useful strat-egy is to 1. First reduce both sides to a sum of products (or a product of sums).
2. Compare the two sides of the equation to see how they differ.
3. Then try to add terms to one side of the equation that are present on the other side.
4. Finally try to eliminate terms from one side that are not present on the other.
Whatever method is used, frequently compare both sides of the equation and let the difference between them serve as a guide for what steps to take next.
Show that A′BD′ + BCD + ABC′ + AB′D = BC′D′ + AD + A′BC Starting with the left side, we first add consensus terms, then combine terms, and finally eliminate terms by the consensus theorem.
A′BD′ + BCD + ABC′ + AB′D = A′BD′ + BCD + ABC′ + AB′D + BC′D + A′BC + ABD (add consensus of A′BD′ and ABC′) (add consensus of A′BD′ and BCD) (add consensus of BCD and ABC′) = AD + A′BD′ + BCD + ABC′ + BC′D′ + A′BC = BC′D′ + AD + A′BC (eliminate consensus of BC′D′ and AD) (eliminate consensus of AD and A′BC) (eliminate consensus of BC′D′ and A′BC) (3-30) Show that the following equation is valid: A′BC′D + (A′ + BC)(A + C′D′) + BC′D + A′BC′ = ABCD + A′C′D′ + ABD + ABCD′ + BC′D First, we will reduce the left side: A′BC′D + (A′ + BC)(A + C′D′) + BC′D + A′BC′ (eliminate A′BC′D using absorption) = (A′ + BC)(A + C′D′) + BC′D + A′BC′ (multiply out using (3-3)) = ABC + A′C′D′ + BC′D + A′BC′ (eliminate A′BC′ by consensus) = ABC + A′C′D′ + BC′D Example 2 Example 1 76 Unit 3 Now we will reduce the right side: = ABCD + A′C′D′ + ABD + ABCD′ + BC′D (combine ABCD and ABCD′) = ABC + A′C′D′ + ABD + BC′D (eliminate ABD by consensus) = ABC + A′C′D′ + BC′D Because both sides of the original equation were independently reduced to the same expression, the original equation is valid.
As we have previously observed, some of the theorems of Boolean algebra are not true for ordinary algebra. Similarly, some of the theorems of ordinary algebra are not true for Boolean algebra. Consider, for example, the cancellation law for ordinary algebra: If x + y = x + z, then y = z (3-31) The cancellation law is not true for Boolean algebra. We will demonstrate this by constructing a counterexample in which x + y = x + z but y = z. Let x = 1, y = 0, z = 1. Then, 1 + 0 = 1 + 1 but 0 ≠1 In ordinary algebra, the cancellation law for multiplication is If xy = xz, then y = z (3-32) This law is valid provided x ≠0.
In Boolean algebra, the cancellation law for multiplication is also not valid when x = 0. (Let x = 0, y = 0, z = 1; then 0 · 0 = 0 · 1, but 0 ≠1). Because x = 0 about half of the time in switching algebra, the cancellation law for multiplication cannot be used.
Even though Statements (3-31) and (3-32) are generally false for Boolean alge-bra, the converses If y = z, then x + y = x + z (3-33) If y = z, then xy = xz (3-34) are true. Thus, we see that although adding the same term to both sides of a Boolean equation leads to a valid equation, the reverse operation of canceling or subtracting a term from both sides generally does not lead to a valid equation. Similarly, multiplying both sides of a Boolean equation by the same term leads to a valid equation, but not conversely. When we are attempting to prove that an equation is valid, it is not permissible to add the same expression to both sides of the equation or to multiply both sides by the same expression, because these operations are not reversible.
Boolean Algebra (Continued) 77 Programmed Exercise 3.1 Cover the answers to this exercise with a sheet of paper and slide it down as you check your answers. Write your answer in the space provided before looking at the correct answer.
The following expression is to be multiplied out to form a sum of products: (A + B + C′)(A′ + B′ + D)(A′ + C + D′)(A + C′ + D) First, find a pair of sum terms which have two literals in common and apply the sec-ond distributive law. Also, apply the same law to the other pair of terms.
Answer (A + C′ + BD)[A′ + (B′ + D)(C + D′)] (Note: This answer was obtained by using (X + Y)(X + Z) = X + YZ.) Next, find a pair of sum terms which have a variable in one and its complement in the other. Use the appropriate theorem to multiply these sum terms together without introducing any redundant terms. Apply the same theorem a second time.
Answer (A + C′ + BD)(A′ + B′D′ + CD) = A(B′D′ + CD) + A′(C′ + BD) or A(B′ + D)(C + D′) + A′(C′ + BD) = A(B′D′ + CD) + A′(C′ + BD) (Note: This answer was obtained using (X + Y)(X′ + Z) = XZ + X′Y.) Complete the problem by multiplying out using the ordinary distributive law.
Final Answer AB′D′ + ACD + A′C′ + A′BD Programmed Exercise 3.2 Cover the answers to this exercise with a sheet of paper and slide it down as you check your answers. Write your answer in the space provided before looking at the correct answer.
The following expression is to be factored to form a product of sums: WXY′ + W′X′Z + WY′Z + W′YZ′ First, factor as far as you can using the ordinary distributive law.
78 Unit 3 Answer WY′(X + Z) + W′(X′Z + YZ′) Next, factor further by using a theorem which involves a variable and its comple-ment. Apply this theorem twice.
Answer (W + X′Z + YZ′)[W′ + Y′(X + Z)] = [W + (X′ + Z′)(Y + Z)][W′ + Y′(X + Z)] or WY′(X + Z) + W′(X′ + Z′)(Y + Z) = [W + (X′ + Z′)(Y + Z)][W′ + Y′(X + Z)] [Note: This answer was obtained by using AB + A′C = (A + C)(A′ + B).] Now, complete the factoring by using the second distributive law.
Final answer (W + X′ + Z′)(W + Y + Z)(W′ + Y′)(W′ + X + Z) Programmed Exercise 3.3 Cover the answers to this exercise with a sheet of paper and slide it down as you check your answers. Write your answer in the space provided before looking at the correct answer.
The following expression is to be simplified using the consensus theorem: AC′ + AB′D + A′B′C + A′CD′ + B′C′D′ First, find all of the consensus terms by checking all pairs of terms.
Answer The consensus terms are indicated.
AC′ AB′D AB′C′ A′B′C A′B′D′ A′B′D′ A′CD′ B′CD B′C′D′ + + + + Boolean Algebra (Continued) 79 Can the original expression be simplified by the direct application of the consensus theorem?
Answer No, because none of the consensus terms appears in the original expression.
Now add the consensus term B′CD to the original expression. Compare the added term with each of the original terms to see if any consensus exists. Eliminate as many of the original terms as you can.
Answer (AB′D) AC′ + AB′D + A′B′C + A′CD′ + B′C′D′ + B′CD (A′B′C) Now that we have eliminated two terms, can B′CD also be eliminated? What is the final reduced expression?
Answer No, because the terms used to form B′CD are gone. Final answer is AC′ + A′CD′ + B′C′D′ + B′CD Programmed Exercise 3.4 Keep the answers to this exercise covered with a sheet of paper and slide it down as you check your answers.
Problem: The following expression is to be simplified ab′cd′e + acd + acf′gh′ + abcd′e + acde′ + e′h′ State a theorem which can be used to combine a pair of terms and apply it to com-bine two of the terms in the above expression.
Answer Apply XY + XY′ = X to the terms ab′cd′e and abcd′e, which reduces the expression to acd′e + acd + acf ′gh′ + acde′ + e′h′ 80 Unit 3 Now state a theorem (other than the consensus theorem) which can be used to eliminate terms and apply it to eliminate a term in this expression.
Answer Apply X + XY = X to eliminate acde′. (What term corresponds toX?) The result is acd′e + acd + acf′gh′ + e′h′ Now state a theorem that can be used to eliminate literals and apply it to eliminate a literal from one of the terms in this expression. (Hint: It may be necessary to fac-tor out some common variables from a pair of terms before the theorem can be applied.) Answer Use X + X′Y = X + Y to eliminate a literal from acd′e. To do this, first factor ac out of the first two terms: acd′e + acd = ac(d + d′e). After eliminating d′, the resulting expression is ace + acd + acf′gh′ + e′h′ (a) Can any term be eliminated from this expression by the direct application of the consensus theorem?
(b) If not, add a redundant term using the consensus theorem, and use this redun-dant term to eliminate one of the other terms.
(c) Finally, reduce your expression to three terms.
Answer (a) No (b) Add the consensus of ace and e′h′: ace + acd + acf′gh′ + e′h′ + ach′ Now eliminate acf′gh′ (by X + XY = X) ace + acd + e′h′ + ach′ (c) Now eliminate ach′ by the consensus theorem. The final answer is ace + acd + e′h′ Boolean Algebra (Continued) 81 Programmed Exercise 3.5 Keep the answers to this exercise covered with a sheet of paper and slide it down as you check your answers.
Z = (A + C′ + F ′ + G)(A + C′ + F + G)(A + B + C′ + D′ + G) (A + C + E + G)(A′ + B + G)(B + C′ + F + G) This is to be simplified to the form (X + X + X)(X + X + X)(X + X + X) where each X represents a literal.
State a theorem which can be used to combine the first two sum terms of Z and apply it. (Hint: The two sum terms differ in only one variable.) Answer (X + Y)(X + Y′) = X Z = (A + C′ + G)(A + B + C′ + D′ + G)(A + C + E + G)(A′ + B + G) (B + C′ + F + G) Now state a theorem (other than the consensus theorem) which can be used to eliminate a sum term and apply it to this expression.
Answer X(X + Y) = X Z = (A + C′ + G)(A + C + E + G)(A′ + B + G)(B + C′ + F + G) Next, eliminate one literal from the second term, leaving the expression other-wise unchanged. (Hint: This cannot be done by the direct application of one theo-rem; it will be necessary to partially multiply out the first two sum terms before eliminating the literal.) Answer (A + C′ + G)(A + C + E + G) = A + G + C′(C + E) = A + G + C′E Therefore, Z = (A + C′ + G)(A + E + G)(A′ + B + G)(B + C′ + F + G) 82 Unit 3 (a) Can any term be eliminated from this expression by the direct application of the consensus theorem?
(b) If not, add a redundant sum term using the consensus theorem, and use this redundant term to eliminate one of the other terms.
(c) Finally, reduce your expression to a product of three sum terms.
Answer (a) No (b) Add B + C′ + G (consensus of A + C′ + G and A′ + B + G).
Use X(X + Y) = X, where X = B + C′ + G, to eliminate B + C′ + F + G.
(c) Now eliminate B + C′ + G by consensus. The final answer is Z = (A + C′ + G)(A + E + G)(A′ + B + G) Problems 3.6 In each case, multiply out to obtain a sum of products: (Simplify where possible.) (a) (W + X′ + Z′)(W′ + Y′)(W′ + X + Z′)(W + X′)(W + Y + Z) (b) (A + B + C + D)(A′ + B′ + C + D′)(A′ + C)(A + D)(B + C + D) 3.7 Factor to obtain a product of sums. (Simplify where possible.) (a) BCD + C′D′ + B′C′D + CD (b) A′C′D′ + ABD′ + A′CD + B′D 3.8 Write an expression for F and simplify.
3.9 Is the following distributive law valid? A ⊕ BC = (A ⊕ B)(A ⊕ C) Prove your answer.
3.10 (a) Reduce to a minimum sum of products (three terms): (X + W)(Y ⊕ Z) + XW′ (b) Reduce to a minimum sum of products (four terms): (A ⊕ BC) + BD + ACD (c) Reduce to a minimum product of sums (three terms): (A′ + C′ + D′)(A′ + B + C′)(A + B + D)(A + C + D) F + A D D B A ⊕ Boolean Algebra (Continued) 83 3.11 Simplify algebraically to a minimum sum of products (five terms): (A + B′ + C + E′)(A + B′ + D′ + E)(B′ + C′ + D′ + E′) 3.12 Prove algebraically that the following equation is valid: A′CD′E + A′B′D′ + ABCE + ABD = A′B′D′ + ABD + BCD′E 3.13 Simplify each of the following expressions: (a) KLMN′ + K′L′MN + MN′ (b) KL′M′ + MN′ + LM′N′ (c) (K + L′)(K′ + L′ + N)(L′ + M + N′) (d) (K′ + L + M′ + N)(K′ + M′ + N + R)(K′ + M′ + N + R′)KM 3.14 Factor to obtain a product of sums: (a) K′L′M + KM′N + KLM + LM′N′ (four terms) (b) KL + K′L′ + L′M′N′ + LMN′ (four terms) (c) KL + K′L′M + L′M′N + LM′N′ (four terms) (d) K′M′N + KL′N′ + K′MN′ + LN (four terms) (e) WXY + WX′Y + WYZ + XYZ′ (three terms) 3.15 Multiply out to obtain a sum of products: (a) (K′ + M′ + N)(K′ + M)(L + M′ + N′)(K′ + L + M)(M + N) (three terms) (b) (K′ + L′ + M′)(K + M + N′)(K + L)(K′ + N)(K′ + M + N) (c) (K′ + L′ + M)(K + N′)(K′ + L + N′)(K + L)(K + M + N′) (d) (K + L + M)(K′ + L′ + N′)(K′ + L′ + M′)(K + L + N) (e) (K + L + M)(K + M + N)(K′ + L′ + M′)(K′ + M′ + N′) 3.16 Eliminate the exclusive OR, and then factor to obtain a minimum product of sums: (a) (KL ⊕ M) + M′N′ (b) M′(K ⊕ N′) + MN + K′N 3.17 Algebraically prove identities involving the equivalence (exclusive-NOR) operation: (a) x ≡0 = x′ (b) x ≡1 = x (c) x ≡x = 1 (d) x ≡x′ = 0 (e) x ≡y = y ≡x (f ) (x ≡y) ≡z = x ≡(y ≡z) (g) (x ≡y)′ = x′ ≡y = x ≡y′ 3.18 Algebraically prove identities involving the exclusive-OR operation: (a) x ⊕ 0 = x (b) x ⊕ 1 = x′ (c) x ⊕ x = 0 (d) x ⊕ x′ = 1 (e) x ⊕ y = y ⊕ x (f ) (x ⊕ y) ⊕ z = x ⊕ ( y ⊕ z) (g) (x ⊕ y)′ = x′ ⊕ y = x ⊕ y′ 84 Unit 3 3.19 Algebraically prove the following identities: (a) x + y = x ⊕ y ⊕ xy (b) x + y = x ≡y ≡xy 3.20 Algebraically prove or disprove the following distributive identities: (a) x( y ⊕ z) = xy ⊕ xz (b) x + ( y ⊕ z) = (x + y) ⊕ (x + z) (c) x(y ≡z) = xy ≡xz (d) x + (y ≡z) = (x + y) ≡(x + z) 3.21 Simplify each of the following expressions using only the consensus theorem (or its dual): (a) BC′D′ + ABC′ + AC′D + AB′D + A′BD′ (reduce to three terms) (b) W′Y′ + WYZ + XY′Z + WX′Y (reduce to three terms) (c) (B + C + D)(A + B + C)(A′ + C + D)(B′ + C′ + D′) (d) W′XY + WXZ + WY′Z + W′Z′ (e) A′BC′ + BC′D′ + A′CD + B′CD + A′BD (f ) (A + B + C)(B + C′ + D)(A + B + D)(A′ + B′ + D′) 3.22 Factor Z = ABC + DE + ACF + AD′ + AB′E′ and simplify it to the form (X + X) (X + X)(X + X + X + X) (where each X represents a literal). Now express Z as a minimum sum of products in the form: XX + XX + XX + XX 3.23 Repeat Problem 3.22 for F = A′B + AC + BC′D′ + BEF + BDF.
3.24 Factor to obtain a product of four terms and then reduce to three terms by applying the consensus theorem: X′Y′Z′ + XYZ 3.25 Simplify each of the following expressions: (a) xy + x′yz′ + yz (b) (xy′ + z)(x + y′)z (c) xy′ + z + (x′ + y)z′ (d) a′d(b′ + c) + a′d′(b + c′) + (b′ + c)(b + c′) (e) w′x′ + x′y′ + yz + w′z′ (f ) A′BCD + A′BC′D + B′EF + CDE′G + A′DEF + A′B′EF (reduce to a sum of three terms) (g) [(a′ + d′ + b′c)(b + d + ac′)]′ + b′c′d′ + a′c′d (reduce to three terms) 3.26 Simplify to a sum of three terms: (a) A′C′D′ + AC′ + BCD + A′CD′ + A′BC + AB′C′ (b) A′B′C′ + ABD + A′C + A′CD′ + AC′D + AB′C′ 3.27 Reduce to a minimum sum of products: F = WXY′ + (W′Y′ ≡X) + (Y ⊕ WZ) Boolean Algebra (Continued) 85 3.28 Determine which of the following equations are always valid (give an algebraic proof): (a) a′b + b′c + c′a = ab′ + bc′ + ca′ (b) (a + b)(b + c)(c + a) = (a′ + b′)(b′ + c′)(c′ + a′) (c) abc + ab′c′ + b′cd + bc′d + ad = abc + ab′c′ + b′cd + bc′d (d) xy′ + x′z + yz′ = x′y + xz′ + y′z (e) (x + y)(y + z)(x + z) = (x′ + y′)(y′ + z′)(x′ + z′) (f ) abc′ + ab′c + b′c′d + bcd = ab′c + abc′ + ad + bcd + b′c′d 3.29 The following circuit is implemented using two half-adder circuits. The expressions for the half-adder outputs are S = A ⊕ B, and C = AB. Derive simplified sum-of-products expressions for the circuit outputs SUM and Co. Give the truth table for the outputs.
3.30 The output of a majority circuit is 1 if a majority (more than half) of its inputs are equal to 1, and the output is 0 otherwise. Construct a truth table for a three-input majority circuit and derive a simplified sum-of-products expression for its output.
3.31 Prove algebraically: (a) (X′ + Y′)(X ≡Z) + (X + Y)(X ⊕ Z) = (X ⊕ Y) + Z′ (b) (W′ + X + Y′)(W + X′ + Y)(W + Y′ + Z) = X′Y′ + WX + XYZ + W′YZ (c) ABC + A′C′D′ + A′BD′ + ACD = (A′ + C)(A + D′)(B + C′ + D) 3.32 Which of the following statements are always true? Justify your answers.
(a) If A + B = C, then AD′ + BD′ = CD′ (b) If A′B + A′C = A′D, then B + C = D (c) If A + B = C, then A + B + D = C + D (d) If A + B + C = C + D, then A + B = D 3.33 Find all possible terms that could be added to each expression using the consensus theorem. Then reduce to a minimum sum of products.
(a) A′C′ + BC + AB′ + A′BD + B′C′D′ + ACD′ (b) A′C′D′ + BC′D + AB′C′ + A′BC 3.34 Simplify the following expression to a sum of two terms and then factor the result to obtain a product of sums: abd′f′ + b′cegh′ + abd′f + acd′e + b′ce 3.35 Multiply out the following expression and simplify to obtain a sum-of-products expression with three terms: (a + c)(b′ + d)(a + c′ + d′)(b′ + c′ + d′) Co A B S C A B S C Ci Y X SUM 86 Unit 3 3.36 Factor and simplify to obtain a product-of-sums expression with four terms: abc′ + d′e + ace + b′c′d′ 3.37 (a) Show that x ⊕ y = (x ≡y)′ (b) Realize a′b′c′ + a′bc + ab′c + abc′ using only two-input equivalence gates.
3.38 In a Boolean algebra, which of the following statements are true? Prove your answer.
(a) If x( y + a′) = x( y + b′), then a = b.
(b) If a′b + ab′ = a′c + ac′, then b = c.
3.39 The definition of Boolean algebra given in Unit 2 is redundant (i.e., not all of the properties are independent). For example, show that the associative property a + (b + c) = (a + b) + c can be proved using the other properties of Boolean algebra. (Hint: Consider expanding [a + (b + c)][(a + b) + c] in two different ways. Be sure to not use the associative property.) 87 Applications of Boolean Algebra U N I T 4 Objectives 1. Given a word description of the desired behavior of a logic circuit, write the output of the circuit as a function of the input variables. Specify this function as an algebraic expression or by means of a truth table, as is appropriate.
2. Given a truth table, write the function (or its complement) as both a minterm expansion (standard sum of products) and a maxterm expansion (standard product of sums). Be able to use both alphabetic and decimal notation.
3. Given an algebraic expression for a function, expand it algebraically to obtain the minterm or maxterm form.
4. Given one of the following: minterm expansion for F, minterm expansion for F′, maxterm expansion for F, or maxterm expansion for F′, find any of the other three forms.
5. Write the general form of the minterm and maxterm expansion of a function of n variables.
6. Explain why some functions contain don’t-care terms.
7. Explain the operation of a full adder and a full subtracter and derive logic equa-tions for these modules. Draw a block diagram for a parallel adder or subtracter and trace signals on the block diagram.
Minterm and Maxterm Expansions 88 Unit 4 Study Guide In the previous units, we placed a dot (·) inside the AND-gate symbol, a plus sign (+) inside the OR-gate symbol, and a ⊕ inside the exclusive OR. Because you are now familiar with the relationship between the shape of the gate symbol and the logic function performed, we will omit the · , + , and ⊕ and use the standard gate symbols for AND, OR, and exclusive OR in the rest of the book.
1. Study Section 4.1, Conversion of English Sentences to Boolean Equations.
(a) Use braces to identify the phrases in each of the following sentences: (1) The tape reader should stop if the manual stop button is pressed, if an error occurs, or if an end-of-tape signal is present.
(2) He eats eggs for breakfast if it is not Sunday and he has eggs in the refrigerator.
(3) Addition should occur iff an add instruction is given and the signs are the same, or if a subtract instruction is given and the signs are not the same.
(b) Write a Boolean expression which represents each of the sentences in (a). Assign a variable to each phrase, and use a complemented variable to rep-resent a phrase which contains “not”.
(Your answers should be in the form F = S′E, F = AB + SB′, and F = A + B + C, but not necessarily in that order.) (c) If X represents the phrase “N is greater than 3”, how can you represent the phrase “N is less than or equal to 3”?
(d) Work Problems 4.1 and 4.2.
2. Study Section 4.2, Combinational Logic Design Using a Truth Table. Previously, you have learned how to go from an algebraic expression for a function to a truth table; in this section you will learn how to go from a truth table to an alge-braic expression.
(a) Write a product term which is 1 iff a = 0, b = 0, and c = 1.
(b) Write a sum term which is 0 iff a = 0, b = 0, and c = 1.
(c) Verify that your answers to (a) and (b) are complements.
Applications of Boolean Algebra Minterm and Maxterm Expansions 89 (d) Write a product term which is 1 iff a = 1, b = 0, c = 0, and d = 1.
(e) Write a sum term which is 0 iff a = 0, b = 0, c = 1, and d = 1.
(f ) For the given truth table, write F as a sum of four product terms which correspond to the four 1’s of F.
(g) From the truth table write F as a product of four sum terms which correspond to the four 0’s of F.
(h) Verify that your answers to both (f ) and (g) reduce to F = b′c′ + a′c.
3. Study Section 4.3, Minterm and Maxterm Expansions.
(a) Define the following terms: minterm (for n variables) maxterm (for n variables) (b) Study Table 4-1 and observe the relation between the values of A, B, and C and the corresponding minterms and maxterms.
If A = 0, then does A or A′ appear in the minterm?
In the maxterm?
If A = 1, then does A or A′ appear in the minterm?
In the maxterm?
What is the relation between minterm, mi, and the corresponding maxterm, Mi?
(c) For the table given in Study Guide Question 2(f ), write the minterm expan-sion for F in m-notation and in decimal notation.
For the same table, write the maxterm expansion for F in M-notation and in decimal notation.
Check your answers by converting your answer to 2(f ) to m-notation and your answer to 2(g) to M-notation.
a b c F 0 0 0 1 0 0 1 1 0 1 0 0 0 1 1 1 1 0 0 1 1 0 1 0 1 1 0 0 1 1 1 0 90 Unit 4 (5) A′BC′ + AB′C + ABC (6) AB′C′ (d) Given a sum-of-products expression, how do you expand it to a standard sum of products (minterm expansion)?
(e) Given a product-of-sums expression, how do you expand it to a standard product of sums (maxterm expansion)?
(f ) In Equation (4-11), what theorems were used to factor f to obtain the maxterm expansion?
(g) Why is the following expression not a maxterm expansion?
f(A, B, C, D) = (A + B′ + C + D)(A′ + B + C′)(A′ + B + C + D′) (h) Assuming that there are three variables (A, B, C), identify each of the following as a minterm expansion, maxterm expansion, or neither: (1) AB + B′C′ (2) (A′ + B + C′)(A + B′ + C ) Note that it is possible for a minterm or maxterm expansion to have only one term.
4. (a) Given a minterm in terms of its variables, the procedure for conversion to decimal notation is (1) Replace each complemented variable with a _ and replace each uncomplemented variable with a .
(2) Convert the resulting binary number to decimal.
(b) Convert the minterm AB′C′DE to decimal notation.
(c) Given that m13 is a minterm of the variables A, B, C, D, and E, write the minterm in terms of these variables.
(d) Given a maxterm in terms of its variables, the procedure for conversion to decimal notation is (1) Replace each complemented variable with a and replace each uncomplemented variable with a _.
(2) Group these 0’s and 1’s to form a binary number and convert to decimal.
(e) Convert the maxterm A′ + B + C + D′ + E′ to decimal notation.
(f ) Given that M13 is a maxterm of the variables A, B, C, D, and E, write the maxterm in terms of these variables.
(g) Check your answers to (b), (c), (e), and (f ) by using the relation Mi = mi ′.
(h) Given f(a, b, c, d, e) = Π M(0, 10, 28), express f in terms of a, b, c, d, and e. (Your answer should contain only five complemented variables.) (3) A + B + C (4) (A′ + B)(B′ + C )(A′ + C ) Applications of Boolean Algebra Minterm and Maxterm Expansions 91 5. Study Section 4.4, General Minterm and Maxterm Expansions. Make sure that you understand the notation here and can follow the algebra in all of the equa-tions. If you have difficulty with this section, ask for help before you take the readiness test.
(a) How many different switching functions of four variables are possible?
(b) Explain why there are 22n switching functions of n variables.
(c) Write the function of Figure 4-1 in the form of Equation (4-13) and show that it reduces to Equation (4-3).
(d) For Equation (4-19), write out the indicated summations in full for the case n = 2.
(e) Study Tables 4-3 and 4-4 carefully and make sure you understand why each table entry is valid. Use the truth table for f and f′ (Figure 4-1) to verify the entries in Table 4-4. If you understand the relationship between Table 4-3 and the truth table for f and f′, you should be able to perform the conver-sions without having to memorize the table.
(f ) Given that f(A, B, C) = Σm(0, 1, 3, 4, 7) The maxterm expansion for f is ______ The minterm expansion for f′ is ______ The maxterm expansion for f′ is ______ (g) Work Problems 4.3 and 4.4.
6. Study Section 4.5, Incompletely Specified Functions.
(a) State two reasons why some functions have don’t-care terms.
(b) Given the following table, write the minterm expansion for Z in decimal form.
(c) Write the maxterm expansion in decimal form.
(d) Work Problems 4.5 and 4.6.
A B C Z 0 0 0 1 0 0 1 X 0 1 0 0 0 1 1 X 1 0 0 X 1 0 1 1 1 1 0 0 1 1 1 0 92 Unit 4 7. Study Section 4.6, Examples of Truth Table Construction. Finding the truth table from the problem statement is probably the most difficult part of the process of designing a switching circuit. Make sure that you understand how to do this.
8. Work Problems 4.7 through 4.10.
9. Study Section 4.7 , Design of Binary Adders.
(a) For the given parallel adder, show the 0’s and 1’s at the full adder (FA) inputs and outputs when the following unsigned numbers are added: 11 + 14 = 25. Verify that the result is correct if C4S3S2S1S0 is taken as a 5-bit sum. If the sum is limited to 4 bits, explain why this is an overflow condition.
(b) Review Section 1.4, Representation of Negative Numbers. If we use the 2’s complement number system to add (−5) + (−2), verify that the FA inputs and outputs are exactly the same as in part (a). However, for 2’s comple-ment, the interpretation of the results is quite different. After discarding C4, verify that the resultant 4-bit sum is correct, and therefore no overflow has occurred.
(c) If we use the 1’s complement number system to add (−5) + (−2), show the FA inputs and outputs on the diagram below before the end-around carry is added in. Assume that C0 is initially 0. Then add the end-around carry (C4) to the rightmost FA, add the new carry (C1) into the next cell, and continue until no further changes occur. Verify that the resulting sum is the correct 1’s complement representation of −7.
10. (a) Work the following subtraction example. As you subtract each column, place a 1 over the next column if you have to borrow, otherwise place a 0. For each column, as you compute xi − yi − bi, fill in the corresponding val-ues of bi+1 and di in the truth table. If you have done this correctly, the resulting table should match the full subtracter truth table (Table 4-6).
FA FA FA FA C4 C0 S3 S2 S1 S0 FA FA FA FA C4 C0 Applications of Boolean Algebra Minterm and Maxterm Expansions 93 ←borrows 1 1 0 0 0 1 1 0 ←X −0 1 0 1 1 0 1 0 ←Y ←difference (b) Work Problems 4.11 and 4.12.
11. Read the following and then work Problem 4.13 or 4.14 as assigned: When looking at an expression to determine the required number of gates, keep in mind that the number of required gates is generally not equal to the number of AND and OR operations which appear in the expression. For example, AB + CD + EF(G + H) contains four AND operations and three OR operations, but it only requires three AND gates and two OR gates: 12. Reread the objectives of this unit. Make sure that you understand the difference in the procedures for converting maxterms and minterms from decimal to alge-braic notation. When you are satisfied that you can meet the objectives, take the readiness test. When you come to take the readiness test, turn in a copy of your solution to assigned simulation exercise.
xi yi bi bi+1 di 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1 A B C D E F G H 94 In this unit you will learn how to design a combinational logic circuit starting with a word description of the desired circuit behavior. The first step is usually to translate the word description into a truth table or into an algebraic expres-sion. Given the truth table for a Boolean function, two standard algebraic forms of the function can be derived—the standard sum of products (minterm expansion) and the standard product of sums (maxterm expansion). Simplification of either of these standard forms leads directly to a realization of the circuit using AND and OR gates.
4.1 Conversion of English Sentences to Boolean Equations The three main steps in designing a single-output combinational switching circuit are 1. Find a switching function that specifies the desired behavior of the circuit.
2. Find a simplified algebraic expression for the function.
3. Realize the simplified function using available logic elements.
For simple problems, it may be possible to go directly from a word description of the desired behavior of the circuit to an algebraic expression for the output function. In other cases, it is better to first specify the function by means of a truth table and then derive an algebraic expression from the truth table.
Logic design problems are often stated in terms of one or more English sentences. The first step in designing a logic circuit is to translate these sentences into Boolean equations. In order to do this, we must break down each sentence into phrases and associate a Boolean variable with each phrase. If a phrase can have a value of true or false, then we can represent that phrase by a Boolean variable. Phrases such as “she goes to the store” or “today is Monday” can be either true or false, but a command like “go to the store” has no truth value. If a sentence has several phrases, we will mark each phrase with a brace. The following sentence has three phrases: Mary watches TV if it is Monday night and she has finished her homework. Applications of Boolean Algebra Minterm and Maxterm Expansions Applications of Boolean Algebra Minterm and Maxterm Expansions 95 The “if” and “and” are not included in any phrase; they show the relationships among the phrases.
We will define a two-valued variable to indicate the truth or falsity of each phrase: F = 1 if “Mary watches TV” is true; otherwise, F = 0.
A = 1 if “it is Monday night” is true; otherwise, A = 0.
B = 1 if “she has finished her homework” is true; otherwise B = 0.
Because F is “true” if A and B are both “true”, we can represent the sentence by F = A · B The following example illustrates how to go from a word statement of a problem directly to an algebraic expression which represents the desired circuit behavior. An alarm circuit is to be designed which operates as follows: The alarm will ring iff the alarm switch is turned on and the door is not closed, or it is after 6 p.m. and the window is not closed.
The first step in writing an algebraic expression which corresponds to the above sentence is to associate a Boolean variable with each phrase in the sentence. This variable will have a value of 1 when the phrase is true and 0 when it is false. We will use the following assignment of variables: The alarm will ring Z iff the alarm switch is on A and the door is not closed ′ B or it is after 6 P.M. C and the window is not closed.
D′ This assignment implies that if Z = 1, the alarm will ring. If the alarm switch is turned on, A = 1, and if it is after 6 p.m., C = 1. If we use the variable B to represent the phrase “the door is closed”, then B′ represents “the door is not closed”. Thus, B = 1 if the door is closed, and B′ = 1(B = 0) if the door is not closed. Similarly, D = 1 if the window is closed, and D′ = 1 if the window is not closed. Using this assignment of variables, the above sentence can be translated into the following Boolean equation: Z = AB′ + CD′ This equation corresponds to the following circuit: A B D C Z In this circuit, A is a signal which is 1 when the alarm switch is on, C is a signal from a time clock which is 1 when it is after 6 p.m., B is a signal from a switch on the door 96 Unit 4 which is 1 when the door is closed, and similarly D is 1 when the window is closed. The output Z is connected to the alarm so that it will ring when Z = 1.
4.2 Combinational Logic Design Using a Truth Table The next example illustrates logic design using a truth table. A switching circuit has three inputs and one output, as shown in Figure 4-1(a). The inputs A, B, and C rep-resent the first, second, and third bits, respectively, of a binary number N. The output of the circuit is to be f = 1 if N ≥0112 and f = 0 if N < 0112. The truth table for f is shown in Figure 4-1(b).
Next, we will derive an algebraic expression for f from the truth table by using the combinations of values of A, B, and C for which f = 1. The term A′BC is 1 only if A = 0, B = 1, and C = 1. Similarly, the term AB′C′ is 1 only for the combination 100, AB′C is 1 only for 101, ABC′ is 1 only for 110, and ABC is 1 only for 111. ORing these terms together yields f = A′BC + AB′C′ + AB′C + ABC′ + ABC (4-1) This expression equals 1 if A, B, and C take on any of the five combinations of values 011, 100, 101, 110, or 111. If any other combination of values occurs, f is 0 because all five terms are 0.
Equation (4-1) can be simplified by first combining terms using the uniting theo-rem and then eliminating A′ using the elimination theorem: f = A′BC + AB′ + AB = A′BC + A = A + BC (4-2) Equation (4-2) leads directly to the following circuit: FIGURE 4-1 Combinational Circuit with Truth Table © Cengage Learning 2014 A B C f (a) A B C f f′ 0 0 1 1 0 1 0 0 1 1 1 0 0 1 0 1 1 0 0 1 0 0 0 0 0 0 1 0 1 1 0 1 0 1 1 1 1 1 1 0 (b) B C A f Applications of Boolean Algebra Minterm and Maxterm Expansions 97 Instead of writing f in terms of the 1’s of the function, we may also write f in terms of the 0’s of the function. The function defined by Figure 4-1 is 0 for three combinations of input values. Observe that the term A + B + C is 0 only if A = B = C = 0. Similarly, A + B + C′ is 0 only for the input combination 001, and A + B′ + C is 0 only for the combination 010. ANDing these terms together yields f = (A + B + C)(A + B + C′)(A + B′ + C) (4-3) This expression equals 0 if A, B, and C take on any of the combinations of values 000, 001, or 010. For any other combination of values, f is 1 because all three terms are l. Because Equation (4-3) represents the same function as Equation (4-1) they must both reduce to the same expression. Combining terms and using the second distributive law, Equation (4-3) simplifies to f = (A + B)(A + B′ + C) = A + B(B′ + C) = A + BC (4-4) which is the same as Equation (4-2).
Another way to derive Equation (4-3) is to first write f′ as a sum of products, and then complement the result. From Figure 4-1, f′is 1 for input combinations ABC = 000, 001, and 010, so f′ = A′B′C′ + A′B′C + A′BC′ Taking the complement of f′ yields Equation (4-3).
4.3 Minterm and Maxterm Expansions Each of the terms in Equation (4-1) is referred to as a minterm. In general, a minterm of n variables is a product of n literals in which each variable appears exactly once in either true or complemented form, but not both. (A literal is a variable or its com-plement.) Table 4-1 lists all of the minterms of the three variables A, B, and C. Each minterm has a value of 1 for exactly one combination of values of the variables A, B, and C. Thus if A = B = C = 0, A′B′C′ = 1; if A = B = 0 and C = 1, A′B′C = 1; and so forth. Minterms are often written in abbreviated form—A′B′C′ is designated m0, A′B′C is designated m1, etc. In general, the minterm which corresponds to row i of the truth table is designated mi (i is usually written in decimal).
Row No.
A B C Minterms Maxterms 0 0 0 0 A′B′C′ = m0 A + B + C = M0 1 0 0 1 A′B′C = m1 A + B + C′ = M1 2 0 1 0 A′BC′ = m2 A + B′ + C = M2 3 0 1 1 A′BC = m3 A + B′ + C′ = M3 4 1 0 0 AB′C′ = m4 A′ + B + C = M4 5 1 0 1 AB′C = m5 A′ + B + C′ = M5 6 1 1 0 ABC′ = m6 A′ + B′ + C = M6 7 1 1 1 ABC = m7 A′ + B′ + C′ = M7 TABLE 4-1 Minterms and Maxterms for Three Variables © Cengage Learning 2014 98 Unit 4 When a function f is written as a sum of minterms as in Equation (4-1), this is referred to as a minterm expansion or a standard sum of products.1 If f = 1 for row i of the truth table, then mi must be present in the minterm expansion because mi = 1 only for the combination of values of the variables corresponding to row i of the table. Because the minterms present in f are in one-to-one correspondence with the 1’s of f in the truth table, the minterm expansion for a function f is unique. Equation (4-1) can be rewritten in terms of m-notation as f(A, B, C) = m3 + m4 + m5 + m6 + m7 (4-5) This can be further abbreviated by listing only the decimal subscripts in the form f(A, B, C) = Σ m(3, 4, 5, 6, 7) (4-5a) Each of the sum terms (or factors) in Equation (4-3) is referred to as a maxterm. In general, a maxterm of n variables is a sum of n literals in which each variable appears exactly once in either true or complemented form, but not both. Table 4-1 lists all of the maxterms of the three variables A, B, and C. Each maxterm has a value of 0 for exactly one combination of values for A, B, and C. Thus, if A = B = C = 0, A + B + C = 0; if A = B = 0 and C = 1, A + B + C′ = 0; and so forth. Maxterms are often written in abbreviated form using M-notation. The maxterm which cor-responds to row i of the truth table is designated Mi. Note that each maxterm is the complement of the corresponding minterm, that is, Mi = mi ′.
When a function f is written as a product of maxterms, as in Equation (4-3), this is referred to as a maxterm expansion or standard product of sums. If f = 0 for row i of the truth table, then Mi must be present in the maxterm expansion because Mi = 0 only for the combination of values of the variables corresponding to row i of the table. Note that the maxterms are multiplied together so that if any one of them is 0, f will be 0. Because the maxterms are in one-to-one correspondence with the 0’s of f in the truth table, the maxterm expansion for a function f is unique. Equation (4-3) can be rewritten in M-notation as f(A, B, C) = M0 M1M2 (4-6) This can be further abbreviated by listing only the decimal subscripts in the form f(A, B, C) = Π M(0, 1, 2) (4-6a) where Π means a product.
Because if f ≠1 then f = 0, it follows that if mi is not present in the minterm expansion of f, then Mi is present in the maxterm expansion. Thus, given a minterm expansion of an n-variable function f in decimal notation, the maxterm expansion is obtained by listing those decimal integers (0 ≤i ≤2n −1) not in the minterm list. Using this method, Equation (4-6a) can be obtained directly from Equation (4-5a).
1Other names used in the literature for standard sum of products are canonical sum of products and disjunctive normal form. Similarly, a standard product of sums may be called a canonical product of sums or a conjunctive normal form.
Applications of Boolean Algebra Minterm and Maxterm Expansions 99 Given the minterm or maxterm expansions for f, the minterm or maxterm expansions for the complement of f are easy to obtain. Because f′ is 1 when f is 0, the minterm expansion for f′ contains those minterms not present in f. Thus, from Equation (4-5), f′ = m0 + m1 + m2 = Σ m(0, 1, 2) (4-7) Similarly, the maxterm expansion for f′ contains those maxterms not present in f. From Equation (4-6), f′ = Π M(3, 4, 5, 6, 7) = M3M4M5M6M7 (4-8) Because the complement of a minterm is the corresponding maxterm, Equation (4-8) can be obtained by complementing Equation (4-5): f′ = (m3 + m4 + m5 + m6 + m7)′ = m3 ′ m4 ′m5 ′ m6 ′ m7 ′ = M3M4M5M6M7 Similarly, Equation (4-7) can be obtained by complementing Equation (4-6): f′ = (M0M1M2)′ = M0 ′ + M1 ′ + M2 ′ = m0 + m1 + m2 A general switching expression can be converted to a minterm or maxterm expansion either using a truth table or algebraically. If a truth table is constructed by evaluating the expression for all different combinations of the values of the vari-ables, the minterm and maxterm expansions can be obtained from the truth table by the methods just discussed. Another way to obtain the minterm expansion is to first write the expression as a sum of products and then introduce the missing variables in each term by applying the theorem X + X′ = 1.
Find the minterm expansion of f(a, b, c, d) = a′(b′ + d) + acd′. f = a′b′ + a′d + acd′ = a′b′(c + c′)(d + d′) + a′d(b + b′)(c + c′) + acd′(b + b′) = a′b′c′d′ + a′b′c′d + a′b′cd′ + a′b′cd + a′b′c′d + a′b′cd + a′bc′d + a′bcd + abcd′ + ab′cd′ (4-9) Duplicate terms have been crossed out, because X + X = X. This expression can then be converted to decimal notation: f = a′b′c′d′ + a′b′c′d + a′b′cd′ + a′b′cd + a′bc′d + a′bcd + abcd′ + ab′cd′ 0 0 0 0 0 0 0 1 0 0 1 0 0 0 11 0 10 1 0 111 1 1 1 0 10 10 f = Σ m(0, 1, 2, 3, 5, 7, 10, 14) (4-10) The maxterm expansion for f can then be obtained by listing the decimal integers (in the range 0 to 15) which do not correspond to minterms of f: f = Π M(4, 6, 8, 9, 11, 12, 13, 15) Example 100 Unit 4 An alternate way of finding the maxterm expansion is to factor f to obtain a product of sums, introduce the missing variables in each sum term by using XX′ = 0, and then factor again to obtain the maxterms. For Equation (4-9), f = a′(b′ + d) + acd′ = (a′ + cd′)(a + b′ + d) = (a′ + c)(a′ + d′)(a + b′ + d) = (a′ + bb′ + c + dd′)(a′ + bb′ + cc′ + d′)(a + b′ + cc′ + d) = (a′ + bb′ + c + d)(a′ + bb′ + c + d′)(a′ + bb′ + c + d′) (a′ + bb′ + c′ + d′)(a + b′ + cc′ + d) = (a′ + b + c + d)(a′ + b′ + c + d)(a′ + b + c + d′)(a′ + b′ + c + d′) 1000 1100 1001 1101 (a′ + b + c′ + d′)(a′ + b′ + c′ + d′)(a + b′ + c + d)(a + b′ + c′ + d) 1011 1111 0100 0110 = Π M(4, 6, 8, 9, 11, 12, 13, 15) (4-11) Note that when translating the maxterms to decimal notation, a primed variable is first replaced with a 1 and an unprimed variable with a 0.
Because the terms in the minterm expansion of a function F correspond one-to-one with the rows of the truth table for which F = 1, the minterm expansion of F is unique. Thus, we can prove that an equation is valid by finding the minterm expan-sion of each side and showing that these expansions are the same.
Show that a′c + b′c′ + ab = a′b′ + bc + ac′.
We will find the minterm expansion of each side by supplying the missing vari-ables. For the left side, a′c(b + b′) + b′c′(a + a′) + ab(c + c′) = a′bc + a′b′c + ab′c′ + a′b′c′ + abc + abc′ = m3 + m1 + m4 + m0 + m7 + m6 For the right side, a′b′(c + c′) + bc(a + a′) + ac′(b + b′) = a′b′c + a′b′c + abc + a′bc + abc′ + ab′c′ = m1 + m0 + m7 + m3 + m6 + m4 Because the two minterm expansions are the same, the equation is valid.
4.4 General Minterm and Maxterm Expansions Table 4-2 represents a truth table for a general function of three variables. Each ai is a constant with a value of 0 or 1. To completely specify a function, we must assign values to all of the ai’s. Because each ai can be specified in two ways, there are 28 Example Applications of Boolean Algebra Minterm and Maxterm Expansions 101 ways of filling the F column of the truth table; therefore, there are 256 different func-tions of three variables (this includes the degenerate cases, F identically equal to 0 and F identically equal to 1). For a function of n variables, there are 2n rows in the truth table, and because the value of F can be 0 or 1 for each row, there are 22n pos-sible functions of n variables.
From Table 4-2, we can write the minterm expansion for a general function of three variables as follows: F = a0m0 + a1m1 + a2m2 + · · · + a7m7 = a 7 i=0 aimi (4-12) Note that if ai = 1, minterm mi is present in the expansion; if ai = 0, the correspond-ing minterm is not present. The maxterm expansion for a general function of three variables is F = (a0 + M0)(a1 + M1)(a2 + M2) · · · (a7 + M7) = q 7 i=0 (ai + Mi) (4-13) Note that if ai = 1, ai + Mi = 1, and Mi drops out of the expansion; however, Mi is present if ai = 0.
From Equation (4-13), the minterm expansion of F′ is F′ = c q 7 i=0 (ai + Mi)d ′ = a 7 i=0 ai ′Mi ′ = a 7 i=0 ai′mi (4-14) Note that all minterms which are not present in F are present in F′.
From Equation (4-12), the maxterm expansion of F′ is F′ = c a 7 i=0 aimid ′ = q 7 i=0 (ai ′+ mi ′) = q 7 i=0 (ai ′ + Mi) (4-15) Note that all maxterms which are not present in F are present in F′. Generalizing Equations (4-12), (4-13), (4-14), and (4-15) to n variables, we have F = a 2n−1 i=0 aimi = q 2n−1 i=0 (ai + Mi) (4-16) A B C F 0 0 0 a0 0 0 1 a1 0 1 0 a2 0 1 1 a3 1 0 0 a4 1 0 1 a5 1 1 0 a6 1 1 1 a7 TABLE 4-2 General Truth Table for Three Variables © Cengage Learning 2014 102 Unit 4 F′ = a 2n−1 i=0 ai ′ mi = q 2n−1 i=0 (ai ′ + Mi) (4-17) Given two different minterms of n variables, mi and mj, at least one variable appears complemented in one of the minterms and uncomplemented in the other. Therefore, if i ≠j, mi mj = 0. For example, for n = 3, m1m3 = (A′B′C)(A′BC) = 0. Given minterm expansions for two functions f1 = a 2n−1 i=0 ai mi f2 = a 2n−1 j=0 bj mj (4-18) the product is f1 f2 = a a 2n−1 i=0 ai mib a a 2n−1 j=0 bj mjb = a 2n−1 i=0 a 2n−1 j=0 ai bj mi mj = a 2n−1 i=0 ai bi mi (because mi mj = 0 unless i = j) (4-19) Note that all of the cross-product terms (i ≠j) drop out so that f1 f2 contains only those minterms which are present in both f1 and f2. For example, if f1 = Σ m(0, 2, 3, 5, 9, 11) and f2 = Σ m(0, 3, 9, 11, 13, 14) f1 f2 = Σ m(0, 3, 9, 11) Table 4-3 summarizes the procedures for conversion between minterm and max-term expansions of F and F′, assuming that all expansions are written as lists of decimal numbers. When using this table, keep in mind that the truth table for an n-variable function has 2n rows so that the minterm (or maxterm) numbers range from 0 to 2n −1. Table 4-4 illustrates the application of Table 4-3 to the three- variable function given in Figure 4-1.
TABLE 4-3 Conversion of Forms © Cengage Learning 2014 GIVEN FORM DESIRED FORM Minterm Expansion of F Maxterm Expansion of F Minterm Expansion of F′ Maxterm Expansion of F′ Minterm Expansion of F _ maxterm nos. are those nos. not on the minterm list for F list minterms not present in F maxterm nos. are the same as minterm nos. of F Maxterm Expansion of F minterm nos. are those nos. not on the maxterm list for F _ minterm nos. are the same as maxterm nos. of F list maxterms not present in F Applications of Boolean Algebra Minterm and Maxterm Expansions 103 4.5 Incompletely Specified Functions A large digital system is usually divided into many subcircuits. Consider the follow-ing example in which the output of circuit N1 drives the input of circuit N2.
Let us assume that the output of N1 does not generate all possible combinations of values for A, B, and C. In particular, we will assume that there are no combinations of values for w, x, y, and z which cause A, B, and C to assume values of 001 or 110. Hence, when we design N2, it is not necessary to specify values of F for ABC = 001 or 110 because these combinations of values can never occur as inputs to N2. For example, F might be specified by Table 4-5.
The X’s in the table indicate that we don’t care whether the value of 0 or 1 is assigned to F for the combinations ABC = 001 or 110. In this example, we don’t care what the value of F is because these input combinations never occur anyway. The function F is then incompletely specified. The minterms A′B′C and ABC′ are referred to as don’t-care minterms, since we don’t care whether they are present in the function or not.
TABLE 4-4 Application of Table 4.3 © Cengage Learning 2014 GIVEN FORM DESIRED FORM Minterm Expansion of f Maxterm Expansion of f Minterm Expansion of f′ Maxterm Expansion of f′ f = Σ m(3, 4, 5, 6, 7) __ Π M(0, 1, 2) Σ m(0, 1, 2) Π M(3, 4, 5, 6, 7) f = Π M(0, 1, 2) Σ m(3, 4, 5, 6, 7) _ Σ m(0, 1, 2) Π M(3, 4, 5, 6, 7) w N1 A B C N2 x y z F TABLE 4-5 Truth Table with Don’t-Cares © Cengage Learning 2014 A B C F 0 0 0 1 0 0 1 X 0 1 0 0 0 1 1 1 1 0 0 0 1 0 1 0 1 1 0 X 1 1 1 1 104 Unit 4 When we realize the function, we must specify values for the don’t-cares. It is desirable to choose values which will help simplify the function. If we assign the value 0 to both X’s, then F = A′B′C′ + A′BC + ABC = A′B′C′ + BC If we assign 1 to the first X and 0 to the second, then F = A′B′C′ + A′B′C + A′BC + ABC = A′B′ + BC If we assign 1 to both X’s, then F = A′B′C′ + A′B′C + A′BC + ABC′ + ABC = A′B′ + BC + AB The second choice of values leads to the simplest solution.
We have seen one way in which incompletely specified functions can arise, and there are many other ways. In the preceding example, don’t-cares were present because certain combinations of circuit inputs did not occur. In other cases, all input combinations may occur, but the circuit output is used in such a way that we do not care whether it is 0 or 1 for certain input combinations.
When writing the minterm expansion for an incompletely specified function, we will use m to denote the required minterms and d to denote the don’t-care minterms. Using this notation, the minterm expansion for Table 4-5 is F = Σ m(0, 3, 7) + Σ d(1, 6) For each don’t-care minterm there is a corresponding don’t-care maxterm. For exam-ple, if F = X (don’t-care) for input combination 001, m1 is a don’t-care minterm and M1 is a don’t-care maxterm. We will use D to represent a don’t-care maxterm, and we write the maxterm expansion of the function in Table 4-5 as F = Π M(2, 4, 5) · Π D(1, 6) which implies that maxterms M2, M4, and M5 are present in F and don’t-care maxterms M1 and M6 are optional.
4.6 Examples of Truth Table Construction We will design a simple binary adder that adds two 1-bit binary numbers, a and b, to give a 2-bit sum. The numeric values for the adder inputs and output are as follows: a b Sum 0 0 00 (0 + 0 = 0) 0 1 01 (0 + 1 = 1) 1 0 01 (1 + 0 = 1) 1 1 10 (1 + 1 = 2) Example 1 Applications of Boolean Algebra Minterm and Maxterm Expansions 105 We will represent inputs to the adder by the logic variables A and B and the 2-bit sum by the logic variables X and Y, and we construct a truth table: Because a numeric value of 0 is represented by a logic 0 and a numeric value of 1 by a logic l, the 0’s and 1’s in the truth table are exactly the same as in the previous table. From the truth table, X = AB and Y = A′B + AB′ = A ⊕ B A B X Y 0 0 0 0 0 1 0 1 1 0 0 1 1 1 1 0 A X Y Z B C D N1 N2 N3 TRUTH TABLE: N1 $%& A B N2 $%& C D N3 $' % '& X Y Z 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 1 0 0 1 0 0 0 1 1 0 1 1 0 1 0 0 0 0 1 0 1 0 1 0 1 0 0 1 1 0 0 1 1 0 1 1 1 1 0 0 1 0 0 0 0 1 0 1 0 0 1 0 1 1 1 0 1 0 1 0 0 1 0 1 1 1 0 1 1 1 0 0 0 1 1 1 1 0 1 1 0 0 1 1 1 0 1 0 1 1 1 1 1 1 1 0 An adder is to be designed which adds two 2-bit binary numbers to give a 3-bit binary sum. Find the truth table for the circuit. The circuit has four inputs and three outputs as shown: Inputs A and B taken together represent a binary number N1. Inputs C and D taken together represent a binary number N2. Outputs X, Y, and Z taken together rep-resent a binary number N3, where N3 = N1 + N2 (+ of course represents ordinary addition here).
In this example we have used A, B, C, and D to represent both numeric values and logic values, but this should not cause any confusion because the numeric and Example 2 106 Unit 4 logic values are the same. In forming the truth table, the variables were treated like binary numbers having numeric values. Now we wish to derive the switching func-tions for the output variables. In doing so, we will treat A, B, C, D, X, Y, and Z as switching variables having nonnumeric values 0 and 1. (Remember that in this case the 0 and 1 may represent low and high voltages, open and closed switches, etc.) From inspection of the table, the output functions are X(A, B, C, D) = Σ m(7, 10, 11, 13, 14, 15) Y(A, B, C, D) = Σ m(2, 3, 5, 6, 8, 9, 12, 15) Z(A, B, C, D) = Σ m(1, 3, 4, 6, 9, 11, 12, 14) A B C D F 0 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 0 1 1 0 0 1 0 0 0 0 1 0 1 0 0 1 1 0 1 0 1 1 1 0 1 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0 1 1 0 1 1 0 0 0 1 1 0 1 1 1 1 1 0 1 1 1 1 1 1 Design an error detector for 6-3-1-1 binary-coded-decimal digits. The output (F) is to be 1 iff the four inputs (A, B, C, D) represent an invalid code combination.
The valid 6-3-1-1 code combinations are listed in Table 1-2. If any other combi-nation occurs, this is not a valid 6-3-1-1 binary-coded-decimal digit, and the circuit output should be F = 1 to indicate that an error has occurred. This leads to the fol-lowing truth table: The corresponding output function is F = Σ m(2, 6, 10, 13, 14, 15) = A′B′CD′ + A′BCD′ + AB′CD′ + ABCD′ + ABC′D + ABCD = A′CD′ + ACD′ + ABD = CD′ + ABD Example 3 (''''' ('''' (''''' (' ('''' (' Applications of Boolean Algebra Minterm and Maxterm Expansions 107 The realization using AND and OR gates is C A B F D D′ The four inputs to a circuit (A, B, C, D) represent an 8-4-2-1 binary-coded-decimal digit. Design the circuit so that the output (Z) is 1 iff the decimal number repre-sented by the inputs is exactly divisible by 3. Assume that only valid BCD digits occur as inputs.
The digits 0, 3, 6, and 9 are exactly divisible by 3, so Z = 1 for the input combina-tions ABCD = 0000, 0011, 0110, and 1001. The input combinations 1010, 1011, 1100, 1101, 1110, and 1111 do not represent valid BCD digits and will never occur, so Z is a don’t-care for these combinations. This leads to the following truth table: Example 4 A B C D Z 0 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 0 1 1 1 0 1 0 0 0 0 1 0 1 0 0 1 1 0 1 0 1 1 1 0 1 0 0 0 0 1 0 0 1 1 1 0 1 0 X 1 0 1 1 X 1 1 0 0 X 1 1 0 1 X 1 1 1 0 X 1 1 1 1 X The corresponding output function is Z = Σ m(0, 3, 6, 9) + Σ d(10, 11, 12, 13, 14, 15) In order to find the simplest circuit which will realize Z, we must choose some of the don’t-cares (X’s) to be 0 and some to be 1. The easiest way to do this is to use a Karnaugh map as described in Unit 5.
108 Unit 4 4.7 Design of Binary Adders and Subtracters In this section, we will design a parallel adder that adds two 4-bit unsigned binary numbers and a carry input to give a 4-bit sum and a carry output (see Figure 4-2). One approach would be to construct a truth table with nine inputs and five out-puts and then derive and simplify the five output equations. Because each equation would be a function of nine variables before simplification, this approach would be very difficult, and the resulting logic circuit would be very complex. A better method is to design a logic module that adds two bits and a carry, and then connect four of these modules together to form a 4-bit adder as shown in Figure 4-3. Each of the modules is called a full adder. The carry output from the first full adder serves as the carry input to the second full adder, etc.
FIGURE 4-2 Parallel Adder for 4-Bit Binary Numbers © Cengage Learning 2014 4-bit Parallel Adder A3 B3 A2 B2 A1 B1 A0 B0 S3 C4 C0 S2 S1 S0 FIGURE 4-3 Parallel Adder Composed of Four Full Adders © Cengage Learning 2014 Full Adder A3 B3 S3 C4 0 1 1 1 Full Adder A2 B2 S2 C3 1 0 0 0 Full Adder A1 B1 S1 C2 1 1 1 1 Full Adder A0 B0 S0 C1 0 1 end-around carry for 1’s complement 1 C0 0 1 In the example of Figure 4-3, we perform the following addition: 10110 (carries) 1011 + 1011 10110 The full adder to the far right adds A0 + B0 + C0 = 1 + 1 + 0 to give a sum of 102, which gives a sum S0 = 0 and a carry out of C1 = 1. The next full adder adds A1 + B1 + C1 = 1 + 1 + 1 = 112, which gives a sum S1 = 1 and a carry C2 = 1. The carry continues to propagate from right to left until the left cell produces a final carry of C4 = 1.
Applications of Boolean Algebra Minterm and Maxterm Expansions 109 Figure 4-4 gives the truth table for a full adder with inputs X, Y, and Cin. The outputs for each row of the table are found by adding up the input bits (X + Y + Cin) and split-ting the result into a carry out (Ci+1) and a sum bit (Si). For example, in the 101 row 1 + 0 + 1 = 102, so Ci+1 = 1 and Si = 0. Figure 4-5 shows the implementation of the full adder using gates. The logic equations for the full adder derived from the truth table are Sum = X′Y′Cin + X′YC′ in + XY′C′ in + XYCin = X′(Y′Cin + YC′ in) + X(Y′C′ in + YCin) = X′(Y ⊕ Cin) + X(Y ⊕ Cin)′ = X ⊕ Y ⊕ Cin (4-20) Cout = X′YCin + XY′Cin + XYC′ in + XYCin = (X′YCin + XYCin) + (XY′Cin + XYCin) + (XYC′ in + XYCin) = YCin + XCin + XY (4-21) Note that the term XYCin was used three times in simplifying Cout. Figure 4-5 shows the logic circuit for Equations (4-20) and (4-21).
FIGURE 4-4 Truth Table for a Full Adder © Cengage Learning 2014 X Y Cin Cout Sum 0 0 0 0 0 0 0 1 0 1 0 1 0 0 1 0 1 1 1 0 1 0 0 0 1 1 0 1 1 0 1 1 0 1 0 1 1 1 1 1 Full Adder Sum X Y Cin Cout FIGURE 4-5 Implementation of Full Adder © Cengage Learning 2014 y cin cin cout x x y y x cin Sum Although designed for unsigned binary numbers, the parallel adder of Figure 4-3 can also be used for signed binary numbers with negative numbers expressed in complement form. When 2’s complement is used, the last carry (C4) is discarded, and there is no carry into the first cell. Because C0 = 0, the equations for the first cell may be simplified to S0 = A0 ⊕ B0 and C1 = A0 B0 When 1’s complement is used, the end-around carry is accomplished by connecting C4 to the C0 input, as shown by the dashed line in Figure 4-3.
When adding signed binary numbers with negative numbers expressed in com-plement form, the sign bit of the sum is wrong when an overflow occurs. That is, an overflow has occurred if adding two positive numbers gives a negative result, or adding two negative numbers gives a positive result. We will define a signal V that 110 Unit 4 is 1 when an overflow occurs. For Figure 4-3, we can use the sign bits of A, B, and S (the sum) to determine the value of V: V = A3 ′ B3 ′ S3 + A3B3S3 ′ (4-22) If the number of bits is large, a parallel binary adder of the type shown in Figure 4-4 may be rather slow because the carry generated in the first cell might have to propagate all of the way to the last cell.
Subtraction of binary numbers is most easily accomplished by adding the com-plement of the number to be subtracted. To compute A −B, add the complement of B to A. This gives the correct answer because A + (−B) = A −B. Either 1’s or 2’s complement is used depending on the type of adder employed.
The circuit of Figure 4-6 may be used to form A −B using the 2’s complement representation for negative numbers. The 2’s complement of B can be formed by first finding the 1’s complement and then adding 1. The 1’s complement is formed by inverting each bit of B, and the addition of 1 is effectively accomplished by putting a 1 into the carry input of the first full adder.
FIGURE 4-6 Binary Subtracter Using Full Adders © Cengage Learning 2014 Full Adder B′ 4 B′ 2 B′ 1 B′ 3 S4 A4 B4 A3 B3 A2 B2 A1 B1 Full Adder S3 Full Adder S2 Full Adder S1 c2 c1 = 1 c3 c4 c5 (Ignore last carry) A = 0110 (+6) B = 0011 (+3) The adder output is 0110 (+6) +1100 (1’s complement of 3) + 1 (first carry input) (1) 0011 = 3 = 6 −3 Alternatively, direct subtraction can be accomplished by employing a full sub-tracter in a manner analogous to a full adder. A block diagram for a parallel subtracter which subtracts Y from X is shown in Figure 4-7 . The first two bits are subtracted in the rightmost cell to give a difference d1, and a borrow signal (b2 = 1) is generated if it is necessary to borrow from the next column. A typical cell (cell i) has inputs xi, yi, and bi, and outputs bi+1 and di. An input bi = 1 indicates that we must borrow 1 from xi in that cell, and borrowing 1 from xi is equivalent to subtracting 1 from xi. In cell i, Example Applications of Boolean Algebra Minterm and Maxterm Expansions 111 bits bi and yi are subtracted from xi to form the difference di, and a borrow signal (bi+1 = 1) is generated if it is necessary to borrow from the next column.
Table 4-6 gives the truth table for a binary full subtracter. Consider the following case, where xi = 0, yi = 1 and bi = 1: FIGURE 4-7 Parallel Subtracter © Cengage Learning 2014 Full Subtracter bn + 1 bn dn xn yn Full Subtracter Cell i bi + 1 bi di xi yi Full Subtracter b3 b2 b1 = 0 d2 x2 y2 Full Subtracter d1 x1 y1 xi yi bi bi+1di 0 0 0 0 0 0 0 1 1 1 0 1 0 1 1 0 1 1 1 0 1 0 0 0 1 1 0 1 0 0 1 1 0 0 0 1 1 1 1 1 TABLE 4-6 Truth Table for Binary Full Subtracter © Cengage Learning 2014 Column i Before Borrow Column i After Borrow xi 0 10 −bi −1 −1 −yi −1 −1 di 0 (bi+1 = 1) Note that in column i, we cannot immediately subtract yi and bi from xi. Hence, we must borrow from column i + 1. Borrowing 1 from column i + 1 is equivalent to set-ting bi+1 to 1 and adding 10 (210) to xi. We then have di = 10 −1 −1 = 0. Verify that Table 4-6 is correct for the other input combinations and use it to work out several examples of binary subtraction.
The ripple carry adder is relatively slow because, in the worst case, a carry propa-gates through all stages of the adder, and there are two gate delays per stage. There are several techniques for reducing the carry propagation time. One is called a carry-lookahead adder. In the parallel adder the carry out of the ith stage can be written as Ci+1 = Ai Bi + Ci(Ai + Bi) = Ai Bi + Ci(Ai ⊕ Bi) = Gi + PiCi 112 Unit 4 where Gi = Ai Bi indicates the condition for the ith stage to generate a carry out and Pi = Ai ⊕ Bi (or Pi = Ai + Bi) indicates the condition for the ith stage to propagate a carry in to the carry out. Then Ci+2 can be expressed in terms of Ci.
Ci+2 = Gi+1 + Pi+1Ci+1 = Gi+1 + (Gi + Ci Pi)Pi+1 = Gi+1 + Pi+1Gi + Pi+1PiCi This can be continued to express Ci+2, Ci+3, etc. in terms of Ci.
Ci+1 = Gi + PiCi Ci+2 = Gi+1 + Pi+1Gi + Pi+1PiCi Ci+3 = Gi+2 + Pi+2Gi+1 + Pi+2 Pi+1Gi + Pi+2 Pi+1PiCi Ci+4 = Gi+3 + Pi+3Gi+2 + Pi+3 Pi+2Gi+1 + Pi+3 Pi+2 Pi+1Gi + Pi+3 Pi+2 Pi+1PiCi (4-23) Assuming that the maximum fan-in of the gates is not exceeded, each of these equa-tions can be implemented in a two-level circuit so, if a change in Ci propagates to Cj ( j = i + 1, i + 2, · · ·), it does so with a delay of two gates. Equations (4-23) are the carry-lookahead equations. If a circuit implements, for example, four of the equa-tions, it is a 4-bit carry-lookahead circuit.
Figure 4-8 shows a 4-bit parallel adder using a 4-bit carry-lookahead circuit. (The sum outputs are not shown.) After the generate and propagate outputs of the full adders are stable, if a change in C0 propagates to Ci (i = 1, 2, 3, or 4), it does so in two gate delays. Similarly, if a change in C1 propagates to Ci (i = 2, 3, or 4), it does so in two gate delays. In the 4-bit ripple-carry adder a change in C0 propagating to C4 requires 8 gate delays.
FIGURE 4-8 4-Bit Adder with Carry-Lookahead © Cengage Learning 2014 A0 B0 G0 P0 Full Adder A1 B1 G1 P1 C0 C1 A2 B2 G2 P2 A3 B3 G3 P3 Full Adder Full Adder Full Adder C3 C2 C4 4-bit Carry-Lookahead Circuit The carry-lookahead circuit can be increased in size to reduce the delay in longer parallel adders; however, the gate fan-in increases linearly with the size of the carry-lookahead circuit so the size is limited by the maximum fan-in available. For longer adders the carry-lookahead circuits can be cascaded. For example, a 16-bit paral-lel adder can be implemented using four 4-bit carry-lookahead circuits, as shown in Figure 4-9. Now the speed of the circuit is determined by the number of carry- lookahead circuits required. In Figure 4-9 the propagation delay from C0 to C16 would be 8 gate delays; a 16-bit ripple-carry adder would have a delay of 32 gates.
To reduce the delay of the adder without increasing the size of the carry- lookahead circuit, a second level of carry-lookahead circuits can be connected to the first level carry-lookahead circuits. To illustrate this, the equations for the four carry-lookahead circuits in Figure 4-9 are written in same form as Equation (4-23).
Applications of Boolean Algebra Minterm and Maxterm Expansions 113 C4 = G0 + P0C0 where G0 = G3 + P3G2 + P3P2G1 + P3P2 P1G0 and P0 = P3P2 P1P0 C8 = G4 + P4C4 where G4 = G7 + P7G6 + P7P6G5 + P7P6P5G4 and P4 = P7P6P5P4 C12 = G8 + P8C8 where G8 = G11 + P11G10 + P11P10G9 + P11P10P9G8 and P8 = P11P10P9P8 C16 = G12 + P12C12 where G12 = G15 + P15G14 + P15P14G13 + P15P14P13G12 and P12 = P15P14P13P12 Now these equations for C4, C8, C12, and C16 can be written in terms of C0.
C4 = G0 + P0C0 C8 = G4 + P4G0 + P4 P0C0 C12 = G8 + P8G4 + P8 P4G0 + P8 P4 P0C0 C16 = G12 + P12G8 + P12 P8G4 + P12 P8 P4G0 + P12 P8 P4 P0C0 These equations are the same as those for a 4-bit carry-lookahead circuit. The first level carry-lookahead circuits can be modified to produce Gi and Pi instead of Ci, i = 0, 4, 8, and 12. These provide inputs to a second level carry-lookahead circuit, as shown in Figure 4-10. Now the propagation delay from C0 to Ci, i = 4, 8, 12, and 16, is just two gate delays.
FIGURE 4-9 16-Bit Adder with Carry-Lookahead © Cengage Learning 2014 A0–3 B0–3 G0–3 P0–3 C0–3 C0 C4 A4–7 B4–7 G4–7 P4–7 C4–7 C8 A8–11 B8–11 G8–11 P8–11 C8–11 C12 A12–15 B12–15 G12–15 P12–15 Full Adders Full Adders Full Adders Full Adders C0–3 4-bit Carry-Lookahead 4-bit Carry-Lookahead 4-bit Carry-Lookahead 4-bit Carry-Lookahead C16 FIGURE 4-10 16-Bit Adder with Second Level Carry-Lookahead © Cengage Learning 2014 C0–3 C0 C4 C4–7 C8 C8–11 C12 Full Adders Full Adders Full Adders Full Adders C12–15 4-bit Carry-Lookahead 4-bit Carry-Lookahead 4-bit Carry-Lookahead 4-bit Carry-Lookahead C16 G0 P0 G4 P4 G8 P8 G12 P12 4-bit Carry-Lookahead Circuit A12–15 B12–15 A8–11 B8–11 A0–3 B0–3 A4–7 B4–7 G0–3 P0–3 G4–7 P4–7 G8–11 P8–11 G12–15 P12–15 114 Unit 4 Ci+1 = Gi + PiGi−1 + Pi Pi−1Gi−2 + Pi Pi−1Pi−2Gi−3 + Pi Pi−1Pi−2Pi−3Ci−3 C4 = G3 + P3G2 + P3P2G1 + P3P2P1G0 + P3P2P1P0C0 = G0 + P0C0 This expression can be expanded to express Ci+1 in terms of Ci−1.
Ci+1 = Gi + Ci Pi + Gi = (Gi−1 + Ci−1Pi−1)Pi = Gi + PiGi−1 + Pi Pi−1Ci−1 This procedure can be continued to obtain Ci+1 = Gi + CiPi Ci+1 = Gi + PiGi−1 + Pi Pi−1Ci−1 Ci+1 = Gi + PiGi−1 + Pi Pi−1Gi−2 + Pi Pi−1Pi−2Ci−2 Ci+1 = Gi + PiGi−1 + Pi Pi−1Gi−2 + Pi Pi−1Pi−2Gi−3 + Pi Pi−1Pi−2Pi−3Ci−3 and so on.
Problems 4.1 Represent each of the following sentences by a Boolean equation.
(a) The company safe should be unlocked only when Mr. Jones is in the office or Mr. Evans is in the office, and only when the company is open for business, and only when the security guard is present.
(b) You should wear your overshoes if you are outside in a heavy rain and you are wearing your new suede shoes, or if your mother tells you to.
(c) You should laugh at a joke if it is funny, it is in good taste, and it is not offensive to others, or if it is told in class by your professor (regardless of whether it is funny and in good taste) and it is not offensive to others.
(d) The elevator door should open if the elevator is stopped, it is level with the floor, and the timer has not expired, or if the elevator is stopped, it is level with the floor, and a button is pressed.
4.2 A flow rate sensing device used on a liquid transport pipeline functions as follows. The device provides a 5-bit output where all five bits are zero if the flow rate is less than 10 gallons per minute. The first bit is 1 if the flow rate is at least 10 gallons per minute; the first and second bits are 1 if the flow rate is at least 20 gallons per minute; the first, second, and third bits are 1 if the flow rate is at least 30 gallons per minute; and so on. The five bits, represented by the logical variables A, B, C, D, and E, are used as inputs to a device that provides two outputs Y and Z.
(a) Write an equation for the output Y if we want Y to be 1 iff the flow rate is less than 30 gallons per minute.
(b) Write an equation for the output Z if we want Z to be 1 iff the flow rate is at least 20 gallons per minute but less than 50 gallons per minute.
Applications of Boolean Algebra Minterm and Maxterm Expansions 115 4.3 Given F1 = Σ m(0, 4, 5, 6) and F2 = Σ m(0, 3, 6, 7) find the minterm expression for F1 + F2. State a general rule for finding the expression for F1 + F2 given the minterm expansions for F1 and F2. Prove your answer by using the general form of the minterm expansion.
4.4 (a) How many switching functions of two variables (x and y) are there?
(b) Give each function in truth table form and in reduced algebraic form.
4.5 A combinational circuit is divided into two subcircuits N1 and N2 as shown. The truth table for N1 is given. Assume that the input combinations ABC = 110 and ABC = 010 never occur. Change as many of the values of D, E, and F to don’t-cares as you can without changing the value of the output Z.
4.6 Work (a) and (b) with the following truth table: (a) Find the simplest expression for F, and specify the values of the don’t-cares that lead to this expression.
(b) Repeat (a) for G. (Hint: Can you make G the same as one of the inputs by prop-erly choosing the values for the don’t-care?) 4.7 Each of three coins has two sides, heads and tails. Represent the heads or tails status of each coin by a logical variable (A for the first coin, B for the second coin, and C for the third) where the logical variable is 1 for heads and 0 for tails. Write a logic function F(A, B, C) which is 1 iff exactly one of the coins is heads after a toss of the coins. Express F (a) as a minterm expansion.
(b) as a maxterm expansion.
N1 N2 A B C D E F Z A B C D E F 0 0 0 1 1 0 0 0 1 0 0 1 0 1 0 0 1 1 0 1 1 1 1 1 1 0 0 1 0 0 1 0 1 1 0 1 1 1 0 0 1 0 1 1 1 0 0 0 A B C F G 0 0 0 1 0 0 0 1 X 1 0 1 0 0 X 0 1 1 0 1 1 0 0 0 0 1 0 1 X 1 1 1 0 1 X 1 1 1 1 1 116 Unit 4 4.8 A switching circuit has four inputs as shown. A and B represent the first and second bits of a binary number N1. C and D represent the first and second bits of a binary number N2. The output is to be 1 only if the product N1 × N2 is less than or equal to 2.
(a) Find the minterm expansion for F.
(b) Find the maxterm expansion for F.
Express your answers in both decimal notation and algebraic form.
4.9 Given: F(a, b, c) = abc′ + b′.
(a) Express F as a minterm expansion. (Use m-notation.) (b) Express F as a maxterm expansion. (Use M-notation.) (c) Express F′ as a minterm expansion. (Use m-notation.) (d) Express F′ as a maxterm expansion. (Use M- notation.) 4.10 Work Problem 4.9 using: F(a, b, c, d) = (a + b + d)(a′ + c)(a′ + b′ + c′)(a + b + c′ + d′) 4.11 (a) Implement a full subtracter using a minimum number of gates.
(b) Compare the logic equations for the full adder and full subtracter. What is the relation between si and di? Between ci+1 and bi+1?
4.12 Design a circuit which will perform the following function on three 4-bit numbers: (X3 X2 X1 X0 + Y3Y2Y1Y0) −Z3Z2Z1Z0 It will give a result S3S2S1S0, a carry, and a borrow. Use eight full adders and any other type of gates. Assume that negative numbers are represented in 2’s complement.
4.13 A combinational logic circuit has four inputs (A, B, C, and D) and one output Z. The output is 1 iff the input has three consecutive 0’s or three consecutive 1’s. For example, if A = 1, B = 0, C = 0, and D = 0, then Z = 1, but if A = 0, B = 1, C = 0, and D = 0, then Z = 0. Design the circuit using one four-input OR gate and four three-input AND gates.
4.14 Design a combinational logic circuit which has one output Z and a 4-bit input ABCD representing a binary number. Z should be 1 iff the input is at least 5, but is no greater than 11. Use one OR gate (three inputs) and three AND gates (with no more than three inputs each).
4.15 A logic circuit realizing the function f has four inputs A, B, C, and D. The three inputs A, B, and C are the binary representation of the digits 0 through 7 with A being the most-significant bit. The input D is an odd-parity bit, i.e., the value of D is such that A F B C D N1 N2 Applications of Boolean Algebra Minterm and Maxterm Expansions 117 A, B, C, and D always contain an odd number of 1’s. (For example, the digit 1 is rep-resented by ABC = 001 and D = 0, and the digit 3 is represented by ABCD = 0111.) The function f has value 1 if the input digit is a prime number. (A number is prime if it is divisible only by itself and 1; 1 is considered to be prime and 0 is not.) (a) List the minterms and don’t-care minterms of f in algebraic form.
(b) List the maxterms and don’t-care maxterms of f in algebraic form.
4.16 A priority encoder circuit has four inputs, x3, x2, x1, and x0. The circuit has three out-puts: z, y1, and y0. If one of the inputs is 1, z is 1 and y1 and y0 represent a 2-bit, binary number whose value equals the index of the highest numbered input that is 1. For example, if x2 is 1 and x3 is 0, then the outputs are z = 1 and y1 = 1 and y0 = 0. If all inputs are 0, z = 0 and y1 and y0 are don’t-cares.
(a) List in decimal form the minterms and don’t-care minterms of each output.
(b) List in decimal form the maxterms and don’t-care maxterms of each output.
4.17 The 9’s complement of a decimal digit d (0 to 9) is defined to be 9 −d. A logic circuit produces the 9’s complement of an input digit where the input and output digits are rep-resented in BCD. Label the inputs A, B, C, and D, and label the outputs W, X, Y and Z.
(a) Determine the minterms and don’t-care minterms for each of the outputs.
(b) Determine the maxterms and don’t-care maxterms for each of the outputs.
4.18 Repeat Problem 4.17 for the case where the input and output digits are represented using the 4-2-2-1 weighted code. (If only one weight of 2 is required for decimal digits less than 5, select the rightmost 2. In addition, select the codes so that W = A′, X = B′, Y = C′, and Z = D′. (There are two possible codes with these restrictions.) 4.19 Each of the following sentences has two possible interpretations depending on whether the AND or OR is done first. Write an equation for each interpretation.
(a) The buzzer will sound if the key is in the ignition switch, and the car door is open, or the seat belts are not fastened.
(b) You will gain weight if you eat too much, or you do not exercise enough, and your metabolism rate is too low.
(c) The speaker will be damaged if the volume is set too high, and loud music is played, or the stereo is too powerful.
(d) The roads will be very slippery if it snows, or it rains, and there is oil on the road.
4.20 A bank vault has three locks with a different key for each lock. Each key is owned by a different person. To open the door, at least two people must insert their keys into the assigned locks. The signal lines A, B, and C are 1 if there is a key inserted into lock 1, 2, or 3, respectively. Write an equation for the variable Z which is 1 iff the door should open.
4.21 A paper tape reader used as an input device to a computer has five rows of holes as shown. A hole punched in the tape indicates a logic 1, and no hole indicates a logic 0. As each hole pattern passes under the photocells, the pattern is translated into logic signals on lines A, B, C, D, and E. All patterns of holes indicate a valid character with two exceptions. A pattern consisting of none of the possible holes punched is not 118 Unit 4 used because it is impossible to distinguish between this pattern and the unpunched space between patterns. An incorrect pattern punched on the tape is erased by punching all five holes in that position. Therefore, a valid character punched on the tape will have at least one hole but will not have all five holes punched.
(a) Write an equation for a variable Z which is 1 iff a valid character is being read.
(b) Write an equation for a variable Y which is 1 iff the hole pattern being read has holes punched only in rows C and E.
4.22 A computer interface to a line printer has seven data lines that control the move-ment of the paper and the print head and determine which character to print. The data lines are labeled A, B, C, D, E, F, and G, and each represents a binary 0 or 1. When the data lines are interpreted as a 7-bit binary number with line A being the most significant bit, the data lines can represent the numbers 0 to 12710. The number 1310 is the command to return the print head to the beginning of a line, the number 1010 means to advance the paper by one line, and the numbers 3210 to 12710 represent printing characters.
(a) Write an equation for the variable X which is 1 iff the data lines indicate a com-mand to return the print head to the beginning of the line.
(b) Write an equation for the variable Y which is 1 iff there is an advance paper command on the data lines.
(c) Write an equation for the variable Z which is 1 iff the data lines indicate a print-able character. (Hint: Consider the binary representations of the numbers 0–31 and 32–127 and write the equation for Z with only two terms.) 4.23 Given F1 = Π M(0, 4, 5, 6) and F2 = Π M(0, 4, 7), find the maxterm expansion for F1F2.
State a general rule for finding the maxterm expansion of F1F2 given the maxterm expansions of F1 and F2.
Prove your answer by using the general form of the maxterm expansion.
4.24 Given F1 = Π M(0, 4, 5, 6) and F2 = Π M(0, 4, 7), find the maxterm expansion for F1 + F2.
State a general rule for finding the maxterm expansion of F1 + F2, given the max-term expansions of F1 and F2.
Prove your answer by using the general form of the maxterm expansion.
4.25 Four chairs are placed in a row: Photocells Variables A B C D E A B C D Applications of Boolean Algebra Minterm and Maxterm Expansions 119 Each chair may be occupied (1) or empty (0). Give the minterm and maxterm expan-sion for each logic function described.
(a) F(A, B, C, D) is 1 iff there are no adjacent empty chairs.
(b) G(A, B, C, D) is 1 iff the chairs on the ends are both empty.
(c) H(A, B, C, D) is 1 iff at least three chairs are full.
(d) J(A, B, C, D) is 1 iff there are more people sitting in the left two chairs than in the right two chairs.
4.26 Four chairs (A, B, C, and D) are placed in a circle: A next to B, B next to C, C next to D, and D next to A. Each chair may be occupied (1) or empty (0). Give the minterm and maxterm expansion for each of the following logic functions: (a) F(A, B, C, D) is 1 iff there are no adjacent empty chairs.
(b) G(A, B, C, D) is 1 iff there are at least three adjacent empty chairs.
(c) H(A, B, C, D) is 1 iff at least three chairs are full.
(d) J(A, B, C, D) is 1 iff there are more people sitting in chairs A and B than chairs C and D.
4.27 Given f(a, b, c) = a(b + c′).
(a) Express f as a minterm expansion (use m-notation).
(b) Express f as maxterm expansion (use M-notation).
(c) Express f ′ as a minterm expansion (use m-notation).
(d) Express f ′ as a maxterm expansion (use M-notation).
4.28 Work Problem 4.27 using f(a, b, c, d) = acd + bd′ + a′c′d + ab′cd + a′b′cd′.
4.29 Find both the minterm expansion and maxterm expansion for the following func-tions, using algebraic manipulations: (a) f(A, B, C, D) = AB + A′CD (b) f(A, B, C, D) = (A + B + D′)(A′ + C)(C + D) 4.30 Given F′(A, B, C, D) = Σ m(0, 1, 2, 6, 7, 13, 15).
(a) Find the minterm expansion for F (both decimal and algebraic form).
(b) Find the maxterm expansion for F (both decimal and algebraic form).
4.31 Repeat Problem 4.30 for F′(A, B, C, D) = Σ m(1, 2, 5, 6, 10, 15).
4.32 Work parts (a) through (d) with the given truth table.
A B C F1 F2 F3 F4 0 0 0 1 1 0 1 0 0 1 X 0 0 0 0 1 0 0 1 X 0 0 1 1 0 0 1 1 1 0 0 0 1 1 1 1 0 1 X 0 1 0 1 1 0 0 X X X 1 1 1 1 X 1 X 120 Unit 4 (a) Find the simplest expression for F1, and specify the values for the don’t-cares that lead to this expression.
(b) Repeat for F2.
(c) Repeat for F3.
(d) Repeat for F4.
4.33 Work Problem 4.5 using the following circuits and truth table. Assume that the input combinations of ABC = 011 and ABC = 110 will never occur.
4.34 Work Problem 4.7 for the following logic functions: (a) G1(A, B, C) is 1 iff all the coins landed on the same side (heads or tails).
(b) G2(A, B, C) is 1 iff the second coin landed on the same side as the first coin.
4.35 A combinational circuit has four inputs (A, B, C, D) and three outputs (X, Y, Z). XYZ represents a binary number whose value equals the number of 1’s at the input. For example if ABCD = 1011, XYZ = 011.
(a) Find the minterm expansions for X, Y, and Z.
(b) Find the maxterm expansions for Y and Z.
4.36 A combinational circuit has four inputs (A, B, C, D) and four outputs (W, X, Y, Z). WXYZ represents an excess-3 coded number whose value equals the number of 1’s at the input. For example, if ABCD = 1101, WXYZ = 0110.
(a) Find the minterm expansions for X, Y, and Z.
(b) Find the maxterm expansions for Y and Z.
4.37 A combinational circuit has four inputs (A, B, C, D), which represent a binary-coded-decimal digit. The circuit has two groups of four outputs—S, T, U, V, and W, X, Y, Z. Each group represents a BCD digit. The output digits represent a deci-mal number which is five times the input number. For example, if ABCD = 0111, the outputs are 0011 0101. Assume that invalid BCD digits do not occur as inputs.
(a) Construct the truth table.
(b) Write down the minimum expressions for the outputs by inspection of the truth table. (Hint: Try to match output columns in the table with input columns.) 4.38 Work Problem 4.37 where the BCD outputs represent a decimal number that is 1 more than four times the input number. For example, if ABCD = 0011, the outputs are 0001 0011.
N1 N2 A B C D E F Z A B C D E F 0 0 0 1 1 0 0 0 1 0 1 0 0 1 0 0 0 1 0 1 1 0 0 0 1 0 0 0 1 0 1 0 1 0 0 1 1 1 0 0 0 1 1 1 1 1 0 1 Applications of Boolean Algebra Minterm and Maxterm Expansions 121 4.39 Design a circuit which will add a 4-bit binary number to a 5-bit binary number. Use five full adders. Assume negative numbers are represented in 2’s complement. (Hint: How do you make a 4-bit binary number into a 5-bit binary number, without mak-ing a negative number positive or a positive number negative? Try writing down the representation for –3 as a 3-bit 2’s complement number, a 4-bit 2’s complement number, and a 5-bit 2’s complement number. Recall that one way to find the 2’s complement of a binary number is to complement all bits to the left of the first 1.) 4.40 A half adder is a circuit that adds two bits to give a sum and a carry. Give the truth table for a half adder, and design the circuit using only two gates. Then design a circuit which will find the 2’s complement of a 4-bit binary number. Use four half adders and any additional gates. (Hint: Recall that one way to find the 2’s comple-ment of a binary number is to complement all bits, and then add 1.) 4.41 (a) Write the switching function f(x, y) = x + y as a sum of minterms and as a prod-uct of maxterms.
(b) Consider the Boolean algebra of four elements 50, 1, a, b6 specified by the following operation tables and the Boolean function f(x, y) = ax + by where a and b are two of the elements in the Boolean algebra. Write f(x, y) in a sum-of- minterms form.
(c) Write the Boolean function of part (b) in a product-of-maxterms form.
(d) Give a table of combinations for the Boolean function of part (b). (Note: The table of combinations has 16 rows, not just 4.) (e) Which four rows of the table of combinations completely specify the function of part (b)? Verify your answer.
4.42 (a) If m1 and m2 are minterms of n variables, prove that m1 + m2 = m1 ⊕m2.
(b) Prove that any switching function can be written as the exclusive OR sum of products where each product does not contain a complemented literal. (Hint: Start with the function written as a sum of minterms and use part (a).) 4.43 (a) Show that the full adder of Figure 4-5 can be implemented using two 2-input exclusive OR gates and three 2-input NAND gates. (Hint: Rewrite Equation (4-2) in terms of X ⊕ Y.) (b) Compare the maximum addition time of the ripple-carry adder of Figure 4-3 using the full adder of part (a) versus the full adder of Figure 4-5 assuming the same gate types are used in both.
4.44 Show that a full subtractor can be implemented using two 2-input exclusive OR gates, one inverter, and three 2-input NOR gates. (Hint: Write the borrow out equa-tion in product-of-sums form.) ′ + 0 1 a b · 0 1 a b 0 1 0 0 1 a b 0 0 0 0 0 1 0 1 1 1 1 1 1 0 1 a b a b a a 1 a 1 a 0 a a 0 b a b b 1 1 b b 0 b 0 b 122 Unit 4 4.45 The full adder of Figure 4-5 is modified by adding two control inputs, E1 and E0, and implemented as shown in the figure below.
(a) For each combination of values for E1 and E0, give the algebraic expression for the outputs of the full adder.
(b) Assume this modified full adder is used in the parallel adder of Figure 4-3. For each combination of values for E1 and E0, specify the function (Add, Exclusive OR, etc.) performed by the parallel adder.
4.46 Redo Problem 4.45 if gates G1 and G2 are NAND gates rather than AND gates.
4.47 Redo Problem 4.45 if gates G1 and G2 are NOR gates rather than AND gates and an inverter is inserted in the ci input of G2.
4.48 Redo Problem 4.45 if gates G1 and G2 are OR gates rather than AND gates and an inverter is inserted in the ci input of G2.
E1′ bi E1 E0 ai ai bi ci ai E0 bi G1 G2 ci bi ci ci+1 si 123 Karnaugh Maps U N I T 5 Objectives 1. Given a function (completely or incompletely specified) of three to five variables, plot it on a Karnaugh map. The function may be given in minterm, maxterm, or algebraic form.
2. Determine the essential prime implicants of a function from a map.
3. Obtain the minimum sum-of-products or minimum product-of-sums form of a function from the map.
4. Determine all of the prime implicants of a function from a map.
5. Understand the relation between operations performed using the map and the corresponding algebraic operations.
124 Unit 5 Study Guide In this unit we will study the Karnaugh (pronounced “car-no”) map. Just about any type of algebraic manipulation we have done so far can be facilitated by using the map, provided the number of variables is small.
1. Study Section 5.1, Minimum Forms of Switching Functions.
(a) Define a minimum sum of products.
(b) Define a minimum product of sums.
2. Study Section 5.2, Two- and Three-Variable Karnaugh Maps.
(a) Plot the given truth table on the map. Then, loop two pairs of 1’s on the map and write the simplified form of F.
Now simplify F algebraically and verify that your answer is correct.
(b) F(a, b, c) is plotted below. Find the truth table for F.
P Q F 0 0 1 0 1 1 1 0 0 1 1 1 0 1 0 Q P F F = 1 0 1 0 1 1 1 0 1 1 00 bc F a 01 11 10 0 a b c F 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1 Karnaugh Maps 125 (c) Plot the following functions on the given Karnaugh maps: F1(R, S, T) = Σ m(0, 1, 5, 6) F2(R, S, T) = Π M(2, 3, 4, 7) Why are the two maps the same?
(d) Plot the following function on the given map: f(x, y, z) = z′ + x′z + yz Do not make a minterm expansion or a truth table before plotting.
(e) For a three-variable map, which squares are “adjacent” to square 2? ___ (f ) What theorem is used when two terms in adjacent squares are combined?
(g) What law of Boolean algebra justifies using a given 1 on a map in two or more loops?
0 1 00 01 11 10 0 1 00 01 11 10 0 1 00 yz x 01 11 10 126 Unit 5 (h) Each of the following solutions is not minimum.
In each case, change the looping on the map so that the minimum solution is obtained.
(i) Work Problem 5.3.
(j) Find two different minimum sum-of-products expressions for the func-tion G, which is plotted below.
3. Study Section 5.3, Four-Variable Karnaugh Maps.
(a) Note the locations of the minterms on three- and four-variable maps (Figures 5-3(b) and 5-10). Memorize this ordering. This will save you a lot of time when you are plotting Karnaugh maps.
This ordering is valid only for the order of the variables given. If we label the maps as shown below, fill in the locations of the minterms: 1 1 1 1 1 1 00 bc G a 01 11 10 1 1 0 1 0 1 1 1 1 1 00 bc G G = G = a 01 11 10 00 01 11 10 00 AB CD 01 11 10 00 01 11 10 0 A BC 1 1 1 1 00 bc f = ab′ + abc g = a′ + ab a 01 11 10 1 0 1 0 1 1 1 1 1 00 bc a 01 11 10 1 Karnaugh Maps 127 (b) Given the following map, write the minterm and maxterm expansions for F in decimal form: (c) Plot the following functions on the given maps: (1) f (w, x, y, z) = Σ m(0, 1, 2, 5, 7, 8, 9, 10, 13, 14) (2) f (w, x, y, z) = x′z′ + y′z + w′xz + wyz′ Your answers to (1) and (2) should be the same.
(d) For a four-variable map, which squares are adjacent to square 14? __ To square 8? _ (e) When we combine two adjacent 1’s on a map, this corresponds to applying the theorem xy′ + xy = x to eliminate the variable in which the two terms differ. Thus, looping the two 1’s as indicated on the following map is equiva-lent to combining the corresponding minterms algebraically: 1 1 00 01 11 10 1 1 1 1 1 00 cd ab 01 11 10 1 F = F = 00 01 11 10 00 yz wx 01 11 10 00 01 11 10 00 yz wx 01 11 10 1 00 01 11 10 1 1 1 1 00 cd ab 01 11 10 1 a′b′c′d + ab′c′d = b′c′d [The term b′c′d can be read directly from the map because it spans the first and last columns (b′) and because it is in the second row (c′d).] 128 Unit 5 Loop two other pairs of adjacent 1’s on this map and state the algebraic equivalent of looping these terms. Now read the loops directly off the map and check your algebra.
(f ) When we combine four adjacent 1’s on a map (either four in a line or four in a square) this is equivalent to applying xy + xy′ = x three times: Loop the other four 1’s on the map and state the algebraic equivalent.
(g) For each of the following maps, loop a minimum number of terms which will cover all of the 1’s.
(For each part you should have looped two groups of four 1’s and two groups of two 1’s).
Write down the minimum sum-of-products expression for f1 and f2 from these maps.
f1 = _______ f2 = __________________________________________________ (h) Why is it not possible to combine three or six minterms together rather than just two, four, eight, etc.?
a′b′cd + a′b′cd′ + ab′cd + ab′cd′ = a′b′c + ab′c = b′c 1 00 01 11 10 1 1 1 1 1 00 cd ab 01 11 10 1 1 1 1 00 01 f1 f2 11 10 1 1 1 1 1 00 cd ab 01 11 10 1 1 00 01 11 10 1 1 1 1 1 1 00 cd ab 01 11 10 1 Karnaugh Maps 129 (i) Note the procedure for deriving the minimum product of sums from the map. You will probably make fewer mistakes if you write down f ′ as a sum of products first and then complement it, as illustrated by the example in Figure 5-14. ( j) Work Problems 5.4 and 5.5.
4. Study Section 5.4, Determination of Minimum Expressions Using Essential Prime Implicants.
(a) For the map of Figure 5-15, list three implicants of F other than those which are labeled.
For the same map, is ac′d′ a prime implicant of F? Why or why not?
(b) For the given map, are any of the circled terms prime implicants?
Why or why not?
5. Study Figure 5-18 carefully and then answer the following questions for the given map: (a) How many 1’s are adjacent to m0?
(b) Are all these 1’s covered by a single prime implicant?
(c) From your answer to (b), can you determine whether B′C′ is essential?
(d) How many 1’s are adjacent to m9?
(e) Are all of these 1’s covered by a single prime implicant?
(f ) From your answer to (e), is B′C′ essential?
(g) How many 1’s are adjacent to m7?
(h) Why is A′C essential?
(i) Find two other essential prime implicants and tell which minterm makes them essential.
1 00 01 11 10 1 1 1 1 1 00 CD AB 01 11 10 1 1 1 0 1 4 1 00 01 11 10 8 1 1 1 9 1 3 1 7 1 00 CD AB 01 11 10 2 1 6 1 10 130 Unit 5 6. (a) How do you determine if a prime implicant is essential using a Karnaugh map?
(b) For the following map, why is A′B′not essential?
Why is BD′ essential?
Is A′D′ essential? Why?
Is BC′ essential? Why?
Is B′CD essential? Why?
Find the minimum sum of products.
(c) Work Programmed Exercise 5.1.
(d) List all 1’s and X’s that are adjacent to 10.
1 1 1 00 01 11 10 1 1 1 1 1 1 00 CD AB 01 11 10 1 1 10 14 112 00 01 11 10 8 X1 15 X13 9 3 X7 115 111 00 CD AB 01 11 10 2 6 X14 10 Why is A′C′ an essential prime implicant?
List all 1’s and X’s adjacent to 115.
Karnaugh Maps 131 Based on this list, why can you not find an essential prime implicant that covers 115?
Does this mean that there is no essential prime implicant that covers 115?
What essential prime implicant covers 111?
Can you find an essential prime implicant that covers 112? Explain.
Find two prime implicants that cover 112.
Give two minimum expressions for F.
(e) Work Problem 5.6.
(f ) If you have a copy of the LogicAid program available, use the Karnaugh map tutorial mode to help you learn to find minimum solutions from Karnaugh maps. This program will check your work at each step to make sure that you loop the terms in the correct order. It also will check your final answer. Work Problem 5.7 using the Karnaugh map tutor.
7. (a) In Example 4, page 107 , we derived the following function: Z = Σ m(0, 3, 6, 9) + Σ d(10, 11, 12, 13, 14, 15) Plot Z on the given map using X’s to represent don’t-care terms.
00 01 11 Z 10 00 CD AB 01 11 10 (b) Show that the minimum sum of products is Z = A′B′C′D′ + B′CD + AD + BCD′ Which four don’t-care minterms were assigned the value 1 when forming your solution?
132 Unit 5 (c) Show that the minimum product of sums for Z is Z = (B′ + C )(B′ + D′)(A′ + D)(A + C + D′)(B + C′ + D) Which one don’t-care term of Z was assigned the value 1 when forming your solution?
(d) Work Problem 5.8.
8. Study Section 5.5, Five-Variable Karnaugh Maps.
(a) The figure below shows a three-dimensional five-variable map. Plot the 1’s and loops on the corresponding two-dimensional map, and give the mini-mum sum-of-products expression for the function.
(b) On a five-variable map (Figure 5-21), what are the five minterms adjacent to minterm 24?
(c) Work through all of the examples in this section carefully and make sure that you understand all of the steps.
(d) Two minimum solutions are given for Figure 5-24. There is a third mini-mum sum-of-products solution. What is it?
(e) Work Programmed Exercise 5.2.
00 00 00 01 11 10 01 11 10 01 11 10 00 1 0 DE A BC 01 11 10 DE A = 1 F = A = 0 BC 1 1 1 1 1 1 1 1 Karnaugh Maps 133 Find the three 1’s and X’s adjacent to 118. Can these all be looped with a single loop?
Find the 1’s and X’s adjacent to 124. Loop the essential prime implicant that covers 124.
Find the 1’s and X’s adjacent to 13. Loop the essential prime implicant that covers 13.
Can you find an essential prime implicant that covers 122? Explain.
Find and loop two more essential prime implicants.
Find three ways to cover the remaining 1 on the map and give the corre-sponding minimum solutions.
(g) If you have the LogicAid program available, work Problem 5.9, using the Karnaugh map tutor.
9. Study Section 5.6, Other Uses of Karnaugh Maps. Refer to Figure 5-8 and note that a consensus term exists if there are two adjacent, but nonoverlapping prime implicants. Observe how this principle is applied in Figure 5-26.
10. Work Problems 5.10, 5.11, 5.12, and 5.13. When deriving the minimum solution from the map, always write down the essential prime implicants first. If you do not, it is quite likely that you will not get the minimum solution. In addition, make sure you can find all of the prime implicants from the map (see Problem 5.10(b)).
11. Review the objectives.
0 4 12 00 01 11 10 8 1 5 13 9 3 7 15 11 00 1 0 DE A BC 01 11 10 2 6 14 X X 1 X 1 X 1 1 1 X X 1 1 1 1 X 10 16 20 28 24 17 21 29 25 19 23 31 27 18 22 30 26 (f ) 134 Switching functions can generally be simplified by using the algebraic techniques described in Unit 3. However, two problems arise when algebraic procedures are used: 1. The procedures are difficult to apply in a systematic way.
2. It is difficult to tell when you have arrived at a minimum solution.
The Karnaugh map method studied in this unit and the Quine-McCluskey proce-dure studied in Unit 6 overcome these difficulties by providing systematic methods for simplifying switching functions. The Karnaugh map is an especially useful tool for simplifying and manipulating switching functions of three or four variables, but it can be extended to functions of five or more variables. Generally, you will find the Karnaugh map method is faster and easier to apply than other simplification methods.
5.1 Minimum Forms of Switching Functions When a function is realized using AND and OR gates, the cost of realizing the func-tion is directly related to the number of gates and gate inputs used. The Karnaugh map techniques developed in this unit lead directly to minimum cost two-level circuits composed of AND and OR gates. An expression consisting of a sum of product terms corresponds directly to a two-level circuit composed of a group of AND gates feeding a single OR gate (see Figure 2-5). Similarly, a product-of-sums expression corresponds to a two-level circuit composed of OR gates feeding a sin-gle AND gate (see Figure 2-6). Therefore, to find minimum cost two-level AND-OR gate circuits, we must find minimum expressions in sum-of-products or product- of-sums form.
A minimum sum-of-products expression for a function is defined as a sum of product terms which (a) has a minimum number of terms and (b) of all those expressions which have the same minimum number of terms, has a minimum number of literals. The minimum sum of products corresponds directly to a minimum two-level gate circuit which has (a) a minimum number of gates and (b) a minimum number Karnaugh Maps Karnaugh Maps 135 Find a minimum sum-of-products expression for (5-1) a′b′ b′c bc′ ab F a′b′c′ a′b′c a′bc′ ab′c abc′ abc F(a, b, c) m Σ (0, 1, 2, 5, 6, 7) None of the terms in the above expression can be eliminated by consensus. However, combining terms in a different way leads directly to a minimum sum of products: (5-2) a′b′ bc′ ac F a′b′c′ a′b′c a′bc′ ab′c abc′ abc If the uniting theorem is applied to all possible pairs of minterms, six two-literal products are obtained: a′b′ , a′c′ , b′c, bc′ , ac, ab. Then, the consensus theorem can be applied to obtain a second minimal solution: a′c′ + b′c + ab (5-3) A minimum product-of-sums expression for a function is defined as a product of sum terms which (a) has a minimum number of terms, and (b) of all those expres-sions which have the same number of terms, has a minimum number of literals. Unlike the maxterm expansion, the minimum product-of-sums form of a function is not necessarily unique. Given a maxterm expansion, the minimum product of sums can often be obtained by a procedure similar to that used in the minimum sum-of-products case, except that the uniting theorem (X + Y)(X + Y′) = X is used to combine terms.
of gate inputs. Unlike the minterm expansion for a function, the minimum sum of products is not necessarily unique; that is, a given function may have two different minimum sum-of-products forms, each with the same number of terms and the same number of literals. Given a minterm expansion, the minimum sum-of-products form can often be obtained by the following procedure: 1. Combine terms by using the uniting theorem XY′ + XY = X. Do this repeat-edly to eliminate as many literals as possible. A given term may be used more than once because X + X = X.
2. Eliminate redundant terms by using the consensus theorem or other theorems.
Unfortunately, the result of this procedure may depend on the order in which terms are combined or eliminated so that the final expression obtained is not necessarily minimum.
Example 136 Unit 5 C′ D) (C′ D) (A B′ D′) (A B′ D′) (A B′ D′)( (A B′ C′ ) (A B′ C′ ) (B C′ D) (B′ C′ D) (A′ B C′ D) (A B′ C D′)(A B′ C′ D′)(A B′ C′ D)(A′ B′ C′ D)(A B C′ D) (5-4) eliminate by consensus The uniting theorem XY′ + XY = X can be applied to minterms and products where the minterms and products are represented in algebraic notation or binary notation. The first four-variable example below illustrates this for minterms and the second for products containing three literals. The dash indicates a missing variable.
ab′cd′ + ab′cd = ab′c 1 0 1 0 + 1 0 1 1 = 101– ab′c + abc = ac 1 0 1– + 111– = 1–1– Note that minterms only combine if they differ in one variable, and products only combine if they have dashes in the same position (same missing variables) and differ in one other variable. The examples below do not combine.
ab′cd′ + ab′c′d (will not combine) 10 10 + 1001 ab′c + abd (will not combine) 1 0 1– + 11–1 The Karnaugh maps introduced next arrange the minterms of a function so that it is easy to recognize visually when the simplification theorem applies to two minterms, two products with one missing variable, two products with two missing variables, etc.
5.2 Two- and Three-Variable Karnaugh Maps Just like a truth table, the Karnaugh map of a function specifies the value of the func-tion for every combination of values of the independent variables. A two-variable Karnaugh map is shown. The values of one variable are listed across the top of the map, and the values of the other variable are listed on the left side. Each square of the map corresponds to a pair of values for A and B as indicated.
Example Karnaugh Maps 137 Figure 5-1 shows the truth table for a function F and the corresponding Karnaugh map. Note that the value of F for A = B = 0 is plotted in the upper left square, and the other map entries are plotted in a similar way in Figure 5-1(b). Each 1 on the map corresponds to a minterm of F. We can read the minterms from the map just like we can read them from the truth table. A 1 in square 00 of Figure 5-1(c) indi-cates that A′B′ is a minterm of F. Similarly, a 1 in square 01 indicates that A′B is a minterm. Minterms in adjacent squares of the map can be combined since they differ in only one variable. Thus, A′B′ and A′B combine to form A′, and this is indicated by looping the corresponding 1’s on the map in Figure 5-1(d).
Figure 5-2 shows a three-variable truth table and the corresponding Karnaugh map (see Figure 5-27 for an alternative way of labeling maps). The value of one vari-able (A) is listed across the top of the map, and the values of the other two variables (B, C) are listed along the side of the map. The rows are labeled in the sequence 00, 01, 11, 10 so that values in adjacent rows differ in only one variable. For each combination of values of the variables, the value of F is read from the truth table and plotted in the appropriate map square. For example, for the input combination ABC = 001, the value F = 0 is plotted in the square for which A = 0 and BC = 01. For the combination ABC = 110, F = 1 is plotted in the A = 1, BC = 10 square.
0 1 0 B A A = 1, B = 0 1 A = 1, B = 1 A = 0, B = 0 A = 0, B = 1 0 1 0 B A 1 1 0 1 0 A′B′ + A′B = A′ F = A′ (d) 0 B A 1 0 1 1 0 1 0 (b) A B F 0 0 1 1 0 1 1 1 0 0 1 0 (a) 0 B A 1 A′B′ A′B 0 1 1 0 1 0 (c) F = A′B′ + A′B FIGURE 5-1 FIGURE 5-2 Truth Table and Karnaugh Map for Three-Variable Function © Cengage Learning 2014 0 1 0 1 0 0 1 0 1 00 ABC = 001, F = 0 ABC = 110, F = 1 BC A 01 11 10 1 F (b) A B C F 0 0 0 0 0 0 1 0 0 1 0 1 0 1 1 1 1 0 0 1 1 0 1 0 1 1 0 1 1 1 1 0 (a) © Cengage Learning 2014 138 Unit 5 Figure 5-3 shows the location of the minterms on a three-variable map. Minterms in adjacent squares of the map differ in only one variable and therefore can be com-bined using the uniting theorem XY′ + XY = X. For example, minterm 011 (a′bc) is adjacent to the three minterms with which it can be combined—001 (a′b′c), 010 (a′bc′), and 111 (abc). In addition to squares which are physically adjacent, the top and bottom rows of the map are defined to be adjacent because the corresponding minterms in these rows differ in only one variable. Thus 000 and 010 are adjacent, and so are 100 and 110.
Given the minterm expansion of a function, it can be plotted on a map by plac-ing 1’s in the squares which correspond to minterms of the function and 0’s in the remaining squares (the 0’s may be omitted if desired). Figure 5-4 shows the plot of F(a, b, c) = m1 + m3 + m5. If F is given as a maxterm expansion, the map is plotted by placing 0’s in the squares which correspond to the maxterms and then by filling in the remaining squares with 1’s. Thus, F(a, b, c) = M0M2M4M6M7 gives the same map as Figure 5-4.
Figure 5-5 illustrates how product terms can be plotted on Karnaugh maps. To plot the term b, 1’s are entered in the four squares of the map where b = 1. The term bc′ is 1 when b = 1 and c = 0, so 1’s are entered in the two squares in the bc = 10 row. The term ac′ is 1 when a = 1 and c = 0, so 1’s are entered in the a = 1 column in the rows where c = 0.
FIGURE 5-3 Location of Minterms on a Three-Variable Karnaugh Map © Cengage Learning 2014 0 4 1 5 3 7 2 00 bc a 01 11 10 6 (b) Decimal notation 000 100 0 1 0 1 001 101 011 111 010 00 bc a 01 11 10 110 (a) Binary notation 100 is adjacent to 110 FIGURE 5-4 Karnaugh Map of F(a, b, c) = Σ m(1, 3, 5) = Π M(0, 2, 4, 6, 7) © Cengage Learning 2014 0 0 0 4 0 1 1 1 1 5 1 3 0 7 0 00 bc a 01 11 10 2 0 6 Karnaugh Maps 139 If a function is given in algebraic form, it is unnecessary to expand it to minterm form before plotting it on a map. If the algebraic expression is converted to sum-of-products form, then each product term can be plotted directly as a group of 1’s on the map. For example, given that f (a, b, c) = abc′ + b′c + a′ we would plot the map as follows: Figure 5-6 illustrates how a simplified expression for a function can be derived using a Karnaugh map. The function to be simplified is first plotted on a Karnaugh map in Figure 5-6(a). Terms in adjacent squares on the map differ in only one vari-able and can be combined using the uniting theorem XY′ + XY = X. Thus a′b′c and a′bc combine to form a′c, and a′b′c and ab′c combine to form b′c, as shown in Figure 5-6(b). A loop around a group of minterms indicates that these terms have been combined. The looped terms can be read directly off the map. Thus, for Figure 5-6(b), term T1 is in the a = 0 (a′) column, and it spans the rows where c = 1, so T1 = a′c. Note that b has been eliminated because the two minterms in T1 differ in the variable b. Similarly, the term T2 is in the bc = 01 row so T2 = b′c, and a has been eliminated because T2 spans the a = 0 and a = 1 columns. Thus, the minimum sum-of-products form for F is a′c + b′c.
FIGURE 5-5 Karnaugh Maps for Product Terms © Cengage Learning 2014 b b = 1 in these rows a = 1 in this colum n c = 0 in these rows 1 1 1 00 bc a 01 11 10 1 bc′ 1 00 bc a 01 11 10 1 1 0 1 0 1 0 1 ac′ 00 bc a 01 11 10 1 1 0 1 1 1 1 1 00 bc a 01 11 10 1 1. The term abc′ is 1 when a = 1 and bc = 10, so we place a 1 in the square which corresponds to the a = 1 column and the bc = 10 row of the map.
2. The term b′c is 1 when bc = 01, so we place 1’s in both squares of the bc = 01 row of the map.
3. The term a′ is 1 when a = 0, so we place 1’s in all the squares of the a = 0 column of the map. (Note: Since there already is a 1 in the abc = 001 square, we do not have to place a second 1 there because x + x = x.) abc′ 140 Unit 5 FIGURE 5-8 Karnaugh Maps that Illustrate the Consensus Theorem © Cengage Learning 2014 0 1 1 1 1 00 yz x 01 11 10 1 x′z xy xy + x′z + yz = xy + x′z yz (consensus term) 0 1 1 1 1 00 yz x 01 11 10 1 The map for the complement of F (Figure 5-7) is formed by replacing 0’s with 1’s and 1’s with 0’s on the map of F. To simplify F′, note that the terms in the top row combine to form b′c′, and the terms in the bottom row combine to form bc′. Because b′c′ and bc′ differ in only one variable, the top and bottom rows can then be combined to form a group of four 1’s, thus eliminating two variables and leav-ing T1 = c′. The remaining 1 combines, as shown, to form T2 = ab, so the minimum sum- of-products form for F′ is c′ + ab.
The Karnaugh map can also illustrate the basic theorems of Boolean algebra. Figure 5-8 illustrates the consensus theorem, XY + X′Z + YZ = XY + X′Z. Note that the consensus term (YZ) is redundant because its 1’s are covered by the other two terms.
FIGURE 5-6 Simplification of a Three-Variable Function © Cengage Learning 2014 0 1 1 1 1 00 bc a 01 11 10 0 F = Σ m(1, 3, 5) F = a′c + b′c (a) Plot of minterms (b) Simplified form of F 1 1 1 1 00 bc a 01 11 10 T1 =a′b′c + a′bc = a′c T2 = a′b′c + ab′c = b′c FIGURE 5-7 Complement of Map in Figure 5-6(a) © Cengage Learning 2014 1 1 0 1 0 0 0 1 1 00 bc a 01 11 10 1 T1 = b′c′ + bc′ = c′ T2 = ab Karnaugh Maps 141 If a function has two or more minimum sum-of-products forms, all of these forms can be determined from a map. Figure 5-9 shows the two minimum solutions for F = Σ m(0, 1, 2, 5, 6, 7).
5.3 Four-Variable Karnaugh Maps Figure 5-10 shows the location of minterms on a four-variable map. Each minterm is located adjacent to the four terms with which it can combine. For example, m5 (0101) could combine with m1 (0001), m4 (0100), m7 (0111), or m13 (1101) because it differs in only one variable from each of the other minterms. The definition of adjacent squares must be extended so that not only are top and bottom rows adjacent as in the three-variable map, but the first and last columns are also adjacent. This requires numbering the columns in the sequence 00, 01, 11, 10 so that minterms 0 and 8, 1 and 9, etc., are in adjacent squares.
We will now plot the following four-variable expression on a Karnaugh map (Figure 5-11): f (a, b, c, d) = acd + a′b + d′ The first term is 1 when a = c = d = 1, so we place 1’s in the two squares which are in the a = 1 column and cd = 11 row. The term a′b is 1 when ab = 01, so we place four 1’s in the ab = 01 column. Finally, d′ is 1 when d = 0, so we place eight 1’s in the two rows for which d = 0. (Duplicate 1’s are not plotted because 1 + 1 = 1.) FIGURE 5-9 Function with Two Minimum Forms © Cengage Learning 2014 1 0 F = a′b′ + bc′ + ac 1 1 1 1 1 00 bc a 01 11 10 1 1 0 F = a′c′ + b′c + ab 1 1 1 1 1 00 bc a 01 11 10 1 FIGURE 5-10 Location of Minterms on Four-Variable Karnaugh Map © Cengage Learning 2014 0 4 12 8 00 01 11 10 1 5 13 9 3 7 15 11 2 00 CD AB 01 11 10 6 14 10 142 Unit 5 Next, we will simplify the functions f1 and f2 given in Figure 5-12. Because the functions are specified in minterm form, we can determine the locations of the 1’s on the map by referring to Figure 5-10. After plotting the maps, we can then combine adjacent groups of 1’s. Minterms can be combined in groups of two, four, or eight to eliminate one, two, or three variables, respectively. In Figure 5-12(a), the pair of 1’s in the ab = 00 column and also in the d = 1 rows represents a′b′d. The group of four 1’s in the b = 1 columns and c = 0 rows represents bc′.
In Figure 5-12(b), note that the four corner 1’s span the b = 0 columns and d = 0 rows and, therefore, can be combined to form the term b′d′. The group of eight 1’s covers both rows where c = 1 and, therefore, represents the term c. The pair of 1’s which is looped on the map represents the term a′bd because it is in the ab = 01 column and spans the d = 1 rows.
The Karnaugh map method is easily extended to functions with don’t-care terms. The required minterms are indicated by 1’s on the map, and the don’t-care minterms are indicated by X’s. When choosing terms to form the minimum sum of products, all FIGURE 5-11 Plot of acd + a′b + d′ © Cengage Learning 2014 1 1 1 1 00 01 11 10 1 1 1 1 1 00 cd ab 01 11 10 1 1 1 a′b acd d′ 1 1 00 01 f1= Σ m(1, 3, 4, 5, 10, 12, 13) = bc′ + a′b′d + ab′cd′ f2 = Σ m(0, 2, 3, 5, 6, 7, 8, 10, 11, 14, 15) = c + b′d′ + a′bd (a) (b) 11 10 1 1 1 1 1 00 cd ab 01 11 10 1 1 00 01 11 10 Four corner terms combine to give b′d′ 1 1 1 1 1 1 00 cd ab 01 11 10 1 1 1 a′b′d c bc′ ab′cd′ a′bd FIGURE 5-12 Simplification of Four-Variable Functions © Cengage Learning 2014 Karnaugh Maps 143 the 1’s must be covered, but the X’s are only used if they will simplify the resulting expression. In Figure 5-13, the only don’t-care term used in forming the simplified expression is 13.
The use of Karnaugh maps to find a minimum sum-of-products form for a func-tion has been illustrated in Figures 5-1, 5-6, and 5-12. A minimum product of sums can also be obtained from the map. Because the 0’s of f are 1’s of f ′, the minimum sum of products for f ′ can be determined by looping the 0’s on a map of f. The complement of the minimum sum of products for f ′ is then the minimum product of sums for f. The following example illustrates this procedure for f = x′z′ + wyz + w′y′z′ + x′y First, the 1’s of f are plotted in Figure 5-14. Then, from the 0’s, f ′ = y′z + wxz′ + w′xy and the minimum product of sums for f is f = (y + z′)(w′ + x′ + z)(w + x′ + y′) FIGURE 5-13 Simplification of an Incompletely Specified Function © Cengage Learning 2014 X 00 01 11 10 1 1 X 1 1 1 00 cd ab 01 11 10 X f = Σ m(1, 3, 5, 7, 9) + Σ d(6, 12, 13) = a′d + c′d FIGURE 5-14 © Cengage Learning 2014 1 1 0 1 00 01 11 10 0 0 0 0 1 0 1 1 1 00 yz wx 01 11 10 0 0 1 144 Unit 5 5.4 Determination of Minimum Expressions Using Essential Prime Implicants Any single 1 or any group of 1’s which can be combined together on a map of the function F represents a product term which is called an implicant of F (see Section 6.1 for a formal definition of implicant and prime implicant). Several implicants of F are indicated in Figure 5-15. A product term implicant is called a prime implicant if it cannot be combined with another term to eliminate a variable. In Figure 5-15, a′b′c, a′cd′, and ac′ are prime implicants because they cannot be combined with other terms to eliminate a variable. On the other hand, a′b′c′d′ is not a prime implicant because it can be combined with a′b′cd′ or ab′c′d′. Neither abc′, nor ab′c′is a prime implicant because these terms can be combined together to form ac′.
All of the prime implicants of a function can be obtained from a Karnaugh map. A single 1 on a map represents a prime implicant if it is not adjacent to any other 1’s. Two adjacent 1’s on a map form a prime implicant if they are not contained in a group of four 1’s; four adjacent 1’s form a prime implicant if they are not contained in a group of eight 1’s, etc.
The minimum sum-of-products expression for a function consists of some (but not necessarily all) of the prime implicants of a function. In other words, a sum-of-products expression containing a term which is not a prime implicant cannot be mini-mum. This is true because if a nonprime term were present, the expression could be simplified by combining the nonprime term with additional minterms. In order to find the minimum sum of products from a map, we must find a minimum number of prime implicants which cover all of the 1’s on the map. The function plotted in Figure 5-16 has six prime implicants. Three of these prime implicants cover all of the 1’s on the map, and the minimum solution is the sum of these three prime implicants. The shaded loops represent prime implicants which are not part of the minimum solution.
When writing down a list of all of the prime implicants from the map, note that there are often prime implicants which are not included in the minimum sum of products. Even though all of the 1’s in a term have already been covered by prime FIGURE 5-15 © Cengage Learning 2014 1 1 1 00 01 11 10 1 1 1 1 00 cd ab 01 11 10 1 a′b′c′d′ a′b′c ac′ ab′c′ abc′ a′cd′ Karnaugh Maps 145 implicants, that term may still be a prime implicant provided that it is not included in a larger group of 1’s. For example, in Figure 5-16, a′c′d is a prime implicant because it cannot be combined with other 1’s to eliminate another variable. However, abd is not a prime implicant because it can be combined with two other 1’s to form ab. The term b′cd is also a prime implicant even though both of its 1’s are already covered by other prime implicants. In the process of finding prime implicants, don’t-cares are treated just like 1’s. However, a prime implicant composed entirely of don’t-cares can never be part of the minimum solution.
Because all of the prime implicants of a function are generally not needed in forming the minimum sum of products, a systematic procedure for selecting prime implicants is needed. If prime implicants are selected from the map in the wrong order, a nonminimum solution may result. For example, in Figure 5-17 , if CD is cho-sen first, then BD, B′C, and AC are needed to cover the remaining 1’s, and the solu-tion contains four terms. However, if the prime implicants indicated in Figure 5-17(b) are chosen first, all 1’s are covered and CD is not needed.
In Section 6.2, prime implicant charts are defined. They can be used systemati-cally to find (all) minimum solutions. The procedure described below can be used to find minimum solutions for functions that are not too complicated.
Note that some of the minterms on the map of Figure 5-17(a) can be covered by only a single prime implicant, but other minterms can be covered by two different prime implicants. For example, m2 is covered only by B′C, but m3 is covered by both FIGURE 5-16 Determination of All Prime Implicants © Cengage Learning 2014 1 1 00 01 11 10 Minimum solution: F = a′b′d + bc′ + ac All prime implicants: a′b′d, bc′, ac, a′c′d, ab, b′cd 1 1 1 1 1 1 00 cd ab 01 11 10 1 1 a′c′d b′cd FIGURE 5-17 © Cengage Learning 2014 00 01 11 10 1 1 1 1 1 1 1 00 CD m2 m14 f = CD + BD + B′C + AC f = BD + B′C + AC (a) (b) m5 CD AB 01 11 10 1 00 01 11 10 1 1 1 1 1 1 1 00 CD AB 01 11 10 1 1 1 146 Unit 5 B′C and CD. If a minterm is covered by only one prime implicant, that prime impli-cant is said to be essential, and it must be included in the minimum sum of products. Thus, B′C is an essential prime implicant because m2 is not covered by any other prime implicant. However, CD is not essential because each of the 1’s in CD can be covered by another prime implicant. The only prime implicant which covers m5 is BD, so BD is essential. Similarly, AC is essential because no other prime implicant covers m14. In this example, if we choose all of the essential prime implicants, all of the 1’s on the map are covered and the nonessential prime implicant CD is not needed.
In general, in order to find a minimum sum of products from a map, we should first loop all of the essential prime implicants. One way of finding essential prime implicants on a map is simply to look at each 1 on the map that has not already been covered, and check to see how many prime implicants cover that 1. If there is only one prime implicant which covers the 1, that prime implicant is essential. If there are two or more prime implicants which cover the 1, we cannot say whether these prime implicants are essential or not without checking the other minterms. For simple problems, we can locate the essential prime implicants in this way by inspection of each 1 on the map. For example, in Figure 5-16, m4 is covered only by the prime implicant bc′, and m10 is covered only by the prime implicant ac. All other 1’s on the map are covered by two prime implicants; therefore, the only essential prime implicants are bc′ and ac.
For more complicated maps, and especially for maps with five or more variables, we need a more systematic approach for finding the essential prime implicants. When checking a minterm to see if it is covered by only one prime implicant, we must look at all squares adjacent to that minterm. If the given minterm and all of the 1’s adja-cent to it are covered by a single term, then that term is an essential prime implicant.1 If all of the 1’s adjacent to a given minterm are not covered by a single term, then there are two or more prime implicants which cover that minterm, and we cannot say whether these prime implicants are essential or not without checking the other minterms. Figure 5-18 illustrates this principle.
1This statement is proved in Appendix D.
FIGURE 5-18 © Cengage Learning 2014 0 4 12 00 01 11 10 Note: 1’s shaded in blue are covered by only one prime implicant. All other 1’s are covered by at least two prime implicants.
8 1 5 13 9 3 7 15 11 00 CD A ′C′ ACD A ′B′D′ AB 01 11 10 2 6 14 1 1 1 1 1 1 1 1 10 Karnaugh Maps 147 The adjacent 1’s for minterm m0 (l0) are 11, 12, and l4. Because no single term cov-ers these four 1’s, no essential prime implicant is yet apparent. The adjacent 1’s for 11 are 10 and 15, so the term which covers these three 1’s (A′C′) is an essential prime implicant. Because the only 1 adjacent to 12 is 10, A′B′D′ is also essential. Because the 1’s adjacent to 17 (15 and 115) are not covered by a single term, neither A′BD nor BCD is essential at this point. However, because the only 1 adjacent to 111 is 115, ACD is essential. To complete the minimum solution, one of the nonessential prime implicants is needed. Either A′BD or BCD may be selected. The final solution is A′C′ + A′B′D′ + ACD + % or A′BD BCD -If a don’t-care minterm is present on the map, we do not have to check it to see if it is covered by one or more prime implicants. However, when checking a 1 for adjacent 1’s, we treat the adjacent don’t-cares as if they were 1’s because don’t-cares may be combined with 1’s in the process of forming prime implicants. The following procedure can then be used to obtain a minimum sum of products from a Karnaugh map: 1. Choose a minterm (a 1) which has not yet been covered.
2. Find all 1’s and X’s adjacent to that minterm. (Check the n adjacent squares on an n-variable map.) 3. If a single term covers the minterm and all of the adjacent 1’s and X’s, then that term is an essential prime implicant, so select that term. (Note that don’t-care terms are treated like 1’s in steps 2 and 3 but not in step 1.) 4. Repeat steps 1, 2, and 3 until all essential prime implicants have been chosen.
5. Find a minimum set of prime implicants which cover the remaining 1’s on the map. (If there is more than one such set, choose a set with a minimum number of literals.) Figure 5-19 gives a flowchart for this procedure. The following example (Figure 5-20) illustrates the procedure. Starting with 14, we see that the adjacent 1’s and X’s (X0, 15, and 16) are not covered by a single term, so no essential prime impli-cant is apparent. However, 16 and its adjacent 1’s and X’s (14 and X7) are covered by A′B, so A′B is an essential prime implicant. Next, looking at 113, we see that its adjacent 1’s and X’s (15, 19, and X15) are not covered by a single term, so no essential prime implicant is apparent. Similarly, an examination of the terms adjacent to 18 and 19 reveals no essential prime implicants. However, 110 has only 18 adjacent to it, so AB′D′ is an essential prime implicant because it covers both 110 and 18. Having first selected the essential prime implicants, we now choose AC′D because it covers both of the remaining 1’s on the map.
Judicious selection of the order in which the minterms are selected (step 1) reduces the amount of work required in applying this procedure. As will be seen in the next section, this procedure is especially helpful in obtaining minimum solutions for five- and six-variable problems.
There are two equivalent methods of obtaining minimum product-of-sum expressions for a function f. As mentioned above, one method is to find minimum a sum-of-products expression for f ′, and then complement f ′ to obtain a minimum 148 Unit 5 FIGURE 5-20 © Cengage Learning 2014 X0 14 18 00 01 11 10 Shaded 1’s are covered by only one prime implicant.
15 113 19 X7 X15 00 CD AB 01 11 10 16 110 FIGURE 5-19 Flowchart for Determining a Minimum Sum of Products Using a Karnaugh Map © Cengage Learning 2014 Find a minimum set of prime implicants which cover the remaining 1’s on the map.
That term is an essential prime implicant. Loop it.
Find all adjacent 1’s and X’s.
Choose a 1 which has not been covered.
All uncovered 1’s checked?
STOP YES Are the chosen 1 and its adjacent 1’s and X’s covered by a single term?
YES NO NO Note: All essential prime implicants have been determined at this point.
Karnaugh Maps 149 product-of-sums expression for f. Alternatively, we can perform the dual of the pro-cedure for finding minimum sum of products. Let S be a sum term. If every input combination for which S = 0 f is also 0, then S can be a term in a product-of-sums expression for F. We will call such a sum term an implicate of f. Implicate S is a prime implicate if it cannot be combined with any other implicate to eliminate a literal from S. All implicates in a minimum product-of-sums expression for f must be prime implicates. The prime implicates of f can be found by looping the largest groups of adjacent zeros on the Karnaugh map for f. If a prime implicate is the only prime implicate covering a maxterm (zero) of f, then it is an essential prime implicate and must be included in any minimum product-of-sums expression for f.
5.5 Five-Variable Karnaugh Maps A five-variable map can be constructed in three dimensions by placing one four-variable map on top of a second one. Terms in the bottom layer are numbered 0 through 15 and corresponding terms in the top layer are numbered 16 through 31, so that terms in the bottom layer contain A′ and those in the top layer contain A. To rep-resent the map in two dimensions, we will divide each square in a four-variable map by a diagonal line and place terms in the bottom layer below the line and terms in the top layer above the line (Figure 5-21). Terms in the top or bottom layer combine just like terms on a four-variable map. In addition, two terms in the same square which are separated by a diagonal line differ in only one variable and can be combined. However, some terms which appear to be physically adjacent are not. For example, terms 0 and 20 are not adjacent because they appear in a different column and a FIGURE 5-21 A Five-Variable Karnaugh Map © Cengage Learning 2014 0 4 12 00 01 11 10 These eight terms combine to give BD′(B from last two columns and D′ from top two rows; A is eliminated because four terms are in the top layer and four in the bottom).
8 1 5 13 9 3 7 15 11 00 1 0 DE A BC 01 11 10 2 6 14 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 10 16 20 28 24 17 21 29 25 19 23 31 27 18 22 30 26 These four terms (two from top layer and two from bottom) combine to yield CDE(C from the middle two columns and DE from the row).
These two terms in the top layer combine to give AB′DE′.
These terms do not combine because they are in different layers and different columns (they differ in two variables).
150 Unit 5 different layer. Each term can be adjacent to exactly five other terms, four in the same layer and one in the other layer (Figure 5-22). An alternate representation for five-variable maps is to draw the two layers side-by-side, as in Figure 5-28, but most individuals find adjacencies more difficult to see when this form is used.
When checking for adjacencies, each term should be checked against the five possible adjacent squares. (In general, the number of adjacent squares is equal to the number of variables.) Two examples of five-variable minimization using maps follow. Figure 5-23 is a map of F(A, B, C, D, E) = Σ m(0, 1, 4, 5, 13, 15, 20, 21, 22, 23, 24, 26, 28, 30, 31) FIGURE 5-23 © Cengage Learning 2014 P1 0 00 01 11 10 Shaded 1’s are used to select essential prime implicants.
00 1 0 DE A BC 01 11 10 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 24 P4 P3 P2 FIGURE 5-22 © Cengage Learning 2014 00 01 11 10 00 DE BC 01 11 10 1 1 1 1 1 1 1 0 A Karnaugh Maps 151 Prime implicant P1 is chosen first because all of the 1’s adjacent to minterm 0 are covered by P1. Prime implicant P2 is chosen next because all of the 1’s adjacent to minterm 24 are covered by P2. All of the remaining 1’s on the map can be cov-ered by at least two different prime implicants, so we proceed by trial and error. After a few tries, it becomes apparent that the remaining 1’s can be covered by three prime implicants. If we choose prime implicants P3 and P4 next, the remain-ing two 1’s can be covered by two different groups of four. The resulting minimum solution is F = A′B′D′ + ABE′ + ACD + A′BCE + % or AB′C B′CD′ - P1 P2 P3 P4 Figure 5-24 is a map of F(A, B, C, D, E) = Σ m(0, 1, 3, 8, 9, 14, 15, 16, 17, 19, 25, 27, 31) All 1’s adjacent to m16 are covered by P1, so choose P1 first. All 1’s adjacent to m3 are covered by P2, so P2 is chosen next. All 1’s adjacent to m8 are covered by P3, so P3 is chosen. Because m14 is only adjacent to m15, P4 is also essential. There are no more essential prime implicants, and the remaining 1’s can be covered by two terms, P5 and (1-9-17-25) or (17-19-25-27). The final solution is F = B′C′D′ + B′C′E + A′C′D′ + A′BCD + ABDE + % or C′D′E AC′E - P1 P2 P3 P4 P5 FIGURE 5-24 © Cengage Learning 2014 P5 0 4 12 00 01 11 10 8 1 5 13 9 3 7 15 11 00 1 0 DE A BC 01 11 10 2 6 14 1 1 1 1 1 1 1 1 1 1 1 1 1 10 16 20 28 24 17 21 29 25 19 23 31 27 18 22 30 26 P3 P1 P2 P4 152 Unit 5 FIGURE 5-25 © Cengage Learning 2014 ↑ 5.6 Other Uses of Karnaugh Maps Many operations that can be performed using a truth table or algebraically can be done using a Karnaugh map. A map conveys the same information as a truth table— it is just arranged in a different format. If we plot an expression for F on a map, we can read off the minterm and maxterm expansions for F and for F ′. From the map of Figure 5-14, the minterm expansion of f is f = Σ m(0, 2, 3, 4, 8, 10, 11, 15) and because each 0 corresponds to a maxterm, the maxterm expansion of f is f = Π M(1, 5, 6, 7, 9, 12, 13, 14) We can prove that two functions are equal by plotting them on maps and showing that they have the same Karnaugh map. We can perform the AND operation (or the OR operation) on two functions by ANDing (or ORing) the 1’s and 0’s which appear in corresponding positions on their maps. This procedure is valid because it is equivalent to doing the same operations on the truth tables for the functions.
A Karnaugh map can facilitate factoring an expression. Inspection of the map reveals terms which have one or more variables in common. For the map of Figure 5-25, the two terms in the first column have A′B′ in common; the two terms in the lower right corner have AC in common.
When simplifying a function algebraically, the Karnaugh map can be used as a guide in determining what steps to take. For example, consider the function F = ABCD + B′CDE + A′B′ + BCE′ From the map (Figure 5-26), we see that in order to get the minimum solution, we must add the term ACDE. We can do this using the consensus theorem: F = ABCD + B′CDE + A′B′ + BCE′ + ACDE 1 00 01 11 10 1 1 1 00 CD AB F = A′B′(C′ + D) + AC(B + D′) 01 11 10 1 1 Karnaugh Maps 153 As can be seen from the map, this expression now contains two redundant terms, ABCD and B′CDE. These can be eliminated using the consensus theorem, which gives the minimum solution: F = A′B + BCE′ + ACDE 5.7 Other Forms of Karnaugh Maps Instead of labeling the sides of a Karnaugh map with 0’s and 1’s, some people prefer to use the labeling shown in Figure 5-27 . For the half of the map labeled A, A = 1; and for the other half, A = 0. The other variables have a similar interpretation. A map labeled this way is sometimes referred to as a Veitch diagram. It is particularly use-ful for plotting functions given in algebraic form rather than in minterm or maxterm form. However, when utilizing Karnaugh maps to solve sequential circuit problems (Units 12 through 16), the use of 0’s and 1’s to label the maps is more convenient.
FIGURE 5-26 © Cengage Learning 2014 0 4 12 00 01 11 10 Add this term.
.
Then these two terms can be eliminated.
8 1 5 13 9 3 7 15 11 00 1 0 DE A BC 01 11 10 2 6 14 1 1 1 1 1 1 1 1 1 1 1 1 1 1 10 16 20 28 24 17 21 29 25 19 23 31 27 18 22 30 26 FIGURE 5-27 Veitch Diagrams © Cengage Learning 2014 B C B C D A A 154 Unit 5 00 01 11 10 00 01 11 10 FIGURE 5-28 Other Forms of Five-Variable Karnaugh Maps © Cengage Learning 2014 Two alternative forms for five-variable maps are used. One form simply consists of two four-variable maps side-by-side as in Figure 5-28(a). A modification of this uses a mirror image map as in Figure 5-28(b). In this map, first and eighth columns are “adjacent” as are second and seventh columns, third and sixth columns, and fourth and fifth columns. The same function is plotted on both these maps.
F = D′E′ + B′C′D′ + BCE + A′BC′E′ + ACDE Programmed Exercise 5.1 Cover the answers to this exercise with a sheet of paper and slide it down as you check your answers. Write your answers in the space provided before looking at the correct answer.
Problem Determine the minimum sum of products and minimum product of sums for f = b′c′d′ + bcd + acd′ + a′b′c + a′bc′d First, plot the map for f.
1 1 1 1 00 01 A = 0 (a) (b) 11 10 1 1 1 00 DE BC 01 11 10 1 1 1 1 1 00 01 A = 1 11 10 1 1 1 1 00 DE BC 01 11 10 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 B D C C E A Karnaugh Maps 155 Answer: 1 1 00 01 11 10 1 1 1 1 1 00 cd ab 01 11 10 1 1 1 1 00 01 11 10 1 1 1 1 1 00 cd ab 01 11 10 1 1 Loop the remaining 1’s using a minimum number of loops.
The two possible minimum sum-of-products forms for f are f = ___________________________________ and f = ___________________________________ Answer: 1 1 00 01 11 10 1 1 1 1 1 00 cd ab 01 11 10 1 1 f = b′d′ + a′bd + abc + a′cd or a′b′c (a) The minterms adjacent to m0 on the preceding map are _________ and _________.
(b) Find an essential prime implicant containing m0 and loop it.
(c) The minterms adjacent to m3 are _________ and _________.
(d) Is there an essential prime implicant which contains m3?
(e) Find the remaining essential prime implicant(s) and loop it (them).
Answers: (a) m2 and m8 (b) (c) m2 and m7 (e) (d) No 156 Unit 5 1 1 00 01 11 10 1 1 1 1 00 Essential because of m1 Essential because of m11 Essential because of m6 cd ab f′ 01 11 10 1 00 01 f′ 11 10 00 01 11 10 Next, we will find the minimum product of sums for f. Start by plotting the map for f ′.
Loop all essential prime implicants of f ′ and indicate which minterm makes each one essential.
Answer: Loop the remaining 1’s and write the minimum sum of products for f ′.
f ′= __________________________________ The minimum product of sums for f is therefore f = __________________________________ Final Answer: f ′ = b′c′d + a′bd′ + ab′d + abc′ f = (b + c + d′)(a + b′ + d)(a′ + b + d′)(a′ + b′ + c) Programmed Exercise 5.2 Problem: Determine a minimum sum-of-products expression for f (a, b, c, d, e) = (a′ + c + d)(a′ + b + e) (a + c′ + e′) (c + d + e′) (b + c + d′ + e) (a′ + b′ + c + e′) Karnaugh Maps 157 The first step in the solution is to plot a map for f. Because f is given in product-of-sums form, it is easier to first plot the map for f ′ and then complement the map. Write f ′ as a sum of products: f ′ = _________________________________________ Now plot the map for f ′. (Note that there are three terms in the upper layer, one term in the lower layer, and two terms which span the two layers.) Next, convert your map for f ′ to a map for f.
00 01 11 10 00 1 0 de a bc f′ 01 11 10 00 01 11 10 00 1 0 de a bc f 01 11 10 00 01 f′ 11 10 00 1 0 de a bc 01 11 10 1 1 1 1 1 1 1 1 1 0 4 12 00 01 f 11 10 8 1 5 13 9 3 7 15 11 00 1 0 de a bc 01 11 10 2 6 14 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 10 16 20 28 24 17 21 29 25 19 23 31 27 18 22 30 26 Answer: 158 Unit 5 00 01 11 10 00 1 0 de a bc 01 11 10 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 The next step is to determine the essential prime implicants of f.
(a) Why is a′d′e′ an essential prime implicant?
(b) Which minterms are adjacent to m3? ___________ To m19? ___________ (c) Is there an essential prime implicant which covers m3 and m19?
(d) Is there an essential prime implicant which covers m21?
(e) Loop the essential prime implicants which you have found. Then, find two more essential prime implicants and loop them.
Answers: (a) It covers m0 and both adjacent minterms.
(b) m19 and m11; m3 and m23 (c) No (d) Yes (e) (a) Why is there no essential prime implicant which covers m11?
(b) Why is there no essential prime implicant which covers m28?
Because there are no more essential prime implicants, loop a minimum number of terms which cover the remaining 1’s.
Answers: (a) All adjacent 1’s of m11(m3, m10) cannot be covered by one grouping.
(b) All adjacent 1’s of m28(m12, m30, m29) cannot be covered by one grouping.
Karnaugh Maps 159 00 01 11 10 Note: There are five other possible ways to loop the four remaining 1’s.
00 1 0 de a bc 01 11 10 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Write down two different minimum sum-of-products expressions for f.
f = ___________________________________ f = ___________________________________ Answer: f = a′d′e′ + ace + a′ce′ + bde′ + | or abc bce′ ¶ + | b′c′de + a′bc′d b′c′de + a′c′de ab′de + a′c′de ¶ Problems 5.3 Find the minimum sum of products for each function using a Karnaugh map.
(a) f1(a, b, c) = m0 + m2 + m5 + m6 (b) f2(d, e, f ) = Σ m(0, 1, 2, 4) (c) f3(r, s, t) = rt ′ + r′s′ + r′s (d) f4(x, y, z) = M0 · M5 5.4 (a) Plot the following function on a Karnaugh map. (Do not expand to minterm form before plotting.) F(A, B, C, D) = BD′ + B′CD + ABC + ABC′D + B′D′ (b) Find the minimum sum of products.
(c) Find the minimum product of sums.
160 Unit 5 5.5 A switching circuit has two control inputs (C1 and C2), two data inputs (X1 and X2), and one output (Z). The circuit performs one of the logic operations AND, OR, EQU (equivalence), or XOR (exclusive OR) on the two data inputs. The function performed depends on the control inputs: (a) Derive a truth table for Z.
(b) Use a Karnaugh map to find a minimum AND-OR gate circuit to realize Z.
5.6 Find the minimum sum-of-products expression for each function. Underline the essential prime implicants in your answer and tell which minterm makes each one essential.
(a) f(a, b, c, d) = Σ m(0, 1, 3, 5, 6, 7, 11, 12, 14) (b) f(a, b, c, d) = Π M(1, 9, 11, 12, 14) (c) f(a, b, c, d) = Π M(5, 7, 13, 14, 15) · Π D(1, 2, 3, 9) 5.7 Find the minimum sum-of-products expression for each function.
(a) f(a, b, c, d) = Σ m(0, 2, 3, 4, 7, 8, 14) (b) f(a, b, c, d) = Σ m(1, 2, 4, 15) + Σ d(0, 3, 14) (c) f(a, b, c, d) = Π M(1, 2, 3, 4, 9, 15) (d) f(a, b, c, d) = Π M(0, 2, 4, 6, 8) · Π D(1, 12, 9, 15) 5.8 Find the minimum sum of products and the minimum product of sums for each function: (a) f(a, b, c, d) = Π M(0, 1, 6, 8, 11, 12) · Π D(3, 7, 14, 15) (b) f(a, b, c, d) = Σ m(1, 3, 4, 11) + Σ d(2, 7, 8, 12, 14, 15) 5.9 Find the minimum sum of products and the minimum product of sums for each function: (a) F(A, B, C, D, E) = Σ m(0, 1, 2, 6, 7, 9, 10, 15, 16, 18, 20, 21, 27, 30) + Σ d(3, 4, 11, 12, 19) (b) F(A, B, C, D, E) = Π M(0, 3, 6, 9, 11, 19, 20, 24, 25, 26, 27, 28, 29, 30) · Π D(1, 2, 12, 13) 5.10 F(a, b, c, d, e) = Σ m(0, 3, 4, 5, 6, 7, 8, 12, 13, 14, 16, 21, 23, 24, 29, 31) (a) Find the essential prime implicants using a Karnaugh map, and indicate why each one of the chosen prime implicants is essential (there are four essential prime implicants).
(b) Find all of the prime implicants by using the Karnaugh map. (There are nine in all.) C1 C2 Function Performed by Circuit 0 0 OR 0 1 XOR 1 0 AND 1 1 EQU Karnaugh Maps 161 5.11 Find a minimum product-of-sums solution for f. Underline the essential prime implicates.
f(a, b, c, d, e) = Σ m(2, 4, 5, 6, 7, 8, 10, 12, 14, 16, 19, 27, 28, 29, 31) + Σ d(1, 30) 5.12 Given F = AB′D′ + A′B + A′C + CD.
(a) Use a Karnaugh map to find the maxterm expression for F (express your answer in both decimal and algebric notation).
(b) Use a Karnaugh map to find the minimum sum-of-products form for F ′.
(c) Find the minimum product of sums for F.
5.13 Find the minimum sum of products for the given expression. Then, make minterm 5 a don’t-care term and verify that the minimum sum of products is unchanged. Now, start again with the original expression and find each minterm which could individually be made a don’t-care without changing the minimum sum of products.
F(A, B, C, D) = A′C′ + B′C + ACD′ + BC′D 5.14 Find the minimum sum-of-products expressions for each of these functions.
(a) f1(A, B, C) = m1 + m2 + m5 + m7 (b) f2(d, e, f ) = Σ m(1, 5, 6, 7) (c) f3(r, s, t) = rs′ + r′s′ + st ′ (d) f4(a, b, c) = m0 + m2 + m3 + m7 (e) f5(n, p, q) = Σ m(1, 3, 4, 5) (f ) f6(x, y, z) = M1M7 5.15 Find the minimum product-of-sums expression for each of the functions in Problem 5.14.
5.16 Find the minimum sum of products for each of these functions.
(a) f1(A, B, C) = m1 + m3 + m4 + m6 (b) f2(d, e, f ) = Σ m(1, 4, 5, 7) (c) f3(r, s, t) = r ′t ′ + rs′ + rs (d) f1(a, b, c) = m3 + m4 + m6 + m7 (e) f2(n, p, q) = Σ m(2, 3, 5, 7) (f ) f4(x, y, z) = M3M6 5.17 (a) Plot the following function on a Karnaugh map. (Do not expand to minterm form before plotting.) F(A, B, C, D) = A′B′ + CD′ + ABC + A′B′CD′ + ABCD′ (b) Find the minimum sum of products.
(c) Find the minimum product of sums.
5.18 Work Problem 5.17 for the following: f(A, B, C, D) = A′B′ + A′B′C′ + A′BD′ + AC′D + A′BD + AB′CD′ 162 Unit 5 C1 C2 Function Performed by Circuit 0 0 X1X2 0 1 X1 ⊕ X2 1 0 X′ 1 + X2 1 1 X1 ≡X2 5.19 A switching circuit has two control inputs (C1 and C2), two data inputs (X1 and X2), and one output (Z). The circuit performs logic operations on the two data inputs, as shown in this table: (a) Derive a truth table for Z.
(b) Use a Karnaugh map to find a minimum OR-AND gate circuit to realize Z.
5.20 Use Karnaugh maps to find all possible minimum sum-of-products expressions for each function.
(a) F(a, b, c) = Π M(3, 4) (b) g(d, e, f ) = Σ m(1, 4, 6) + Σ d(0, 2, 7) (c) F(p, q, r) = (p + q′ + r)(p′ + q + r′) (d) F(s, t, u) = Σ m(1, 2, 3) + Σ d(0, 5, 7) (e) f(a, b, c) = Π M(2, 3, 4) (f ) G(D, E, F ) = Σ m(1, 6) + Σ d(0, 3, 5) 5.21 Simplify the following expression first by using a map and then by using Boolean algebra. Use the map as a guide to determine which theorems to apply to which terms for the algebraic simplification.
F = a′b′c′ + a′c′d + bcd + abc + ab′ 5.22 Find all prime implicants and all minimum sum-of-products expressions for each of the following functions.
(a) f(A, B, C, D) = Σ m(4, 11, 12, 13, 14) + Σ d(5, 6, 7, 8, 9, 10) (b) f(A, B, C, D) = Σ m(3, 11, 12, 13, 14) + Σ d(5, 6, 7, 8, 9, 10) (c) f(A, B, C, D) = Σ m(1, 2, 4, 13, 14) + Σ d(5, 6, 7, 8, 9, 10) (d) f(A, B, C, D) = Σ m(4, 15) + Σ d(5, 6, 7, 8, 9, 10) (e) f(A, B, C, D) = Σ m(3, 4, 11, 15) + Σ d(5, 6, 7, 8, 9, 10) (f ) f(A, B, C, D) = Σ m(4) + Σ d(5, 6, 7, 8, 9, 10, 11, 12, 13, 14) (g) f(A, B, C, D) = Σ m(4, 15) + Σ d(0, 1, 2, 5, 6, 7, 8, 9, 10) 5.23 For each function in Problem 5.22, find all minimum product-of-sums expressions.
5.24 Find the minimum sum-of-products expression for (a) Σ m(0, 2, 3, 5, 6, 7, 11, 12, 13) (b) Σ m(2, 4, 8) + Σ d(0, 3, 7) (c) Σ m(1, 5, 6, 7, 13) + Σ d(4, 8) (d) f(w, x, y, z) = Σ m(0, 3, 5, 7, 8, 9, 10, 12, 13) + Σ d(1, 6, 11, 14) (e) Π M(0, 1, 2, 5, 7, 9, 11) · Π D(4, 10, 13) Karnaugh Maps 163 5.25 Work Problem 5.24 for the following: (a) f (a, b, c, d) = Σ m(1, 3, 4, 5, 7, 9, 13, 15) (b) f (a, b, c, d) = Π M(0, 3, 5, 8, 11) (c) f (a, b, c, d) = Σ m(0, 2, 6, 9, 13, 14) + Σ d(3, 8, 10) (d) f (a, b, c, d) = Π M(0, 2, 6, 7, 9, 12, 13) · Π D(1, 3, 5) 5.26 Find the minimum product of sums for the following. Underline the essential prime implicates in your answer.
(a) Π M(0, 2, 4, 5, 6, 9, 14) · Π D(10, 11) (b) Σ m(1, 3, 8, 9, 15) + Σ d(6, 7, 12) 5.27 Find a minimum sum-of-products and a minimum product-of-sums expression for each function: (a) f (A, B, C, D) = Π M(0, 2, 10, 11, 12, 14, 15) · Π D(5, 7) (b) f (w, x, y, z) = Σ m(0, 3, 5, 7, 8, 9, 10, 12, 13) + Σ d(1, 6, 11, 14) 5.28 A logic circuit realizes the function F(a, b, c, d) = a′b′ + a′cd + ac′d + ab′d′. Assum-ing that a = c never occurs when b = d = 1, find a simplified expression for F.
5.29 Given F = AB′D′ + A′B + A′C + CD.
(a) Use a Karnaugh map to find the maxterm expression for F (express your answer in both decimal and algebric notation).
(b) Use a Karnaugh map to find the minimum sum-of-products form for F ′.
(c) Find the minimum product of sums for F.
5.30 Assuming that the inputs ABCD = 0101, BCD = 1001, ABCD = 1011 never occur, find a simplified expression for F = A′BC′D + A′B′D + A′CD + ABD + ABC 5.31 Find all of the prime implicants for each of the functions plotted on page 157 .
5.32 Find all of the prime implicants for each of the plotted functions: 00 01 11 10 00 1 0 de a bc F 01 11 10 1 1 1 1 1 00 01 11 10 00 1 0 de a bc G 01 11 10 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 164 Unit 5 5.33 Given that f (a, b, c, d, e) = Σ m(6, 7, 9, 11, 12, 13, 16, 17, 18, 20, 21, 23, 25, 28), using a Karnaugh map, (a) Find the essential prime implicants (three).
(b) Find the minimum sum of products (7 terms).
(c) Find all of the prime implicants (twelve).
5.34 A logic circuit realizing the function f has four inputs a, b, c, d. The three inputs a, b, and c are the binary representation of the digits 0 through 7 with a being the most significant bit. The input d is an odd-parity bit; that is, the value of d is such that a, b, c, and d always contains an odd number of 1’s. (For example, the digit 1 is rep-resented by abc = 001 and d = 0, and the digit 3 is represented by abcd = 0111.) The function f has value 1 if the input digit is a prime number. (A number is prime if it is divisible only by itself and 1; 1 is considered to be prime, and 0 is not.) (a) Draw a Karnaugh map for f.
(b) Find all prime implicants of f.
(c) Find all minimum sum of products for f.
(d) Find all prime implicants of f ′.
(e) Find all minimum product of sums for f.
5.35 The decimal digits 0 though 9 are represented using five bits A, B, C, D, and E. The bits A, B, C, and D are the BCD representation of the decimal digit, and bit E is a parity bit that makes the five bits have odd parity. The function F (A, B, C, D, E ) has value 1 if the decimal digit represented by A, B, C, D, and E is divisible by either 3 or 4. (Zero is divisible by 3 and 4.) (a) Draw a Karnaugh map for f.
(b) Find all prime implicants of f. (Prime implicants containing only don’t-cares need not be included.) (c) Find all minimum sum of products for f.
(d) Find all prime implicants of f ′.
(e) Find all minimum product of sums for f.
5.36 Rework Problem 5.35 assuming the decimal digits are represented in excess-3 rather than BCD.
5.37 The function F(A, B, C, D, E) = Σ m(1, 7, 8, 13, 16, 19) + Σ d(0, 3, 5, 6, 9, 10, 12, 15, 17, 18, 20, 23, 24, 27, 29, 30).
(a) Draw a Karnaugh map for f.
(b) Find all prime implicants of f. (Prime implicants containing only don’t-cares need not be included.) (c) Find all minimum sum of products for f.
(d) Find all prime implicants of f ′.
(e) Find all minimum product of sums for f.
Karnaugh Maps 165 5.38 F(a, b, c, d, e) = Σ m(0, 1, 4, 5, 9, 10, 11, 12, 14, 18, 20, 21, 22, 25, 26, 28) (a) Find the essential prime implicants using a Karnaugh map, and indicate why each one of the chosen prime implicants is essential (there are four essential prime implicants).
(b) Find all of the prime implicants by using the Karnaugh map (there are 13 in all).
5.39 Find the minimum sum-of-products expression for F. Underline the essential prime implicants in this expression.
(a) f(a, b, c, d, e) = Σ m(0, 1, 3, 4, 6, 7, 8, 10, 11, 15, 16, 18, 19, 24, 25, 28, 29, 31) + Σ d(5, 9, 30) (b) f(a, b, c, d, e) = Σ m(1, 3, 5, 8, 9, 15, 16, 20, 21, 23, 27, 28, 31) 5.40 Work Problem 5.39 with F(A, B, C, D, E) = Π M(2, 3, 4, 8, 9, 10, 14, 15, 16, 18, 19, 20, 23, 24, 30, 31) 5.41 Find the minimum sum-of-products expression for F. Underline the essential prime implicants in your expression.
F(A, B, C, D, E) = Σ m(0, 2, 3, 5, 8, 11, 13, 20, 25, 26, 30) + Σ d(6, 7, 9, 24) 5.42 F(V, W, X, Y, Z) = Π M(0, 3, 5, 6, 7, 8, 11, 13, 14, 15, 18, 20, 22, 24) · Π D(1, 2, 16, 17) (a) Find a minimum sum-of-products expression for F. Underline the essential prime implicants.
(b) Find a minimum product-of-sums expression for F. Underline the essential prime implicates.
5.43 Find the minimum product of sums for (a) F(a, b, c, d, e) = Σ m(1, 2, 3, 4, 5, 6, 25, 26, 27, 28, 29, 30, 31) (b) F(a, b, c, d, e) = Σ m(1, 5, 12, 13, 14, 16, 17, 21, 23, 24, 30, 31) + Σ d(0, 2, 3, 4) 5.44 Find a minimum product-of-sums expression for each of the following functions: (a) F(v, w, x, y, z) = Σ m(4, 5, 8, 9, 12, 13, 18, 20, 21, 22, 25, 28, 30, 31) (b) F(a, b, c, d, e) = Π M(2, 4, 5, 6, 8, 10, 12, 13, 16, 17, 18, 22, 23, 24) · Π D(0, 11, 30, 31) 5.45 Find the minimum sum of products for each function. Then, make the specified minterm a don’t-care and verify that the minimum sum of products is unchanged. Now, start again with the original expression and find each minterm which could individually be made a don’t-care, without changing the minimum sum of products.
(a) F(A, B, C, D) = A′C′ + A′B′ + ACD′ + BC′D, minterm 2 (b) F(A, B, C, D) = A′BD + AC′D + AB′ + BCD + A′C′D, minterm 7 166 Unit 5 5.46 F(V, W, X, Y, Z) = Π M(0, 3, 6, 9, 11, 19, 20, 24, 25, 26, 27, 28, 29, 30) · Π D(1, 2, 12, 13) (a) Find two minimum sum-of-products expressions for F.
(b) Underline the essential prime implicants in your answer and tell why each one is essential.
5.47 Four of the minterms of the completely specified function f(a, b, c, d) are m0, m1, m4, and m5.
(a) Specify additional minterms for f so that f has eight prime implicants with two literals and no other prime implicants.
(b) For each prime implicant, give its algebraic representation and specify whether it is an essential prime implicant.
(c) Determine all minimum sum-of-products expressions for f.
5.48 Four of the minterms of the completely specified function f(a, b, c, d) are m0, m1, m4, and m5.
(a) Specify additional minterms for f so that f has one prime implicant with one literal, six prime implicants with two literals, and no other prime implicants.
(b) For each prime implicant, give its algebraic representation and specify whether it is an essential prime implicant.
(c) Determine all minimum sum-of-products expressions for f.
5.49 Four of the minterms of the completely specified function f(a, b, c, d) are m0, m1, m4, and m5.
(a) Specify additional minterms for f so that f has two prime implicants with one literal, two prime implicants with two literals, and no other prime implicants.
(b) For each prime implicant, give its algebraic representation and specify whether it is an essential prime implicant.
(c) Determine all minimum sum-of-products expressions for f.
5.50 Four of the minterms of an incompletely specified function f(a, b, c, d) are m0, m1, m4, and m5.
(a) Specify additional minterms and don’t-cares for f so that f has five prime impli-cants with two literals and no other prime implicants and, in addition, f has one prime implicate with one literal and two prime implicates with two literals.
(b) For each prime implicant, give its algebraic representation and specify whether it is an essential prime implicant.
(c) Determine all minimum sum-of-products expressions for f.
(d) For each prime implicate, give its algebraic representation and specify whether it is an essential prime implicate.
(e) Determine all minimum product-of-sums expressions for f.
167 Quine-McCluskey Method U N I T 6 Objectives 1. Find the prime implicants of a function by using the Quine-McCluskey method. Explain the reasons for the procedures used.
2. Define prime implicant and essential prime implicant.
3. Given the prime implicants, find the essential prime implicants and a minimum sum-of-products expression for a function, using a prime implicant chart and using Petrick’s method.
4. Minimize an incompletely specified function, using the Quine-McCluskey method.
5. Find a minimum sum-of-products expression for a function, using the method of map-entered variables.
168 Unit 6 Study Guide 1. Review Section 5.1, Minimum Forms of Switching Functions.
2. Read the introduction to this unit and, then, study Section 6.1. Determination of Prime Implicants.
(a) Using variables A, B, C, D, and E, give the algebraic equivalent of 10110 + 10010 = 10−10 10−10 + 10−11 = 10−1− (b) Why will the following pairs of terms not combine?
01101 + 00111 10−10 + 001−0 (c) When using the Quine-McCluskey method for finding prime implicants, why is it necessary to compare terms only from adjacent groups?
(d) How can you determine if two minterms from adjacent groups will combine by looking at their decimal representations?
(e) When combining terms, why is it permissible to use a term which has already been checked off?
(f ) In forming Column II of Table 6-1, note that terms 10 and 14 were com-bined to form 10, 14 even though both 10 and 14 had already been checked off. If this had not been done, which term in Column II could not be elimi-nated (checked off)?
(g) In forming Column III of Table 6-1, note that minterms 0, 1, 8, and 9 were combined in two different ways to form –00–. This is equivalent to looping the minterms in two different ways on the Karnaugh map, as shown.
(0, 1) + (8, 9) (0, 8) + (1, 9) (0, 1, 8, 9) = = 1 1 00 01 11 10 1 1 00 cd ab 01 11 10 1 1 00 01 11 10 1 1 00 cd ab 01 11 10 1 1 00 01 11 10 1 1 00 cd ab 01 11 10 Quine-McCluskey Method 169 (h) Using a map, find all of the prime implicants of Equation (6-2) and com-pare your answer with Equation (6-3).
(i) The prime implicants of f(a, b, c, d) = Σ m(4, 5, 6, 7, 12, 13, 14, 15) are to be found using the Quine-McCluskey method. Column III is given; find Column IV and check off the appropriate terms in Column III.
00 01 11 10 00 01 11 10 Column III Column IV (4, 5, 6, 7) 01 - -(4, 5, 12, 13) –10– (4, 6, 12, 14) –1–0 (5, 7, 13, 15) –1–1 (6, 7, 14, 15) –11– (12, 13, 14, 15) 11 - -00 01 11 10 00 01 11 10 3. (a) List all seven product term implicants of F(a, b, c) = Σ m(0, 1, 5, 7) Which of these implicants are prime?
Why is a′c not an implicant?
(b) Define a prime implicant.
(c) Why must every term in a minimum sum-of-products expression be a prime implicant?
Check your answer using a Karnaugh map.
170 Unit 6 (d) Given that F(A, B, C, D) = Σ m(0, 1, 4, 5, 7, 10, 15), which of the following terms are not prime implicants and why?
A′B′C′ A′C′ BCD ABC AB′CD′ 4. Study Section 6.2, The Prime Implicant Chart.
(a) Define an essential prime implicant.
(b) Find all of the essential prime implicants from the following chart.
a b c d 0 4 5 10 11 12 13 15 (0, 4) 0 – 0 0 × × (4, 5, 12, 13) – 1 0 – × × × × (13, 15) 1 1 – 1 × × (11, 15) 1 – 1 1 × × (10, 11) 1 0 1 – × × m4 m5 m7 m13 P1 bd × × × P2 bc′ × × × P3 a′b × × × P4 c′d × × We will find all minimum solutions using Petrick’s method. Let Pi = 1 mean the prime implicant in row Pi is included in the solution.
Which minterm is covered iff (P1 + P3) = 1?_________ Write a sum term which is 1 iff m4 is covered._________ Check your answer using a Karnaugh map.
(c) Why must all essential prime implicants of a function be included in the minimum sum of products?
(d) Complete the solution of Table 6-5.
(e) Work Programmed Exercise 6.1.
(f ) Work Problems 6.2 and 6.3.
5. Study Section 6.3, Petrick’s Method (optional).
(a) Consider the following reduced prime implicant chart for a function F: Quine-McCluskey Method 171 Write a product-of-sum terms which is 1 iff all m4, m5, m7 and m13 are all covered: P = ____________________________________________________________ (b) Reduce P to a minimum sum of products. (Your answer should have four terms, each one of the form Pi Pj.) P = ____________________________________________________________ If P1P2 = 1, which prime implicants are included in the solution?_________ How many minimum solutions are there?________ Write out each solution in terms of a, b, c, and d.
(1) F = (2) F = (3) F = (4) F = 6. Study Section 6.4, Simplification of Incompletely Specified Functions.
(a) Why are don’t-care terms treated like required minterms when finding the prime implicants?
(b) Why are the don’t-care terms not listed at the top of the prime implicant chart when finding the minimum solution?
(c) Work Problem 6.4.
(d) Work Problem 6.5, and check your solution using a Karnaugh map.
7. If you have LogicAid or a similar computer program available, use it to check your answers to some of the problems in this unit. LogicAid accepts Boolean functions in the form of equations, minterms or maxterms, and truth tables. It finds simplified sum-of-products and product-of-sums expressions for the func-tions using a modified version of the Quine-McCluskey method or Espresso-II. It can also find one or all of the minimum solutions using Petrick’s method.
8. Study Section 6.5, Simplification Using Map-Entered Variables.
(a) For the following map, find MS0, MS1, and F. Verify that your solution for F is minimum by using a four-variable map.
D 1 1 D 1 X 0 1 00 BC A 01 11 10 172 Unit 6 (b) Use the method of map-entered variables to find an expression for F from the following map. Treat C and C′ as if they were independent variables. Is the result a correct representation of F? Is it minimum?
(c) Work Problem 6.6.
9. In this unit you have learned a “turn-the-crank” type procedure for finding mini-mum sum-of-products forms for switching functions. In addition to learning how to “turn the crank” and grind out minimum solutions, you should have learned several very important concepts in this unit. In particular, make sure you know: (a) What a prime implicant is (b) What an essential prime implicant is (c) Why the minimum sum-of-products form is a sum of prime implicants (d) How don’t-cares are handled when using the Quine-McCluskey method and the prime implicant chart 10. Reread the objectives of the unit. If you are satisfied that you can meet the objectives, take the readiness test.
C C′ 1 0 1 0 B A 1 The Karnaugh map method described in Unit 5 is an effective way to simplify switching functions which have a small number of variables. When the number of variables is large or if several functions must be simplified, the use of a digital com-puter is desirable. The Quine-McCluskey method presented in this unit provides a systematic simplification procedure which can be readily programmed for a digital computer.
Quine-McCluskey Method Quine-McCluskey Method 173 The Quine-McCluskey method reduces the minterm expansion (standard sum-of-products form) of a function to obtain a minimum sum of products. The procedure consists of two main steps: 1. Eliminate as many literals as possible from each term by systematically applying the theorem XY + XY′ = X. The resulting terms are called prime implicants.
2. Use a prime implicant chart to select a minimum set of prime implicants which, when ORed together, are equal to the function being simplified and which con-tain a minimum number of literals.
6.1 Determination of Prime Implicants In order to apply the Quine-McCluskey method to determine a minimum sum- of-products expression for a function, the function must be given as a sum of minterms. (If the function is not in minterm form, the minterm expansion can be found by using one of the techniques given in Section 5.3.) In the first part of the Quine-McCluskey method, all of the prime implicants of a function are systematical ly formed by combining minterms. The minterms are represented in binary notation and combined using XY + XY′ = X (6-1) where X represents a product of literals and Y is a single variable. Two minterms will combine if they differ in exactly one variable.
In order to find all of the prime implicants, all possible pairs of minterms should be compared and combined whenever possible. To reduce the required number of comparisons, the binary minterms are sorted into groups according to the number of 1’s in each term. Thus, f(a, b, c, d) = Σ m(0, 1, 2, 5, 6, 7, 8, 9, 10, 14) (6-2) is represented by the following list of minterms: group 0 0 0000 group 1 | 1 0001 2 0010 8 1000 group 2 & 5 0101 6 0110 9 1001 10 1010 group 3 e 7 0111 14 1110 174 Unit 6 In this list, the term in group 0 has zero 1’s, the terms in group 1 have one 1, those in group 2 have two 1’s, and those in group 3 have three 1’s.
Two terms can be combined if they differ in exactly one variable. Comparison of terms in nonadjacent groups is unnecessary because such terms will always differ in at least two variables and cannot be combined using XY + XY′ = X. Similarly, the comparison of terms within a group is unnecessary because two terms with the same number of 1’s must differ in at least two variables. Thus, only terms in adjacent groups must be compared.
First, we will compare the term in group 0 with all of the terms in group 1. Terms 0000 and 0001 can be combined to eliminate the fourth variable, which yields 000–. Similarly, 0 and 2 combine to form 00–0 (a′b′d′), and 0 and 8 combine to form –000 (b′c′d′). The resulting terms are listed in Column II of Table 6-1.
Whenever two terms combine, the corresponding decimal numbers differ by a power of 2 (1, 2, 4, 8, etc.). This is true because when the binary representations differ in exactly one column and if we subtract these binary representations, we get a 1 only in the column in which the difference exists. A binary number with a 1 in exactly one column is a power of 2.
Column I Column II Column III group 0 0 0000 1 0001 group 1 2 0010 8 1000 5 0101 6 0110 group 2 9 1001 10 1010 group 3 7 0111 14 1110 ✓ 0, 1 000– ✓ 0, 1, 8, 9 –00– ✓ 0, 2 00–0 ✓ 0, 2, 8, 10 –0–0 ✓ 0, 8 –000 ✓ 0, 8, 1, 9 –00– ✓ 1, 5 0–01 0, 8, 2, 10 –0–0 ✓ 1, 9 –001 ✓ 2, 6, 10, 14 - - 10 ✓ 2, 6 0–10 ✓ 2, 10, 6, 14 - - 10 ✓ 2, 10 –010 ✓ ✓ 8, 9 100– ✓ ✓ 8, 10 10–0 ✓ ✓ 5, 7 01–1 6, 7 011– 6, 14 –110 ✓ 10, 14 1–10 ✓ TABLE 6-1 Determination of Prime Implicants Because the comparison of group 0 with groups 2 and 3 is unnecessary, we pro-ceed to compare terms in groups 1 and 2. Comparing term 1 with all terms in group 2, we find that it combines with 5 and 9 but not with 6 or 10. Similarly, term 2 combines only with 6 and 10, and term 8 only with 9 and 10. The resulting terms are listed in Column II. Each time a term is combined with another term, it is checked off. A term may be used more than once because X + X = X. Even though two terms have already been combined with other terms, they still must be compared and combined if possible. This is necessary because the resultant term may be needed to form the © Cengage Learning 2014 Quine-McCluskey Method 175 minimum sum solution. At this stage, we may generate redundant terms, but these redundant terms will be eliminated later. We finish with Column I by comparing terms in groups 2 and 3. New terms are formed by combining terms 5 and 7 , 6 and 7 , 6 and 14, and 10 and 14.
Note that the terms in Column II have been divided into groups, according to the number of 1’s in each term. Again, we apply XY + XY′ = X to combine pairs of terms in Column II. In order to combine two terms, the terms must have the same variables, and the terms must differ in exactly one of these variables. Thus, it is neces-sary only to compare terms which have dashes (missing variables) in corresponding places and which differ by exactly one in the number of 1’s.
Terms in the first group in Column II need only be compared with terms in the second group which have dashes in the same places. Term 000– (0, 1) com-bines only with term 100– (8, 9) to yield –00–. This is algebraically equivalent to a′b′c + ab′c′ = b′c′. The resulting term is listed in Column III along with the desig-nation 0, 1, 8, 9 to indicate that it was formed by combining minterms 0, 1, 8, and 9. Term (0, 2) combines only with (8, 10), and term (0, 8) combines with both (1, 9) and (2, 10). Again, the terms which have been combined are checked off. Comparing terms from the second and third groups in Column II, we find that (2, 6) combines with (10, 14), and (2, 10) combines with (6, 14).
Note that there are three pairs of duplicate terms in Column III. These duplicate terms were formed in each case by combining the same set of four minterms in a different order. After deleting the duplicate terms, we compare terms from the two groups in Column III. Because no further combination is possible, the process termi-nates. In general, we would keep comparing terms and forming new groups of terms and new columns until no more terms could be combined.
The terms which have not been checked off because they cannot be combined with other terms are called prime implicants. Because every minterm has been included in at least one of the prime implicants, the function is equal to the sum of its prime implicants. In this example we have f = a′c′d + a′bd + a′bc + b′c′ + b′d′ + cd′ (1, 5) (5, 7) (6, 7) (0, 1, 8, 9) (0, 2, 8, 10) (2, 6, 10, 14) (6-3) In this expression, each term has a minimum number of literals, but the num-ber of terms is not minimum. Using the consensus theorem to eliminate redundant terms yields f = a′bd + b′c′ + cd′ (6-4) which is the minimum sum-of-products expression for f. Section 6.2 discusses a better method of eliminating redundant prime implicants using a prime impli-cant chart.
Next, we will define implicant and prime implicant and relate these terms to the Quine-McCluskey method.
176 Unit 6 Definition Definition Given a function F of n variables, a product term P is an implicant of F iff for every combination of values of the n variables for which P = 1, F is also equal to 1.
In other words, if for some combination of values of the variables, P = 1 and F = 0, then P is not an implicant of F. For example, consider the function F(a, b, c) = a′b′c′ + ab′c′ + ab′c + abc = b′c′ + ac (6-5) If a′b′c′ = 1, then F = 1; if ac = 1, then F = 1; etc. Hence, the terms a′b′c′, ac, etc., are implicants of F. In this example, bc is not an implicant of F because when a = 0 and b = c = 1, bc = 1 and F = 0. In general, if F is written in sum-of-products form, every product term is an implicant. Every minterm of F is also an implicant of F, and so is any term formed by combining two or more minterms. For example, in Table 6-1, all of the terms listed in any of the columns are implicants of the function given in Equation (6-2).
A prime implicant of a function F is a product term implicant which is no longer an implicant if any literal is deleted from it.
In Equation (6-5), the implicant a′b′c′ is not a prime implicant because a′ can be eliminated, and the resulting term (b′c′) is still an implicant of F. The implicants b′c′ and ac are prime implicants because if we delete a literal from either term, the term will no longer be an implicant of F. Each prime implicant of a function has a mini-mum number of literals in the sense that no more literals can be eliminated from it by combining it with other terms.
The Quine-McCluskey method, as previously illustrated, finds all of the product term implicants of a function. The implicants which are nonprime are checked off in the process of combining terms so that the remaining terms are prime implicants.
A minimum sum-of-products expression for a function consists of a sum of some (but not necessarily all) of the prime implicants of that function. In other words, a sum-of-products expression which contains a term which is not a prime implicant cannot be minimum. This is true because the nonprime term does not contain a minimum number of literals—it can be combined with additional minterms to form a prime implicant which has fewer literals than the nonprime term. Any nonprime term in a sum-of-products expression can thus be replaced with a prime implicant, which reduces the number of literals and simplifies the expression.
6.2 The Prime Implicant Chart Given all the prime implicants of a function, the prime implicant chart can be used to select a minimum set of prime implicants. The minterms of the function are listed across the top of the chart, and the prime implicants are listed down the side. Quine-McCluskey Method 177 A prime implicant is equal to a sum of minterms, and the prime implicant is said to cover these minterms. If a prime implicant covers a given minterm, an X is placed at the intersection of the corresponding row and column. Table 6-2 shows the prime implicant chart derived from Table 6-1. All of the prime implicants (terms which have not been checked off in Table 6-1) are listed on the left.
In the first row, X’s are placed in columns 0, 1, 8, and 9, because prime implicant b′c′ was formed from the sum of minterms 0, 1, 8, and 9. Similarly, X’s are placed in columns 0, 2, 8, and 10 opposite the prime implicant b′d′ and so forth.
0 1 2 5 6 7 8 9 10 14 (0, 1, 8, 9) b′c′ × × × ⊗ (0, 2, 8, 10) b′d′ × × × × (2, 6, 10, 14) cd′ × × × ⊗ (1, 5) a′c′d × × (5, 7) a′bd × × (6, 7) a′bc × × TABLE 6-2 Prime Implicant Chart If a minterm is covered by only one prime implicant, then that prime implicant is called an essential prime implicant and must be included in the minimum sum of products. Essential prime implicants are easy to find using the prime implicant chart. If a given column contains only one X, then the corresponding row is an essential prime implicant. In Table 6-2, columns 9 and 14 each contain one X, so prime impli-cants b′c′ and cd′ are essential.
Each time a prime implicant is selected for inclusion in the minimum sum, the corresponding row should be crossed out. After doing this, the columns which cor-respond to all minterms covered by that prime implicant should also be crossed out. Table 6-3 shows the resulting chart when the essential prime implicants and the cor-responding rows and columns of Table 6-2 are crossed out. A minimum set of prime implicants must now be chosen to cover the remaining columns. In this example, a′bd covers the remaining two columns, so it is chosen. The resulting minimum sum of products is f = b′c′ + cd′ + a′bd which is the same as Equation (6-4). Note that even though the term a′bd is included in the minimum sum of products, a′bd is not an essential prime implicant. It is the sum of minterms m5 and m7; m5 is also covered by a′c′d, and m7 is also covered by a′bc.
0 1 2 5 6 7 8 9 10 14 (0, 1, 8, 9) b′c′ × × × × × × × × × × × × × × × × × × (0, 2, 8, 10) b′d′ (2, 6, 10, 14) cd′ (1, 5) a′c′d (5, 7) a′bd (6, 7) a′bc TABLE 6-3 © Cengage Learning 2014 © Cengage Learning 2014 178 Unit 6 When selecting prime implicants for a minimum sum, the essential prime impli-cants are chosen first because all essential prime implicants must be included in every minimum sum. After the essential prime implicants have been chosen, the minterms which they cover can be eliminated from the prime implicant chart by crossing out the corresponding columns. If the essential prime implicants do not cover all of the minterms, then additional nonessential prime implicants are needed. In simple cases, the nonessential prime implicants needed to form the minimum solution may be selected by trial and error. For larger prime implicant charts, addi-tional procedures for chart reduction can be employed.1 (Also, see Problem 6.21.) Some functions have two or more minimum sum-of-products expressions, each hav-ing the same number of terms and literals. The next example shows such a function.
1For a discussion of such procedures, see E. J. McCluskey, Logic Design Principles (Prentice-Hall, 1986).
0 1 2 5 6 7 ➀→(0, 1) a′b′ × × × × × × × × × × × × (0, 2) a′c′ (1, 5) b′c ➁→(2, 6) bc′ ➂→(5, 7) ac (6, 7) ab Example A prime implicant chart which has two or more X’s in every column is called a cyclic prime implicant chart. The following function has such a chart: F = Σ m(0, 1, 2, 5, 6, 7) (6-6) Derivation of prime implicants: 0 000 ✓ 1 001 ✓ 0, 1 00− 0, 2 0−0 1, 5 −01 2 010 ✓ 5 101 ✓ 2, 6 −10 5, 7 1−1 6, 7 11− 6 110 ✓ 7 111 ✓ TABLE 6-4 Table 6-4 shows the resulting prime implicant chart. All columns have two X’s, so we will proceed by trial and error. Both (0, 1) and (0, 2) cover column 0, so we will try (0, 1). After crossing out row (0, 1) and columns 0 and 1, we examine column 2, which is covered by (0, 2) and (2, 6). The best choice is (2, 6) because it covers two of the remaining columns while (0, 2) covers only one of the remaining columns. After crossing out row (2, 6) and columns 2 and 6, we see that (5, 7) covers the remaining columns and completes the solution. Therefore, one solution is F = a′b′ + bc′ + ac.
© Cengage Learning 2014 Quine-McCluskey Method 179 6.3 Petrick’s Method Petrick’s method is a technique for determining all minimum sum-of-products solu-tions from a prime implicant chart. The example shown in Tables 6-4 and 6-5 has two minimum solutions. As the number of variables increases, the number of prime implicants and the complexity of the prime implicant chart may increase significantly. In such cases, a large amount of trial and error may be required to find the minimum solution(s). Petrick’s method is a more systematic way of finding all minimum solu-tions from a prime implicant chart than the method used previously. Before applying Petrick’s method, all essential prime implicants and the minterms they cover should be removed from the chart.
We will illustrate Petrick’s method using Table 6-5. First, we will label the rows of the table P1, P2, P3, etc. We will form a logic function, P, which is true when all of the minterms in the chart have been covered. Let P1 be a logic variable which is true when the prime implicant in row P1 is included in the solution, P2 be a logic variable which is true when the prime implicant in row P2 is included in the solution, etc. Because column 0 has X’s in rows P1 and P2, we must choose row P1 or P2 in order to cover minterm 0. Therefore, the expression (P1 + P2) must be true. In order to cover minterm 1, we must choose row P1 or P3; therefore, (P1 + P3) must be true. In order 0 1 2 5 6 7 P1 (0, 1) a′b′ × × × × × × × × × × × × P2 (0, 2) a′c′ P3 (1, 5) b′c P4 (2 6) bc′ P5 (5, 7) ac P6 (6, 7) ab However, we are not guaranteed that this solution is minimum. We must go back and solve the problem over again starting with the other prime implicant that covers column 0. The resulting table (Table 6-5) is TABLE 6-5 Finish the solution and show that F = a′c′ + b′c + ab. Because this has the same number of terms and same number of literals as the expression for F derived in Table 6-4, there are two minimum sum-of-products solutions to this problem. Com-pare these two minimum solutions for Equation (6-6) with the solutions obtained in Figure 5-9 using Karnaugh maps. Note that each minterm on the map can be covered by two different loops. Similarly, each column of the prime implicant chart (Table 6-4) has two X’s, indicating that each minterm can be covered by two different prime implicants.
© Cengage Learning 2014 180 Unit 6 to cover minterm 2, (P2 + P4) must be true. Similarly, in order to cover minterms 5, 6, and 7 , the expressions (P3 + P5), (P4 + P6) and (P5 + P6) must be true. Because we must cover all of the minterms, the following function must be true: P = (P1 + P2)(P1 + P3)(P2 + P4)(P3 + P5)(P4 + P6)(P5 + P6) = 1 The expression for P in effect means that we must choose row P1 or P2, and row P1 or P3, and row P2 or P4, etc.
The next step is to reduce P to a minimum sum of products. This is easy because there are no complements. First, we multiply out, using (X + Y)(X + Z) = X + YZ and the ordinary distributive law: P = (P1 + P2P3)(P4 + P2P6)(P5 + P3P6) = (P1P4 + P1P2P6 + P2P3P4 + P2P3P6)(P5 + P3P6) = P1P4P5 + P1P2P5P6 + P2P3P4P5 + P2P3P5P6 + P1P3P4P6 + P1P2P3P6 + P2P3P4P6 + P2P3P6 Next, we use X + XY = X to eliminate redundant terms from P, which yields P = P1P4P5 + P1P2P5P6 + P2P3P4P5 + P1P3P4P6 + P2P3P6 Because P must be true (P = 1) in order to cover all of the minterms, we can trans-late the equation back into words as follows. In order to cover all of the minterms, we must choose rows P1 and P4 and P5, or rows P1 and P2 and P5 and P6, or . . . or rows P2 and P3 and P6. Although there are five possible solutions, only two of these have the minimum number of rows. Thus, the two solutions with the minimum number of prime implicants are obtained by choosing rows P1, P4, and P5 or rows P2, P3, and P6. The first choice leads to F = a′b′ + bc′ + ac, and the second choice to F = a′c′ + b′c + ab, which are the two minimum solutions derived in Section 6.2.
In summary, Petrick’s method is as follows: 1. Reduce the prime implicant chart by eliminating the essential prime implicant rows and the corresponding columns.
2. Label the rows of the reduced prime implicant chart P1, P2, P3, etc.
3. Form a logic function P which is true when all columns are covered. P consists of a product of sum terms, each sum term having the form (Pi0 + Pi1 + · · · ), where Pi0, Pi1 . . . represent the rows which cover column i.
4. Reduce P to a minimum sum of products by multiplying out and applying X + XY = X.
5. Each term in the result represents a solution, that is, a set of rows which covers all of the minterms in the table. To determine the minimum solutions (as defined in Section 5.1), find those terms which contain a minimum number of variables. Each of these terms represents a solution with a minimum number of prime implicants.
6. For each of the terms found in step 5, count the number of literals in each prime implicant and find the total number of literals. Choose the term or terms which correspond to the minimum total number of literals, and write out the corre-sponding sums of prime implicants.
Quine-McCluskey Method 181 The application of Petrick’s method is very tedious for large charts, but it is easy to implement on a computer.
6.4 Simplification of Incompletely Specified Functions Given an incompletely specified function, the proper assignment of values to the don’t-care terms is necessary in order to obtain a minimum form for the function. In this section, we will show how to modify the Quine-McCluskey method in order to obtain a minimum solution when don’t-care terms are present. In the process of finding the prime implicants, we will treat the don’t-care terms as if they were required minterms. In this way, they can be combined with other minterms to elimi-nate as many literals as possible. If extra prime implicants are generated because of the don’t-cares, this is correct because the extra prime implicants will be elimi-nated in the next step anyway. When forming the prime implicant chart, the don’t-cares are not listed at the top. This way, when the prime implicant chart is solved, all of the required minterms will be covered by one of the selected prime implicants. However, the don’t-care terms are not included in the final solution unless they have been used in the process of forming one of the selected prime implicants. The following example of simplifying an incompletely specified function should clarify the procedure.
F(A, B, C, D) = Σ m(2, 3, 7, 9, 11, 13) + Σ d(1, 10, 15) (the terms following d are don’t-care terms) The don’t-care terms are treated like required minterms when finding the prime implicants: 1 0001 ✓ (1, 3) 00–1 ✓ (1, 3, 9, 11) –0–1 2 0010 ✓ (1, 9) –001 ✓ (2, 3, 10,11) –01– 3 0011 ✓ (2, 3) 001– ✓ (3, 7 , 11, 15) - - 11 9 1001 ✓ (2, 10) –010 ✓ (9, 11, 13, 15) 1 - - 1 10 1010 ✓ (3, 7) 0–11 ✓ 7 0111 ✓ (3, 11) –011 ✓ 11 1011 ✓ (9, 11) 10–1 ✓ 13 1101 ✓ (9, 13) 1–01 ✓ 5 1111 ✓ (10, 11) 101– ✓ (7 , 15) –111 ✓ (11, 15) 1–11 ✓ (13, 15) 11–1 ✓ 182 Unit 6 The don’t-care columns are omitted when forming the prime implicant chart: F = B′C + CD + AD 2 3 7 9 11 13 (1, 3, 9, 11) × × × × × × × × × × × × (2, 3, 10, 11) (3, 7, 11, 15) (9, 11, 13, 15) Indicates an essential prime implicant.
FIGURE 6-1 Use of Map-Entered Variables © Cengage Learning 2014 1 00 01 11 10 X E X F 1 E 1 1 1 00 CD AB G 01 11 10 X 1 00 01 11 10 X X 1 1 1 1 00 CD AB E = F = 0 MS0 = A′B′ + ACD 01 11 10 X X 00 01 11 10 X 1 X X 1 X X X 00 CD AB E = 1, F = 0 MS1 = A′D 01 11 10 X X 00 01 11 10 X X 1 X X X X 00 CD AB E = 0, F = 1 MS2 = AD (a) (b) (c) (d) 01 11 10 X Note that although the original function was incompletely specified, the final simplified expression for F is defined for all combinations of values for A, B, C, and D and is therefore completely specified. In the process of simplification, we have automatically assigned values to the don’t-cares in the original truth table for F. If we replace each term in the final expression for F by its corresponding sum of minterms, the result is F = (m2 + m3 + m10 + m11) + (m3 + m7 + m11 + m15) + (m9 + m11 + m13 + m15) Because m10 and m15 appear in this expression and m1 does not, this implies that the don’t-care terms in the original truth table for F have been assigned as follows: for ABCD = 0001, F = 0; for 1010, F = 1; for 1111, F = 1 6.5 Simplification Using Map-Entered Variables Although the Quine-McCluskey method can be used with functions with a fairly large number of variables, it is not very efficient for functions that have many vari-ables and relatively few terms. Some of these functions can be simplified by using a modification of the Karnaugh map method. By using map-entered variables, Karnaugh map techniques can be extended to simplify functions with more than four or five variables. Figure 6-1(a) shows a four-variable map with two additional variables entered in the squares in the map. When E appears in a square, this means Quine-McCluskey Method 183 that if E = 1, the corresponding minterm is present in the function G, and if E = 0, the minterm is absent. Thus, the map represents the six-variable function G(A, B, C, D, E, F ) = m0 + m2 + m3 + Em5 + Em7 + Fm9 + m11 + m15 (+ don’t-care terms) where the minterms are minterms of the variables A, B, C, and D. Note that m9 is present in G only when F = 1.
We will now use a three-variable map to simplify the function: F(A, B, C, D) = A′B′C + A′BC + A′BC′D + ABCD + (AB′C ) where the AB′C is a don’t-care term. Because D appears in only two terms, we will choose it as a map-entered variable, which leads to Figure 6-2(a). We will simplify F by first considering D = 0 and then D = 1. First set D = 0 on the map, and F reduces to A′C. Setting D = 1 leads to the map of Figure 6-2(b). The two 1’s on the original map have already been covered by the term A′C, so they are changed to X’s because we do not care whether they are covered again or not. From Figure 6-2(b), when D = 1. Thus, the expression F = A′C + D(C + A′B) = A′C + CD + A′BD gives the correct value of F both when D = 0 and when D = 1. This is a minimum expression for F, as can be verified by plotting the original function on a four-variable map; see Figure 6-2(c).
Next, we will discuss a general method of simplifying functions using map-entered variables. In general, if a variable Pi is placed in square mj of a map of function F, this means that F = 1 when Pi = 1, and the variables are chosen so that mj = 1. Given a map with variables P1, P2, . . . entered into some of the squares, the minimum sum-of-products form of F can be found as follows: Find a sum-of-products expression for F of the form F = MS0 + P1MS1 + P2MS2 + · · · where MS0 is the minimum sum obtained by setting P1 = P2 = · · · = 0.
FIGURE 6-2 Simplification Using a Map-Entered Variable © Cengage Learning 2014 (c) (b) (a) 00 01 11 10 1 X X 1 1 1 1 00 BC DA 01 11 10 1 0 1 X X X 1 1 00 BC A 01 11 10 0 1 1 X 1 D D 00 BC A 01 11 10 184 Unit 6 MS1 is the minimum sum obtained by setting P1 = 1, Pj = 0 ( j ≠1), and replac-ing all 1’s on the map with don’t-cares.
MS2 is the minimum sum obtained by setting P2 = 1, Pj = 0 ( j ≠2) and replac-ing all 1’s on the map with don’t-cares.
(Corresponding minimum sums can be found in a similar way for any remaining map-entered variables.) The resulting expression for F will always be a correct representation of F. This expression will be minimum provided that the values of the map-entered variables can be assigned independently. On the other hand, the expression will not generally be minimum if the variables are not independent (for example, if P1 = P2 ′).
For the example of Figure 6-1(a), maps for finding MS0, MS1, and MS2 are shown in Figures 6-1(b), (c), and (d), where E corresponds to P1 and F corresponds to P2. The resulting expression is a minimum sum of products for G: G = A′B′ + ACD + EA′D + FAD After some practice, it should be possible to write the minimum expression directly from the original map without first plotting individual maps for each of the minimum sums.
6.6 Conclusion We have discussed four methods for reducing a switching expression to a minimum sum-of-products or a minimum product-of-sums form: algebraic simplification, Karnaugh maps, Quine-McCluskey method, and Petrick’s method. Many other methods of sim-plification are discussed in the literature, but most of these methods are based on vari-ations or extensions of the Karnaugh map or Quine-McCluskey techniques. Karnaugh maps are most useful for functions with three to five variables. The Quine-McCluskey technique can be used with a high-speed digital computer to simplify functions with up to 15 or more variables. Such computer programs are of greatest value when used as part of a computer-aided design (CAD) package that assists with deriving the equations as well as implementing them. Algebraic simplification is still valuable in many cases, especially when different forms of the expressions are required. For problems with a large number of variables and a small number of terms, it may be impossible to use the Karnaugh map, and the Quine-McCluskey method may be very cumbersome. In such cases, algebraic simplification may be the easiest method to use. In situations where a minimum solution is not required or where obtaining a minimum solution requires too much computation to be practical, heuristic procedures may be used to simplify switch-ing functions. One of the more popular heuristic procedures is the Espresso-II method,2 which can produce near minimum solutions for a large class of problems.
The minimum sum-of-products and minimum product-of-sums expressions we have derived lead directly to two-level circuits that use a minimum number of AND 2This method is described in R. K. Brayton et al., Logic Minimization Algorithms for VLSI Synthesis (Kluwer Academic Publishers, 1984).
Quine-McCluskey Method 185 and OR gates and have a minimum number of gate inputs. As discussed in Unit 7 , these circuits are easily transformed into circuits that contain NAND or NOR gates. These minimum expressions may also be useful when designing with some types of array logic, as discussed in Unit 9. However, many situations exist where minimum expressions do not lead to the best design. For practical designs, many other factors must be considered, such as the following: What is the maximum number of inputs a gate can have?
What is the maximum number of outputs a gate can drive?
Is the speed with which signals propagate through the circuit fast enough?
How can the number of interconnections in the circuit be reduced?
Does the design lead to a satisfactory circuit layout on a printed circuit board or on a silicon chip?
Until now, we have considered realizing only one switching function at a time. Unit 7 describes design techniques and Unit 9 describes components that can be used when several functions must be realized by a single circuit.
Programmed Exercise 6.1 Cover the answers to this exercise with a sheet of paper and slide it down as you check your answers.
Find a minimum sum-of-products expression for the following function: f(A, B, C, D, E) = Σ m(0, 2, 3, 5, 7, 9, 11, 13, 14, 16, 18, 24, 26, 28, 30) Translate each decimal minterm into binary and sort the binary terms into groups according to the number of 1’s in each term.
0 00000 ✓ 0,2 000-0 2 00010 ✓ 16 10000 3 00011 5 00101 9 01001 18 10010 24 11000 7 00111 11 01011 13 01101 14 01110 26 11010 28 11100 30 11110 Answer: Compare pairs of terms in adjacent groups and combine terms where possible. (Check off terms which have been combined.) 186 Unit 6 Answer: 0 2 (0, 2, 16, 18) 0 00000 ✓ 0, 2 000−0 ✓ 0, 2, 16, 18 −00−0 2 00010 ✓ 0, 16 −0000 16 10000 ✓ 2, 3 0001− 3 00011 ✓ 2, 18 −0010 5 00101 ✓ 16, 18 100−0 ✓ 9 01001 ✓ 16, 24 1−000 18 10010 ✓ 3, 7 00−11 24 11000 ✓ 3, 11 0−011 7 00111 ✓ 5, 7 001−1 11 01101 ✓ 5, 13 0−101 13 01101 ✓ 9, 11 010−1 14 01110 ✓ 9, 13 01−01 26 11010 ✓ 18, 26 1−010 28 11100 ✓ 24, 26 110−0 30 11110 ✓ 24, 28 11−00 14, 30 −1110 26, 30 11−10 28, 30 111−0 Now, compare pairs of terms in adjacent groups in the second column and combine terms where possible. (Check off terms which have been combined.) Check your work by noting that each new term can be formed in two ways. (Cross out duplicate terms.) Answer: (third column) 0, 2, 16, 18 –00–0 (check off (0, 2), (16, 18), (0, 16), and (2, 18)) 16, 18, 24, 26 1–0–0 (check off (16, 18), (24, 26), (16, 24), and (18, 26)) 24, 26, 28, 30 11 -- 0 (check off (24, 26), (28, 30), (24, 28), and (26, 30)) Can any pair of terms in the third column be combined?
Complete the given prime implicant chart.
Quine-McCluskey Method 187 Answer: Answer: No pair of terms in the third column combine.
0 2 3 5 7 9 11 13 14 16 18 24 26 28 30 (0, 2, 16, 18) × × × × (16, 18, 24, 26) × × × × (24, 26, 28, 30) × × × × (2, 3) × × (3, 7) × × (3, 11) × × (5, 7) × × (5, 13) × × (9, 11) × × (9, 13) × × (14, 30) × × Determine the essential prime implicants, and cross out the corresponding rows and columns.
0 2 3 5 7 9 11 13 14 16 18 24 26 28 30 (0, 2, 16, 18) × × × × × × × × × × × × × × × × × × × × × × × × × × × × (16, 18, 24, 26) (24, 26, 28, 30) (2, 3) (3, 7) (3, 11) (5, 7) (5, 13) (9, 11) (9, 13) (14, 30) Indicates an essential prime implicant.
Note that all remaining columns contain two or more X’s. Choose the first column which has two X’s and then select the prime implicant which covers the first X in that column. Then, choose a minimum number of prime implicants which cover the remaining columns in the chart.
188 Unit 6 Answer: 0 2 3 5 7 9 11 13 14 16 18 24 26 28 30 (0, 2, 16, 18) × × × × × × × × × × × × × × × × × × × × × × × × × × × × (16, 18, 24, 26) (24, 26, 28, 30) (2, 3) (3, 7) (3, 11) (5, 7) (5, 13) (9, 11) (9, 13) (14, 30) 0 2 3 5 7 9 11 13 14 16 18 24 26 28 30 (0, 2, 16, 18) × × × × × × × × × ×× × × × × ×× × × × × × × × × × × × (16, 18, 24, 26) (24, 26, 28, 30) (2, 3) (3, 7) → (3, 11) → (5, 7) (5, 13) (9, 11) → (9, 13) (14, 30) Indicates an essential prime implicant.
From this chart, write down the chosen prime implicants in 0, 1, and – notation.
Then, write the minimum sum of products in algebraic form.
Answer: –00–0, 11--0, 0–011, 001–1, 01–01, and –1110 f = B′C′E′ + ABE′ + A′C′DE + A′B′CE + A′BD′E + BCDE′ The prime implicant chart with the essential prime implicants crossed out is repeated here.
Find a second minimum sum-of-products solution.
Answer: Start by choosing prime implicant (5, 13).
f = BCDE′ + B′C′E′ + ABE′ + A′B′DE + A′CD′E + A′BC′E Indicates an essential prime implicant.
Quine-McCluskey Method 189 Problems 6.2 For each of the following functions, find all of the prime implicants, using the Quine-McCluskey method.
(a) f(a, b, c, d) = Σ m(1, 5, 7, 9, 11, 12, 14, 15) (b) f(a, b, c, d) = Σ m(0, 1, 3, 5, 6, 7, 8, 10, 14, 15) 6.3 Using a prime implicant chart, find all minimum sum-of-products solutions for each of the functions given in Problem 6.2.
6.4 For this function, find a minimum sum-of-products solution, using the Quine-McCluskey method.
f(a, b, c, d) = Σ m(1, 3, 4, 5, 6, 7, 10, 12, 13) + Σ d(2, 9, 15) 6.5 Find all prime implicants of the following function and then find all minimum solu-tions using Petrick’s method: F(A, B, C, D) = Σ m(9, 12, 13, 15) + Σ d(1, 4, 5, 7, 8, 11, 14) 6.6 Using the method of map-entered variables, use four-variable maps to find a mini-mum sum-of-products expression for (a) F(A, B, C, D, E) = Σ m(0, 4, 5, 7, 9) + Σ d(6, 11) + E(m1 + m15), where the m’s represent minterms of the variables A, B, C, and D.
(b) Z(A, B, C, D, E, F, G) = Σ m(0, 3, 13, 15) + Σ d(1, 2, 7, 9, 14) + E(m6 + m8) + Fm12 + Gm5 6.7 For each of the following functions, find all of the prime implicants using the Quine-McCluskey method.
(a) f(a, b, c, d) = Σ m(0, 3, 4, 5, 7, 9, 11, 13) (b) f(a, b, c, d) = Σ m(2, 4, 5, 6, 9, 10, 11, 12, 13, 15) 6.8 Using a prime implicant chart, find all minimum sum-of-products solutions for each of the functions given in Problem 6.7 .
6.9 For each function, find a minimum sum-of-products solution using the Quine-McCluskey method.
(a) f(a, b, c, d) = Σ m(2, 3, 4, 7, 9, 11, 12, 13, 14) + Σ d(1, 10, 15) (b) f(a, b, c, d) = Σ m(0, 1, 5, 6, 8, 9, 11, 13) + Σ d(7, 10, 12) (c) f(a, b, c, d) = Σ m(3, 4, 6, 7, 8, 9, 11, 13, 14) + Σ d(2, 5, 15) 6.10 Work Problem 5.24(a) using the Quine-McCluskey method.
6.11 F(A, B, C, D, E) = Σ m(0, 2, 6, 7, 8, 10, 11, 12, 13, 14, 16, 18, 19, 29, 30) + Σ d(4, 9, 21) 190 Unit 6 Find the minimum sum-of-products expression for F, using the Quine-McCluskey method. Underline the essential prime implicants in this expression.
6.12 Using the Quine-McCluskey method, find all minimum sum-of-products expres-sions for (a) f(A, B, C, D, E) = Σ m(0, 1, 2, 3, 4, 8, 9, 10, 11, 19, 21, 22, 23, 27, 28, 29, 30) (b) f(A, B, C, D, E) = Σ m(0, 1, 2, 4, 8, 11, 13, 14, 15, 17, 18, 20, 21, 26, 27, 30, 31) 6.13 Using the Quine-McCluskey method, find all minimum product-of-sums expressions for the functions of Problem 6.12. 6.14 (a) Using the Quine-McCluskey, method find all prime implicants of f(A, B, C, D) = Σ m(1, 3, 5, 6, 8, 9, 12, 14, 15) + Σ d(4, 10, 13). Identify all essential prime impli-cants and find all minimum sum-of-products expressions.
(b) Repeat part (a) for f ′. 6.15 (a) Use the Quine-McCluskey method to find all prime implicants of f(a, b, c, d, e) = Σ m(1, 2, 4, 5, 6, 7, 9, 12, 13, 15, 17, 20, 22, 25, 28, 30). Find all essential prime implicants, and find all minimum sum-of-products expressions.
(b) Repeat part (a) for f ′.
6.16 G(A, B, C, D, E, F ) = Σ m(1, 2, 3, 16, 17, 18, 19, 26, 32, 39, 48, 63) + Σ d(15, 28, 29, 30) (a) Find all minimum sum-of-products expressions for G.
(b) Circle the essential prime implicants in your answer.
(c) If there were no don’t-care terms present in the original function, how would your answer to part (a) change? (Do this by inspection of the prime implicant chart; do not rework the problem.) 6.17 (a) Use the Quine-McCluskey procedure to find all prime implicants of the function G(A, B, C, D, E, F ) = Σ m(1, 7, 11, 12, 15, 33, 35, 43, 47, 59, 60) + Σ d(30, 50, 54, 58). Identify all essential prime implicants and find all minimum sum-of-products expressions.
(b) Repeat part (a) for G′.
6.18 The following prime implicant table (chart) is for a four-variable function f(A, B, C, D).
(a) Give the decimal representation for each of the prime implicants.
(b) List the maxterms of f.
(c) List the don’t-cares of f, if any.
(d) Give the algebraic expression for each of the essential prime implicants.
2 3 7 9 11 13 –0–1 × × × –01– × × × - - 11 × × × 1 - - 1 × × × Quine-McCluskey Method 191 6.19 Packages arrive at the stockroom and are delivered on carts to offices and laborato-ries by student employees. The carts and packages are various sizes and shapes. The students are paid according to the carts used. There are five carts and the pay for their use is Cart C1: $2 Cart C2: $1 Cart C3: $4 Cart C4: $2 Cart C5: $2 On a particular day, seven packages arrive, and they can be delivered using the five carts as follows: C1 can be used for packages P1, P3, and P4.
C2 can be used for packages P2, P5, and P6.
C3 can be used for packages P1, P2, P5, P6, and P7.
C4 can be used for packages P3, P6, and P7.
C5 can be used for packages P2 and P4.
The stockroom manager wants the packages delivered at minimum cost. Using mini-mization techniques described in this unit, present a systematic procedure for find-ing the minimum cost solution.
6.20 Use the Quine-McCluskey procedure to find all prime implicants of the function h(A, B, C, D, E, F, G) = Σ m(24, 28, 39, 47, 70, 86, 88, 92, 102, 105, 118).
Express the prime implicants algebraically.
6.21 Shown below is the prime implicant chart for a completely specified four-variable combinational logic function r(w, x, y, z).
(a) Algebraically express r as a product of maxterms.
(b) Give algebraic expressions for the prime implicants labeled A, C, and D in the table.
(c) Find all minimal sum-of-product expressions for r. You do not have to give alge-braic expressions; instead just list the prime implicants (A, B, C, etc.) required in the sum(s).
6.22 (a) In the prime implicant chart of Problem 6.21, column 7 is said to cover column 6 since column 7 has an X in each row that column 6 does. Similarly, column 11 0 4 5 6 7 8 9 10 11 13 14 15 A × × B × × × × C × × × × D × × × × E × × × × F × × × × G × × H × × × × 192 Unit 6 covers column 10 and column 15 covers column 14. Columns 7 , 11, and 15 can be removed to obtain a simpler chart having the same solutions as the original. Explain why this is correct.
(b) In Table 6-5 (after removing row P2 and columns 0 and 2), row P3 covers row P1. Row (prime implicant) P1 can be removed, and the resulting chart will have a minimum solution for the original table. Explain why this is correct. Are there any restrictions on the two prime implicants to allow removal of the covered prime implicant?
(c) After deleting row P1 from Table 6-5, row P3 must be included in a minimal solu-tion for the chart. Why?
6.23 Find all prime implicants of the following function, and then find all minimum solu-tions using Petrick’s method: F(A, B, C, D) = Σ m(7, 12, 14, 15) + Σ d(1, 3, 5, 8, 10, 11, 13) 6.24 Using the method of map-entered variables, use four-variable maps to find a minimum sum-of-products expression for (a) F(A, B, C, D, E) = Σ m(0, 4, 6, 13, 14) + Σ d(2, 9) + E(m1 + m12) (b) Z(A, B, C, D, E, F, G) = Σ m(2, 5, 6, 9) + Σ d(1, 3, 4, 13, 14) + E(m11 + m12) + F(m10) + G(m0) 6.25 (a) Rework Problem 6.6(a), using a five-variable map.
(b) Rework Problem 6.6(a), using the Quine-McCluskey method. Note that you must express F in terms of minterms of all five variables; the original four-variable minterms cannot be used.
6.26 Using map-entered variables, find the minimum sum-of-products expressions for the following function: G = C′E′F + DEF + AD′E′F ′ + BDE′F + AD′EF ′ 193 Multi-Level Gate Circuits NAND and NOR Gates U N I T 7 Objectives 1. Design a minimal two-level or multi-level circuit of AND and OR gates to real-ize a given function. (Consider both circuits with an OR gate at the output and circuits with an AND gate at the output.) 2. Design or analyze a two-level gate circuit using any one of the eight basic forms (AND-OR, NAND-NAND, OR-NAND, NOR-OR, OR-AND, NOR-NOR, AND-NOR, and NAND-AND).
3. Design or analyze a multi-level NAND-gate or NOR-gate circuit.
4. Convert circuits of AND and OR gates to circuits of NAND gates or NOR gates, and conversely, by adding or deleting inversion bubbles.
5. Design a minimal two-level, multiple-output AND-OR, OR-AND, NAND-NAND, or NOR-NOR circuit using Karnaugh maps.
194 Unit 7 Study Guide 1. Study Section 7 .1, Multi-Level Gate Circuits.
(a) What are two ways of changing the number of levels in a gate circuit?
(b) By constructing a tree diagram, determine the number of gates, gate inputs, and levels of gates required to realize Z1 and Z2: Z1 = [(A + B)C + DE(F + G)]H Z2 = A + B[C + DE(F + G)] Check your answers by drawing the corresponding gate circuits.
(c) In order to find a minimum two-level solution, why is it necessary to consider both a sum-of-products form and a product-of-sums form for the function?
(d) One realization of Z = ABC(D + E) + FG is A C B D E F G Z Redraw the circuit so that it uses one less gate and so that the output of an AND gate never goes directly to the input of another AND gate.
Multi-Level Gate Circuits NAND and NOR Gates 195 (e) Work Problems 7 .1 and 7 .2. Unless otherwise specified, you may always assume that both the variables and their complements are available as cir-cuit inputs.
2. Study Section 7 .2, NAND and NOR Gates.
(a) For each gate, specify the missing inputs: 0 0 1 1 1 0 0 1 (b) What is meant by functionally complete set of logic gates?
(c) How can you show that a set of logic gates is functionally complete?
(d) Show that the NOR gate itself is functionally complete.
(e) Using NAND gates, draw a circuit for F = (A′(BC)′)′.
(f ) Using NOR gates, draw a circuit for F = ((X + Y)′ + (X′ + Z)′)′.
3. Study Section 7 .3, Design of Two-Level NAND- and NOR-Gate Circuits.
(a) Draw the circuit corresponding to Equation (7-17).
(b) Derive Equation (7-18).
(c) Make sure that you understand the relation between Equations (7-13) through (7-21) and the diagrams of Figure 7-11.
(d) Why is the NOR-NAND form degenerate?
196 Unit 7 (e) What assumption is made about the types of inputs available when the pro-cedures for designing two-level NAND-NAND and NOR-NOR circuits are used?
(f ) For these procedures the literal inputs to the output gate are comple-mented but not the literal inputs to the other gates. Explain why. Use an equation to illustrate.
(g) A general OR-AND circuit follows. Transform this to a NOR-NOR circuit and prove that your transformation is valid.
ℓ1 ℓ2 ...
...
...
...
x1 P1 P2 F x2 y1 y2 = a f f b c a′ b′ c′ = a f f b c a′ b′ c′ (h) Work Problem 7 .3.
4. Study Section 7 .4, Design of Multi-Level NAND- and NOR-Gate Circuits.
(a) Verify that the NAND circuit of Figure 7-13 is correct by dividing the cor-responding circuit of AND and OR gates into two-level subcircuits and transforming each subcircuit.
(b) If you wish to design a two-level circuit using only NOR gates, should you start with a minimum sum of products or a minimum product of sums?
(c) Note that direct conversion of a circuit of AND and OR gates to a NAND-gate circuit requires starting with an OR gate at the output, but the direct conversion to a NOR-gate circuit requires starting with an AND gate at the output. This is easy to remember because a NAND is equivalent to an OR with the inputs inverted: and a NOR is equivalent to an AND with the inputs inverted: Multi-Level Gate Circuits NAND and NOR Gates 197 (d) Convert the circuit of Figure 7-1(b) to all NAND gates.
(e) Work Problems 7 .4, 7 .5, 7 .6, and 7 .7 .
5. Study Section 7 .5, Circuit Conversion Using Alternative Gate Symbols.
(a) Determine the logic function realized by each of the following circuits: G A B A B C F C F = G = (b) Convert the circuit of Figure 7-13(a) to NAND gates by adding bubbles and complementing input variables when necessary. (You should have added 12 bubbles. Your result should be similar to Figure 7-13(b), except some of the NAND gates will use the alternative symbol.) (c) Draw a circuit of AND and OR gates for the following equation: Z = A[BC + D + E(F + GH)] Then convert to NOR gates by adding bubbles and complementing inputs when necessary. (You should have added 10 bubbles and complemented six input variables.) (d) Work Problem 7 .8.
6. Study Section 7 .6, Design of Two-Level, Multiple-Output Circuits.
(a) In which of the following cases would you replace a term xy′ with xy′z + xy′z′?
(1) Neither xy′z or xy′z′ is used in another function.
(2) Both xy′z and xy′z′ are used in other functions.
(3) Term xy′z is used in another function, but xy′z′ is not.
(b) In the second example (Figure 7-23), in f2, c could have been replaced by bc + b′c because bc and b′c were available “free” from f1 and f3. Why was this replacement not made?
198 Unit 7 (c) In the following example, compute the cost of realizing f1 and f2 separately; then compute the cost using the term a′b′c in common between the two functions. Use a two-level AND-OR circuit in both cases.
(d) Find expressions which correspond to a two-level, minimum multiple-output, AND-OR realization of F1, F2, and F3. Why should the term cd not be included in F1?
F1 = F2 = F3 = (e) Work Problems 7 .9, 7 .10, and 7 .11.
(f ) Work Problem 7 .12. (Hint: Work with the 0’s on the maps and first find a minimum solution for f1′, f2′, and f3 ′.) 7. Study Section 7 .7 , Multiple-Output NAND- and NOR-Gate Circuits.
(a) Derive expressions for the F1 and F2 outputs of the NOR circuits of Figure 7-26(b) by finding the equation for each gate output, and show that these expressions reduce to the original expressions for F1 and F2.
f1 f2 1 1 1 0 1 00 bc a 01 11 10 1 1 1 1 1 0 1 00 bc a 01 11 10 F1 F2 F3 1 00 01 11 10 1 1 1 1 1 00 cd ab 01 11 10 1 00 01 11 10 1 1 1 1 00 cd ab 01 11 10 1 1 00 01 11 10 1 1 1 1 1 00 cd ab 01 11 10 Multi-Level Gate Circuits NAND and NOR Gates 199 (b) Convert Figure 7-26(a) to 7-26(b) by using the bubble method.
(c) Work Problem 7 .13.
Multi-Level Gate Circuits NAND and NOR Gates In the first part of this unit, you will learn how to design circuits which have more than two levels of AND and OR gates. In the second part you will learn techniques for designing with NAND and NOR gates. These techniques generally consist of first designing a circuit of AND and OR gates and then converting it to the desired type of gates. These techniques are easy to apply provided that you start with the proper form of circuit.
7.1 Multi-Level Gate Circuits The maximum number of gates cascaded in series between a circuit input and the output is referred to as the number of levels of gates (not to be confused with voltage levels). Thus, a function written in sum-of-products form or in product-of-sums form corresponds directly to a two-level gate circuit. As is usually the case in digital cir-cuits where the gates are driven from flip-flop outputs (as discussed in Unit 11), we will assume that all variables and their complements are available as circuit inputs. For this reason, we will not normally count inverters which are connected directly 200 Unit 7 to input variables when determining the number of levels in a circuit. In this unit we will use the following terminology: 1. AND-OR circuit means a two-level circuit composed of a level of AND gates followed by an OR gate at the output.
2. OR-AND circuit means a two-level circuit composed of a level of OR gates fol-lowed by an AND gate at the output.
3. OR-AND-OR circuit means a three-level circuit composed of a level of OR gates followed by a level of AND gates followed by an OR gate at the output.
4. Circuit of AND and OR gates implies no particular ordering of the gates; the output gate may be either AND or OR.
The number of levels in an AND-OR circuit can usually be increased by factor-ing the sum-of-products expression from which it was derived. Similarly, the number of levels in an OR-AND circuit can usually be increased by multiplying out some of the terms in the product-of-sums expression from which it was derived. Logic designers are concerned with the number of levels in a circuit for several reasons. Sometimes factoring (or multiplying out) to increase the number of levels of gates will reduce the required number of gates and gate inputs and, thus, reduce the cost of building the circuit, but in other cases increasing the number of levels will increase the cost. In many applications, the number of gates which can be cascaded is limited by gate delays. When the input of a gate is switched, there is a finite time before the output changes. When several gates are cascaded, the time between an input change and the corresponding change in the circuit output may become excessive and slow down the operation of the digital system.
The number of gates, gate inputs, and levels in a circuit can be determined by inspection of the corresponding expression. In the example of Figure 7-1(a), the tree diagram drawn below the expression for Z indicates that the corresponding circuit will have four levels, six gates, and 13 gate inputs, as verified in Figure 7-1(b). Each FIGURE 7-1 Four-Level Realization of Z © Cengage Learning 2014 Level 1 Level 2 Level 3 Level 4 A Z = (AB + C) (D + E + FG) + H B C D E H Z F G 2 2 3 2 2 2 (a) (b) Multi-Level Gate Circuits NAND and NOR Gates 201 node on the tree diagram represents a gate, and the number of gate inputs is written beside each node.
We can change the expression for Z to three levels by partially multiplying it out: Z = (AB + C)[(D + E) + FG] + H = AB(D + E) + C(D + E) + ABFG + CFG + H As shown in Figure 7-2, the resulting circuit requires three levels, six gates, and 19 gate inputs.
FIGURE 7-2 Three-Level Realization of Z © Cengage Learning 2014 Z H A B D E C ABFG C F G Z = AB(D + E) + C(D + E) + ABFG + CFG + H 2 3 2 (a) (b) 4 3 Level 2 Level 3 Level 1 5 The same gate can be used for both appearances of (D + E).
Problem: Find a circuit of AND and OR gates to realize f(a, b, c, d) = Σ m(1, 5, 6, 10, 13, 14) Consider solutions with two levels of gates and three levels of gates. Try to minimize the number of gates and the total number of gate inputs. Assume that all variables and their complements are available as inputs.
Solution: First, simplify f by using a Karnaugh map (Figure 7-3): Example of Multi-Level Design Using AND and OR Gates FIGURE 7-3 © Cengage Learning 2014 0 0 0 0 00 01 11 10 1 1 1 0 0 0 0 0 0 00 cd ab 01 11 10 1 1 1 f = a′c′d + bc′d + bcd′ + acd′ (7-1) 202 Unit 7 This leads directly to a two-level AND-OR gate circuit (Figure 7-4): Factoring Equation (7-1) yields f = c′d(a′ + b) + cd′(a + b) (7-2) which leads to the following three-level OR-AND-OR gate circuit (Figure 7-5): Both of these solutions have an OR gate at the output. A solution with an AND gate at the output might have fewer gates or gate inputs. A two-level OR-AND circuit corresponds to a product-of-sums expression for the function. This can be obtained from the 0’s on the Karnaugh map as follows: f′ = c′d′ + ab′c′ + cd + a′b′c (7-3) f = (c + d)(a′ + b + c)(c′ + d′)(a + b + c′) (7-4) Equation (7-4) leads directly to a two-level OR-AND circuit (Figure 7-6): FIGURE 7-4 © Cengage Learning 2014 a′ c′ d b c′ d b f c d′ a c d′ Two levels Five gates 16 gate inputs FIGURE 7-5 © Cengage Learning 2014 a′ b a c′ d f c d′ b Three levels Five gates 12 gate inputs FIGURE 7-6 © Cengage Learning 2014 c d a′ b c c′ f d′ a b c′ Two levels Five gates 14 gate inputs Multi-Level Gate Circuits NAND and NOR Gates 203 To get a three-level circuit with an AND-gate output, we partially multiply out Equation (7-4) using (X + Y)(X + Z) = X + YZ: f = [c + d(a′ + b)][c′ + d′(a + b)] (7-5) Equation (7-5) would require four levels of gates to realize; however, if we multiply out d′(a + b) and d(a′ + b), we get f = (c + a′d + bd)(c′ + ad′ + bd′) (7-6) which leads directly to a three-level AND-OR-AND circuit (Figure 7-7): For this particular example, the best two-level solution had an AND gate at the output (Figure 7-6), and the best three-level solution had an OR gate at the output (Figure 7-5). In general, to be sure of obtaining a minimum solution, one must find both the circuit with the AND-gate output and the one with the OR-gate output.
If an expression for f′ has n levels, the complement of that expression is an n-level expression for f. Therefore, to realize f as an n-level circuit with an AND-gate output, one procedure is first to find an n-level expression for f′ with an OR opera-tion at the output level and then complement the expression for f′. In the preceding example, factoring Equation (7-3) gives a three-level expression for f′: f′ = c′(d′ + ab′) + c(d + a′b′) = c′(d′ + a)(d′ + b′) + c(d + a′)(d + b′) (7-7) Complementing Equation (7-7) gives Equation (7-6), which corresponds to the three-level AND-OR-AND circuit of Figure 7-7 .
FIGURE 7-7 © Cengage Learning 2014 a d′ b d′ c′ f a′ d b d c Three levels Seven gates 16 gate inputs 204 Unit 7 7.2 NAND and NOR Gates Until this point we have designed logic circuits using AND gates, OR gates, and inverters. Exclusive-OR and equivalence gates have also been introduced in Unit 3. In this section we will define NAND and NOR gates. Logic designers frequently use NAND and NOR gates because they are generally faster and use fewer components than AND or OR gates. As will be shown later, any logic function can be imple-mented using only NAND gates or only NOR gates.
Figure 7-8(a) shows a three-input NAND gate. The small circle (or “bub-ble”) at the gate output indicates inversion, so the NAND gate is equivalent to an AND gate followed by an inverter, as shown in Figure 7-8(b). A more appropriate name would be an AND-NOT gate, but we will follow common usage and call it a NAND gate. The gate output is F = (ABC)′ = A′ + B′ + C′ The output of the n-input NAND gate in Figure 7-8(c) is F = (X1X2 . . . Xn)′ = X1 ′ + X2 ′ + · · · + Xn ′ (7-8) The output of this gate is 1 iff one or more of its inputs are 0.
Figure 7-9(a) shows a three-input NOR gate. The small circle at the gate output indicates inversion, so the NOR gate is equivalent to an OR gate followed by an inverter. A more appropriate name would be an OR-NOT gate, but we will follow common usage and call it a NOR gate. The gate output is F = (A + B + C)′ = A′B′C′ The output of an n-input NOR gate, shown in Figure 7-9(c), is F = (X1 + X2 + · · · + Xn)′ = X1 ′X2′ . . . Xn ′ (7-9) FIGURE 7-8 NAND Gates © Cengage Learning 2014 X1 X2 Xn A B F C (a) Three-input NAND gate A B F F C (b) NAND gate equivalent (c) n-input NAND gate ...
FIGURE 7-9 NOR Gates © Cengage Learning 2014 X1 X2 Xn A B F C (a) Three-input NOR gate A B F F C (b) NOR gate equivalent (c) n-input NOR gate ...
Multi-Level Gate Circuits NAND and NOR Gates 205 A set of logic operations is said to be functionally complete if any Boolean function can be expressed in terms of this set of operations. The set AND, OR, and NOT is obviously functionally complete because any function can be expressed in sum-of-products form, and a sum-of-products expression uses only the AND, OR, and NOT operations. Similarly, a set of logic gates is functionally complete if all switching functions can be realized using this set of gates. Because the set of oper-ations AND, OR, and NOT is functionally complete, any set of logic gates which can realize AND, OR, and NOT is also functionally complete. AND and NOT are a functionally complete set of gates because OR can also be realized using AND and NOT: FIGURE 7-10 NAND Gate Realization of NOT, AND, and OR © Cengage Learning 2014 X A A′ B′ B X′ A B (AB)′ (A′B′)′ = A + B AB If a single gate forms a functionally complete set by itself, then any switching function can be realized using only gates of that type. The NAND gate is an exam-ple of such a gate. Because the NAND gate performs the AND operation followed by an inversion, NOT, AND, and OR can be realized using only NAND gates, as shown in Figure 7-10. Thus, any switching function can be realized using only NAND gates. An easy method for converting an AND-OR circuit to a NAND circuit is discussed in the next section. Similarly, any function can be realized using only NOR gates.
The following procedure can be used to determine if a given set of gates is func-tionally complete. First, write out a minimum sum-of-products expression for the function realized by each gate. If no complement appears in any of these expressions, then NOT cannot be realized, and the set is not functionally complete. If a comple-ment appears in one of the expressions, then NOT can generally be realized by an appropriate choice of inputs to the corresponding gate. (We will always assume that 0 and 1 are available as gate inputs). Next, attempt to realize AND or OR, keeping in mind that NOT is now available. Once AND or OR has been realized, the other one can always be realized using DeMorgan’s laws if no more direct procedure is appar-ent. For example, if OR and NOT are available, AND can be realized by XY = (X′ + Y′)′ (7-10) X Y X′ X′Y′ (X′Y′)′ = X + Y Y′ 206 Unit 7 7.3 Design of Two-Level NAND- and NOR-Gate Circuits In this section two-level circuits realizing a function F using various combinations of NAND, NOR, AND, and OR gates are obtained by converting the switching algebra expression for F into the form matching the desired gate circuit. It is difficult to extend this approach to multiple-level circuits because it requires repeated complementa-tion of parts of the expression for F. In Sections 7 .4 and 7 .5, an alternative method is developed which first realizes F in the desired form using AND and OR gates. The circuit with AND and OR gates is converted to one containing NAND or NOR gates by inserting inverters in pairs to convert each AND and OR gate to a NAND or NOR gate. This approach avoids manipulation of the expression for F and is less error prone.
A two-level circuit composed of AND and OR gates is easily converted to a cir-cuit composed of NAND gates or NOR gates. This conversion is carried out by using F = (F ′)′ and then applying DeMorgan’s laws: (X1 + X2 + · · · + Xn)′ = X1 ′X2 ′ · · · Xn ′ (7-11) (X1X2 · · · Xn)′ = X1 ′ + X2 ′ + · · · + Xn ′ (7-12) The following example illustrates conversion of a minimum sum-of-products form to several other two-level forms: F = A + BC′ + B′CD = [(A + BC′ + B′CD)′]′ (7-13) = [A′ · (BC′)′ · (B′CD)′]′ (by 7-11) (7-14) = [A′ · (B′ + C) · (B + C′ + D′)]′ (by 7-12) (7-15) = A + (B′ + C)′ + (B + C′ + D′)′ (by 7-12) (7-16) Equations (7-13), (7-14), (7-15), and (7-16) represent the AND-OR, NAND-NAND, OR-NAND, and NOR-OR forms, respectively, as shown in Figure 7-11.
Rewriting Equation (7-16) in the form F = 5[A + (B′ + C)′ + (B + C′ + D′)′]′6′ (7-17) leads to a three-level NOR-NOR-INVERT circuit. However, if we want a two-level circuit containing only NOR gates, we should start with the minimum product-of-sums form for F instead of the minimum sum of products. After obtaining the minimum product of sums from a Karnaugh map, F can be written in the following two-level forms: F = (A + B + C)(A + B′ + C′)(A + C′ + D) = 5[(A + B + C)(A + B′ + C′)(A + C′ + D)]′6′ (7-18) = [(A + B + C)′ + (A + B′ + C′)′ + (A + C′ + D)′]′ (by 7-12) (7-19) = (A′B′C′ + A′BC + A′CD′)′ (by 7-11) (7-20) = (A′B′C′)′ · (A′BC)′ · (A′CD′)′ (by 7-11) (7-21) Multi-Level Gate Circuits NAND and NOR Gates 207 FIGURE 7-11 Eight Basic Forms for Two-Level Circuits © Cengage Learning 2014 F A C′ D A B′ C′ A B C OR-AND F = (A + B + C)(A + B′ + C′)(A + C′ + D) (7-18) F = (A′B′C′ + A′BC + A′CD′)′ (7-20) NAND-AND NOR-NOR AND-NOR B C′ A F B′ C D B′ C A F B C′ D′ B′ C A′ F B C′ D′ AND-OR F = A + BC′ + B′CD F = [A′ ∙ (B′ + C) ∙ (B + C′ + D′)]′ (7-15) F = A + (B′ + C)′ + (B + C′ + D′)′ (7-16) F = [A′ ∙ (BC′)′ ∙ (B′CD)′]′ (7-14) F = (A′B′C′)′ ∙ (A′BC)′ ∙ (A′CD′)′ (7-21) F = [(A + B + C)′ + (A + B′ + C′)′ + (A + C′ + D)′]′ (7-19) NOR-OR NAND-NAND OR-NAND (7-13) B C′ A′ F B′ C D F A C′ D A B′ C′ A B C F A′ C D′ A′ B C A′ B′ C′ F A′ C D′ A′ B C A′ B′ C′ 208 Unit 7 Equations (7-18), (7-19), (7-20), and (7-21) represent the OR-AND, NOR-NOR, AND-NOR, and NAND-AND forms, respectively, as shown in Figure 7-11. Two-level AND-NOR (AND-OR-INVERT) circuits are available in integrated-circuit form. Some types of NAND gates can also realize AND-NOR circuits when the so-called wired OR connection is used.
The other eight possible two-level forms (AND-AND, OR-OR, OR-NOR, AND-NAND, NAND-NOR, NOR-NAND, etc.) are degenerate in the sense that they cannot realize all switching functions. Consider, for example, the following NAND-NOR circuit: FIGURE 7-12 AND-OR to NAND-NAND Transformation © Cengage Learning 2014 ...
...
...
x1 ℓ1 ℓ2 ℓ′ 1 ℓ′ 2 (a) Before transformation P1 P2 F x2 ...
y1 y2 ...
...
...
x1 (b) After transformation P′ 1 P2 ′ F x2 ...
y1 y2 From this example, it is clear that the NAND-NOR form can realize only a product of literals and not a sum of products.
Because NAND and NOR gates are readily available in integrated circuit form, two of the most commonly used circuit forms are the NAND-NAND and the NOR-NOR. Assuming that all variables and their complements are available as inputs, the following method can be used to realize F with NAND gates: Procedure for designing a minimum two-level NAND-NAND circuit: 1. Find a minimum sum-of-products expression for F.
2. Draw the corresponding two-level AND-OR circuit.
3. Replace all gates with NAND gates leaving the gate interconnections unchanged. If the output gate has any single literals as inputs, complement these literals.
Figure 7-12 illustrates the transformation of step 3. Verification that this transforma-tion leaves the circuit output unchanged follows. In general, F is a sum of literals (ℓ1, ℓ2, . . .) and product terms (P1, P2, . . .): F = ℓ1 + ℓ2 + · · · + P1 + P2 + · · · After applying DeMorgan’s law, F = (ℓ1 ′ ℓ2 ′ · · · P1 ′ P2 ′ · · ·)′ F = [(ab)′ + (cd)′ + e]′ = abcde′ a b c d e F Multi-Level Gate Circuits NAND and NOR Gates 209 Example So the output OR gate is replaced with a NAND gate with inputs, ℓ1 ′, ℓ2 ′, · · ·, P1 ′, P2 ′, · · · . Because product terms P1, P2, . . . are each realized with an AND gate, P1 ′, P2 ′, . . . are each realized with a NAND gate in the transformed circuit.
Assuming that all variables and their complements are available as inputs, the following method can be used to realize F with NOR gates: Procedure for designing a minimum two-level NOR-NOR circuit: 1. Find a minimum product-of-sums expression for F.
2. Draw the corresponding two-level OR-AND circuit.
3. Replace all gates with NOR gates leaving the gate interconnections unchanged. If the output gate has any single literals as inputs, complement these literals.
This procedure is similar to that used for designing NAND-NAND circuits. Note, however, that for the NOR-NOR circuit, the starting point is a minimum product of sums rather than a sum of products.
7.4 Design of Multi-Level NAND- and NOR-Gate Circuits The following procedure may be used to design multi-level NAND-gate circuits: 1. Simplify the switching function to be realized.
2. Design a multi-level circuit of AND and OR gates. The output gate must be OR. AND-gate outputs cannot be used as AND-gate inputs; OR-gate outputs cannot be used as OR-gate inputs.
3. Number the levels starting with the output gate as level 1. Replace all gates with NAND gates, leaving all interconnections between gates unchanged. Leave the inputs to levels 2, 4, 6, . . . unchanged. Invert any literals which appear as inputs to levels 1, 3, 5, . . . .
The validity of this procedure is easily proven by dividing the multi-level circuit into two-level subcircuits and applying the previous results for two-level circuits to each of the two-level subcircuits. The example of Figure 7-13 illustrates the procedure. Note that if step 2 is performed correctly, each level of the circuit will contain only AND gates or only OR gates.
The procedure for the design of multi-level NOR-gate circuits is exactly the same as for NAND-gate circuits except the output gate of the circuit of AND and OR gates must be an AND gate, and all gates are replaced with NOR gates.
F1 = a′[b′ + c(d + e′) + f ′g′] + hi′j + k Figure 7-13 shows how the AND-OR circuit for F1 is converted to the corresponding NAND circuit.
210 Unit 7 7.5 Circuit Conversion Using Alternative Gate Symbols Logic designers who design complex digital systems often find it convenient to use more than one representation for a given type of gate. For example, an inverter can be represented by In the second case, the inversion “bubble” is at the input instead of the output. Figure 7-14 shows some alternative representations for AND, OR, NAND, and NOR gates. These equivalent gate symbols are based on DeMorgan’s laws.
These alternative symbols can be used to facilitate the analysis and design of NAND- and NOR-gate circuits. Figure 7-15(a) shows a simple NAND-gate circuit. To analyze the circuit, we will replace the NAND gates at the first and third levels with the alterna-tive NAND gate symbol. This eliminates the inversion bubble at the circuit output.
FIGURE 7-13 Multi-Level Circuit Conversion to NAND Gates © Cengage Learning 2014 Level 5 Level 4 Level 3 (a) AND-OR network Level 2 Level 1 d e′ c f′ g′ b′ a′ h k F1 i′ j Level 5 Level 4 Level 3 (b) NAND network Level 2 Level 1 d′ e c f′ g′ b a′ h k′ F1 i′ j A or A′ A A′ FIGURE 7-14 Alternative Gate Symbols © Cengage Learning 2014 A B A AB = (A′ + B′)′ (a) AND A + B = (A′B′)′ (b) OR B AB A + B A B A (AB)′ = A′ + B′ (c) NAND (A + B)′ = A′B′ (d) NOR B (AB)′ (A + B)′ Multi-Level Gate Circuits NAND and NOR Gates 211 In the resulting circuit (Figure 7-15(b)), inverted outputs (those with a bubble) are always connected to inverted inputs, and noninverted outputs are connected to non-inverted inputs. Because two inversions in a row cancel each other out, we can easily analyze the circuit without algebraically applying DeMorgan’s laws. Note, for example, that the output of gate 2 is [(A′ + B)C]′, but the term (A′ + B)C appears in the output function. We can also convert the circuit to an AND-OR circuit by simply removing the double inversions (see Figure 7-15(c)). When a single input variable is connected to an inverted input, we must also complement that variable when we remove the inversion from the gate input. For example, A in Figure 7-15(b) becomes A′ in Figure 7-15(c).
The circuit of AND and OR gates shown in Figure 7-16(a) can easily be con-verted to a NOR-gate circuit because the output gate is an AND-gate, and AND and OR gates alternate throughout the circuit. That is, AND-gate outputs connect only to OR-gate inputs, and OR-gate outputs connect only to AND-gate inputs. To carry out conversion to NOR-gates, we first replace all of the OR and AND gates with NOR gates, as shown in Figure 7-16(b). Because each inverted gate output drives an inverted gate input, the pairs of inversions cancel. However, when an input variable drives an inverted input, we have added a single inversion, so we must complement the variable to compensate. Therefore, we have complemented C and G. The result-ing NOR-gate circuit is equivalent to the original AND-OR circuit.
Even if AND and OR gates do not alternate, we can still convert an AND-OR circuit to a NAND or NOR circuit, but it may be necessary to add extra inverters so that each added inversion is cancelled by another inversion. The following proce-dure may be used to convert to a NAND (or NOR) circuit: 1. Convert all AND gates to NAND gates by adding an inversion bubble at the output. Convert all OR gates to NAND gates by adding inversion bubbles at the FIGURE 7-15 NAND Gate Circuit Conversion © Cengage Learning 2014 A B′ C D F Z E 1 2 3 (a) NAND gate network 4 A A′ + B [(A′ + B)C]′ (DE)′ B′ C D F Z = (A′ + B)C + F′ + DE E 2 3 (b) Alternate form for NAND gate network A′ B C D F′ Z E 2 3 (c) Equivalent AND-OR network 1 1 4 4 212 Unit 7 inputs. (To convert to NOR, add inversion bubbles at all OR-gate outputs and all AND-gate inputs.) 2. Whenever an inverted output drives an inverted input, no further action is needed because the two inversions cancel.
3. Whenever a noninverted gate output drives an inverted gate input or vice versa, insert an inverter so that the bubbles will cancel. (Choose an inverter with the bubble at the input or output as required.) FIGURE 7-16 Conversion to NOR Gates © Cengage Learning 2014 Double inversion cancels Complemented input cancels inversion A B′ C D E G Z F (a) Circuit with OR and AND gates A B′ C′ D E G′ Z F (b) Equivalent circuit with NOR gates FIGURE 7-17 Conversion of AND-OR Circuit to NAND Gates © Cengage Learning 2014 A B′ C D′ E′ F Added inverter (c) Completed conversion Added inverter A B′ C D E F Bubbles cancel (b) First step in NAND conversion A B′ C D E F (a) AND-OR network Multi-Level Gate Circuits NAND and NOR Gates 213 4. Whenever a variable drives an inverted input, complement the variable (or add an inverter) so the complementation cancels the inversion at the input.
In other words, if we always add bubbles (or inversions) in pairs, the function realized by the circuit will be unchanged. To illustrate the procedure we will convert Figure 7-17(a) to NANDs. First, we add bubbles to change all gates to NAND gates (Figure 7-17(b)). In four places (highlighted in blue), we have added only a single inversion. This is corrected in Figure 7-17(c) by adding two inverters and complementing two variables.
Note that when an inverter is added between two gates during the conversion procedure, the number of levels in the circuit is increased by 1. This is avoided if each path through the circuit alternately passes through AND and OR gates. Similarly, if the circuit containing AND and OR gates has an output OR (AND) gate and it is converted to a circuit with NOR (NAND) gates, then it is necessary to add an inverter at the output, which also increases the number of levels by 1. Hence, if a NAND (NOR) gate circuit is desired, it is usually best to start with a circuit contain-ing AND and OR gates that has an output OR (AND) gate.
An advantage of multi-level circuits is that gate fan-in can be reduced. As an example, consider F = D′E + BCE + AB′ + AC′ (7-22) A two-level AND-OR circuit implementing F requires one 4-input OR, one 3-input AND, and three 2-input ANDs. To reduce the fan-in, F can be factored. F = A(B′ + C′) + E(D′ + BC) (7-23) The resulting four-level circuit using AND and OR gates is shown in Figure 7-18.
Since the output gate is an OR, the circuit can be converted to NAND gates without increasing the number of levels; Figure 7-19 is the result. Note that the three-level OR with inputs B′ and C′ and the four-level AND with inputs B and C both become a NAND with inputs B and C; hence, both can be replaced by the same gate.
FIGURE 7-18 Limited Fan-In Circuit © Cengage Learning 2014 F A E D′ B′ C′ B C FIGURE 7-19 NAND Gate Equivalent of Figure 7-18 © Cengage Learning 2014 B C D E A F 214 Unit 7 Reducing the fan-in for some functions requires inserting inverters. The fan-in for F = ABC + D can be reduced to 2 by factoring F as F = (AB)C + D. If this is implemented using two-input NAND gates, an inverter is required and the resulting circuit has four levels.
7.6 Design of Two-Level, Multiple-Output Circuits Solution of digital design problems often requires the realization of several func-tions of the same variables. Although each function could be realized separately, the use of some gates in common between two or more functions sometimes leads to a more economical realization. The following example illustrates this: Design a circuit with four inputs and three outputs which realizes the functions F1(A, B, C, D) = Σ m(11, 12, 13, 14, 15) F2(A, B, C, D) = Σ m(3, 7, 11, 12, 13, 15) F3(A, B, C, D) = Σ m(3, 7, 12, 13, 14, 15) (7-24) First, each function will be realized individually. The Karnaugh maps, functions, and resulting circuit are given in Figures 7-20 and 7-21. The cost of this circuit is 9 gates and 21 gate inputs.
An obvious way to simplify this circuit is to use the same gate for AB in both F1 and F3. This reduces the cost to eight gates and 19 gate inputs. (Another, but less obvious, way to simplify the circuit is possible.) Observing that the term ACD is necessary for the realization of F1 and A′CD is necessary for F3, if we replace CD in F2 by A′CD + ACD, the realization of CD is unnecessary and one gate is saved. Figure 7-22 shows the reduced circuit, which requires seven gates and 18 gate inputs. Note that F2 is realized by the expression ABC′ + A′CD + ACD, which is not a minimum sum of products, and two of the terms are not prime implicants of F2. Thus in realizing multiple-output circuits, the use of a minimum sum of prime implicants FIGURE 7-20 Karnaugh Maps for Equations (7-24) © Cengage Learning 2014 F1 F2 F3 1 00 01 11 10 1 1 1 00 CD AB 01 11 10 1 1 00 01 11 10 1 1 1 1 1 00 CD AB 01 11 10 1 00 01 11 10 1 1 1 1 00 CD AB 01 11 10 1 Multi-Level Gate Circuits NAND and NOR Gates 215 for each function does not necessarily lead to a minimum cost solution for the circuit as a whole.
When designing multiple-output circuits, you should try to minimize the total number of gates required. If several solutions require the same number of gates, the one with the minimum number of gate inputs should be chosen. The next example further illustrates the use of common terms to save gates. A four-input, three-output circuit is to be designed to realize f1 = Σ m(2, 3, 5, 7, 8, 9, 10, 11, 13, 15) f2 = Σ m(2, 3, 5, 6, 7, 10, 11, 14, 15) f3 = Σ m(6, 7, 8, 9, 13, 14, 15) (7-25) First, we plot maps for f1, f2, and f3 (Figure 7-23). If each function is minimized sepa-rately, the result is f1 = bd + b′c + ab′ f2 = c + a′bd f3 = bc + ab′c′ + % abd or ac′d - 10 gates, 25 gate inputs (7-25(a)) FIGURE 7-22 Multiple-Output Realization of Equations (7-24) © Cengage Learning 2014 A B F1 A C D F2 A B C′ A′ C D F3 FIGURE 7-21 Realization of Equations (7-24) © Cengage Learning 2014 A A B C D F1 = AB + ACD A C D B C′ F2 = ABC′ + CD A′ A B C D F3 = A′CD + AB 216 Unit 7 By inspecting the maps, we can see that terms a′bd (from f2), abd (from f3), and ab′c′ (from f3) can be used in f1. If bd is replaced with a′bd + abd, then the gate needed to realize bd can be eliminated. Because m10 and m11 in f1 are already covered by b′c, ab′c′ (from f3) can be used to cover m8 and m9, and the gate needed to realize ab′ can be eliminated. The minimal solution is therefore f1 = a′bd + abd + ab′c′ + b′c f2 = c + a′bd eight gates f3 = bc + ab′c′ + abd 22 gate inputs (7-25(b)) (Terms which are used in common between two functions are underlined.) When designing multiple-output circuits, it is sometimes best not to combine a 1 with its adjacent 1’s, as illustrated in the example of Figure 7-24.
The solution with the maximum number of common terms is not necessarily best, as illustrated in the example of Figure 7-25.
Determination of Essential Prime Implicants for Multiple-Output Realization As a first step in determining a minimum two-level, multiple-output realization, it is often desirable to determine essential prime implicants. However, we must be careful because some of the prime implicants essential to an individual function may not be essential to the multiple-output realization. For example, in Figure 7-23, bd is an essen-tial prime implicant of f1 (only prime implicant which covers m5), but it is not essential to the multiple-output realization. The reason that bd is not essential is that m5 also appears on the f2 map and, hence, might be covered by a term which is shared by f1 and f2. We can find prime implicants which are essential to one of the functions and to the multiple-output realization by a modification of the procedure used for the single-output case. In particular, when we check each 1 on the map to see if it is covered by only one prime implicant, we will only check those 1’s which do not appear on the other function maps. Thus, in Figure 7-24 we find that c′d is essential to f1 for the multiple-output realization (because of m1), but abd is not essential because m15 also abd ab′c′ a′bd 1 00 01 11 10 1 1 1 1 1 1 1 1 00 cd ab 01 11 10 1 00 01 11 10 1 1 1 1 1 1 00 cd ab 01 11 10 1 1 1 1 00 01 11 10 1 1 1 1 00 cd ab 01 11 10 1 1 FIGURE 7-23 © Cengage Learning 2014 Multi-Level Gate Circuits NAND and NOR Gates 217 appears on the f2 map. In Figure 7-25, the only minterms of f1 which do not appear on the f2 map are m2 and m5. The only prime implicant which covers m2 is a′d′; hence, a′d′ is essential to f1 in the multiple-output realization. Similarly, the only prime implicant which covers m5 is a′bc′, and a′bc′ is essential. On the f2 map, bd′ is essential. Why?
Once the essential prime implicants for f1 and f2 have been looped, selection of the remaining terms to form the minimum solution is obvious in this example. The techniques for finding essential prime implicants outlined above cannot be applied in a problem such as Figure 7-23, where every minterm of f1 also appears on the f2 or f3 map.
A general procedure for finding the minimum multiple output AND-OR circuit requires finding the prime implicants of not only each function but, also, of the prod-uct of all functions. If three functions f1, f2, and f3 are being realized, then the prime implicants of f1, f2, f3, f1 f2, f1 f3, f2 f3, and f1 f2 f3 are required. The optimum solution is obtained by selecting the fewest prime implicants from these prime implicants to realize f1, f2, and f3. This procedure is not discussed further in this text.
7.7 Multiple-Output NAND- and NOR-Gate Circuits The procedure given in Section 7 .4 for design of single-output, multi-level NAND- and NOR-gate circuits also applies to multiple-output circuits. If all of the output gates are OR gates, direct conversion to a NAND-gate circuit is possible. If all FIGURE 7-24 00 01 11 10 1 1 1 1 1 00 cd ab f1 01 11 10 1 1 00 01 11 10 1 00 cd ab f2 01 11 10 1 1 00 01 11 10 1 1 1 1 1 00 cd ab f1 (a) Best solution (b) Solution requires an extra gate 01 11 10 1 1 00 01 11 10 1 00 cd ab f2 01 11 10 1 1 00 01 11 10 1 1 1 1 1 1 00 cd ab f1 (a) Solution with maximum number of common terms requires 8 gates, 26 inputs 01 11 10 1 1 1 1 00 01 11 10 00 cd ab f2 01 11 10 1 1 00 01 11 10 1 1 1 1 1 1 00 cd ab f1 (b) Best solution requires 7 gates, 18 inputs and has no common terms 01 11 10 1 1 00 01 11 10 00 cd ab f2 01 11 10 1 1 1 1 FIGURE 7-25 © Cengage Learning 2014 © Cengage Learning 2014 218 Unit 7 of the output gates are AND, direct conversion to a NOR-gate circuit is possible. Figure 7-26 gives an example of converting a two-output circuit to NOR gates. Note that the inputs to the first and third levels of NOR gates are inverted.
F1 = (a + b′ )c + d F2 = (a + b′ )c + g′h Problems 7.1 Using AND and OR gates, find a minimum circuit to realize f(a, b, c, d) = m4 + m6 + m7 + m8 + m9 + m10 (a) using two-level logic (b) using three-level logic (12 gate inputs minimum) 7.2 Realize the following functions using AND and OR gates. Assume that there are no restrictions on the number of gates which can be cascaded and minimize the number of gate inputs.
(a) AC′D + ADE′ + BE′ + BC′ + A′D′E′ (b) AE + BDE + BCE + BCFG + BDFG + AFG 7.3 Find eight different simplified two-level gate circuits to realize F(a, b, c, d) = a′bd + ac′d FIGURE 7-26 Multi-Level Circuit Conversion to NOR Gates © Cengage Learning 2014 Level 4 Level 3 (a) Network of AND and OR gates Level 2 Level 1 a b′ c d e′ f g′ h F1 F2 (b) NOR network a b′ c′ d e′ f g′ h′ F1 F2 Multi-Level Gate Circuits NAND and NOR Gates 219 7.4 Find a minimum three-level NAND-gate circuit to realize F(A, B, C, D) = Σ m(5, 10, 11, 12, 13) (four gates) 7.5 Realize Z = A′D + A′C + AB′C′D′ using four NOR gates.
7.6 Realize Z = ABC + AD + C′D′ using only two-input NAND gates. Use as few gates as possible.
7.7 Realize Z = AE + BDE + BCEF using only two-input NOR gates. Use as few gates as possible.
7.8 (a) Convert the following circuit to all NAND gates, by adding bubbles and inverters where necessary.
(b) Convert to all NOR gates (an inverter at the output is allowed).
A′ B C D′ E F G′ Z 7.9 Find a two-level, multiple-output AND-OR gate circuit to realize the following functions. Minimize the required number of gates (six gates minimum).
f1 = ac + ad + b′d and f2 = a′b′ + a′d′ + cd′ 7.10 Find a minimum two-level, multiple-output AND-OR gate circuit to realize these functions.
f1(a, b, c, d) = Σ m(3, 4, 6, 9, 11) f2(a, b, c, d) = Σ m(2, 4, 8, 10, 11, 12) f3(a, b, c, d) = Σ m(3, 6, 7, 10, 11) (11 gates minimum) 7.11 Find a minimum two-level OR-AND circuit to simultaneously realize F1(a, b, c, d) = Σ m(2, 3, 8, 9, 14, 15) F2(a, b, c, d) = Σ m(0, 1, 5, 8, 9, 14, 15) (minimum solution has eight gates) 7.12 Find a minimum two-level OR-AND circuit to realize the functions given in Equations (7-25) on page 215 (nine gates minimum).
7.13 (a) Find a minimum two-level NAND-NAND circuit to realize the functions given in Equations (7-25) on page 215.
(b) Find a minimum two-level NOR-NOR circuit to realize the functions given in Equations (7-25).
220 Unit 7 7.14 Using AND and OR gates, find a minimum circuit to realize f(a, b, c, d) = M0 M1 M3 M13 M14 M15 (a) using two-level logic (b) using three-level logic (12 gate inputs minimum) 7.15 Using AND and OR gates, find a minimum two-level circuit to realize (a) F = a′c + bc′d + ac′d (b) F = (b′ + c)(a + b′ + d)(a + b + c′ + d ) (c) F = a′cd′ + a′bc + ad (d) F = a′b + ac + bc + bd′ 7.16 Realize the following functions using AND and OR gates. Assume that there are no restrictions on the number of gates which can be cascaded and minimize the number of gate inputs.
(a) ABC′ + ACD + A′BC + A′C′D (b) ABCE + ABEF + ACD′ + ABEG + ACDE 7.17 A combinational switching circuit has four inputs (A, B, C, D) and one output (F ). F = 0 iff three or four of the inputs are 0.
(a) Write the maxterm expansion for F.
(b) Using AND and OR gates, find a minimum three-level circuit to realize F (five gates, 12 inputs).
7.18 Find eight different simplified two-level gate circuits to realize (a) F(w, x, y, z) = (x + y′ + z)(x′ + y + z)w (b) F(a, b, c, d) = Σ m(4, 5, 8, 9, 13) 7.19 Implement f(x, y, z) = Σ m(0, 1, 3, 4, 7) as a two-level gate circuit, using a minimum number of gates.
(a) Use AND gates and NAND gates.
(b) Use NAND gates only.
7.20 Implement f(a, b, c, d) = Σ m(3, 4, 5, 6, 7, 11, 15) as a two-level gate circuit, using a minimum number of gates.
(a) Use OR gates and NOR gates.
(b) Use NOR gates only.
7.21 Realize each of the following functions as a minimum two-level NAND-gate circuit and as a minimum two-level NOR-gate circuit.
(a) F(A,B,C,D) = BD′ + B′CD + A′BC + A′BC′D + B′D′ (b) f(a, b, c, d) = Π M(0, 1, 7, 9, 10, 13) · Π D(2, 6, 14, 15) (c) f(a, b, c, d) = Σ m(0, 2, 5, 10) + Σ d(3, 6, 9, 13, 14, 15) (d) F(A, B, C, D, E) = Σ m(0, 2, 4, 5, 11, 14, 16, 17, 18, 22, 23, 25, 26, 31) + Σ d(3, 19, 20, 27, 28) Multi-Level Gate Circuits NAND and NOR Gates 221 (e) F(A, B, C, D, E) = Π M(3, 4, 8, 9, 10, 11, 12, 13, 14, 16, 19, 22, 25, 27) · Π D(17, 18, 28, 29) (f ) f(a, b, c, d) = Π M(1, 3, 10, 11, 13, 14, 15) · Π D(4, 6) (g) f(w, x, y, z) = Σ m(1, 2, 4, 6, 8, 9, 11, 12, 13) + Σ d(0, 7, 10, 15) 7.22 A combinational switching circuit has four inputs and one output as shown. F = 0 iff three or four of the inputs are 1.
(a) Write the maxterm expansion for F.
(b) Using AND and OR gates, find a minimum three-level circuit to realize F (5 gates, 12 inputs).
A B C D F f A B C 7.25 (a) Use gate equivalences to convert the circuit of Problem 7 .24 into a five-level cir-cuit containing only NOR gates and a minimum number of inverters. (Assume the inputs are available only in uncomplemented form.) (b) Derive a minimum POS expression for f.
(c) By manipulating the expression for f, find a four-level circuit containing only six NOR gates and inverters.
7.23 Implement f(a, b, c, d) = Σ m(3, 4, 5, 6, 7, 11, 15) as a two-level gate circuit, using a minimum number of gates.
(a) Use AND gates and NAND gates.
(b) Use OR gates and NAND gates.
(c) Use NAND gates only.
7.24 (a) Use gate equivalences to convert the circuit into a four-level circuit containing only NAND gates and a minimum number of inverters. (Assume the inputs are available only in uncomplemented form.) (b) Derive a minimum SOP expression for f.
(c) By manipulating the expression for f, find a three-level circuit containing only five NAND gates and inverters.
222 Unit 7 7.26 In the circuit, replace each NOR gate by an AND or OR gate so that the resulting circuit contains the fewest inverters possible. Assume the inputs are available in both true and complemented form. Do not replace the exclusive-OR gates.
B C′ A′ D′ E′ F G J W H I′ C D f A B 7.27 (a) Convert the circuit shown into a four-level circuit only containing AND and OR gates and a minimum number of inverters.
(b) Derive a sum-of-products expression for f.
(c) Find a circuit that realizes f ′ containing only NOR gates (no internal inverters). (Hint: Use gate conversions to convert the NAND gates in the given circuit to NOR gates.) 7.28 f(a, b, c, d, e) = Σ m(2, 3, 6, 12, 13, 16, 17, 18, 19, 22, 24, 25, 27, 28, 29, 31) (a) Find a minimum two-level NOR-gate circuit to realize f.
(b) Find a minimum three-level NOR-gate circuit to realize f.
7.29 Design a minimum three-level NOR-gate circuit to realize f = a′b′ + abd + acd 7.30 Find a minimum four-level NAND- or NOR-gate circuit to realize (a) Z = abe′f + c′e′f + d′e′f + gh (b) Z = (a′ + b′ + e + f )(c′ + a′ + b)(d′ + a′ + b)(g + h) 7.31 Implement abde′ + a′b′ + c using four NOR gates.
7.32 Implement x′yz + xvy′w′ + xvy′z′ using a three-level NAND-gate circuit.
Multi-Level Gate Circuits NAND and NOR Gates 223 7.33 Design a logic circuit that has a 4-bit binary number as an input and one output. The output should be 1 iff the input is a prime number (greater than 1) or zero.
(a) Use a two-level NAND-gate circuit.
(b) Use a two-level NOR-gate circuit.
(c) Use only two-input NAND gates.
7.34 Work Problem 7 .33 for a circuit that has an output 1 iff the input is evenly divisible by 3 (0 is divisible by 3).
7.35 Realize the following functions, using only two-input NAND gates. Repeat using only two-input NOR gates.
(a) F = A′BC′ + BD + AC + B′CD′ (b) F = A′CD + AB′C′D + ABD′ + BC 7.36 (a) Find a minimum circuit of two-input AND and two-input OR gates to realize F(A, B, C, D) = Σ m(0, 1, 2, 3, 4, 5, 7, 9, 11, 13, 14, 15) (b) Convert your circuit to two-input NAND gates. Add inverters where necessary.
(c) Repeat (b), except convert to two-input NOR gates.
7.37 Realize Z = A[BC′ + D + E(F′ + GH)] using NOR gates. Add inverters if necessary.
7.38 Show that the function of Equation (7-22) can be realized using four 2-input NOR gates and one 3-input NOR gate. Assume the inputs are available both comple-mented and uncomplemented. (No inverters are required.) 7.39 F(A, B, C) equals 1 if exactly two of A, B, and C are 1.
(a) Find the minimum two-level OR-AND circuit for F.
(b) Find a four-level circuit for F that has six 2-input NOR gates.
(c) Find the minimum two-level AND-OR circuit for F.
(d) Find a three-level circuit for F that has three 2-input NAND gates and two 2-input XOR gates.
7.40 (a) Use gate conversions to convert the circuit below into one containing NAND and XOR gates.
(b) Find the minimum two-level OR-AND circuit for F.
(c) Find a three-level circuit for F that has five 2-input NAND gates.
B′ A′ A B C F C′ 224 Unit 7 7.41 In which of the following two-level circuit forms can an arbitrary switching function be realized? Verify your answers. (Assume the inputs are available in both comple-mented and uncomplemented form.) (a) NOR-AND (b) NOR-OR (c) NOR-NAND (d) NOR-XOR (e) NAND-AND (f ) NAND-OR (g) NAND-NOR (h) NAND-XOR 7.42 Find a minimum two-level, multiple-output AND-OR gate circuit to realize these functions (eight gates minimum).
f1(a, b, c, d ) = Σ m(10, 11, 12, 15) + Σ d(4, 8, 14) f2(a, b, c, d ) = Σ m(0, 4, 8, 9) + Σ d(1, 10, 12) f3(a, b, c, d ) = Σ m(4, 11, 13, 14, 15) + Σ d(5, 9, 12) 7.43 Repeat 7 .42 for the following functions (six gates).
f1(a, b, c, d) = Σ m(2, 3, 5, 6, 7, 8, 10) f2(a, b, c, d) = Σ m(0, 1, 2, 3, 5, 7, 8, 10) 7.44 Repeat 7 .42 for the following functions (eight gates).
f1(x, y, z) = Σ m(2, 3, 4, 5) f2(x, y, z) = Σ m(1, 3, 5, 6) f3(x, y, z) = Σ m(1, 2, 4, 5, 6) 7.45 (a) Find a minimum two-level, multiple-output OR-AND circuit to realize f1 = b′d + a′b′ + c′d and f2 = a′d′ + bc′ + bd′.
(b) Realize the same functions with a minimum two-level NAND-NAND circuit.
7.46 Repeat Problem 7 .45 for f1 = ac′ + b′d + c′d and f2 = b′c + a′d + cd′.
7.47 (a) Find a minimum two-level, multiple-output NAND-NAND circuit to realize f1 = Σ m(3, 6, 7, 11, 13, 14, 15) and f2 = Σ m(3, 4, 6, 11, 12, 13, 14).
(b) Repeat for a minimum two-level, NOR-NOR circuit.
7.48 (a) Find a minimum two-level, multiple-output NAND-NAND circuit to realize f1 = Σ m(0, 2, 4, 6, 7, 10, 14) and f2 = Σ m(0, 1, 4, 5, 7, 10, 14).
(b) Repeat for a minimum two-level, multiple-output NOR-NOR circuit.
7.49 Draw a multi-level, multiple-output circuit equivalent to Figure 7-26(a) using: (a) NAND and AND gates (b) NAND gates only (a direct conversion is not possible) 225 Combinational Circuit Design and Simulation Using Gates U N I T 8 Objectives 1. Draw a timing diagram for a combinational circuit with gate delays.
2. Define static 0- and 1-hazards and dynamic hazards. Given a combinational circuit, find all of the static 0- and 1-hazards. For each hazard, specify the order in which the gate outputs must switch in order for the hazard to actually produce a false output.
3. Given a switching function, realize it using a two-level circuit which is free of static and dynamic hazards (for single input variable changes).
4. Design a multiple-output NAND or NOR circuit using gates with limited fan-in.
5. Explain the operation of a logic simulator that uses four-valued logic.
6. Test and debug a logic circuit design using a simulator.
226 Unit 8 Study Guide 1. Obtain your design problem assignment from your instructor.
2. Study Section 8.1, Review of Combinational Circuit Design.
3. Generally, it is possible to redesign a circuit which has two AND gates cas-caded or two OR gates cascaded so that AND and OR gates alternate. If this is not practical, the conversion to a NAND or NOR circuit by the techniques of Section 7 .4 is still possible by introducing a dummy one-input OR (AND) gate between the two AND (OR) gates. When the conversion is carried out, the dummy gate becomes an inverter. Try this technique and convert the following circuit to all NAND gates. Alternatively, you may use the procedures given in Section 7 .5 to do the conversion.
4. Study Section 8.2, Design of Circuits with Limited Gate Fan-In.
(a) If a realization of a switching expression requires too many inputs on one or more gates, what should be done?
(b) Assuming that all variables and their complements are available as inputs and that both AND and OR gates are available, does realizing the comple-ment of an expression take the same number of gates and gate inputs as realizing the original expression?
(c) When designing multiple-output circuits with limited gate fan-in, why is the procedure of Section 7 .6 of little help?
5. (a) Study Section 8.3, Gate Delays and Timing Diagrams. Complete the timing diagram for the given circuit. Assume that the AND gate has a 30-nanosecond (ns) propagation delay and the inverter has a 20-ns delay.
Z B′ B 0 20 40 60 80 100 120 t(ns) A A B B′ Z f a b′ d′ e c g′ Combinational Circuit Design and Simulation Using Gates 227 (b) Work Problem 8.1.
6. Study Section 8.4, Hazards in Combinational Logic.
(a) Even though all of the gates in a circuit are of the same type, each indi-vidual gate may have a different propagation delay. For example, for one type of TTL NAND gate the manufacturer specifies a minimum propaga-tion delay of 5 ns and a maximum delay of 30 ns. Sketch the gate outputs for the following circuit when the x input changes from 1 to 0, assuming the following gate delays: (a) gate 1–5 ns (b) gate 2–20 ns (c) gate 3–10 ns (b) Define static 0-hazard, static 1-hazard, and dynamic hazard.
(c) Using a Karnaugh map, explain why F = a′b + ac has a 1-hazard for the input change abc = 011 to 111, but not for 011 to 010. Then explain it with-out using the map.
(d) Explain why F = (a′ + b′)(b + c) has a 0-hazard for the input change abc = 100 to 110, but not for 100 to 000.
(e) Under what condition does a sum-of-products expression represent a hazard-free, two-level AND-OR circuit?
(f ) Under what condition does a product-of-sums expression represent a hazard-free, two-level OR-AND circuit?
(g) If a hazard-free circuit of AND and OR gates is transformed to NAND or NOR gates using the procedure given in Unit 7 , why will the results be hazard-free?
(h) Work Problems 8.2 and 8.3.
Z y2 y1 y1 y2 50 40 30 20 10 0 t(ns) x x 1 0 Z 1 3 2 228 Unit 8 7. Study Section 8.5, Simulation and Testing of Logic Circuits.
(a) Verify that Table 8-1 is correct. Consider both the case where the unknown value, X, is 0 and the case where it is 1.
(b) The following circuit was designed to realize the function F = [A′ + B + C′D][A + B′ + (C′ + D′)(C + D)] When a student builds the circuit in lab, he finds that when A = C = 0 and B = D = 1, the output F has the wrong value and that the gate outputs are as shown. Determine some possible causes of the incorrect output if G = 0 and if G = 1 (c) Work Problems 8.4 and 8.5.
8. Study your assigned design problem and prepare a design which meets specifica-tions. Note that only two-, three-, and four-input NAND gates (or NOR gates as specified) and inverters are available for this project; therefore, factoring some of the equations will be necessary. Try to make an economical design by using common terms; however, do not waste time trying to get an absolute minimum solution. When counting gates, count both NAND (or NOR) gates and inverters, but do not count the inverters needed for the input variables.
9. Check your design carefully before simulating it. Test it on paper by applying some input combinations of 0’s and 1’s and tracing the signals through to make sure that the outputs are correct. If you have a CAD program such as LogicAid available, enter the truth table for your design into the computer, derive the minimum two-level equations, and compare them with your solution.
10. In designing multi-level, multiple-output circuits of the type used in the design problems in this unit, it is very difficult and time-consuming to find a minimum solution. You are not expected to find the best possible solution to these prob-lems. All of these solutions involve some “tricks,” and it is unlikely that you could find them without trying a large number of different ways of factoring your equations. Therefore, if you already have an acceptable solution, do not waste time trying to find the minimum solution. Because integrated circuit gates are quite inexpensive, it is not good engineering practice to spend a large amount of time finding the absolute minimum solution unless a very large number of units of the same type are to be manufactured.
11. Obtain a Unit 8 supplement from your instructor and follow the instructions therein regarding simulating and testing your design.
C′ D′ C C A′ B A F B′ D′ G 0 1 0 0 1 0 D 1 3 5 7 6 4 2 229 Combinational Circuit Design and Simulation Using Gates 8.1 Review of Combinational Circuit Design The first step in the design of a combinational switching circuit is usually to set up a truth table which specifies the output(s) as a function of the input variables. For n input variables this table will have 2n rows. If a given combination of values for the input variables can never occur at the circuit inputs, the corresponding output values are don’t-cares. The next step is to derive simplified algebraic expressions for the output functions using Karnaugh maps, the Quine-McCluskey method, or a similar proce-dure. In some cases, particularly if the number of variables is large and the number of terms is small, it may be desirable to go directly from the problem statement to alge-braic equations, without writing down a truth table. The resulting equations can then be simplified algebraically. The simplified algebraic expressions are then manipulated into the proper form, depending on the type of gates to be used in realizing the circuit.
The number of levels in a gate circuit is equal to the maximum number of gates through which a signal must pass when going between the input and output termi-nals. The minimum sum of products (or product of sums) leads directly to a mini-mum two-level gate circuit. However, in some applications it is desirable to increase the number of levels by factoring (or multiplying out) because this may lead to a reduction in the number of gates or gate inputs.
When a circuit has two or more outputs, common terms in the output functions can often be used to reduce the total number of gates or gate inputs. If each function is minimized separately, this does not always lead to a minimum multiple-output circuit. For a two-level circuit, Karnaugh maps of the output functions can be used to find the common terms. All of the terms in the minimum multiple-output circuit will not necessarily be prime implicants of the individual functions. When designing circuits with three or more levels, looking for common terms on the Karnaugh maps may be of little value. In this case, the designer will often minimize the functions separately and, then, use ingenuity to factor the expressions in such a way to create common terms.
Minimum two-level AND-OR, NAND-NAND, OR-NAND, and NOR-OR circuits can be realized using the minimum sum of products as a starting point. Mini-mum two-level OR-AND, NOR-NOR, AND-NOR, and NAND-AND circuits can be realized using the minimum product of sums as a starting point. Design of multi-level, 230 Unit 8 multiple-output NAND-gate circuits is most easily accomplished by first designing a circuit of AND and OR gates. Usually, the best starting point is the minimum sum-of-products expressions for the output functions. These expressions are then factored in various ways until an economical circuit of the desired form can be found. If this circuit has an OR gate at each output and is arranged so that an AND- gate (or OR-gate) output is never connected to the same type of gate, a direct conversion to a NAND-gate circuit is possible. Conversion is accomplished by replacing all of the AND and OR gates with NAND gates and then inverting any literals which appear as inputs to the first, third, fifth, . . . levels (output gates are the first level).
If the AND-OR circuit has an AND-gate (or OR-gate) output connected to the same type of gate, then extra inverters must be added in the conversion process (see Section 7 .5, Circuit Conversion Using Alternative Gate Symbols).
Similarly, design of multi-level, multiple-output NOR-gate circuits is most easily accomplished by first designing a circuit of AND and OR gates. In this case the best starting point is usually the minimum sum-of-products expressions for the comple-ments of the output functions. After factoring these expressions to the desired form, they are then complemented to get expressions for the output functions, and the cor-responding circuit of AND and OR gates is drawn. If this circuit has an AND gate at each output, and an AND-gate (or OR-gate) output is never connected to the same type of gate, a direct conversion to a NOR-gate circuit is possible. Otherwise, extra inverters must be added in the conversion process.
8.2 Design of Circuits with Limited Gate Fan-In In practical logic design problems, the maximum number of inputs on each gate (or the fan-in) is limited. Depending on the type of gates used, this limit may be two, three, four, eight, or some other number. If a two-level realization of a circuit requires more gate inputs than allowed, factoring the logic expression to obtain a multi-level realization is necessary.
map of f : f′ = a′b′c′d + ab′cd + abc′ + a′bc + a′cd′ 1 1 0 1 00 01 11 10 0 1 0 1 1 0 1 0 0 00 cd ab 01 11 10 0 1 1 Realize f(a, b, c, d) = Σm(0, 3, 4, 5, 8, 9, 10, 14, 15) using three-input NOR gates.
Example Combinational Circuit Design and Simulation Using Gates 231 As can be seen from the preceding expression, a two-level realization requires two four-input gates and one five-input gate. The expression for f ′ is factored to reduce the maximum number of gate inputs to three and, then, it is complemented: f ′ = b′d(a′c′ + ac) + a′c(b + d′) + abc′ f = [b + d′ + (a + c)(a′ + c′)][a + c′ + b′d][a′ + b′ + c] The resulting NOR-gate circuit is shown in Figure 8-1.
FIGURE 8-1 © Cengage Learning 2014 a c a′ b d′ d′ b a′ c b′ f a c′ c′ FIGURE 8-2 © Cengage Learning 2014 f1 = Σ m(0, 2, 3, 4, 5) f2 = Σ m(0, 2, 3, 4, 7) f3 = Σ m(1, 2, 6, 7) 1 1 1 00 bc a 01 11 10 1 1 1 1 1 1 1 00 bc a 01 11 10 0 1 0 1 0 1 1 1 1 00 bc a 01 11 10 1 The techniques for designing two-level, multiple-output circuits given in Section 7 .6 are not very effective for designing multiple-output circuits with more than two levels. Even if the two-level expressions had common terms, most of these common terms would be lost when the expressions were factored. Therefore, when designing multiple-output circuits with more than two levels, it is usually best to minimize each function separately. The resulting two-level expressions must then be factored to increase the number of levels. This factoring should be done in such a way as to introduce common terms wherever possible.
Realize the functions given in Figure 8-2, using only two-input NAND gates and inverters. If we minimize each function separately, the result is f1 = b′c′ + ab′ + a′b f2 = b′c′ + bc + a′b f3 = a′b′c + ab + bc′ Example 232 Unit 8 Each function requires a three-input OR gate, so we will factor to reduce the num-ber of gate inputs: f1 = b′(a + c′) + a′b f2 = b(a′ + c) + b′c′ or f2 = (b′ + c)(b + c′) + a′b f3 = a′b′c + b(a + c′) The second expression for f2 has a term common to f1, so we will choose the second expression. We can eliminate the remaining three-input gate from f3 by noting that a′b′c = a′(b′c) = a′(b + c′)′ Figure 8-3(a) shows the resulting circuit, using common terms a′b and a + c′. Because each output gate is an OR, the conversion to NAND gates, as shown in Figure 8-3(b), is straightforward.
8.3 Gate Delays and Timing Diagrams When the input to a logic gate is changed, the output will not change instantaneously. The transistors or other switching elements within the gate take a finite time to react to a change in input, so that the change in the gate output is delayed with respect to the input change. Figure 8-4 shows possible input and output waveforms for an inverter. If the change in output is delayed by time, ε , with respect to the input, we say that this gate has a propagation delay of ε. In practice, the propagation delay for a 0 to 1 output change may be different than the delay for a 1 to 0 change. Propagation delays for integrated circuit gates may be as short as a few nanoseconds (1 nanosecond = 10−9 second), and in many cases these delays can be neglected. However, in the analysis of some types of sequential circuits, even short delays may be important.
Timing diagrams are frequently used in the analysis of sequential circuits. These diagrams show various signals in the circuit as a function of time. Several variables are usually plotted with the same time scale so that the times at which these vari-ables change with respect to each other can easily be observed.
FIGURE 8-3 Realization of Figure 8-2 a′ c b c′ b′ b′ a′ a′ b b f1 f2 f3 b′c c (b) a c′ b′ c b b′ a′ a′ b b f1 f2 f3 b′c c′ (a) © Cengage Learning 2014 Combinational Circuit Design and Simulation Using Gates 233 Figure 8-5 shows the timing diagram for a circuit with two gates. We will assume that each gate has a propagation delay of 20 ns (nanoseconds). This timing diagram indicates what happens when gate inputs B and C are held at constant values 1 and 0, respectively, and input A is changed to 1 at t = 40 ns and then changed back to 0 at t = 100 ns. The output of gate G1 changes 20 ns after A changes, and the output of gate G2 changes 20 ns after G1 changes.
Figure 8-6 shows a timing diagram for a circuit with an added delay element. The input X consists of two pulses, the first of which is 2 microseconds (2 × 10−6 second) wide and the second is 3 microseconds wide. The delay element has an output Y which is the same as the input except that it is delayed by 1 microsecond. That is, Y changes to a 1 value 1 microsecond after the rising edge of the X pulse and returns to 0 1 microsecond after the falling edge of the X pulse. The output (Z) of the AND gate should be 1 during the time interval in which both X and Y are 1. If we assume a small propagation delay in the AND gate (ε), then Z will be as shown in Figure 8-6.
FIGURE 8-4 Propagation Delay in an Inverter © Cengage Learning 2014 X′ X′ ε1 ε2 Time X X Time FIGURE 8-5 Timing Diagram for AND-NOR Circuit © Cengage Learning 2014 0 20 40 60 80 100 120 140 t(ns) G2 G2 G1 G1 A A B = 1 C = 0 20 ns 20 ns 20 ns 20 ns FIGURE 8-6 Timing Diagram for Circuit with Delay 1 1 1 0 1 2 3 4 5 6 7 8 9 10 0 0 0 Z Y X X Y Z Time (microseconds) Rising edge Falling edge 2 1 1 s 3 1 Delay μs μs ε μs μs μs © Cengage Learning 2014 234 Unit 8 8.4 Hazards in Combinational Logic When the input to a combinational circuit changes, unwanted switching transients may appear in the output. These transients occur when different paths from input to output have different propagation delays. If, in response to any single input change and for some combination of propagation delays, a circuit output may momentar-ily go to 0 when it should remain a constant 1, we say that the circuit has a static 1-hazard. Similarly, if the output may momentarily go to 1 when it should remain a 0, we say that the circuit has a static 0-hazard. If, when the output is supposed to change from 0 to 1 (or 1 to 0), the output may change three or more times, we say that the circuit has a dynamic hazard. Figure 8-7 shows possible outputs from a circuit with hazards. In each case the steady-state output of the circuit is correct, but a switching transient appears at the circuit output when the input is changed.
FIGURE 8-7 Types of Hazards © Cengage Learning 2014 0 1 1 1 1 1 0 0 0 (a) Static 1-hazard (c) Dynamic hazards 0 0 1 0 1 (b) Static 0-hazard Figure 8-8(a) illustrates a circuit with a static 1-hazard. If A = C = 1, then F = B + B′ = 1, so the F output should remain a constant 1 when B changes from 1 to 0. However, as shown in Figure 8-8(b), if each gate has a propagation delay of 10 ns, E will go to 0 before D goes to 1, resulting in a momentary 0 (a glitch caused by the 1-hazard) appearing at the output F. Note that right after B changes to 0, both the inverter input (B) and output (B′) are 0 until the propagation delay has elapsed. During this period, both terms in the equation for F are 0, so F momentarily goes to 0.
Note that hazards are properties of the circuit and are independent of the delays existing in the circuit. If the circuit is free of hazards, then for any combination of delays that might exist in the circuit and for any single input change, the output will not contain a transient. On the other hand, if a circuit contains a hazard, then there is some combination of delays and some input change for which the circuit output contains a transient. The combination of delays that produces the transient may or may not be likely to occur in an implementation of the circuit; in some cases it is very unlikely that such delays would occur.
Besides depending on the delays existing in a circuit, the occurrence of transients depends on how gates respond to input changes. In some cases, if multiple input changes to a gate occur within a short time period, a gate may not respond to the input changes. For example, in Figure 8-8 assume the inverter has a delay of 2 ns rather than 10 ns. Then the D and E changes reaching the output OR gate are 2 ns apart, in which case the OR gate may not generate the 0 glitch. A gate exhibiting Combinational Circuit Design and Simulation Using Gates 235 this behavior is said to have an inertial delay. Quite often the inertial delay value is assumed to be the same as the propagation delay of the gate; if this is the case, the circuit of Figure 8-8 will generate the 0 glitch only for inverter delays greater than 10 ns. In contrast, if a gate always responds to input changes (with a propagation delay), no matter how closely spaced the input changes may be, the gate is said to have an ideal or transport delay. If the OR gate in Figure 8-8 has an ideal delay, then the 0 glitch would be generated for any nonzero value of the inverter delay. (Inertial and transport delay models are discussed more in Unit 10.) Unless otherwise noted, the examples and problems in this unit assume that gates have an ideal delay.
Hazards can be detected using a Karnaugh map (Figure 8-8(a)). As seen on the map, no loop covers both minterms ABC and AB′C. So if A = C = 1 and B changes, both terms can momentarily go to 0, resulting in a glitch in F. We can detect hazards in a two-level AND-OR circuit, using the following procedure: 1. Write down the sum-of-products expression for the circuit.
2. Plot each term on the map and loop it.
3. If any two adjacent 1’s are not covered by the same loop, a 1-hazard exists for the transition between the two 1’s. For an n-variable map, this transition occurs when one variable changes and the other n −1 variables are held constant.
If we add a loop to the map of Figure 8-8(a) and, then, add the corresponding gate to the circuit (Figure 8-9), this eliminates the hazard. The term AC remains 1 while B is changing, so no glitch can appear in the output. Note that F is no longer a minimum sum of products. FIGURE 8-8 Detection of a 1-Hazard © Cengage Learning 2014 0 ns 10 ns 20 ns 30 ns (b) Timing chart (a) Circuit with a static 1-hazard 40 ns 50 ns 1-hazard 60 ns F E D B B A D E F C F =AB′+BC 0 1 0 1 1 0 1 0 1 0 00 BC A 01 11 10 236 Unit 8 Figure 8-10(a) shows a circuit with several 0-hazards. The product-of-sums repre-sentation for the circuit output is F = (A + C)(A′ + D′)(B′ + C′ + D) The Karnaugh map for this function (Figure 8-10(b)) shows four pairs of adjacent 0’s that are not covered by a common loop as indicated by the arrows. Each of these pairs corresponds to a 0-hazard. For example, when A = 0, B = 1, D = 0, and C changes from 0 to 1, a spike may appear at the Z output for some combination of gate delays. The timing diagram of Figure 8-10(c) illustrates this, assuming gate delays of 3 ns for each inverter and of 5 ns for each AND gate and each OR gate.
FIGURE 8-9 Circuit with Hazard Removed © Cengage Learning 2014 B A A F C F = AB′ + BC + AC 0 1 0 1 1 0 1 0 1 0 00 BC A 01 11 10 FIGURE 8-10 Detection of a Static 0-Hazard © Cengage Learning 2014 C D A W Y Z B X at 5 ns, 0→1 at 10 ns, 0→1 at 8 ns, 1→0 (a) Circuit with a static 0-hazard (b) Karnaugh map for circuit of (a) at 13 ns, 1→0 at 15 ns, 0→1 at 18 ns, 1→0 4 0 5 10 (c) Timing diagram illustrating 0-hazard of (a) 15 8 13 18 20 Z Y X W C 0 0 00 01 11 10 0 0 0 0 0 0 00 CD AB 01 11 10 0 0 1 2 3 Combinational Circuit Design and Simulation Using Gates 237 We can eliminate the 0-hazards by looping additional prime implicants that cover the adjacent 0’s that are not already covered by a common loop. This requires three additional loops as shown in Figure 8-11. The resulting equation is F = (A + C)(A′ + D′)(B′ + C′ + D)(C + D′)(A + B′ + D)(A′ + B′ + C′) and the resulting circuit requires seven gates in addition to the inverters.
FIGURE 8-11 Karnaugh Map Removing Hazards of Figure 8-10 © Cengage Learning 2014 0 0 00 01 11 10 0 0 0 0 0 0 00 CD AB 01 11 10 0 0 Hazards in circuits with more than two levels can be determined by deriving either a SOP or POS expression for the circuit that represents a two-level circuit containing the same hazards as the original circuit. The SOP or POS expression is derived in the normal manner except that the complementation laws are not used, i.e., xx′ = 0 and x + x′ = 1 are not used. Consequently, the resulting SOP (POS) expression may contain products (sums) of the form xx′α (x + x′ + β). (α is a product of literals or it may be null; β is a sum of literals or it may be empty.) The comple-mentation laws are not used because we are analyzing the circuit behavior resulting from an input change. As that input change propagates through the circuit, at a given point in time a line tending toward the value x may not have the value that is the complement of a line tending toward the value x′. In the SOP expression, a product of the form xx′α represents a pseudo gate that may temporarily have the output value 1 as x changes and if α = 1.
Given the SOP expression, the circuit is analyzed for static 1-hazards the same as for a two-level AND-OR circuit, i.e., the products are mapped on a Karnaugh map and if two 1’s are adjacent on the map and not included in one of the products, they correspond to a static 1-hazard. The circuit can have a static 0-hazard or a dynamic hazard only if the SOP expression contains a term of the form xx′α. A static 0-hazard exists if there are two adjacent 0’s on the Karnaugh map for which α = 1 and the two input combinations differ just in the value of x. A dynamic hazard exists if there is a term of the form xx′α and two conditions are satisfied: (1) There are adjacent input combinations on the Karnaugh map differing in the value of x, with α = 1 and with opposite function values, and (2) for these input combinations the change in x propagates over at least three paths through the circuit.
238 Unit 8 As an example consider the circuit of Figure 7-7 . The expression for the circuit output is f = (c′ + ad′ + bd′)(c + a′d + bd) = cc′ + acd′ + bcd′ + a′c′d + aa′dd′ + a′bdd′ + bc′d + abdd′ + bdd′ = cc′ + acd′ + bcd′ + a′c′d + aa′dd′ + bc′d + bdd′ The Karnaugh map for this function is shown as the circled 1’s in Figure 7-3. It is derived in the normal way ignoring the product terms containing both a variable and its complement. The circuit does not contain any static 1-hazards because each pair of adjacent 1’s are covered by one of the product terms. Potentially, the terms cc′ and bdd′ may cause either static 0- or dynamic hazards or both; the first for c changing and the second for d changing. (The term aa′dd′ cannot cause either hazard because, for example, if a changes the dd′ part of the product forces it to 0.) With a = 0, b = 0, and d = 0 and c changing, the circuit output is 0 before and after the change, and because the cc′ term can cause the output to temporarily become 1, this transition is a static 0-hazard. Similarly, a change in c, with a = 1, b = 0, and d = 1, is a static 0-hazard. The cc′ term cannot cause a dynamic hazard because there are only two physical paths from input c to the circuit output.
The term bdd′ can cause a static 0- or dynamic hazard only if b = 1. From the Karnaugh map, it is seen that, with b = 1 and d changing, the circuit output changes for any combination of a and c, so the only possibility is that of a dynamic hazard. There are four physical paths from d to the circuit output, so a dynamic hazard exists if a d change can propagate over at least three of those paths. However, this cannot happen because, with c = 0, propagation over the upper two paths is blocked at the upper OR gate because c′ = 1 forces the OR gate output to be 1, and with c = 1 propagation over the lower two paths is blocked at the lower OR gate. The circuit does not contain a dynamic hazard.
Another approach to finding the hazards is as follows: If we factor the original expression for the circuit output (without using the complementation laws), we get f = (c′ + a + b)(c′ + d′)(c + a′ + b)(c + d) Plotting the 0’s of f from this expression on a Karnaugh map reveals that there are 0-hazards when a = b = d = 0 and c changes, and also when b = 0, a = d = 1, and c changes. An expression of the form x + x′ does not appear in any sum term of f, and this indicates that there are no 1-hazards or dynamic hazards.
As another example of finding static and dynamic hazards from a SOP expression, consider the circuit of Figure 8-12(a). The SOP expression for f is f = (A′C′ + B′C) (C + D) = A′CC′ + A′C′D + B′C The Karnaugh map for f in Figure 8-12(b) shows that f = 1 for the input com-binations (A, B, C, D) = (0, 0, 0, 1) and (0, 0, 1, 1) and neither product of f covers these two minterms; hence, these two input combinations imply a static 1-hazard for C changing. The product A′CC′ in f indicates the possibility of a static 0-hazard and a dynamic hazard for A = 0 and C changing. The Karnaugh map shows that when f = 0, Combinational Circuit Design and Simulation Using Gates 239 the two input combinations (0, 1, 0, 0) and (0, 1, 1, 0) meet these conditions and, hence, they imply a static 0-hazard. The Karnaugh map shows two pairs of input combina-tions with f changing for A = 0 and C changing—namely, (0, 0, 0, 0), (0, 0, 1, 0), and (0, 1, 0, 1), (0, 1, 1, 1). In order for these to be dynamic hazards, the C change must propagate over three or more paths to the output. The circuit shows that propagation over the three paths requires B = 0 and D = 0 as well as A = 0; thus, a dynamic hazard only occurs for (0, 0, 0, 0) and (0, 0, 1, 0). For (0, 1, 0, 1) and (0, 1, 1, 1), the C change only propagates over one path, and f can only change once.
To design a circuit which is free of static and dynamic hazards, the following pro-cedure may be used: 1. Find a sum-of-products expression (F t) for the output in which every pair of adjacent 1’s is covered by a 1-term. (The sum of all prime implicants will always satisfy this condition.) A two-level AND-OR circuit based on this Ft will be free of 1-, 0-, and dynamic hazards.
2. If a different form of the circuit is desired, manipulate Ft to the desired form by simple factoring, DeMorgan’s laws, etc. Treat each xi and x′ i as independent vari-ables to prevent introduction of hazards.
Alternatively, you can start with a product-of-sums expression in which every pair of adjacent 0’s is covered by a 0-term, and follow the dual procedure to design a hazard-free two-level OR-AND circuit.
It should be emphasized that the discussion of hazards and the possibility of resulting glitches in this section has assumed that only a single input can change at a time and that no other input will change until the circuit has stabilized. If more than one input can change at one time, then nearly all circuits will contain hazards, and they cannot be eliminated by modifying the circuit implementation. The circuit cor-responding to the Karnaugh map of Figure 8-11 illustrates this. Consider the input change (A, B, C, D) = (0, 1, 0, 1) to (0, 1, 1, 0) with both C and D changing. The out-put is 0 before the change and will be 0 after the circuit has stabilized; however, if the C change propagates through the circuit before the D change, then the circuit will output a transient 1. Effectively, the input combination to the circuit can temporarily become (A, B, C, D) = (0, 1, 1, 1), and the circuit output will temporarily become 1 no matter how it is implemented.
FIGURE 8-12 Hazard Example © Cengage Learning 2014 1 1 1 0 0 0 0 0 0 0 0 0 0 1 (b) 10 11 01 00 00 A B C D f 01 11 10 1 1 D B C f A (a) 240 Unit 8 Glitches are of most importance in asynchronous sequential circuits. The latches and flip-flops discussed in Unit 11 are the most important examples of asynchronous sequential circuits. Although more than one input can change at the same time for some of these circuits, restrictions are placed on the changes so that it is necessary to analyze the circuits for hazards only when a single input changes. Consequently, the discussion in this section is relevant to this important class of circuits.
8.5 Simulation and Testing of Logic Circuits An important part of the logic design process is verifying that the final design is correct and debugging the design if necessary. Logic circuits may be tested either by actually building them or by simulating them on a computer. Simulation is gener-ally easier, faster, and more economical. As logic circuits become more and more complex, it is very important to simulate a design before actually building it. This is particularly true when the design is built in integrated circuit form, because fabri-cating an integrated circuit may take a long time and correcting errors may be very expensive. Simulation is done for several reasons, including (1) verification that the design is logically correct, (2) verification that the timing of the logic signals is cor-rect, and (3) simulation of faulty components in the circuit as an aid to finding tests for the circuit.
To use a computer program for simulating logic circuits, you must first specify the circuit components and connections; then, specify the circuit inputs; and, finally, observe the circuit outputs. The circuit description may be input into a simulator in the form of a list of connections between the gates and other logic elements in the circuit, or the description may be in the form of a logic diagram drawn on a computer screen. Most modern logic simulators use the latter approach. A typical simulator which runs on a personal computer uses switches or input boxes to specify the inputs and probes to read the logic outputs. Alternatively, the inputs and outputs may be specified as sequences of 0’s and 1’s or in the form of timing diagrams.
A simple simulator for combinational logic works as follows: 1. The circuit inputs are applied to the first set of gates in the circuit, and the out-puts of those gates are calculated.
2. The outputs of the gates which changed in the previous step are fed into the next level of gate inputs. If the input to any gate has changed, then the output of that gate is calculated.
3. Step 2 is repeated until no more changes in gate inputs occur. The circuit is then in a steady-state condition, and the outputs may be read.
4. Steps 1 through 3 are repeated every time a circuit input changes.
The two logic values, 0 and 1, are not sufficient for simulating logic circuits. At times, the value of a gate input or output may be unknown, and we will represent this unknown value by X. At other times we may have no logic signal at an input, as in the case of an open circuit when an input is not connected to any output. We use Combinational Circuit Design and Simulation Using Gates 241 the logic value Z to represent an open circuit, or high impedance (hi-Z) connection. The discussion that follows assumes we are using a four-valued logic simulator with logic values 0, 1, X (unknown), and Z (hi-Z).
Figure 8-13(a) shows a typical simulation screen on a personal computer. The switches are set to 0 or 1 for each input. The probes indicate the value of each gate output. In Figure 8-13(b), one gate has no connection to one of its inputs. Because that gate has a 1 input and a hi-Z input, we do not know what the hardware will do, and the gate output is unknown. This is indicated by an X in the probe.
1 1 1 0 0 (a) Simulation screen showing switches 0 1 0 1 1 1 1 0 1 0 Probe X 1 1 0 0 (b) Simulation screen with missing gate input 0 1 0 1 1 Z X 0 FIGURE 8-13 TABLE 8-1 AND and OR Functions for Four-Valued Simulation · 0 1 X Z 0 0 0 0 0 1 0 1 X X X 0 X X X Z 0 X X X + 0 1 X Z 0 0 1 X X 1 1 1 1 1 X X 1 X X Z X 1 X X Table 8-1 shows AND and OR functions for four-valued logic simulation. These functions are defined in a manner similar to the way real gates work. For an AND gate, if one of the inputs is 0, the output is always 0 regardless of the other input. If one input is 1 and the other input is X (we do not know what the other input is), then the output is X (we do not know what the output is). If one input is 1 and the other input is Z (it has no logic signal), then the output is X (we do not know what the hardware will do). For an OR gate, if one of the inputs is 1, the output is 1 regard-less of the other input. If one input is 0 and the other input is X or Z, the output is unknown. For gates with more than two inputs, the operations may be applied several times.
A combinational logic circuit with a small number of inputs may easily be tested with a simulator or in lab by checking the circuit outputs for all possible combina-tions of the input values. When the number of inputs is large, it is usually possible to find a relatively small set of input test patterns which will test for all possible faulty gates in the circuit.1 1Methods for test pattern generation are described in Alexander Miczo, Digital Logic Testing and Simula-tion, 2nd ed. (John Wiley & Sons, 2003).
© Cengage Learning 2014 © Cengage Learning 2014 242 Unit 8 If a circuit output is wrong for some set of input values, this may be due to several possible causes: 1. Incorrect design 2. Gates connected wrong 3. Wrong input signals to the circuit If the circuit is built in lab, other possible causes include 4. Defective gates 5. Defective connecting wires Fortunately, if the output of a combinational logic circuit is wrong, it is very easy to locate the problem systematically by starting at the output and working back through the circuit until the trouble is located. For example, if the output gate has the wrong output and its inputs are correct, this indicates that the gate is defective. On the other hand, if one of the inputs is wrong, then either the gate is connected wrong, the gate driving this input has the wrong output, or the input connection is defective.
The function F = AB(C′D + CD′) + A′B′(C + D) is realized by the circuit of Figure 8-14: Example FIGURE 8-14 Logic Circuit with Incorrect Output © Cengage Learning 2014 C′ D C A F B A′ B′ D C D′ 1 0 1 1 1 0 1 0 5 6 2 3 7 4 A student builds the circuit in a lab and finds that when A = B = C = D = 1, the output F has the wrong value, and that the gate outputs are as shown in Figure 8-14. The reason for the incorrect value of F can be determined as follows: 1. The output of gate 7 (F ) is wrong, but this wrong output is consistent with the inputs to gate 7 , that is, 1 + 0 = 1. Therefore, one of the inputs to gate 7 must be wrong.
2. In order for gate 7 to have the correct output (F = 0), both inputs must be 0. Therefore, the output of gate 5 is wrong. However, the output of gate 5 is con-sistent with its inputs because 1 · 1 · 1 = 1. Therefore, one of the inputs to gate 5 must be wrong.
3. Either the output of gate 3 is wrong, or the A or B input to gate 5 is wrong. Because C′D + CD′ = 0, the output of gate 3 is wrong.
4. The output of gate 3 is not consistent with the outputs of gates 1 and 2 because 0 + 0 ≠1. Therefore, either one of the inputs to gate 3 is connected wrong, gate 3 is defective, or one of the input connections to gate 3 is defective.
This example illustrates how to troubleshoot a logic circuit by starting at the output gate and working back until the wrong connection or defective gate is located.
Combinational Circuit Design and Simulation Using Gates 243 Problems 8.1 Complete the timing diagram for the given circuit. Assume that both gates have a propagation delay of 5 ns.
8.2 Consider the following logic function.
F(A, B, C, D) = Σ m(0, 4, 5, 10, 11, 13, 14, 15) (a) Find two different minimum circuits which implement F using AND and OR gates. Identify two hazards in each circuit.
(b) Find an AND-OR circuit for F which has no hazards.
(c) Find an OR-AND circuit for F which has no hazards.
8.3 For the following circuit: (a) Assume that the inverters have a delay of 1 ns and the other gates have a delay of 2 ns. Initially A = 0 and B = C = D = 1, and C changes to 0 at time = 2 ns. Draw a timing diagram and identify the transient that occurs.
(b) Modify the circuit to eliminate the hazard.
8.4 Using four-valued logic, find A, B, C, D, E, F, G, and H.
Z V Y X W W X Y V Z 0 5 10 15 20 25 30 35 40 t(ns) B E F C A D G 1 (no connection) A C D E F G H B 244 Unit 8 8.5 The circuit below was designed to implement the logic equation F = AB′D + BC′D′ + BCD, but it is not working properly. The input wires to gates 1, 2, and 3 are so tightly packed, it would take you a while to trace them all back to see whether the inputs are correct. It would be nice to only have to trace whichever one is incor-rectly wired. When A = B = 0 and C = D = 1, the inputs and outputs of gate 4 are as shown. Is gate 4 working properly? If so, which of the other gates either is con-nected incorrectly or is malfunctioning?
1 1 1 0 F A B C D 1 2 4 3 Mess of Wires 8.7 A two-level, NOR-NOR circuit implements the function f(a, b, c, d) = (a + d′)(b′ + c + d)(a′ + c′ + d′)(b′ + c′ + d).
(a) Find all hazards in the circuit.
(b) Redesign the circuit as a two-level, NOR-NOR circuit free of all hazards and using a minimum number of gates.
8.8 F(A, B, C, D) = Σ m(0, 2, 3, 5, 6, 7, 8, 9, 13, 15) (a) Find three different minimum AND-OR circuits that implement F. Identify two hazards in each circuit. Then find an AND-OR circuit for F that has no hazards.
(b) There are two minimum OR-AND circuits for F ; each has one hazard. Identify the hazard in each circuit, and then find an OR-AND circuit for F that has no hazards.
A D C B E F G H 8.6 (a) Assume the inverters have a delay of 1 ns and the other gates have a delay of 2 ns. Initially A = B = C = 0 and D = 1; C changes to 1 at time 2 ns. Draw a timing dia-gram showing the glitch corresponding to the hazard.
(b) Modify the circuit so that it is hazard free. (Leave the circuit as a two-level, OR- AND circuit.) Combinational Circuit Design and Simulation Using Gates 245 8.9 Consider the following three-level NOR circuit: (a) Find all hazards in this circuit.
(b) Redesign the circuit as a three-level NOR circuit that is free of all hazards.
A B C D f Z V Y X W W X Y V Z 0 5 10 15 20 25 30 35 40 t(ns) W X Y V Z 10 ns 5 ns 15 V Z 0 5 10 20 25 30 35 40 t (ns) Y X W 45 50 55 8.10 Draw the timing diagram for V and Z for the circuit. Assume that the AND gate has a delay of 10 ns and the OR gate has a delay of 5 ns.
8.11 Consider the three-level circuit corresponding to the expression f(A, B, C, D) = (A + B)(B′C′ + BD′).
(a) Find all hazards in this circuit.
(b) Redesign the circuit as a three-level NOR circuit that is free of all hazards.
8.12 Complete the timing diagram for the given circuit. Assume that both gates have a propagation delay of 5 ns.
246 Unit 8 8.13 Implement the logic function from Figure 8.10(b) as a minimum sum of products. Find the static hazards and tell what minterms they are between. Implement the same logic function as a sum of products without any hazards.
8.14 Using four-valued logic, find A, B, C, D, E, F, G, and H.
1 0 F 0 A B C 0 Mess of Wires 1 2 4 3 (no connection) (no connection) 0 A C D E F H G B 8.15 The following circuit was designed to implement the logic equation F = (A + B′ + C′) (A′ + B + C′)(A′ + B′ + C), but it is not working properly. The input wires to gates 1, 2, and 3 are so tightly packed, it would take you a while to trace them all back to see whether the inputs are correct. It would be nice to only have to trace whichever one is incorrectly wired. When A = B = C = 1, the inputs and outputs of gate 4 are as shown. Is gate 4 working properly? If so, which of the other gates either is con-nected incorrectly or is malfunctioning?
8.16 Consider the following logic function.
F(A, B, C, D) = Σ m(0, 2, 5, 6, 7, 8, 9, 12, 13, 15) (a) Find two different minimum AND-OR circuits which implement F. Identify two hazards in each circuit. Then find an AND-OR circuit for F that has no hazards.
(b) The minimum OR-AND circuit for F has one hazard. Identify it, and then find an OR-AND circuit for F that has no hazards.
Design Problems Seven-Segment Indicator Several of the problems involve the design of a circuit to drive a seven-segment indi-cator (see Figure 8-15). The seven-segment indicator can be used to display any one of the decimal digits 0 through 9. For example, “1” is displayed by lighting segments Combinational Circuit Design and Simulation Using Gates 247 2 and 3, “2” by lighting segments 1, 2, 7 , 5, and 4, and “8” by lighting all seven seg-ments. A segment is lighted when a logic 1 is applied to the corresponding input on the display module.
8.A Design an 8-4-2-1 BCD code converter to drive a seven-segment indicator. The four inputs to the converter circuit (A, B, C, and D in Figure 8-15) represent an 8-4-2-1 binary-coded-decimal digit. Assume that only input combinations representing the digits 0 through 9 can occur as inputs, so that the combinations 1010 through 1111 are don’t-cares. Design your circuit using only two-, three-, and four-input NAND gates and inverters. Try to minimize the number of gates required. The variables A, B, C, and D will be available from toggle switches.
Use (not ) for 6.
Use (not ) for 9.
Any solution that uses 18 or fewer gates and inverters (not counting the four invert-ers for the inputs) is acceptable.
8.B Design an excess-3 code converter to drive a seven-segment indicator. The four inputs to the converter circuit (A, B, C, and D in Figure 8-15) represent an excess-3 coded decimal digit. Assume that only input combinations representing the dig-its 0 through 9 can occur as inputs, so that the six unused combinations are don’t-cares. Design your circuit using only two-, three-, and four-input NAND gates and inverters. Try to minimize the number of gates and inverters required. The variables A, B, C, and D will be available from toggle switches.
Use (not ) for 6.
Use (not ) for 9.
Any solution with 16 or fewer gates and inverters (not counting the four inverters for the inputs) is acceptable.
8.C Design a circuit which will yield the product of two binary numbers, n2 and m2, where 002 ≤n2 ≤ 112 and 0002 ≤m2 ≤ 1012. For example, if n2 = 102 and m2 = 0012, then the product is n2 × m2 = 102 × 0012 = 00102. Let the variables A and B repre-sent the first and second digits of n2, respectively (i.e., in this example A = 1 and B = 0). Let the variables C, D, and E represent the first, second, and third digits of FIGURE 8-15 Circuit Driving Seven-Segment Module © Cengage Learning 2014 A B C D Circuit to be Designed 1 Seven-Segment Indicator 2 3 4 5 6 7 X1 X2 X3 X4 X5 X6 X7 1 2 3 4 5 6 7 Inputs From Toggle Switches 248 Unit 8 m2, respectively (in this example C = 0, D = 0, and E = 1). Also let the variables W, X, Y, and Z represent the first, second, third, and fourth digits of the product. (In this example W = 0, X = 0, Y = 1, and Z = 0.) Assume that m2 > 1012 never occurs as a circuit input.
C A B W X Y Z D E Circuit to be Designed Product of n2 × m2 m2 Input n2 Input Design the circuit using only two-, three-, and four-input NOR gates and invert-ers. Try to minimize the total number of gates and inverters required. The variables A, B, C, D, and E will be available from toggle switches. Any solution that uses 15 or fewer gates and inverters (not counting the five inverters for the inputs) is acceptable.
8.D Work Design Problem 8.C using two-, three-, and four-input NAND gates and inverters instead of NOR gates and inverters. Any solution that uses 14 gates and inverters or less (not counting the five inverters for the inputs) is acceptable.
8.E Design a circuit which multiplies two 2-bit binary numbers and displays the answer in decimal on a seven-segment indicator. In Figure 8-15, A and B are two bits of a binary number N1, and C and D are two bits of a binary number N2. The prod-uct (N1 × N2) is to be displayed in decimal by lighting appropriate segments of the seven-segment indicator. For example, if A = 1, B = 0, C = 1, and D = 0, the num-ber “4” is displayed by lighting segments 2, 3, 6, and 7 .
Use (not ) for 6.
Use (not ) for 9.
Design your circuit using only two-, three-, and four-input NAND gates and invert-ers. Try to minimize the number of gates required. The variables A, B, C, and D will be available from toggle switches. Any solution that uses 18 or fewer gates and inverters (not counting the four inverters for the inputs) is acceptable.
8.F Design a Gray code converter to drive a seven-segment indicator. The four inputs to the converter circuit (A, B, C, and D in Figure 8-15) represent a decimal digit coded using the Gray code of Table 1-2. Assume that only input combinations representing the digits 0 through 9 can occur as inputs, so that the six unused combinations are don’t-care terms. Design your circuit using only two-, three-, and four-input NAND gates and inverters. Try to minimize the numbers of gates and inverters required. The variables A, B, C, and D will be available from toggle switches.
Use (not ) for 6.
Use (not ) for 9.
Any solution with 20 or fewer gates and inverters (not counting the four inverters for the inputs) is acceptable.
Combinational Circuit Design and Simulation Using Gates 249 8.G Design a circuit that will add either 1 or 2 to a 4-bit binary number N. Let the inputs N3, N2, N1, N0 represent N. The input K is a control signal. The circuit should have outputs M3, M2, M1, M0, which represent the 4-bit binary number M. When K = 0, M = N + 1. When K = 1, M = N + 2. Assume that the inputs for which M > 11112 will never occur.
Design the circuit using only two-, three-, and four-input NAND gates and inverters. Try to minimize the total number of gates and inverters required. The input vari-ables K, N3, N2, N1, and N0 will be available from toggle switches. Any solution that uses 13 or fewer gates and inverters (not counting the five inverters for the inputs) is acceptable.
8.H Work Problem 8.A, except use 4-2-1-8 code instead of 8-4-2-1 code. For example, in 4-2-1-8 code, 9 is represented by 0011. Also change the representations of digits 6 and 9 to the opposite form given in Problem 8.A. Any solution with 20 or fewer gates and inverters (not counting the four inverters for the inputs) is acceptable.
8.I Work Problem 8.B, except use excess-2 code instead of excess-3 code. (In excess- 2 code, 0 is represented by 0010, 1 by 0011, 2 by 0100, etc.). Any solution with 17 or fewer gates and inverters (not counting the four inverters for the inputs) is acceptable.
8.J Design a circuit which will multiply a 3-bit binary number CDE by 2, 3, or 5, depend-ing on the value of a 2-bit code AB (00, 01, or 10), to produce a 4-bit result WXYZ. If the result has a value greater than or equal to 15, WXYZ should be 1111 to indicate an overflow. Assume that the code AB = 11 will never occur. Design your circuit using only two-, three-, and four-input NOR gates and inverters. Try to minimize the number of gates required. The inputs A, B, C, D, and E will be available from toggle switches. Any solution which uses 19 or fewer gates and inverters (not counting the five inverters for the inputs) is acceptable.
8.K Design a circuit which will divide a 5-bit binary number by 3 to produce a 4-bit binary quotient. Assume that the input number is in the range 0 through 27 and that numbers in the range 28 through 31 will never occur as inputs. Design your circuit using only two-, three-, and four-input NAND gates and inverters. Try to minimize the number of gates required. The inputs A, B, C, D, and E will be available from toggle switches. Any solution which uses 22 or fewer gates and inverters (not count-ing the five inverters for the inputs) is acceptable.
8.L Design an excess-3 code converter to drive a seven-segment indicator. The four inputs (A, B, C, D) to the converter circuit represent an excess-3 digit. Input combi-nations representing the numbers 0 through 9 should be displayed as decimal digits. The input combinations 0000, 0001, and 0010 should be interpreted as an error, and an “E” should be displayed. Assume that the input combinations 1101, 1110, and 1111 will never occur. Design your circuit using only two-, three-, and four-input NOR gates and inverters. Any solution with 18 or fewer gates and inverters (not counting the four inverters for the inputs) is acceptable.
250 Unit 8 Use (not ) for 6.
Use (not ) for 9.
8.M Design a circuit which displays the letters A through J on a seven-segment indicator. The circuit has four inputs W, X, Y, Z which represent the last 4 bits of the ASCII code for the letter to be displayed. For example, if WXYZ = 0001, “A” will be dis-played. The letters should be displayed in the following form: Design your circuit using only two-, three-, and four-input NOR gates and inverters. Any solution with 22 or fewer gates and inverters (not counting the four inverters for the inputs) is acceptable.
8.N A simple security system for two doors consists of a card reader and a keypad.
To Door 1 To Door 2 To Alarm Logic Circuit Keypad Card Reader C A B D E X Y Z A person may open a particular door if he or she has a card containing the corre-sponding code and enters an authorized keypad code for that card. The outputs from the card reader are as follows: To unlock a door, a person must hold down the proper keys on the keypad and, then, insert the card in the reader. The authorized keypad codes for door 1 are 101 and 110, and the authorized keypad codes for door 2 are 101 and 011. If the card has an invalid code or if the wrong keypad code is entered, the alarm will ring when the card is inserted. If the correct keypad code is entered, the corresponding door will be unlocked when the card is inserted.
Design the logic circuit for this simple security system. Your circuit’s inputs will consist of a card code AB, and a keypad code CDE. The circuit will have three outputs XYZ (if X or Y = 1, door 1 or 2 will be opened; if Z = 1, the alarm will sound). Design your circuit using only two-, three-, and four-input NOR gates and inverters. Any solution A B No card inserted 0 0 Valid code for door 1 0 1 Valid code for door 2 1 1 Invalid card code 1 0 Combinational Circuit Design and Simulation Using Gates 251 with 19 or fewer gates and inverters (not counting the five inverters for the inputs) is acceptable. Use toggle switches for inputs A, B, C, D, and E when you test your circuit.
8.O Work Design Problem 8.A using two-, three-, and four-input NOR gates and invert-ers instead of NAND gates and inverters. Any solution that uses 19 gates and invert-ers or fewer (not counting the four inverters for the inputs) is acceptable.
8.P Work Design Problem 8.F using two-, three-, and four-input NOR gates and inverters instead of NAND gates and inverters. Any solution that uses 21 gates and inverters or fewer (not counting the four inverters for the inputs) is acceptable.
8.Q Work Design Problem 8.H using two-, three-, and four-input NOR gates and inverters instead of NAND gates and inverters. Any solution that uses 17 gates and inverters or fewer (not counting the four inverters for the inputs) is acceptable.
8.R Work Design Problem 8.I using two-, three-, and four-input NOR gates and inverters instead of NAND gates and inverters. Any solution that uses 16 gates and inverters or fewer (not counting the four inverters for the inputs) is acceptable.
8.S Design a “disk spinning” animation circuit for a CD player. The input to the circuit will be a 3-bit binary number A1A2A3 provided by another circuit. It will count from 0 to 7 in binary, and then it will repeat. (You will learn to design such counters in Unit 12.) The animation will appear on the top four lights of the LED display of Figure 8-15, i.e., on X1, X2, X7, and X6, going clockwise. The animation should consist of a blank spot on a disk spinning around once, beginning with X1. Then, the entire disk should blink on and off twice. The pattern is shown.
Design your circuit using only two-, three-, and four-input NOR gates and inverters. Try to minimize the number of gates required. Any solution which uses 11 or fewer gates (not counting the four inverters for the inputs) is acceptable.
252 Multiplexers, Decoders, and Programmable Logic Devices U N I T 9 Objectives 1. Explain the function of a multiplexer. Implement a multiplexer using gates.
2. Explain the operation of three-state buffers. Determine the resulting output when three-state buffer outputs are connected together. Use three-state buffers to multiplex signals onto a bus.
3. Explain the operation of a decoder and encoder. Use a decoder with added gates to implement a set of logic functions. Implement a decoder or priority encoder using gates.
4. Explain the operation of a read-only memory (ROM). Use a ROM to imple-ment a set of logic functions.
5. Explain the operation of a programmable logic array (PLA). Use a PLA to implement a set of logic functions. Given a PLA table or an internal connection diagram for a PLA, determine the logic functions realized.
6. Explain the operation of a programmable array logic device (PAL). Determine the programming pattern required to realize a set of logic functions with a PAL.
7. Explain the operation of a complex programmable logic device (CPLD) and a field-programmable gate array (FPGA).
8. Use Shannon’s expansion theorem to decompose a switching function.
Multiplexers, Decoders, and Programmable Logic Devices 253 Study Guide 1. Read Section 9.1, Introduction.
2. Study Section 9.2, Multiplexers.
(a) Draw a logic circuit for a 2-to-1 multiplexer (MUX) using gates.
(b) Write the equation for a 4-to-1 MUX with control inputs A and C.
Z = _______ (c) By tracing signals on Figure 9-3, determine what will happen to Z if A = 1, B = 0 and C changes from 0 to 1.
(d) Use three 2-to-1 MUXes to make a 4-to-1 MUX with control inputs A and B. Draw the circuit. (Hint: One MUX should have I0 and I1 inputs, and another should have I2 and I3 inputs.) (e) Observe that if A = 0, A ⊕ B = B, and that if A = 1, A ⊕ B = B′. Using this observation, construct an exclusive-OR gate using a 2-to-1 multiplexer and one inverter.
(f ) Work Problems 9.1 and 9.2.
(g) This section introduces bus notation. The bus symbol A 4 represents a group of four wires: A3 __ A2 __ A1 __ A0 __ 254 Unit 9 Draw the bus symbol for B2__ B1__ B0__ (h) Represent the circuit of Figure 4-3 by one 4-bit full adder with two bus inputs, one bus output, and terminals for carry input C0 and output C4. Note that the carries C3, C2, and C1 will not appear on your circuit diagram because they are signals internal to the 4-bit adder.
3. Study Section 9.3, Three-State Buffers.
(a) Determine the output of each three-state buffer: (b) Determine the inputs for each three-state buffer (use X if an input is a don’t-care).
(c) Determine the output for each circuit. Use X to represent an unknown output.
(d) The symbol C A B 2 2 represents 2 three-state buffers with a common control input: 0 Z 1 1 1 1 0 0 1 1 1 0 1 0 1 0 0 1 0 0 1 1 0 1 1 0 0 1 1 Multiplexers, Decoders, and Programmable Logic Devices 255 Using bus notation, draw an equivalent circuit for: (e) For the following circuit, determine the 4-bit output (P) if M = 0. __ Repeat for M = 1. __ (f ) Specify the AND-gate inputs so that the given circuit is equivalent to the 4-to-1 MUX in Figure 9-2. (Z in the following figure represents an output terminal, not high impedance.) 4 4 4 4 P 0101 1100 M I0 Z I1 I2 I3 C A1 B1 B0 A0 G E2 F2 F1 E1 F0 E0 256 Unit 9 (g) Work Problem 9.3.
4. Study Section 9.4, Decoders and Encoders.
(a) The 7442 4-to-10 line decoder (Figure 9-18) can be used as a 3-to-8 line decoder. To do this, which three lines should be used as inputs?
___ The remaining input line should be set equal to _____.
(b) Complete the following table for a 4-to-2 priority encoder: What will a,b, and c be if y0 y1 y2 y3 is 0101?
(c) Work Problem 9.4, 9.5, and 9.6.
5. Study Section 9.5, Read-Only Memories.
(a) The following diagram shows the pattern of 0’s and 1’s stored in a ROM with eight words and four bits per word. What will be the values of F1, F2, F3, and F4 if A = 0 and B = C = 1?
Give the minterm expansions for F1 and F2: F1 = F2 = (b) When asked to specify the size of a ROM, give the number of words and the number of bits per word.
What size ROM is required to realize four functions of 5 variables?
What size ROM is required to realize eight functions of 10 variables?
y0 y1 y2 y3 a b c 0 1 0 1 1 1 0 1 0 0 0 1 Decoder A B C 1 0 1 1 0 1 0 1 0 0 0 1 0 1 0 0 0 1 0 1 F1 F2 F3 F4 Multiplexers, Decoders, and Programmable Logic Devices 257 (c) When specifying the size of a ROM, assume that you are specifying a stand-ard size ROM with 2n words. What size ROM is required to convert 8-4-2-1 BCD code to 2-out-of-5 code? (See Table 1-2, page 22.) What size ROM would be required to realize the decoder given in Figure 9-18?
(d) Draw an internal connection diagram for a ROM which would perform the same function as the circuit of Figure 7-22. (Indicate the presence of switch-ing elements by dots at the intersection of the word lines and output lines.) (e) Explain the difference between a mask-programmable ROM and an EEP-ROM. Which would you use for a new design which had not yet been debugged?
(f ) Work Problem 9.7 .
6. Study Section 9.6, Programmable Logic Devices.
(a) When you are asked to specify the size of a PLA, give the number of inputs, the number of product terms, and the number of outputs.
What size PLA would be required to realize Equations (7-24) if no simpli-fication of the minterm expansions were performed?
(b) If the realization of Equations (7-24) shown in Figure 7-22 were converted to a PLA realization, what size PLA would be required?
(c) Specify the contents of the PLA of question (b) in tabular form. Your table should have four rows. (You will only need seven 1’s on the right side of your table. If you get eight 1’s, you are probably doing more work than is necessary.) (d) Draw an internal connection diagram for the PLA of (b). (Use X’s to indi-cate the presence of switching elements in the AND and OR arrays.) 258 Unit 9 (e) Given the following PLA table, plot maps for Z1,Z2, and Z3.
(The Z1 map should have six 1’s, Z2 should have five, and Z3 should have four.) (f ) For a truth table, any combination of input values will select exactly one row. Is this statement true for a PLA table?
For any combination of input values, the output values from a PLA can be determined by inspection of the PLA table. Consider Table 9-1, which represents a PLA with three inputs and four outputs. If the inputs are ABC = 110, which three rows in the table are selected?
In a given output column, what is the output if some of the selected rows are 1’s and some are 0’s? (Remember that the output bits for the selected rows are ORed together.) When ABC = 110, what are the values of F0F1F2F3 at the PLA output?
When ABC = 010, which rows are selected and what are the values of F0F1F2F3 at the PLA output?
(g) Which interconnection points in Figure 9-32(a) must be set in order to real-ize the function shown in Figure 9-32(b)?
(h) What size of PAL could be used to realize the 8-to-1 MUX of Figure 9-3? The quad MUX of Figure 9-7? Give the number of inputs, the number of OR gates, and the maximum number of inputs to an OR gate.
(i) Work Problems 9.8, 9.9, and 9.10.
7. Study Section 9.7 , Complex Programmable Logic Devices.
Work Problem 9.11.
8. Study Section 9.8, Field-Programmable Gate Arrays.
(a) For the CLB of Figure 9-37 , write a logic equation for H in terms of F, G, and H1.
A B C Z1 Z2 Z3 −0 0 1 1 0 0 1 − 1 1 0 1 0 − 1 0 0 1 1 1 0 1 1 0 −1 1 0 1 0 0 0 0 0 1 Z1 Z2 Z3 0 1 00 BC A 01 11 10 0 1 00 01 11 10 0 1 00 01 11 10 Multiplexers, Decoders, and Programmable Logic Devices 259 (b) How many 4-variable function generators are required to implement a four-input OR gate? A 4-variable function with 13 minterms?
(c) Expand the function of Equation (9-9) about the variable c instead of a. Expand it algebraically and, then, expand it by using the Karnaugh map of Figure 9-39. (Hint: How should you split the map into two halves?) (d) Draw a diagram showing how to implement Equation (9-12) using four function generators and a 4-to-1 MUX.
(e) In the worst case, how many 4-variable function generators are required to realize a 7-variable function (assume the necessary MUXes are available).
(f ) Show how to realize K = abcdefg using only two 4-variable function gen-erators. (Hint: Use the output of one function generator as an input to the other.) (g) Work Problems 9.12 and 9.13.
9. When you are satisfied that you can meet all of the objectives, take the readi-ness test.
260 Multiplexers, Decoders, and Programmable Logic Devices 9.1 Introduction Until this point we have mainly been concerned with basic principles of logic design. We have illustrated these principles using gates as our basic building blocks. In this unit we introduce the use of more complex integrated circuits (ICs) in logic design. Integrated circuits may be classified as small-scale integration (SSI), medium-scale integration (MSI), large-scale integration (LSI), or very-large-scale integration (VLSI), depending on the number of gates in each integrated circuit package and the type of function performed. SSI functions include NAND, NOR, AND, and OR gates, inverters, and flip-flops. SSI integrated circuit packages typically contain one to four gates, six inverters, or one or two flip-flops. MSI integrated circuits, such as adders, multiplexers, decoders, registers, and counters, perform more complex func-tions. Such integrated circuits typically contain the equivalent of 12 to 100 gates in one package. More complex functions such as memories and microprocessors are classified as LSI or VLSI integrated circuits. An LSI integrated circuit generally con-tains 100 to a few thousand gates in a single package, and a VLSI integrated circuit contains several thousand gates or more.
It is generally uneconomical to design digital systems using only SSI and MSI integrated circuits. By using LSI and VLSI functions, the required number of inte-grated circuit packages is greatly reduced. The cost of mounting and wiring the inte-grated circuits as well as the cost of designing and maintaining the digital system may be significantly lower when LSI and VLSI functions are used.
This unit introduces the use of multiplexers, decoders, encoders, and three-state buffers in logic design. Then read-only memories (ROMs) are described and used to implement multiple-output combinational logic circuits. Finally, other types of programmable logic devices (PLDs), including programmable logic arrays (PLAs), programmable array logic devices (PALs), complex programmable logic devices (CPLDs), and field- programmable gate arrays (FPGAs) are introduced and used in combinational logic design.
Multiplexers, Decoders, and Programmable Logic Devices 261 9.2 Multiplexers A multiplexer (or data selector, abbreviated as MUX) has a group of data inputs and a group of control inputs. The control inputs are used to select one of the data inputs and connect it to the output terminal. Figure 9-1 shows a 2-to-1 multiplexer and its switch analog. When the control input A is 0, the switch is in the upper position and the MUX output is Z = I0; when A is 1, the switch is in the lower position and the MUX output is Z = I1. In other words, a MUX acts like a switch that selects one of the data inputs (I0 or I1) and transmits it to the output. The logic equation for the 2-to-1 MUX is therefore: Z = A′I0 + AI1 Figure 9-2 shows diagrams for a 4-to-1 multiplexer, 8-to-1 multiplexer, and 2n-to-1 multiplexer. The 4-to-1 MUX acts like a four-position switch that transmits one of the four inputs to the output. Two control inputs (A and B) are needed to select one of the four inputs. If the control inputs are AB = 00, the output is I0; similarly, the control inputs 01, 10, and 11 give outputs of I1, I2, and I3, respectively. The 4-to-1 multiplexer is described by the equation Z = A′B′I0 + A′BI1 + AB′I2 + ABI3 (9-1) Similarly, the 8-to-1 MUX selects one of eight data inputs using three control inputs. It is described by the equation Z = A′B′C′I0 + A′B′CI1 + A′BC′I2 + A′BCI3 + AB′C′I4 + AB′CI5 + ABC′I6 + ABCI7 (9-2) FIGURE 9-2 Multiplexers © Cengage Learning 2014 4-to-1 MUX Data inputs Control inputs I0 I1 I2 I3 A B Z 2n-to-1 MUX n control inputs 2n data lines Z 8-to-1 MUX I0 I1 I2 I3 I4 I5 I6 I7 A B C Z ...
...
FIGURE 9-1 2-to-1 Multiplexer and Switch Analog © Cengage Learning 2014 2-to-1 MUX I0 I1 A Z I0 I1 A Z 262 Unit 9 When the control inputs are ABC = 011, the output is I3, and the other outputs are selected in a similar manner. Figure 9-3 shows an internal logic diagram for the 8-to-1 MUX. In general, a multiplexer with n control inputs can be used to select any one of 2n data inputs. The general equation for the output of a MUX with n control inputs and 2n data inputs is Z = a 2n−1 k=0 mkIk where mk is a minterm of the n control variables and Ik is the corresponding data input.
Of course, there are several other implementations of the 8-to-1 MUX. Each of the gates in Figure 9-3 can be replaced by NAND gates to obtain a NAND gate implementation. If a NOR gate implementation is wanted, the equation for Z can be written as a product of sums: Z = (A + B + C + I0)(A + B + C′ + I1)(A + B′ + C + I2) (A + B′ + C′ + I3)(A′ + B + C + I4)(A′ + B + C′ + I5) (A′ + B′ + C + I6)(A′ + B′ + C′ + I7) (9-3) Implementations with more than two levels of gates can be obtained by factoring the equation for Z. For example, if a multiple-level NAND-gate implementation is desired, Equation (9-2) can be factored. One factorization is Z = A′B′(C′I0 + CI1) + A′B(C′I2 + CI3) + AB′(C′I4 + CI5) + AB(C′I6 + CI7) (9-4) FIGURE 9-3 Logic Diagram for 8-to-1 MUX © Cengage Learning 2014 a′ b′ c′ I0 a′ b′ c I1 a′ b c′ I2 a′ b Z c I3 a b′ c′ I4 a b′ c I5 a b c′ I6 a b c I7 Multiplexers, Decoders, and Programmable Logic Devices 263 The corresponding NAND-gate circuit is shown in Figure 9-4. Note that the data inputs are connected to four 2-to-1 MUXs with C as the select line, and the outputs of these 2-to-1 MUXs are connected to a 4-to-1 MUX with A and B as the select lines. Figure 9-5 shows this in block diagram form.
FIGURE 9-5 Component MUXs of Figure 9-4 © Cengage Learning 2014 0 2-to-1 1 S0 S1 0 1 2 3 4-to-1 0 2-to-1 1 0 2-to-1 1 I0 I1 I2 I3 I4 I5 I6 I7 0 2-to-1 1 Z C B A S S S S FIGURE 9-4 A Multi-Level Implementation of an 8-to-1 MUX © Cengage Learning 2014 I0 I1 I2 I3 I4 I5 I6 I7 C′C A′ B′ A′ B A Z B′ A B 264 Unit 9 Multiplexers are frequently used in digital system design to select the data which is to be processed or stored. Figure 9-6 shows how a quadruple 2-to-1 MUX is used to select one of two 4-bit data words. If the control is A = 0, the values of x0, x1, x2, and x3 will appear at the z0, z1, z2, and z3 outputs; if A = 1, the values of y0, y1, y2, and y3 will appear at the outputs.
Several logic signals that perform a common function may be grouped together to form a bus. For example, the sum outputs of a 4-bit binary adder can be grouped together to form a 4-bit bus. Instead of drawing the individual wires that make up a bus, we often represent a bus by a single heavy line. The quad MUX of Figure 9-6 is redrawn in Figure 9-7 , using bus inputs X and Y, and bus output Z. The X bus repre-sents the four signals x0, x1, x2, and x3, and similarly for the Y and Z buses. When A = 0, the signals on bus X appear on bus Z; otherwise, the signals on bus Y appear. A diago-nal slash through a bus with a number beside it specifies the number of bits in the bus.
The preceding multiplexers do not invert the data inputs as they are routed to the output. Some multiplexers do invert the inputs, e.g., if the OR gate in Figure 9-3 is replaced by a NOR gate, then the 8-to-1 MUX inverts the selected input. To dis-tinguish between these two types of multiplexers, we will say that the multiplexers without the inversion have active high outputs, and the multiplexers with the inver-sion have active low outputs.
Another type of multiplexer has an additional input called an enable. The 8-to-1 MUX in Figure 9-3 can be modified to include an enable by changing the AND gates to five-input gates. The enable signal E is connected to the fifth input of each of the AND gates. Then, if E = 0, Z = 0 independent of the gate inputs Ii and the select inputs a, b, and c. However, if E = 1, then the MUX functions as an ordinary 8-to-1 multiplexer. The terminology used for the MUX output, i.e., active high and active low, can be used for the enable as well. As described above, the enable is active high; E must be 1 for the MUX to function as a multiplexer. If an inverter is FIGURE 9-7 Quad Multiplexer with Bus Inputs and Output © Cengage Learning 2014 2-to-1 4 4 4 X Z Y A FIGURE 9-6 Quad Multiplexer Used to Select Data © Cengage Learning 2014 2-to-1 x0 z0 y0 2-to-1 x1 z1 y1 2-to-1 x2 z2 y2 A (MUX control) 2-to-1 x3 z3 y3 Multiplexers, Decoders, and Programmable Logic Devices 265 inserted between E and the AND gates, E must be 0 for the MUX to function as a multiplexer; the enable is active low.
Four combinations of multiplexers with an enable are possible. The output can be active high or active low, whereas the enable can be active high or active low. In a block diagram for the MUX, an active low line is indicated by inserting a bubble on the line to indicate the inclusion of an inversion. Figure 9-8 shows these combina-tions for a 4-to-1 MUX.
In addition to acting as a data selector, a MUX can implement more general logic functions. In Figure 9-9 a 4-to-1 MUX is used to implement the function Z = C′D′(A′ + B′) + C′D(A′) + CD′(AB′ + A′B) + CD′(0) = A′C′ + A′BD′ + AB′D′ Given a switching function, a MUX implementation can be obtained using Shan-non’s expansion of the function. (See the Subsection Decomposition of Switching Functions in Section 9.8.) In general, the complexity of the implementation will depend upon which function inputs are used as the MUX select inputs, so it is neces-sary to try different combinations to obtain the simplest solution.
9.3 Three-State Buffers A gate output can only be connected to a limited number of other device inputs without degrading the performance of a digital system. A simple buffer may be used to increase the driving capability of a gate output. Figure 9-10 shows a buffer con-nected between a gate output and several gate inputs. Because no bubble is present FIGURE 9-8 Active-High, Active-Low Enable and Output Combinations © Cengage Learning 2014 Z S0 S1 0 1 2 3 4-to-1 I0 I1 I2 I3 E (c) (a) (b) (d) Z S0 S1 0 1 2 3 4-to-1 I0 I1 I2 I3 E Z S0 S1 0 1 2 3 4-to-1 I0 I1 I2 I3 E Z S0 S1 0 1 2 3 4-to-1 I0 I1 I2 I3 E FIGURE 9-9 Four-Variable Function Implemented with a 4-to-1 MUX © Cengage Learning 2014 Z S0 S1 0 1 2 3 4-to-1 A B C D A′ A B 0 266 Unit 9 at the buffer output, this is a noninverting buffer, and the logic values of the buffer input and output are the same, that is, F = C.
Normally, a logic circuit will not operate correctly if the outputs of two or more gates or other logic devices are directly connected to each other. For example, if one gate has a 0 output (a low voltage) and another has a 1 output (a high voltage), when the gate outputs are connected together the resulting output voltage may be some intermediate value that does not clearly represent either a 0 or a 1. In some cases, damage to the gates may result if the outputs are connected together.
Use of three-state logic permits the outputs of two or more gates or other logic devices to be connected together. Figure 9-11 shows a three-state buffer and its logi-cal equivalent. When the enable input B is 1, the output C equals A; when B is 0, the output C acts like an open circuit. In other words, when B is 0, the output C is effectively disconnected from the buffer output so that no current can flow. This is often referred to as a Hi-Z (high-impedance) state of the output because the circuit offers a very high resistance or impedance to the flow of current. Three-state buffers are also called tri-state buffers.
Figure 9-12 shows the truth tables for four types of three-state buffers. In Figures 9-12(a) and (b), the enable input B is not inverted, so the buffer output is enabled when B = 1 and disabled when B = 0. That is, the buffer operates normally when B = 1, and the buffer output is effectively an open circuit when B = 0. We use the symbol Z to represent this high-impedance state. In Figure 9-12(b), the buffer output is inverted so that C = A′ when the buffer is enabled. The buffers in 9-12(c) and (d) operate the same as in (a) and (b) except that the enable input is inverted, so the buffer is enabled when B = 0.
In Figure 9-13, the outputs of two three-state buffers are tied together. When B = 0, the top buffer is enabled, so that D = A; when B = 1, the lower buffer is ena-bled, so that D = C. Therefore, D = B′A + BC. This is logically equivalent to using a 2-to-1 multiplexer to select the A input when B = 0 and the C input when B = 1.
FIGURE 9-10 Gate Circuit with Added Buffer © Cengage Learning 2014 ...
A B C F FIGURE 9-11 Three-State Buffer © Cengage Learning 2014 A C B A C B Multiplexers, Decoders, and Programmable Logic Devices 267 When we connect two three-state buffer outputs together, as shown in Figure 9-14, if one of the buffers is disabled (output = Z), the combined output F is the same as the other buffer output. If both buffers are disabled, the output is Z. If both buffers are enabled, a conflict can occur. If A = 0 and C = 1, we do not know what the hardware will do, so the F output is unknown (X). If one of the buffer inputs is unknown, the F output will also be unknown. The table in Figure 9-14 summarizes the operation of the circuit. S1 and S2 represent the outputs the two buffers would have if they were not connected together. When a bus is driven by three-state buffers, we call it a three-state bus. The signals on this bus can have values of 0, 1, Z, and perhaps X.
A multiplexer may be used to select one of several sources to drive a device input. For example, if an adder input must come from four different sources, a 4-to-1 MUX may be used to select one of the four sources. An alternative is to set up a three-state bus, using three-state buffers to select one of the sources (see Figure 9-15). In this FIGURE 9-12 Four Kinds of Three-State Buffers © Cengage Learning 2014 (a) (b) (c) (d) B A C B A C B A C B A C 0 0 Z 0 0 Z 0 0 0 0 0 1 0 1 Z 0 1 Z 0 1 1 0 1 0 1 0 0 1 0 1 1 0 Z 1 0 Z 1 1 1 1 1 0 1 1 Z 1 1 Z A C B A C B A C B A C B FIGURE 9-14 Circuit with Two Three-State Buffers © Cengage Learning 2014 X 0 1 Z X X X X X 0 X 0 X 0 1 X X 1 1 Z X 0 1 Z S2 S1 A B S1 S2 D C F FIGURE 9-13 Data Selection Using Three-State Buffers © Cengage Learning 2014 2-to-1 MUX 0 1 A C B D A C B D 268 Unit 9 circuit, each buffer symbol actually represents four three-state buffers that have a common enable signal.
Integrated circuits are often designed using bi-directional pins for input and out-put. Bi-directional means that the same pin can be used as an input pin and as an output pin, but not both at the same time. To accomplish this, the circuit output is connected to the pin through a three-state buffer, as shown in Figure 9-16. When the buffer is enabled, the pin is driven with the output signal. When the buffer is disa-bled, an external source can drive the input pin.
9.4 Decoders and Encoders The decoder is another commonly used type of integrated circuit. Figure 9-17 shows the diagram and truth table for a 3-to-8 line decoder. This decoder generates all of the minterms of the three input variables. Exactly one of the output lines will be 1 for each combination of the values of the input variables.
FIGURE 9-17 A 3-to-8 Line Decoder © Cengage Learning 2014 y0 = a′b′c′ y1 = a′b′c y2 = a′bc′ y3 = a′bc y4 = ab′c′ y5 = ab′c y6 = abc′ y7 = abc 3-to-8 line decoder a b c a b c y0 y1 y2 y3 y4 y5 y6 y7 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 1 1 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 1 0 0 1 1 0 0 0 0 0 0 0 1 0 1 1 1 0 0 0 0 0 0 0 1 FIGURE 9-16 Integrated Circuit with Bi-Directional Input-Output Pin © Cengage Learning 2014 Integrated Logic Circuit Output EN Bi-Directional Input-Output Pin Input FIGURE 9-15 4-Bit Adder with Four Sources for One Operand © Cengage Learning 2014 EnA 4 A EnB 4 B EnC 4 C EnD 4-bit adder 4 4 4 4 D E Sum Cout Multiplexers, Decoders, and Programmable Logic Devices 269 Figure 9-18 illustrates a 4-to-10 decoder. This decoder has inverted outputs (indi-cated by the small circles). For each combination of the values of the inputs, exactly one of the output lines will be 0. When a binary-coded-decimal digit is used as an input to this decoder, one of the output lines will go low to indicate which of the 10 decimal digits is present.
FIGURE 9-18 A 4-to-10 Line Decoder © Cengage Learning 2014 9 8 7 6 5 4 3 2 1 0 D C B A Outputs 7442 (b) Block diagram (a) Logic diagram A B C D Inputs m′ 9 m′ 8 m′ 7 m′ 6 m′ 5 m′ 4 m′ 3 m′ 2 m′ 1 m′ 0 BCD Input Decimal Output A B C D 0 1 2 3 4 5 6 7 8 9 0 0 0 0 0 1 1 1 1 1 1 1 1 1 0 0 0 1 1 0 1 1 1 1 1 1 1 1 0 0 1 0 1 1 0 1 1 1 1 1 1 1 0 0 1 1 1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1 0 1 1 1 1 1 0 1 0 1 1 1 1 1 1 0 1 1 1 1 0 1 1 0 1 1 1 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 1 1 1 0 1 1 1 0 0 0 1 1 1 1 1 1 1 1 0 1 1 0 0 1 1 1 1 1 1 1 1 1 1 0 1 0 1 0 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 (c) Truth Table 270 Unit 9 In general, an n-to-2n line decoder generates all 2n minterms (or maxterms) of the n input variables. The outputs are defined by the equations yi = mi = Mi ′, i = 0 to 2n −1 (noninverted outputs) (9-5) or yi = mi ′ = Mi, i = 0 to 2n −1 (inverted outputs) (9-6) where mi is a minterm of the n input variables and Mi is a maxterm.
Because an n-input decoder generates all of the minterms of n variables, n- variable functions can be realized by ORing together selected minterm outputs from a decoder. If the decoder outputs are inverted, then NAND gates can be used to generate the functions, as illustrated in the following example. Realize f1(a, b, c, d) = m1 + m2 + m4 and f2(a, b, c, d) = m4 + m7 + m9 using the decoder of Figure 9-18. Since a NAND gate ORs inverted signals, f1 and f2 can be generated using NAND gates, as shown in Figure 9-19.
An encoder performs the inverse function of a decoder. Figure 9-20 shows an 8-to-3 priority encoder with inputs y0 through y7. If input yi is 1 and the other inputs are 0, then the abc outputs represent a binary number equal to i. For example, if FIGURE 9-19 Realization of a Multiple-Output Circuit Using a Decoder © Cengage Learning 2014 m4 ′ m7 ′ m9 ′ f2 f1 m2 ′ m1 ′ 0 1 2 3 4 4-to-10 Line Decoder a b c d 5 6 7 8 9 FIGURE 9-20 An 8-to-3 Priority Encoder © Cengage Learning 2014 y0 y1 y2 y3 y4 y5 y6 y7 a b c d 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 X 1 0 0 0 0 0 0 0 0 1 1 X X 1 0 0 0 0 0 0 1 0 1 X X X 1 0 0 0 0 0 1 1 1 X X X X 1 0 0 0 1 0 0 1 X X X X X 1 0 0 1 0 1 1 X X X X X X 1 0 1 1 0 1 X X X X X X X 1 1 1 1 1 8-to-3 Priority Encoder a b c d y0 y1 y2 y3 y4 y5 y6 y7 Multiplexers, Decoders, and Programmable Logic Devices 271 y3 = 1, then abc = 011. If more than one input can be 1 at the same time, the output can be defined using a priority scheme. The truth table in Figure 9-20 uses the fol-lowing scheme: If more than one input is 1, the highest numbered input determines the output. For example, if inputs y1, y4, and y5 are 1, the output is abc = 101. The X’s in the table are don’t-cares; for example, if y5 is 1, we do not care what inputs y0 through y4 are. Output d is 1 if any input is 1, otherwise, d is 0. This signal is needed to distinguish the case of all 0 inputs from the case where only y0 is 1.
9.5 Read-Only Memories A read-only memory (ROM) consists of an array of semiconductor devices that are interconnected to store an array of binary data. Once binary data is stored in the ROM, it can be read out whenever desired, but the data that is stored cannot be changed under normal operating conditions. Figure 9-21(a) shows a ROM which has three input lines and four output lines. Figure 9-21(b) shows a typical truth table which relates the ROM inputs and outputs. For each combination of input values on the three input lines, the corresponding pattern of 0’s and 1’s appears on the ROM output lines. For example, if the combination ABC = 010 is applied to the input lines, the pattern F0F1F2F3 = 0111 appears on the output lines. Each of the output patterns that is stored in the ROM is called a word. Because the ROM has three input lines, we have 23 = eight different combinations of input values. Each input combination serves as an address which can select one of the eight words stored in the memory. Because there are four output lines, each word is four bits long, and the size of this ROM is 8 words × 4 bits.
A ROM which has n input lines and m output lines (Figure 9-22) contains an array of 2n words, and each word is m bits long. The input lines serve as an address to select one of the 2n words. When an input combination is applied to the ROM, the pattern of 0’s and 1’s which is stored in the corresponding word in the memory appears at the output lines. For the example in Figure 9-22, if 00 . . . 11 is applied to the input (address lines) of the ROM, the word 110 . . . 010 will be selected and transferred to the output lines. A 2n × m ROM can realize m functions of n variables because it can store a truth table with 2n rows and m columns. Typical sizes for commercially available ROMs range from 32 words × 4 bits to 512K words × 8 bits, or larger.
FIGURE 9-21 An 8-Word × 4-Bit ROM © Cengage Learning 2014 272 Unit 9 A ROM basically consists of a decoder and a memory array, as shown in Figure 9-23. When a pattern of n 0’s and 1’s is applied to the decoder inputs, exactly one of the 2n decoder outputs is 1. This decoder output line selects one of the words in the memory array, and the bit pattern stored in this word is transferred to the memory output lines.
Figure 9-24 illustrates one possible internal structure of the 8-word × 4-bit ROM shown in Figure 9-21. The decoder generates the eight minterms of the three input variables. The memory array forms the four output functions by ORing together selected minterms. A switching element is placed at the intersection of a word line and an output line if the corresponding minterm is to be included in the output func-tion; otherwise, the switching element is omitted (or not connected). If a switching element connects an output line to a word line which is 1, the output line will be 1. Otherwise, the pull-down resistors at the top of Figure 9-24 cause the output line to be 0. So the switching elements which are connected in this way in the memory array effectively form an OR gate for each of the output functions. For example, m0, m1, m4, and m6 are ORed together to form F0. Figure 9-25 shows the equivalent OR gate.
In general, those minterms which are connected to output line F by switching elements are ORed together to form the output Fi. Thus, the ROM in Figure 9-24 generates the following functions: F0 = Σ m(0, 1, 4, 6) = A′B′ + AC′ F1 = Σ m(2, 3, 4, 6, 7) = B + AC′ F2 = Σ m(0, 1, 2, 6) = A′B′ + BC′ F3 = Σ m(2, 3, 5, 6, 7) = AC + B (9-7) FIGURE 9-22 Read-Only Memory with n Inputs and m Outputs © Cengage Learning 2014 n Input m Output Variables Variables 00 · · · 00 100 · · · 110 00 · · · 01 010 · · · 111 00 · · · 10 101 · · · 101 00 · · · 11 110 · · · 010 11 · · · 00 001 · · · 011 11 · · · 01 110 · · · 110 11 · · · 10 011 · · · 000 11 · · · 11 111 · · · 101 · · · · · · Typical Data Array Stored in ROM (2n words of m bits each) ROM 2n Words × m Bits m Output Lines n Input Lines ...
...
FIGURE 9-23 Basic ROM Structure © Cengage Learning 2014 Decoder n Input Lines Memory Array 2n Words × m Bits ROM m Output Lines ...
...
...
Multiplexers, Decoders, and Programmable Logic Devices 273 The contents of a ROM are usually specified by a truth table. The truth table of Figure 9-21(b) specifies the ROM in Figure 9-24. Note that a 1 or 0 in the output part of the truth table corresponds to the presence or absence of a switching element in the memory array of the ROM.
Multiple-output combinational circuits can easily be realized using ROMs. As an example, we will realize a code converter that converts a 4-bit binary number to a hexadecimal digit and outputs the 7-bit ASCII code. Figure 9-26 shows the truth table and logic circuit for the converter. Because A5 = A4, and A6 = A4 ′ the ROM needs only five outputs. Because there are four address lines, the ROM size is 16 words by 5 bits. Columns A4 A3 A2 A1 A0 of the truth table are stored in the ROM. Figure 9-27 shows an internal diagram of the ROM. The switching elements at the intersections of the rows and columns of the memory array are indicated using X’s. An X indicates that the switching element is present and connected, and no X indi-cates that the corresponding element is absent or not connected.
Three common types of ROMs are mask-programmable ROMs, programmable ROMs (PROMs), and electrically erasable programmable ROMs (EEPROMs). At the time of manufacture, the data array is permanently stored in a mask-programmable ROM. This is accomplished by selectively including or omitting the switching elements at the row- column intersections of the memory array. This requires preparation of a FIGURE 9-25 Equivalent OR Gate for F0 © Cengage Learning 2014 m0 m1 m4 m6 F0 FIGURE 9-24 An 8-Word × 4-Bit ROM © Cengage Learning 2014 Word Lines F0 m7 = ABC m6 = ABC′ m5 = AB′C m4 = AB′C′ m3 = A′BC m2 = A′BC′ m1 = A′B′C F1 F2 F3 m0 = A′B′C′ 3-to-8 Decoder Switching Element Output Lines A B C 274 Unit 9 special mask, which is used during fabrication of the integrated circuit. Preparation of this mask is expensive, so the use of mask-programmable ROMs is economically feasible only if a large quantity (typically several thousand or more) is required with the same data array. If a small quantity of ROMs is required with a given data array, EEPROMs may be used.
Modification of the data stored in a ROM is often necessary during the devel-opmental phases of a digital system, so EEPROMs are used instead of mask- programmable ROMs. EEPROMs use a special charge-storage mechanism to enable or disable the switching elements in the memory array. A PROM programmer is used to provide appropriate voltage pulses to store electronic charges in the mem-ory array locations. Data stored in this manner is generally permanent until erased. FIGURE 9-27 ROM Realization of Code Converter © Cengage Learning 2014 4-to-16 Decoder ROM Outputs ROM Inputs Z Y X W A4 m15 m14 m13 m12 m11 m10 m9 m8 m7 m6 m5 m4 m3 m2 m1 m0 A3 A2 A1 A0 FIGURE 9-26 Hexadecimal-to-ASCII Code Converter © Cengage Learning 2014 Input Hex ASCII Code for Hex Digit W X Y Z Digit A6 A5 A4 A3 A2 A1 A0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 1 1 0 1 1 0 0 0 1 0 0 1 0 2 0 1 1 0 0 1 0 0 0 1 1 3 0 1 1 0 0 1 1 0 1 0 0 4 0 1 1 0 1 0 0 0 1 0 1 5 0 1 1 0 1 0 1 0 1 1 0 6 0 1 1 0 1 1 0 0 1 1 1 7 0 1 1 0 1 1 1 1 0 0 0 8 0 1 1 1 0 0 0 1 0 0 1 9 0 1 1 1 0 0 1 1 0 1 0 A 1 0 0 0 0 0 1 1 0 1 1 B 1 0 0 0 0 1 0 1 1 0 0 C 1 0 0 0 0 1 1 1 1 0 1 D 1 0 0 0 1 0 0 1 1 1 0 E 1 0 0 0 1 0 1 1 1 1 1 F 1 0 0 0 1 1 0 ROM A6 A5 A4 A3 A2 A1 Z Y X W A0 Multiplexers, Decoders, and Programmable Logic Devices 275 After erasure, a new set of data can be stored in the EEPROM. An EEPROM can be erased and reprogrammed only a limited number of times, typically 100 to 1000 times. Flash memories are similar to EEPROMs, except that they use a different charge-storage mechanism. They usually have built-in programming and erase capa-bility so that data can be written to the flash memory while it is in place in a circuit without the need for a separate programmer.
9.6 Programmable Logic Devices A programmable logic device (or PLD) is a general name for a digital integrated circuit capable of being programmed to provide a variety of different logic functions. In this section we will discuss several types of combinational PLDs, and later we will discuss sequential PLDs. Simple combinational PLDs are capable of realizing from 2 to 10 functions of 4 to 16 variables with a single integrated circuit. More complex PLDs may contain thousands of gates and flip-flops. Thus, a single PLD can replace a large number of integrated circuits, and this leads to lower cost designs. When a digital system is designed using a PLD, changes in the design can easily be made by changing the programming of the PLD without having to change the wiring in the system.
Programmable Logic Arrays A programmable logic array (PLA) performs the same basic function as a ROM. A PLA with n inputs and m outputs (Figure 9-28) can realize m functions of n vari-ables. The internal organization of the PLA is different from that of the ROM. The decoder is replaced with an AND array which realizes selected product terms of the input variables. The OR array ORs together the product terms needed to form the output functions, so a PLA implements a sum-of-products expression, while a ROM directly implements a truth table.
Figure 9-29 shows a PLA which realizes the same functions as the ROM of Figure 9-24. Product terms are formed in the AND array by connecting switch-ing elements at appropriate points in the array. For example, to form A′B′, switching elements are used to connect the first word line with the A′ and B′ lines. FIGURE 9-28 Programmable Logic Array Structure © Cengage Learning 2014 AND Array n Input Lines k Word Lines OR Array PLA m Output Lines ...
...
...
276 Unit 9 Switching elements are connected in the OR array to select the product terms needed for the output functions. For example, because F0 = A′B′ + AC′, switching elements are used to connect the A′B′ and AC′ lines to the F0 line. The connec-tions in the AND and OR arrays of this PLA make it equivalent to the AND-OR array of Figure 9-30.
The contents of a PLA can be specified by a PLA table. Table 9-1 specifies the PLA in Figure 9-29. The input side of the table specifies the product terms. The sym-bols 0, l, and – indicate whether a variable is complemented, not complemented, or F3 F2 F1 Outputs F0 A′B′ A′ A B C B′ C′ AC′ B BC′ AC +V Inputs +V +V +V +V FIGURE 9-30 AND-OR Array Equivalent to Figure 9-29 © Cengage Learning 2014 A A′B′ B AC′ B BC′ AC F0 F1 F2 F3 C AND Array OR Array FIGURE 9-29 PLA with Three Inputs, Five Product Terms, and Four Outputs © Cengage Learning 2014 Multiplexers, Decoders, and Programmable Logic Devices 277 not present in the corresponding product term. The output side of the table specifies which product terms appear in each output function. A 1 or 0 indicates whether a given product term is present or not present in the corresponding output function. Thus, the first row of Table 9-1 indicates that the term A′B′ is present in output func-tions F0 and F2, and the second row indicates that AC′ is present in F0 and F1.
Next, we will realize Equation (7-25) using a PLA. Using the minimum multiple-output solution given in Equation (7-25b), we can construct a PLA table, Figure 9-31(a), with one row for each distinct product term. Figure 9-31(b) shows the corresponding PLA structure, which has four inputs, six product terms, and three outputs. A dot at the intersection of a word line and an input or output line indicates the presence of a switching element in the array.
TABLE 9-1 PLA Table for Figure 9-29 © Cengage Learning 2014 Product Term Inputs A B C Outputs F0 F1 F2 F3 A′B′ 0 0 − 1 0 1 0 F0 = A′B′ + AC′ AC′ 1 − 0 1 1 0 0 F1 = AC′ + B B − 1 − 0 1 0 1 F2 = A′B′ + BC′ BC′ − 1 0 0 0 1 0 F3 = B + AC AC 1 − 1 0 0 0 1 FIGURE 9-31 PLA Realization of Equation (7-25b) © Cengage Learning 2014 a b c d F1 a′bd abd ab′c′ b′c c bc F2 F3 Inputs Outputs (b) PLA structure Word Lines a b c d f1 f2 f3 0 1 – 1 1 1 0 1 1 – 1 1 0 1 1 0 0 – 1 0 1 – 0 1 – 1 0 0 – – 1 – 0 1 0 – 1 1 – 0 0 1 (a) PLA table 278 Unit 9 A PLA table is significantly different than a truth table for a ROM. In a truth table each row represents a minterm; therefore, exactly one row will be selected by each combination of input values. The 0’s and 1’s of the output portion of the selected row determine the corresponding output values. On the other hand, each row in a PLA table represents a general product term. Therefore, zero, one, or more rows may be selected by each combination of input values. To determine the value of fi for a given input combination, the values of fi in the selected rows of the PLA table must be ORed together. The following examples refer to the PLA table of Figure 9-31(a). If abcd = 0001, no rows are selected, and all f’s are 0. If abcd = 1001, only the third row is selected, and f1 f2 f3 = 101. If abcd = 0111, the first, fifth, and sixth rows are selected. Therefore, f1 = 1 + 0 + 0 = 1, f2 = 1 + 1 + 0 = 1, and f3 = 0 + 0 + 1 = 1.
Both mask-programmable and field-programmable PLAs are available. The mask-programmable type is programmed at the time of manufacture in a manner similar to mask-programmable ROMs. The field-programmable logic array (FPLA) has programmable interconnection points that use electronic charges to store a pat-tern in the AND and OR arrays. An FPLA with 16 inputs, 48 product terms, and eight outputs can be programmed to implement eight functions of 16 variables, pro-vided that the total number of product terms does not exceed 48.
When the number of input variables is small, a PROM may be more economi-cal to use than a PLA. However, when the number of input variables is large, PLAs often provide a more economical solution than PROMs. For example, to realize eight functions of 24 variables would require a PROM with over 16 million 8-bit words. Because PROMs of this size are not readily available, the functions would have to be decomposed so that they could be realized using a number of smaller PROMs. The same eight functions of 24 variables could easily be realized using a single PLA, provided that the total number of product terms is small. If more terms are required, the outputs of several PLAs can be ORed together.
Programmable Array Logic The PAL (programmable array logic) is a special case of the programmable logic array in which the AND array is programmable and the OR array is fixed. The basic structure of the PAL is the same as the PLA shown in Figure 9-28. Because only the AND array is programmable, the PAL is less expensive than the more general PLA, and the PAL is easier to program. For this reason, logic designers frequently use PALs to replace individual logic gates when several logic functions must be realized.
Figure 9-32(a) represents a segment of an unprogrammed PAL. The symbol Noninverted Output Inverted Output represents an input buffer which is logically equivalent to Multiplexers, Decoders, and Programmable Logic Devices 279 A buffer is used because each PAL input must drive many AND gate inputs. When the PAL is programmed, some of the interconnection points are programmed to make the desired connections to the AND gate inputs. Connections to the AND gate inputs in a PAL are represented by X’s as shown: FIGURE 9-32 PAL Segment © Cengage Learning 2014 I1 I2 F1 Output (a) Unprogrammed F4 F5 F8 I1 I1 I2 ′ + I1 ′ I2 I2 (b) Programmed A C B C A B C A B C B A As an example, we will use the PAL segment of Figure 9-32(a) to realize the func-tion I1I2 ′ + I1 ′I2. The X’s in Figure 9-32(b) indicate that I1 and I2 ′ lines are connected to the first AND gate, and the I ′1 ′ and I2 lines are connected to the other gate.
When designing with PALs, we must simplify our logic equations and try to fit them into one (or more) of the available PALs. Unlike the more general PLA, the AND terms cannot be shared among two or more OR gates; therefore, each func-tion to be realized can be simplified by itself without regard to common terms. For a given type of PAL, the number of AND terms that feed each output OR gate is fixed and limited. If the number of AND terms in a simplified function is too large, we may be forced to choose a PAL with more gate inputs and fewer outputs.
280 Unit 9 As an example of programming a PAL, we will implement a full adder. The logic equations for the full adder are Sum = X′Y′Cin + X′YC′ in + XY′C′ in + XYCin Cout = XCin + YCin + XY Figure 9-33 shows a section of a PAL where each OR gate is driven by four AND gates. The X’s on the diagram show the connections that are programmed into the PAL to implement the full adder equations. For example, the first row of X’s imple-ments the product term X′Y′Cin.
FIGURE 9-33 Implementation of a Full Adder Using a PAL © Cengage Learning 2014 X Cin Sum Cout Y 9.7 Complex Programmable Logic Devices As integrated circuit technology continues to improve, more and more gates can be placed on a single chip. This has allowed the development of complex programmable logic devices (CPLDs). Instead of a single PAL or PLA on a chip, many PALs or PLAs can be placed on a single CPLD chip and interconnected. When storage ele-ments such as flip-flops are also included on the same IC, a small digital system can be implemented with a single CPLD.
Figure 9-34 shows the basic architecture of a Xilinx XCR3064XL CPLD. This CPLD has four function blocks, and each block has 16 associated macrocells (MC1, MC2, . . .). Each function block is a programmable AND-OR array that is configured as a PLA. Each macrocell contains a flip-flop and multiplexers that route signals from the function block to the input-output (I/O) block or to the interconnect array (IA). The IA selects signals from the macrocell outputs or I/O blocks and connects them back to function block inputs. Thus, a signal generated in one function block can be used as an input to any other function block. The I/O blocks provide an inter-face between the bi-directional I/O pins on the IC and the interior of the CPLD.
Multiplexers, Decoders, and Programmable Logic Devices 281 Figure 9-35 shows how a signal generated in the PLA is routed to an I/O pin through a macrocell. Any of the 36 outputs from the IA (or their complements) can be connected to any inputs of the 48 AND gates. Each OR gate can accept up to 48 product term inputs from the AND array. The macrocell logic in this diagram is a sim-plified version of the actual logic. The first MUX (1) can be programmed to select the OR-gate output or its complement. Details of the flip-flop operation will be discussed in Unit 11. The MUX (2) at the output of the macrocell can be programmed to select either the combinational output (G) or the flip-flop output (Q). This output goes to the interconnect array and to the output cell. The output cell includes a three-state buffer (3) to drive the I/O pin. The buffer enable input can be programmed from several sources. When the I/O pin is used as an input, the buffer must be disabled.
Sophisticated CAD software is available for fitting logic circuits into a PLD and for programming the interconnections within the PLD. The input to this software can be in several forms such as a logic circuit diagram, a set of logic equations, or code written in a hardware description language (HDL). Unit 10 discusses the use of an HDL. The CAD software processes the input, determines the logic equations to be implemented, fits these equations into the PLD, determines the required inter-connections within the PLD, and generates a bit pattern for programming the PLD.
FIGURE 9-34 Architecture of Xilinx XCR3064XL CPLD (Figure based on figures and text owned by Xilinx, Inc., Courtesy of Xilinx, Inc. © Xilinx, Inc. 1999–2003. All rights reserved.) 16 16 16 16 MC1 MC2 MC16 FUNCTION BLOCK Interconnect Array (IA) FUNCTION BLOCK I/O I/O Pins I/O ...
MC1 MC2 MC16 ...
...
...
36 36 16 16 16 16 MC1 MC2 MC16 FUNCTION BLOCK FUNCTION BLOCK I/O I/O ...
MC1 MC2 MC16 ...
...
...
36 36 FIGURE 9-35 CPLD Function Block and Macrocell (A Simplified Version of XCR3064XL) © Cengage Learning 2014 One of 16 OR Gates Part of PLA Simplified Macrocell Output Cell 48 AND Gates 36 Inputs from IA ...
...
...
...
...
1 2 3 I/O Pin To IA To IA D CE CK Q Programmable Select Flip-Flop Programmable Enable G F 282 Unit 9 9.8 Field-Programmable Gate Arrays In this section we introduce the use of field-programmable gate arrays (FPGAs) in combinational logic design. An FPGA is an IC that contains an array of identical logic cells with programmable interconnections. The user can program the functions realized by each logic cell and the connections between the cells. Figure 9-36 shows the layout of part of a typical FPGA. The interior of the FPGA consists of an array of logic cells, also called configurable logic blocks (CLBs). The array of CLBs is sur-rounded by a ring of input-output interface blocks. These I/O blocks connect the CLB signals to IC pins. The space between the CLBs is used to route connections between the CLB outputs and inputs.
Figure 9-37 shows a simplified version of a CLB. This CLB contains two func-tion generators, two flip-flops, and various multiplexers for routing signals within the CLB. Each function generator has four inputs and can implement any function of up to four variables. The function generators are implemented as lookup tables (LUTs). A four-input LUT is essentially a reprogrammable ROM with 16 1-bit words. This ROM stores the truth table for the function being generated. The H multiplexer selects either F or G depending on the value of H1. The CLB has two combinational outputs (X and Y) and two flip-flop outputs (XQ and YQ). The X and Y outputs and FIGURE 9-36 Layout of a Typical FPGA © Cengage Learning 2014 Interconnect Area Configurable Logic Block I/O Block Multiplexers, Decoders, and Programmable Logic Devices 283 the flip-flop inputs are selected by programmable multiplexers. The select inputs to these MUXes are programmed when the FPGA is configured. For example, the X output can come from the F function generator, and the Y output from the H multi-plexer. Operation of the CLB flip-flops will be described in Unit 11.
Figure 9-38 shows one way to implement a function generator with inputs a, b, c, d. The numbers in the squares represent the bits stored in the LUT. These bits enable particular minterms. Because the function being implemented is stored as a truth table, a function with only one minterm or with as many as 15 minterms requires a single function generator. The functions F = abc and F = a′b′c′d + a′b′cd + a′bc′d + a′bcd′ + ab′c′d + ab′cd′ + abc′d′ + abcd each require a single function generator.
Decomposition of Switching Functions In order to implement a switching function of more than four variables using 4- variable function generators, the function must be decomposed into subfunctions where each subfunction requires only four variables. One method of decomposition FIGURE 9-37 Simplified Configurable Logic Block (CLB) © Cengage Learning 2014 H LUT G G4 YQ XQ Y X G3 G2 D SR Q CK CE G1 H1 LUT = Programmable MUX F F4 F3 F2 F1 D SR Q CK CE FIGURE 9-38 Implementation of a Lookup Table (LUT) © Cengage Learning 2014 ...
...
0 b′ a′ c′ d′ 1 b′ a′ c′ d F 1 b a c d a b c d F 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 · · · · · · 284 Unit 9 is based on Shannon’s expansion theorem. We will first illustrate this theorem by expanding a function of the variables a, b, c, and d about the variable a: f(a, b, c, d) = a′ f(0, b, c, d) + a f(1, b, c, d) = a′ f0 + a f1 (9-8) The 3-variable function f0 = f(0, b, c, d) is formed by replacing a with 0 in f(a, b, c, d), and f1 = f(1, b, c, d) is formed by replacing a with 1 in f(a, b, c, d). To verify that Equation (9-8) is correct, first set a to 0 on both sides, and then set a to 1 on both sides. An example of applying Equation (9-8) is as follows: f(a, b, c, d) = c′d′ + a′b′c + bcd + ac′ = a′(c′d′ + b′c + bcd) + a(c′d′ + bcd + c′) = a′(c′d′ + b′c + cd) + a(c′ + bd) = a′f0 + a f1 (9-9) Note that before simplification, the terms c′d′ and bcd appear in both f0 and f1 because neither term contains a′ or a.
Expansion can also be accomplished using a truth table or a Karnaugh map. Figure 9-39 shows the map for Equation (9-9). The left half of the map where a = 0 is in effect a 3-variable map for f0(b, c, d). Looping terms on the left half gives f0 = c′d′ + b′c + cd, which is the same as the previous result. Similarly the right half where a = 1 is a 3-variable map for f1(b, c, d), and looping terms on the right half gives f1 = c′ + bd. The expressions for f0 and f1 obtained from the map are the same as those obtained algebraically in Equation (9-9).
The general form of Shannon’s expansion theorem for expanding an n-variable function about the variable xi is f(x1, x2, . . . , xi–1, xi, xi+1, . . . , xn) = xi′ f(x1, x2, . . . , xi–1, 0, xi+1, . . . , xn) + xi f(x1, x2, . . . , xi–1, 1, xi+1, . . . , xn) = xi′ f0 + xi f1 (9-10) FIGURE 9-39 Function Expansion Using a Karnaugh Map © Cengage Learning 2014 F F0 F1 a = 0 a = 1 1 1 1 1 00 01 11 10 1 1 1 1 1 1 00 cd ab 01 11 10 1 1 1 1 00 01 11 10 1 1 1 1 1 1 00 cd ab 01 11 10 where f0 is the (n −1)-variable function obtained by setting xi to 0 in the original function and f1 is the (n −1)-variable function obtained by setting xi to 1 in the Multiplexers, Decoders, and Programmable Logic Devices 285 original function. The theorem is easily proved for switching algebra by first setting xi to 0 in Equation (9-10), and, then, setting xi to 1. Because both sides of the equation are equal for xi = 0 and for xi = 1, the theorem is true for switching algebra.
Applying the expansion theorem to a 5-variable function gives f(a, b, c, d, e) = a′ f(0, b, c, d, e) + a f(1, b, c, d, e) = a′ f0 + a f1 (9-11) This shows that any 5-variable function can be realized using two 4-variable function generators and a 2-to-1 MUX (Figure 9-40(a)). This implies that any 5-variable func-tion can be implemented using a CLB of the type shown in Figure 9-37 .
To realize a 6-variable function using 4-variable function generators, we apply the expansion theorem twice: G(a, b, c, d, e, f ) = a′G(0, b, c, d, e, f ) + a G(1, b, c, d, e, f ) = a′G0 + a G1 G0 = b′G(0, 0, c, d, e, f ) + b G(0, 1, c, d, e, f ) = b′G00 + b G01 G1 = b′G(1, 0, c, d, e, f ) + b G(1, 1, c, d, e, f ) = b′G10 + bG11 Because G00,G01,G10, and G11 are all 4-variable functions, we can realize any 6-variable function using four 4-variable function generators and three 2-to-1 MUXes, as shown in Figure 9-40(b). Thus, we can realize any 6-variable function using two CLBs of the type shown in Figure 9-35. Alternatively, we can write G(a, b, c, d, e, f ) = a′b′G00 + a′b G01 + ab′G10 + ab G11 (9-12) and realize G using four function generators and a 4-to-1 MUX. In general, we can realize any n-variable function (n > 4) using 2n−4 4-variable function generators and one 2n−4-to-1 MUX. This is a worst-case situation because many functions of n- variables can be realized with fewer function generators.
FIGURE 9-40 Realization of 5- and 6-Variable Functions with Function Generators © Cengage Learning 2014 b b c d G00 G0 G1 G G01 G10 G11 e f c d e f c d e f c d e f FG FG a a b c F0 F1 F d e FG 0 1 b c d e FG (a) 5-variable function (b) 6-variable function FG FG 286 Unit 9 Problems 9.1 (a) Show how two 2-to-1 multiplexers (with no added gates) could be connected to form a 3-to-1 MUX. Input selection should be as follows: If AB = 00, select I0 If AB = 01, select I1 If AB = 1− (B is a don’t-care), select I2 (b) Show how two 4-to-1 and one 2-to-1 multiplexers could be connected to form an 8-to-1 MUX with three control inputs.
(c) Show how four 2-to-1 and one 4-to-1 multiplexers could be connected to form an 8-to-1 MUX with three control inputs.
9.2 Design a circuit which will either subtract X from Y or Y from X, depending on the value of A. If A = 1, the output should be X −Y, and if A = 0, the output should be Y −X. Use a 4-bit subtracter and two 4-bit 2-to-1 multiplexers (with bus inputs and outputs as in Figure 9-7).
9.3 Repeat 9.2 using a 4-bit subtracter, four 4-bit three-state buffers (with bus inputs and outputs), and one inverter.
9.4 Realize a full adder using a 3-to-8 line decoder (as in Figure 9-17) and (a) two OR gates.
(b) two NOR gates.
9.5 Derive the logic equations for a 4-to-2 priority encoder. Refer to your table in the Study Guide, Part 4(b).
9.6 Design a circuit equivalent to Figure 9-15 using a 4-to-1 MUX (with bus inputs as in Figure 9-7). Use a 4-to-2 line priority encoder to generate the control signals.
9.7 An adder for Gray-coded-decimal digits (see Table 1-2) is to be designed using a ROM. The adder should add two Gray-coded digits and give the Gray-coded sum and a carry. For example, 1011 + 1010 = 0010 with a carry of 1 (7 + 6 = 13). Draw a block diagram showing the required ROM inputs and outputs. What size ROM is required? Indicate how the truth table for the ROM would be specified by giving some typical rows.
9.8 The following PLA will be used to implement the following equations: X = AB′D + A′C′ + BC + C′D′ Y = A′C′ + AC + C′D′ Z = CD + A′C′ + AB′D Multiplexers, Decoders, and Programmable Logic Devices 287 (a) Indicate the connections that will be made to program the PLA to implement these equations.
(b) Specify the truth table for a ROM which realizes these same equations.
9.9 Show how to implement a full subtracter using a PAL. See Figure 9-33.
9.10 (a) If the ROM in the hexadecimal to ASCII code converter of Figure 9-26 is replaced with a PAL, give the internal connection diagram.
(b) If the same ROM is replaced with a PLA, give the PLA table.
9.11 (a) Sometimes the programmable MUX (1) in Figure 9-35 helps us to save AND gates. Consider the case in which F = c′d′ + bc′ + a′c. If programmable MUX (1) is not set to invert F (i.e., G = F), how many AND gates are needed? If the MUX is set to invert F (i.e., G = F′), how many AND gates are needed?
(b) Repeat (a) for F = a′b′ + c′d′.
9.12 (a) Implement a 3-variable function generator using a PAL with inputs a, b, c, and 1 (use the input inverter to get 0 also). Give the internal connection diagram. Leave the connections to 0 and 1 disconnected, so that any 3-variable function can be implemented by connecting only 0 and 1.
(b) Now connect 0 and 1 so that the function generator implements the sum func-tion for a full adder. See Figure 9-38.
9.13 Expand the following function about the variable b.
F = ab′cde′ + bc′d′e + a′cd′e + ac′de′ 9.14 (a) Implement the following function using only 2-to-1 MUXes: R = ab′h′ + bch′ + eg′h + fgh. (b) Repeat using only tri-state buffers.
9.15 Show how to make a 4-to-1 MUX, using an 8-to-1 MUX.
9.16 Implement a 32-to-1 multiplexer using two 16-to-1 multiplexers and a 2-to-1 multiplexer in two ways: (a) Connect the most significant select line to the 2-to-1 multiplexer, and (b) connect the least significant select line to the 2-to-1 multiplexer.
A X Y Z B C D 288 Unit 9 9.17 2-to-1 multiplexers with an active high output and active high enable are to be used in the following implementations: (a) Show how to implement a 4-to-1 multiplexer with an active high output and no enable using two of the 2-to-1 MUXes and a minimum number of additional gates.
(b) Repeat part (a) for a 4-to-1 multiplexer with an active low output.
(c) Repeat part (b) assuming the output of the 2-to-1 MUX is 1 (rather than 0) when the enable is 0.
9.18 Realize a BCD to excess-3 code converter using a 4-to-10 decoder with active low outputs and a minimum number of gates.
9.19 Use a 4-to-1 multiplexer and a minimum number of external gates to realize the function F(w, x, y, z) = Σ m(3, 4, 5, 7, 10, 14) + Σ d(1, 6, 15).
The inputs are only available uncomplemented.
9.20 Realize the function f(a, b, c, d, e) = Σ m(6, 7, 9, 11, 12, 13, 16, 17, 18, 20, 21, 23, 25, 28) using a 16-to-1 MUX with control inputs b, c, d, and e. Each data input should be 0, 1, a, or a′. (Hint: Start with a minterm expansion of F and combine minterms to eliminate a and a′ where possible.) 9.21 Implement a full adder (a) using two 8-to-1 MUXes. Connect X,Y, and Cin to the control inputs of the MUXes and connect 1 or 0 to each data input.
(b) using two 4-to-1 MUXes and one inverter. Connect X and Y to the control inputs of the MUXes, and connect 1’s, 0’s, Cin, or C′in to each data input.
(c) again using two 4-to-1 MUXes, but this time connect Cin and Y to the control inputs of the MUXes, and connect 1’s, 0’s, X, or X′ to each data input. Note that in this fashion, any N-variable logic function may be implemented using a 2(N−1)- to-1 MUX.
9.22 Repeat Problem 9.21 for a full subtracter, except use Bin instead of Cin.
9.23 Make a circuit which gives the absolute value of a 4-bit binary number. Use four full adders, four multiplexers, and four inverters. Assume negative numbers are repre-sented in 2’s complement. Recall that one way to find the 2’s complement of a binary number is to invert all of the bits and then add 1.
9.24 Show how to make a 4-to-1 MUX using four three-state buffers and a decoder.
9.25 Show how to make an 8-to-1 MUX using two 4-to-1 MUXes, two three-state buffers, and one inverter.
9.26 Realize a full subtracter using a 3-to-8 line decoder with inverting outputs and (a) two NAND gates (b) two AND gates Multiplexers, Decoders, and Programmable Logic Devices 289 9.27 Show how to make the 8-to-3 priority encoder of Figure 9-20 using two 4-to-2 prior-ity encoders and any additional necessary gates.
9.28 Design an adder for excess-3 decimal digits (see Table 1-2) using a ROM. Add two excess-3 digits and give the excess-3 sum and a carry. For example, 1010 + 1001 = 0110 with a carry of 1 (7 + 6 = 13). Draw a block diagram showing the required ROM inputs and outputs. What size ROM is required? Indicate how the truth table for the ROM would be specified by giving some typical rows.
9.29 A circuit has four inputs RSTU and four outputs VWYZ. RSTU represents a binary-coded-decimal digit. VW represents the quotient and YZ the remainder when RSTU is divided by 3 (VW and YZ represent 2-bit binary numbers). Assume that invalid inputs do not occur. Realize the circuit using (a) a ROM (b) a minimum two-level NAND-gate circuit (c) a PLA (specify the PLA table) 9.30 Repeat Problem 9.29 if the inputs RSTU represent a decimal digit in Gray code (see Table 1-2).
9.31 (a) Find a minimum two-level NOR-gate circuit to realize F1 and F2. Use as many common gates as possible.
F1(a, b, c, d) = Σ m(1, 2, 4, 5, 6, 8, 10, 12, 14) F2(a, b, c, d) = Σ m(2, 4, 6, 8, 10, 11, 12, 14, 15) (b) Realize F1 and F2 using a PLA. Give the PLA table and internal connection diagram for the PLA.
9.32 Braille is a system which allows a blind person to read alphanumerics by feeling a pattern of raised dots. Design a circuit that converts BCD to Braille. The table shows the correspondence between BCD and Braille.
(a) Use a multiple-output NAND-gate circuit.
290 Unit 9 (b) Use a PLA. Give the PLA table.
(c) Specify the connection pattern for the PLA.
9.33 (a) Implement your solution to Problem 7 .10 using a PLA. Specify the PLA table and draw the internal connection diagram for the PLA using dots to indicate the presence of switching elements.
(b) Repeat (a) for Problem 7 .44.
(c) Repeat (a) for Problem 7 .47 .
9.34 Show how to make an 8-to-1 MUX using a PAL. Assume that PAL has 14 inputs and six outputs and assume that each output OR gate may have up to four AND terms as inputs, as in Figure 9-33. (Hint: Wire some outputs of the PAL around to the inputs, external to the PAL. Some PALs allow this inside the PAL to save inputs.) 9.35 Work Problem 9.34 but make the 8-to-3 priority encoder of Figure 9-20 instead of a MUX.
9.36 The function F = CD′E + CDE + A′D′E + A′B′DE′ + BCD is to be implemented in an FPGA which uses 3-variable lookup tables.
(a) Expand F about the variables A and B.
(b) Expand F about the variables B and C.
(c) Expand F about the variables A and C.
(d) Any 5-variable function can be implemented using four 3-variable lookup tables and a 4-to-1 MUX, but this time we are lucky. Use your preceding answers to implement F using only three 3-variable lookup tables and a 4-to-1 MUX. Give the truth tables for the lookup tables.
9.37 Work Problem 9.36 for F = B′D′E′ + AB′C + C′DE′ + A′BC′D.
9.38 Implement a 4-to-1 MUX using a CLB of the type shown in Figure 9-37 . Specify the function realized by each function generator.
9.39 Realize the function f(A, B, C, D) = A′C′ + AB′D′ + ACD + A′BD.
(a) Use a single 8-to-1 multiplexer with an active low enable and an active high output. Use A, C, and D as the select inputs where A is the most significant and D is the least significant.
(b) Repeat part (a) assuming the multiplexer enable is active high and output is active low.
(c) Use a single 4-to-1 multiplexer with an active low enable and an active high output and a minimum of additional gates. Show the function expansion both algebraically and on a Karnaugh map.
9.40 Repeat Problem 9.39 for the function f(A, B, C, D, E) = A′C′E′ + A′B′D′E′ + ACDE′ + A′BDE′.
Multiplexers, Decoders, and Programmable Logic Devices 291 9.41 F(a, b, c, d) = a′ + ac′d′ + b′cd′ + ad.
(a) Using Shannon’s expansion theorem, expand F about the variable d.
(b) Use the expansion in part (a) to realize the function using two 3-variable LUTs and a 2-to-1 MUX. Specify the LUT inputs.
(c) Give the truth table for each LUT.
9.42 Repeat 9.41 for F(a, b, c, d) = cd′ + ad′ + a′b′cd + bc′.
9.43 Repeat 9.41 for F(a, b, c, d) = bd + bc′ + ac′d + a′d′.
9.44 The module M below is a demultiplexer (i.e., it routes the input w to one of the four outputs depending on the value of the select lines s and t; thus, an output is 0 or equal to input w depending on the value of s and t). The outputs of module M can be ORed to realize functions of the inputs.
(a) Show how to realize the function f(a, b, c) = ab′ + b′c′ using one module M and one OR-gate. (Assume that the inputs are available in both true and comple-ment form.) (b) Using just one module M and one OR gate, is it possible to realize any arbitrary three-variable function? (Again assume inputs are available in both true and complement form.) Justify your answer.
(c) Can the function of part (a) be realized with one module M and one NOR gate? Verify your answer.
(d) If the outputs of module M are active-low, to what type of gate should the out-puts connect to realize nontrivial functions? (Note: The outputs not selected are logic 1 and the selected output is w′.) 9.45 The circuit below has a 4-input priority encoder connected to a 2-to-4 decoder with enable. The truth table for the priority encoder is given. (The I3 input is highest pri-ority.) All signals are active high. What functions of A, B, C, and D are realized by Z3, Z2, Z1, and Z0?
s t y3=w if st =11 y2=w if st = 10 w M y1=w if st =01 y0=w if st = 00 (a) (b) Priority Encoder Y1 Y0 G A B 2-to-4 Decoder Z3 Z2 Z1 Z0 S0 S1 I3 I2 I1 I0 C D E I3 I2 I1 I0 G Y1 Y0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 1 – 1 0 1 0 1 – – 1 1 0 1 – – – 1 1 1 292 Unit 9 9.46 The circuit below has a 2-to-4 decoder with active high outputs connected to a 4-to-1 MUX with an active low output.
(a) Derive a minimum SOP or a minimum POS expression for the output, f(A, B, C, D).
(b) Repeat part (a) assuming the decoder outputs are active low.
9.47 The Max Selector below has two 4-bit, unsigned inputs, A and B. Its output Z = A if A ≥B and Z = B if A < B.
(a) Design the Max Selector in the form shown. The Mi are identical, and a single line connects them with information flowing from right to left. Do one design assuming c0 = 0 and one assuming c0 = 1.
(b) What is the relationship between the design of part (a) and adder or subtractor circuits?
C D B A S1 Y0 Y1 Y2 Y3 I0 I1 f S1 S0 I2 I3 2-to-4 Decoder 4-to-1 MUX S0 A B 4 4 4 Z Max Selector c0 c4 c3 c2 c1 a3 b3 a2 b2 a1 b1 a0 b0 2-to-1 MUX A B 4 4 4 Z M3 M2 M1 M0 S Multiplexers, Decoders, and Programmable Logic Devices 293 (c) Consider an alternative design of the Max Selector where the information flow is from left to right as shown. Can the Max Selector be designed in this form? If yes, complete the design. If no, explain why not and explain what change would be required (with information only flowing from left to right between the modules).
9.48 (a) Show that the full adder of Figure 4-5 can be implemented using two 2-input exclusive-OR gates and a 2-to-1 multiplexer. (Hint: Rewrite Equation (4-21) in terms of X ⊕ Y.) (b) Assume the ripple-carry adder of Figure 4-3 and the full adder of part (a) are implemented using CMOS logic. Which adder would have the smallest max-imum addition time? Explain. (You need to be familiar with the material in Appendix A to answer this question.) 9.49 Repeat Problem 9.48 for the full subtractor of Table 4-6.
c4 c3 c2 c1 c0 a3 b3 a2 b2 a1 b1 a0 b0 2-to-1 Mux A B 4 4 4 Z S M3 M2 M1 M0 294 Introduction to VHDL U N I T 10 Objectives 1. Represent gates and combinational logic by concurrent VHDL statements.
2. Given a set of concurrent VHDL statements, draw the corresponding combinational logic circuit.
3. Write a VHDL module for a combinational circuit a. by using concurrent VHDL statements to represent logic equations b. by interconnecting VHDL components 4. Compile and simulate a VHDL module.
5. Use the basic VHDL operators and understand their order of precedence.
6. Use the VHDL types: bit, bit_vector, Boolean, and integer. Define and use an array_type.
7. Use IEEE Standard Logic. Use std_logic_vectors, together with overloaded operators, to perform arithmetic operations.
Introduction to VHDL 295 (d) Write a VHDL statement to implement A = B ⊕ C without using the xor or xnor operator. Do not include gate delays.
(e) Work Problems 10.1 and 10.2.
2. Study Section 10.2, VHDL Models for Multiplexers.
(a) Implement the following VHDL conditional assignment statement, using a 2-to-1 MUX: F <= A when C = ‘1’ else B; (b) Write a VHDL conditional assignment statement that represents the 4-to-1 MUX of Figure 9-2. Assume I0 = 1, I1 = 0, and I2 = I3 = C.
(c) Write a VHDL selected signal assignment for the same circuit as in (b).
3. Study Section 10.3, VHDL Modules, and Section 10.4, Signals and Constants.
(a) Write an entity for the module MOD1. A, B, C, D, and E are all of type bit.
M 1 M 0 5 10 15 20 25 t (ns) Study Guide 1. Study Section 10.1, VHDL Description of Combinational Circuits.
(a) Draw a circuit that corresponds to the following VHDL statements: C <= not A; D <= C and B; (b) If A changes at time 5 ns, at what time do each of the following concurrent statements execute? At what times are C and D updated?
C <= A; D <= A; (c) Write a VHDL statement that corresponds to the following circuit. The inverter has a delay of 5 ns. Draw the waveform for M assuming that M is initially 0.
A B C D E VHDL Module MOD1 296 Unit 10 (b) Write the architecture for MOD1 if D = ABC and E = D′.
(c) What changes must be made in the code of Figure 10-12 to implement a 5-bit adder?
(d) Given the concurrent VHDL statements R <= A after 5 ns; -- statement 1 S <= R after 10 ns; -- statement 2 If A changes at time 3 ns, at what time will statement 1 be executed?
At what time will R be updated?
At what time will statement 2 be executed?
At what time will S be updated?
Answers: 3 ns, 8 ns, 8 ns, and 18 ns (e) Write a statement that defines a bit_vector constant C1 equal to 10101011.
(f ) The circuit of Figure 8-5 is implemented as a module without gate delays as follows.
(In the figure, B is set to 1 and C is set to 0, but here, assume they are inputs.) entity fig8_5 is port (A, B, C: in bit; G2: out bit); end fig8_5; architecture circuit of fig8_5 is begin G2 <= not(C or (A and B)); end circuit; Each gate in Figure 8-5 has a delay of 20 ns. Modify the module to include gate delays. (Hint: You will need a signal declaration to introduce G1 as an internal signal.) (g) Work Problems 10.3 and 10.4.
4. Study Section 10.5, Arrays.
(a) Write VHDL statements that define a ROM that is 16 words of 8 bits each. Leave the values stored in the ROM unspecified.
(b) Work Problem 10.5.
Introduction to VHDL 297 5. Study Section 10.6, VHDL Operators.
(a) For each of the following statements, eliminate one set of parentheses with-out changing the order of operation.
(i) not ((A & B) xor “10”) (ii) (not (A & B) xor “10”) (b) If A(0 to 7) = “11011011”, what will be the result of executing the follow-ing concurrent statement?
B <= A(6 to 7)&A(0 to 5); What problem will occur when the following concurrent statement is executed?
A <= A(6 to 7)&A(0 to 5); (Hint: A concurrent statement executes every time the right-hand side changes.) (c) Work Problem 10.6(a).
6. Study Section 10.7 , Packages and Libraries. Give the entity and architecture that describes a three-input AND gate with 2-ns delay. Assume that all signals are of type bit.
7. Study Section 10.8, IEEE Standard Logic.
(a) Suppose A, B, C, D, E, and F are of type std_logic. If the following concur-rent statements are executed, what are the values of A, B, C, D, E, and F?
A <= ‘1’; A <= ‘Z’; B <= ‘0’; B <= A; C <= ‘0’; D <= A when C = ‘0’ else ‘Z’; D <= C when C = ‘1’ else ‘Z’; E <= ‘0’ when A = ‘1’ else C; E <= A when C = ‘0’ else ‘1’; F <= ‘1’ when A = ‘1’ and C = ‘1’ else ‘Z’; F <= ‘0’ when A = ‘0’ and C = ‘0’ else ‘Z’; (b) Given the concurrent statements F <= ‘0’; F <= ‘1’ after 2 ns; What will happen if F is of type bit? What if F is of type std_logic?
(c) Suppose in Figure 10-19 that A is 1011, B is 0111, and Cin is 1. What is Addout? Sum? Cout?
298 Unit 10 (d) If A is a 6-bit std_logic_vector and B is a 4-bit std_logic_vector, write con-current VHDL statements that will add A and B to result in a 6-bit sum and a carry.
(e) Draw a circuit that implements the following VHDL code: signal A, B, C, D: std_logic_vector(1 to 3); signal E, F, G: std_logic; -----------------------------------------------------D <= A when E = ‘1’ else “ZZZ”; D <= B when F = ‘1’ else “ZZZ”; D <= C when G = ‘1’ else “ZZZ”; (f ) Work Problems 10.6(b), 10.7 , and 10.8.
8. Before you take the test on Unit 10, pick up a lab assignment sheet and work the assigned lab problems. Turn in your VHDL code and simulation results.
Introduction to VHDL As integrated circuit technology has improved to allow more and more components on a chip, digital systems have continued to grow in complexity. As digital systems have become more complex, detailed design of the systems at the gate and flip-flop level has become very tedious and time consuming. For this reason, the use of hard-ware description languages in the digital design process continues to grow in impor-tance. A hardware description language allows a digital system to be designed and debugged at a higher level before implementation at the gate and flip-flop level. The use of computer-aided design tools to do this conversion is becoming more wide-spread. This is analogous to writing software programs in a high-level language such as C and then using a compiler to convert the programs to machine language. The two most popular hardware description languages are VHDL and Verilog.
Introduction to VHDL 299 VHDL is a hardware description language that is used to describe the behav-ior and structure of digital systems. The acronym VHDL stands for VHSIC Hardware Description Language, and VHSIC in turn stands for Very High Speed Integrated Circuit. However, VHDL is a general-purpose hardware description language which can be used to describe and simulate the operation of a wide variety of digital systems, ranging in complexity from a few gates to an intercon-nection of many complex integrated circuits. VHDL was originally developed to allow a uniform method for specifying digital systems. The VHDL language became an IEEE standard in 1987 , and it is widely used in industry. IEEE pub-lished a revised VHDL standard in 1993, and the examples in this text conform to that standard.
VHDL can describe a digital system at several different levels—behavioral, data flow, and structural. For example, a binary adder could be described at the behavioral level in terms of its function of adding two binary numbers, without giving any implementation details. The same adder could be described at the data flow level by giving the logic equations for the adder. Finally, the adder could be described at the structural level by specifying the interconnections of the gates which make up the adder.
VHDL leads naturally to a top-down design methodology in which the system is first specified at a high level and tested using a simulator. After the system is debugged at this level, the design can gradually be refined, eventually leading to a structural description which is closely related to the actual hardware implementa-tion. VHDL was designed to be technology independent. If a design is described in VHDL and implemented in today’s technology, the same VHDL description could be used as a starting point for a design in some future technology.
In this chapter, we introduce VHDL and illustrate how we can describe simple combinational circuits using VHDL. We will use VHDL in later units to design sequential circuits and more complex digital systems. In Unit 17 , we introduce the use of CAD software tools for automatic synthesis from VHDL descriptions. These synthesis tools will derive a hardware implementation from the VHDL code.
10.1 VHDL Description of Combinational Circuits We begin by describing a simple gate circuit using VHDL. A VHDL signal is used to describe a signal in a physical system. (Section 10.4 contains a summary of signals, constants, and types. The VHDL language also includes variables similar to variables in programming languages, but to obtain synthesizable code for hardware, signals should be used to represent hardware signals. VHDL variables are not used in this text.) The gate circuit of Figure 10-1 has five signals: A, B, C, D, and E. The symbol “<=” is the signal assignment operator which indicates that the value computed on 300 Unit 10 the right-hand side is assigned to the signal on the left side. A behavioral description of the circuit in Figure 10-1 is E <= D or (A and B); Parentheses are used to specify the order of operator execution.
The two assignment statements in Figure 10-1 give a dataflow description of the circuit where it is assumed that each gate has a 5-ns propagation delay. When the statements in Figure 10-1 are simulated, the first statement will be evalu-ated any time A or B changes, and the second statement will be evaluated any time C or D changes. Suppose that initially A = 1, and B = C = D = E = 0. If B changes to 1 at time 0, C will change to 1 at time = 5 ns. Then, E will change to 1 at time = 10 ns.
The circuit of Figure 10-1 can also be described using structural VHDL code. To do so requires that a two-input AND-gate component and a two-input OR-gate component be declared and defined. Components may be declared and defined either in a library or within the architecture part of the VHDL code. (VHDL archi-tectures are discussed in Section 10.3, and packages and libraries are discussed in Section 10.7 .) Instantiation statements are used to specify how components are con-nected. Each copy of a component requires a separate instantiation statement to specify how it is connected to other components and to the port inputs and outputs. An instantiation statement is a concurrent statement that executes anytime one of the input signals in its port map changes. The circuit of Figure 10-1 is described by instantiating the AND gate and the OR gate as follows: Gate1: AND2 port map (A, B, C); Gate2: OR2 port map (C, D, E); The port map for Gate1 connects A and B to the AND-gate inputs, and it con-nects D to the AND-gate output. Since an instantiation statement is concurrent, whenever A or B changes, these changes go to the Gate1 inputs, and then the com-ponent computes a new value of C. Similarly, the second statement passes changes in C or D to the Gate2 inputs, and then the component computes a new value of E. This is exactly how the real hardware works. (The order in which the instantiation statements appear is irrelevant.) Instantiating a component is different than calling a function in a computer program. A function returns a new value whenever it is called, but an instantiated component computes a new output value whenever its input changes.
VHDL signal assignment statements, such as the ones in Figure 10-1, are exam-ples of concurrent statements. The VHDL simulator monitors the right side of each concurrent statement, and any time a signal changes, the expression on the right side is immediately re-evaluated. The new value is assigned to the signal on the left side FIGURE 10-1 Gate Circuit © Cengage Learning 2014 C <= A and B after 5 ns; E <= C or D after 5 ns; A B D C E Introduction to VHDL 301 FIGURE 10-2 Inverter with Feedback © Cengage Learning 2014 CLK CLK 10 20 30 40 60 50 CLK <= not CLK after 10 ns; after an appropriate delay. This is exactly the way the hardware works. Any time a gate input changes, the gate output is recomputed by the hardware, and the output changes after the gate delay.
When we initially describe a circuit, we may not be concerned about propagation delays. If we write C <= A and B; E <= C or D; this implies that the propagation delays are 0 ns. In this case, the simulator will assume an infinitesimal delay referred to as Δ (delta). Assume that initially A = 1 and B = C = D = E = 0. If B is changed to 1 at time = 1 ns, then C will change at time 1 + Δ and E will change at time 1 + 2Δ.
Unlike a sequential program, the order of the above concurrent statements is unimportant. If we write E <= C or D; C <= A and B; the simulation results would be exactly the same as before.
In general, a signal assignment statement has the form signal_name <= expression [after delay]; The expression is evaluated when the statement is executed, and the signal on the left side is scheduled to change after delay. The square brackets indicate that after delay is optional; they are not part of the statement. If after delay is omitted, then the signal is scheduled to be updated after a delta delay. Note that the time at which the statement executes and the time at which the signal is updated are not the same.
Even if a VHDL program has no explicit loops, concurrent statements may exe-cute repeatedly as if they were in a loop. Figure 10-2 shows an inverter with the output connected back to the input. If the output is ‘0’, then this ‘0’ feeds back to the input and the inverter output changes to ‘1’ after the inverter delay, assumed to be 10 ns. Then, the ‘1’ feeds back to the input, and the output changes to ‘0’ after the inverter delay. The signal CLK will continue to oscillate between ‘0’ and ‘1’, as shown in the waveform. The corresponding concurrent VHDL statement will produce the same result. If CLK is initialized to ‘0’, the statement executes and CLK changes to ‘1’ after 10 ns. Because CLK has changed, the statement executes again, and CLK will change back to ‘0’ after another 10 ns. This process will continue indefinitely.
302 Unit 10 The statement in Figure 10-2 generates a clock waveform with a half period of 10 ns. On the other hand, the concurrent statement CLK <= not CLK; will cause a run-time error during simulation. Because there is 0 delay, the value of CLK will change at times 0 + Δ, 0 + 2Δ, 0 + 3Δ, etc. Because Δ is an infinitesimal time, time will never advance to 1 ns.
In general, VHDL is not case sensitive, that is, capital and lower case letters are treated the same by the compiler and the simulator. Thus, the statements Clk <= NOT clk After 10 NS; and CLK <= not CLK after 10 ns; would be treated exactly the same. Signal names and other VHDL identifiers may contain letters, numbers, and the underscore character (). An identifier must start with a letter, and it cannot end with an underscore. Thus, C123 and ab_23 are legal identifiers, but 1ABC and ABC_ are not. Every VHDL statement must be termi-nated with a semicolon. Spaces, tabs, and carriage returns are treated in the same way. This means that a VHDL statement can be continued over several lines, or sev-eral statements can be placed on one line. In a line of VHDL code, anything follow-ing a double dash (--) is treated as a comment. Words such as and, or, and after are reserved words (or keywords) which have a special meaning to the VHDL compiler. In this text, we will put all reserved words in boldface type.
Figure 10-3 shows three gates that have the signal A as a common input and the corresponding VHDL code. The three concurrent statements execute simultane-ously whenever A changes, just as the three gates start processing the signal change at the same time. However, if the gates have different delays, the gate outputs can change at different times. If the gates have delays of 2 ns, 1 ns, and 3 ns, respectively, and A changes at time 5 ns, then the gate outputs D, E, and F can change at times 7 ns, 6 ns, and 8 ns, respectively. The VHDL statements work in the same way. Even though the statements execute simultaneously, the signals D, E, and F are updated at times 7 ns, 6 ns, and 8 ns. However, if no delays were specified, then D, E, and F would all be updated at time 5 + Δ.
In these examples, every signal is of type bit, which means it can have a value of ‘0’ or ‘1’. (Bit values in VHDL are enclosed in single quotes to distinguish them from integer values.) In digital design, we often need to perform the same operation on a group of signals. A one-dimensional array of bit signals is referred to as a bit-vector. If a 4-bit vector named B has an index range 0 through 3, then the four elements of the bit-vector are designated B(0), B(1), B(2), and B(3). The statement B <= “0110” assigns ‘0’ to B(0), ‘1’ to B(1), ‘1’ to B(2), and ‘0’ to B(3).
FIGURE 10-3 Three Gates with a Common Input and Different Delays © Cengage Learning 2014 B C A D E F -- when A changes, these concurrent -- statements all execute at the same time D <= A and B after 2 ns; E <= not A after 1 ns; F <= A or C after 3 ns; Introduction to VHDL 303 FIGURE 10-4 Array of AND Gates © Cengage Learning 2014 A(3) B(3) C(3) A(2) B(2) C(2) A(1) B(1) C(1) A(0) B(0) C(0) -- the hard way C(3) <= A(3) and B(3); C(2) <= A(2) and B(2); C(1) <= A(1) and B(1); C(0) <= A(0) and B(0); -- the easy way C <= A and B; Figure 10-4 shows an array of four AND gates. The inputs are represented by bit-vectors A and B, and the outputs by bit-vector C. Although we can write four VHDL statements to represent the four gates, it is much more efficient to write a single VHDL statement that performs the and operation on the bit-vectors A and B. When applied to bit-vectors, the and operator performs the and operation on correspond-ing pairs of elements.
The preceding signal assignment statements containing “after delay” create what is called an inertial delay model. Consider a device with an inertial delay of D time units. If an input change to the device will cause its output to change, then the output changes D time units later. However, this is not what happens if the device receives two input changes within a period of D time units and both input changes should cause the output to change. In this case the device output does not change in response to either input change. As an example, consider the signal assignment C <= A and B after 10 ns; Assume A and B are initially 1, and A changes to 0 at 15 ns, to 1 at 30 ns, and to 0 at 35 ns. Then C changes to 1 at 10 ns and to 0 at 25 ns, but C does not change in response to the A changes at 30 ns and 35 ns because these two changes occurred less than 10 ns apart. A device with an inertial delay of D time units filters out output changes that would occur in less than or equal to D time units.
VHDL can also model devices with an ideal (transport) delay. Output changes caused by input changes to a device exhibiting an ideal (transport) delay of D time units are delayed by D time units, and the output changes occur even if they occur within D time units. The VHDL signal assignment statement that models ideal (transport) delay is signal_name <= transport expression after delay As an example, consider the signal assignment C <= transport A and B after 10 ns; Assume A and B are initially 1 and A changes to 0 at 15 ns, to 1 at 30 ns, and to 0 at 35 ns. Then C changes to 1 at 10 ns, to 0 at 25 ns, to 1 at 40 ns, and to 0 at 45 ns. Note that the last two changes are separated by just 5 ns.
304 Unit 10 10.2 VHDL Models for Multiplexers Figure 10-5 shows a 2-to-1 multiplexer (MUX) with two data inputs and one control input. The MUX output is F = A′·I0 + A·I1. The corresponding VHDL statement is F <= (not A and I0) or (A and I1); Alternatively, we can represent the MUX by a conditional signal assignment state-ment, as shown in Figure 10-5. This statement executes whenever A, I0, or I1 changes. The MUX output is I0 when A = ‘0’, and else it is I1. In the conditional statement, I0, I1, and F can either be bits or bit-vectors.
The general form of a conditional signal assignment statement is signal_name <= expression1 when condition1 else expression2 when condition2 [else expressionN]; This concurrent statement is executed whenever a change occurs in a signal used in one of the expressions or conditions. If condition1 is true, signal_name is set equal to the value of expression1, or else if condition2 is true, signal_name is set equal to the value of expression2, etc. The line in square brackets is optional. Figure 10-6 shows how two cascaded MUXes can be represented by a conditional signal assignment statement. The output MUX selects A when E = ‘1’; or else it selects the output of the first MUX, which is B when D = ‘1’, or else it is C.
Figure 10-7 shows a 4-to-1 MUX with four data inputs and two control inputs, A and B. The control inputs select which one of the data inputs is transmitted to the output. The logic equation for the 4-to-1 MUX is F = A′B′Ι0 + A′BI1 + AB′I2 + ABI3 Thus, one way to model the MUX is with the VHDL statement F <= (not A and not B and I0) or (not A and B and I1) or (A and not B and I2) or (A and B and I3); FIGURE 10-5 2-to-1 Multiplexer © Cengage Learning 2014 A F I0 I1 0 1 -- conditional signal assignment statement F <= I0 when A = '0' else I1; FIGURE 10-6 Cascaded 2-to-1 MUXes © Cengage Learning 2014 D C B 0 1 E F A 0 1 F <= A when E = '1' else B when D = '1' else C; Introduction to VHDL 305 Another way to model the 4-to-1 MUX is to use a conditional assignment statement: F <= I0 when A&B = “00” else I1 when A&B = “01” else I2 when A&B = “10” else I3; The expression A&B means A concatenated with B, that is, the two bits A and B are merged together to form a 2-bit vector. This bit vector is tested, and the appro-priate MUX input is selected. For example, if A = ‘1’ and B = ‘0’, A&B = “10” and I2 is selected. Instead of concatenating A and B, we could use a more complex condition: F <= I0 when A = ‘0’ and B = ‘0’ else I1 when A = ‘0’ and B = ‘1’ else I2 when A = ‘1’ and B = ‘0’ else I3; A third way to model the MUX is to use a selected signal assignment state-ment, as shown in Figure 10-7 . A&B cannot be used in this type of statement, so we first set Sel equal to A&B. The value of Sel then selects the MUX input that is assigned to F.
The general form of a selected signal assignment statement is with expression_s select signal_s <= expression1 [after delay-time] when choice1, expression2 [after delay-time] when choice2, . . . [expression_n [after delay-time] when others]; This concurrent statement executes whenever a signal changes in any of the expressions. First, expression_s is evaluated. If it equals choice1, signal_s is set equal to expression1; if it equals choice2, signal_s is set equal to expression2; etc. If all possible choices for the value of expression_s are given, the last line should be omit-ted; otherwise, the last line is required. When it is present, if expression_s is not equal to any of the enumerated choices, signal_s is set equal to expression_n. The signal_s is updated after the specified delay-time, or after Δ if the “after delay-time” is omitted.
FIGURE 10-7 4-to-1 Multiplexer © Cengage Learning 2014 A B I0 I1 I2 I3 F MUX sel <= A&B -- selected signal assignment statement with sel select F <= I0 when "00", I1 when "01", I2 when "10", I3 when "11"; 306 Unit 10 10.3 VHDL Modules To write a complete VHDL module, we must declare all of the input and output signals using an entity declaration, and then specify the internal operation of the module using an architecture declaration. As an example, consider Figure 10-8. The entity declaration gives the name “two_gates” to the module. The port declaration specifies the inputs and outputs to the module. A, B, and D are input signals of type bit, and E is an output signal of type bit. The architecture is named “gates”. The signal C is declared within the architecture because it is an internal signal. The two concurrent statements that describe the gates are placed between the keywords begin and end.
When we describe a system in VHDL, we must specify an entity and an archi-tecture at the top level, and also specify an entity and architecture for each of the component modules that are part of the system (see Figure 10-9). Each entity decla-ration includes a list of interface signals that can be used to connect to other modules or to the outside world. We will use entity declarations of the form: entity entity-name is [port(interface-signal-declaration);] end [entity] [entity-name]; The items enclosed in square brackets are optional. The interface-signal-declaration normally has the following form: list-of-interface-signals: mode type [: = initial-value] {; list-of-interface-signals: mode type [: = initial-value]}; FIGURE 10-8 VHDL Module with Two Gates © Cengage Learning 2014 entity two_gates is port (A,B,D: in bit; E: out bit); end two_gates; architecture gates of two_gates is signal C: bit; begin C <= A and B; -- concurrent E <= C or D; -- statements end gates; A B D C E FIGURE 10-9 VHDL Program Structure © Cengage Learning 2014 ...
Entity Architecture Module 1 Entity Architecture Module 2 Entity Architecture Entity Architecture Module N Introduction to VHDL 307 The curly brackets indicate zero or more repetitions of the enclosed clause. Input signals are of mode in, output signals are of mode out, and bi-directional signals (see Figure 9-16) are of mode inout.
So far, we have only used type bit and bit_vector; other types are described in Section 10.4. The optional initial-value is used to initialize the signals on the associ-ated list; otherwise, the default initial value is used for the specified type. For exam-ple, the port declaration port(A, B: in integer : = 2; C, D: out bit); indicates that A and B are input signals of type integer that are initially set to 2, and C and D are output signals of type bit that are initialized by default to ‘0’.
Associated with each entity is one or more architecture declarations of the form architecture architecture-name of entity-name is [declarations] begin architecture body end [architecture] [architecture-name]; In the declarations section, we can declare signals and components that are used within the architecture. The architecture body contains statements that describe the operation of the module.
Next, we will write the entity and architecture for a full adder module (refer to Section 4.7 for a description of a full adder). The entity specifies the inputs and out-puts of the adder module, as shown in Figure 10-10. The port declaration specifies that X, Y and Cin are input signals of type bit, and that Cout and Sum are output signals of type bit.
The operation of the full adder is specified by an architecture declaration: In this example, the architecture name (Equations) is arbitrary, but the entity name (FullAdder) must match the name used in the associated entity declaration. FIGURE 10-10 Entity Declaration for a Full Adder Module © Cengage Learning 2014 X Y Cin Cout Sum Full Adder entity FullAdder is port (X,Y,Cin: in bit; -- Inputs Cout, Sum: out bit); -- Outputs end FullAdder; architecture Equations of FullAdder is begin -- concurrent assignment statements Sum <= X xor Y xor Cin after 10 ns; Cout <= (X and Y) or (X and Cin) or (Y and Cin) after 10 ns; end Equations; 308 Unit 10 The VHDL assignment statements for Sum and Cout represent the logic equations for the full adder. Several other architectural descriptions such as a truth table or an interconnection of gates could have been used instead. In the Cout equation, paren-theses are required around (X and Y) because VHDL does not specify an order of precedence for the logic operators.
Four-Bit Full Adder Next, we will show how to use the FullAdder module defined above as a com-ponent in a system which consists of four full adders connected to form a 4-bit binary adder (see Figure 10-11). We first declare the 4-bit adder as an entity (see Figure 10-12). Because the inputs and the sum output are four bits wide, we declare them as bit_vectors which are dimensioned 3 downto 0. (We could have used a range 1 to 4 instead.) Next, we specify the FullAdder as a component within the architecture of Adder4 (Figure 10-12). The component specification is very similar to the entity declaration for the full adder, and the input and output port signals correspond to those declared for the full adder. Following the component statement, we declare a 3-bit internal carry signal C.
In the body of the architecture, we create several instances of the FullAdder component. (In CAD jargon, we instantiate four copies of the FullAdder.) Each copy of FullAdder has a name (such as FA0) and a port map. The signal names following the port map correspond one-to-one with the signals in the component port. Thus, A(0), B(0), and Ci correspond to the inputs X, Y, and Cin, respectively. C(1) and S(0) correspond to the Cout and Sum outputs. Note that the order of the signals in the port map must be the same as the order of the signals in the port of the component declaration.
In preparation for simulation, we can place the entity and architecture for the FullAdder and for Adder4 together in one file and compile. Alternatively, we could compile the FullAdder separately and place the resulting code in a library which is linked in when we compile Adder4.
All of the simulation examples in this text use the ModelSim simulator from Model Tech. Most other VHDL simulators use similar command files and can FIGURE 10-11 4-Bit Binary Adder © Cengage Learning 2014 Full Adder Co A3 B3 S3 Full Adder C3 A2 B2 S2 Full Adder C2 A1 B1 S1 Full Adder C1 A0 B0 S0 Ci Introduction to VHDL 309 produce output in a similar format. We will use the following simulator commands to test Adder4: We have chosen to run the simulation for 50 ns because this is more than enough time for the carry to propagate through all of the full adders. The simulation results for the above command list are: ns delta a b co c ci s 0 +0 0000 0000 0 000 0 0000 0 +1 1111 0001 0 000 1 0000 10 +0 1111 0001 0 001 1 1111 20 +0 1111 0001 0 011 1 1101 30 +0 1111 0001 0 111 1 1001 40 +0 1111 0001 1 111 1 0001 50 +0 0101 1110 1 111 0 0001 60 +0 0101 1110 1 110 0 0101 70 +0 0101 1110 1 100 0 0111 80 +0 0101 1110 1 100 0 0011 FIGURE 10-12 Structural Description of 4-Bit Adder © Cengage Learning 2014 entity Adder4 is port (A, B: in bit_vector(3 downto 0); Ci: in bit; -- Inputs S: out bit_vector(3 downto 0); Co: out bit); -- Outputs end Adder4; architecture Structure of Adder4 is component FullAdder port (X, Y, Cin: in bit; -- Inputs Cout, Sum: out bit); -- Outputs end component; signal C: bit_vector(3 downto 1); begin -- instantiate four copies of the FullAdder FA0: FullAdder port map (A(0), B(0), Ci, C(1), S(0)); FA1: FullAdder port map (A(1), B(1), C(1), C(2), S(1)); FA2: FullAdder port map (A(2), B(2), C(2), C(3), S(2)); FA3: FullAdder port map (A(3), B(3), C(3), Co, S(3)); end Structure; add list A B Co C Ci S -- put these signals on the output list force A 1111 -- set the A inputs to 1111 force B 0001 -- set the B inputs to 0001 force Ci 1 -- set Ci to 1 run 50 ns -- run the simulation for 50 ns force Ci 0 force A 0101 force B 1110 run 50 ns 310 Unit 10 The listing shows how the carry propagates one position every 10 ns. The full adder inputs change at time = Δ: The sum and carry are computed by each FA and appear at the FA outputs 10 ns later: Because the inputs to FA1 have changed, the outputs change 10 ns later: The final simulation results are: 1111 + 0001 + 1 = 0001 with a carry of 1 (at time = 40 ns) and 0101 + 1110 + 0 = 0011 with a carry of 1 (at time = 80 ns) The simulation stops at 80 ns because no further changes occur after that time. For more details on how the simulator handles Δ delays, refer to Section 10.9.
In this section we have shown how to construct a VHDL module using an entity-architecture pair. The 4-bit adder module demonstrates the use of VHDL components to write structural VHDL code. Components used within the architecture are declared at the beginning of the architecture, using a component declaration of the form component component-name port (list-of-interface-signals-and-their-types); end component; FA3 1 0 0 Time = 10 0 0 1 1 1 FA2 1 0 1 FA1 1 0 1 FA0 1 1 1 FA3 1 0 0 Time = 20 0 1 1 1 1 FA2 1 0 1 FA1 1 0 0 FA0 1 1 1 FA3 1 0 0 Time = Δ 0 0 0 1 0 FA2 1 0 0 FA1 1 0 0 FA0 1 1 0 Introduction to VHDL 311 The port clause used in the component declaration has the same form as the port clause used in an entity declaration. The connections to each component used in a circuit are specified by using a component instantiation statement of the form label: component-name port map (list-of-actual-signals); The list of actual signals must correspond one-to-one to the list of interface signals specified in the component declaration.
10.4 Signals and Constants Input and output signals for a module are declared in a port. Signals internal to a module are declared at the start of an architecture, before begin, and can be used only within that architecture. Port signals have an associated mode (usually in or out), but internal signals do not. A signal used within an architecture must be declared either in a port or in the declaration section of an architecture, but it cannot be declared in both places. A signal declaration has the form signal list_of_signal_names: type_name [constraint] [:= initial_value]; The constraint can be an index range like (0 to 5) or (4 downto 1), or it can be a range of values such as range 0 to 7 . Examples: signal A, B, C: bit_vector(3 downto 0):= “1111”; A, B, and C are 4-bit vectors dimensioned 3 downto 0 and initialized to 1111.
signal E, F: integer range 0 to 15; E and F are integers in the range 0 to 15, initialized by default to 0. The compiler or simulator will flag an error if we attempt to assign a value outside the specified range to E or F.
Constants declared at the start of an architecture can be used anywhere within that architecture. A constant declaration is similar to a signal declaration: constant constant_name: type_name [constraint] [:= constant_value]; A constant named limit of type integer with a value of 17 can be defined as constant limit : integer := 17; A constant named delay1 of type time with the value of 5 ns can be defined as constant delay1 : time := 5 ns; This constant could then be used in an assignment statement A <= B after delay1; Once the value of a constant is defined in a declaration statement, unlike a signal, the value cannot be changed by using an assignment statement.
Signals and constants can have any one of the predefined VHDL types, or they can have a user-defined type. Some of the predefined types are 312 Unit 10 Note that the integer range for VHDL is symmetrical even though the range for a 32-bit 2’s complement integer is −231 to + (231 − 1).
A common user-defined type is the enumeration type in which all of the values are enumerated. For example, the declarations type state_type is (S0, S1, S2, S3, S4, S5); signal state : state_type := S1; define a signal called state which can have any one of the values S0, S1, S2, S3, S4, or S5 and which is initialized to S1. If no initialization is given, the default initialization is the left most element in the enumeration list, S0 in this example. If we declare the signal state as shown, the following assignment statement sets state to S3: state <= S3; VHDL is a strongly typed language so signals of different types generally cannot be mixed in the same assignment statement, and no automatic type conversion is per-formed. Thus the statement A <= B or C is only valid if A, B, and C all have the same type or closely related types.
10.5 Arrays In order to use an array in VHDL, we must first declare an array type, and then declare an array object. For example, the following declaration defines a one-dimensional array type named SHORT_WORD: type SHORT_WORD is array (15 downto 0) of bit; An array of this type has an integer index with a range from 15 downto 0, and each element of the array is of type bit.
Next, we will declare array objects of type SHORT_WORD: signal DATA_WORD: SHORT_WORD; signal ALT_WORD: SHORT_WORD := “0101010101010101”; constant ONE_WORD: SHORT_WORD := (others => ‘1’); Definition bit ‘0’ or ‘1’ boolean FALSE or TRUE integer an integer in the range −(231 −1) to + (231 −1) (some implementations support a wider range) positive an integer in the range 1 to 231 −1 (positive integers) natural an integer in the range 0 to 231 −1 (positive integers and zero) real floating-point number in the range −1.0E38 to + 1.0E38 character any legal VHDL character including upper- and lower case letters, digits, and special characters; each printable character must be enclosed in single quotes, e.g., ‘d’, ‘7’, ‘+’ time an integer with units fs, ps, ns, us, ms, sec, min, or hr Introduction to VHDL 313 DATA_WORD is a signal array of 16 bits, indexed 15 downto 0, which is initial-ized (by default) to all ‘0’ bits. ALT_WORD is a signal array of 16 bits which is ini-tialized to alternating 0’s and 1’s. ONE_WORD is a constant array of 16 bits; all bits are set to ‘1’ by others => ‘1’). Because none of the bits have been set individually,1 in this case others applies to all of the bits.
We can reference individual elements of the array by specifying an index value. For example, ALT_WORD(0) accesses the far right bit of ALT_WORD. We can also specify a portion of the array by specifying an index range: ALT_WORD(5 downto 0) accesses the low order six bits of ALT_WORD, which have an initial value of 010101.
The array type and array object declarations illustrated above have the general forms: type array_type_name is array index_range of element_type; signal array_name: array_type_name [ := initial_values ]; In this declaration, signal may be replaced with constant.
Multidimensional array types may also be defined with two or more dimensions. The following example defines a two-dimensional array signal which is a matrix of integers with four rows and three columns: type matrix4x3 is array (1 to 4, 1 to 3) of integer; signal matrixA: matrix4x3 := ((1,2,3),(4,5,6),(7,8,9),(10,11,12)); The signal matrixA, will be initialized to 1 2 3 4 5 6 7 8 9 10 11 12 ¥ The array element matrixA(3,2) references the element in the third row and second col-umn, which has a value of 8. The statement B <= matrixA (2,3) assigns a value of 6 to B.
When an array type is declared, the dimensions of the array may be left unde-fined. This is referred to as an unconstrained array type. For example, type intvec is array (natural range <>) of integer; declares intvec as an array type which defines a one-dimensional array of integers with an unconstrained index range of natural numbers. The default type for array indices is integer, but another type may be specified. Because the index range is not specified in the unconstrained array type, the range must be specified when the array object is declared. For example, signal intvec5: intvec(1 to 5) := (3,2,6,8,1); defines a signal array named intvec5 with an index range of 1 to 5, which is initialized to 3, 2, 6, 8, 1. The following declaration defines matrix as a two-dimensional array with unconstrained row and column index ranges: type matrix is array (natural range <>, natural range <>) of integer; 1See Reference [1, p. 86] for information on how to set individual bits.
314 Unit 10 Predefined unconstrained array types in VHDL include bit_vector and string, which are defined as follows: type bit_vector is array (natural range <>) of bit; type string is array (positive range <>) of character; The characters in a string literal must be enclosed in double quotes. For example, “This is a string.” is a string literal. The following example declares a constant string1 of type string: constant string1: string(1 to 29) := “This string is 29 characters.” A bit_vector literal may be written either as a list of bits separated by commas or as a string. For example, (‘1’,‘0’,‘1’,‘1’,‘0’) and “10110” are equivalent forms. The following declares a constant A which is a bit_vector with a range 0 to 5.
constant A : bit_vector(0 to 5) := “101011”; A truth table can be implemented using a ROM (read-only memory) as illustrated in Figure 9-21. If we represent the ROM outputs by a bit_vector, F(0 to 3), we can rep-resent the truth table that is stored in the ROM by an array of bit_vectors. The VHDL code for this ROM is given in Figure 10-13. The port declaration (line 4) defines the inputs and outputs for the ROM. The type declaration (line 7) defines an array with 8 rows where each row is 4 bits wide. Line 8 declares ROM1 to be an array of this type with binary data stored in each row. Line 9 declares an integer called index. This index will be used to select one of the 8 rows in the ROM1 array. In line 11, this index is formed by concatenating the three input bits to form a 3-bit vector, and this vector is converted to an integer. The data is read from the ROM1 array in line 13. For example, if A = ‘1’, B = ‘0’, and C = ‘1’, index = 5, and “0001” is read from the ROM. Lines 1 and 2 allow us to use the vec2int function, which is defined in a library named BITLIB.
FIGURE 10-13 VHDL Description of a ROM 1 library BITLIB; 2 use BITLIB.bit_pack.all; 3 entity ROM9_17 is 4 port (A, B, C: in bit; F: out bit_vector(0 to 3)); 5 end entity; 6 architecture ROM of ROM9_17 is 7 type ROM8X4 is array (0 to 7) of bit_vector(0 to 3); 8 constant ROM1: ROM8X4 : (“1010”, “1010”, “0111”, “0101”, “1100”, “0001”, “1111”, “0101”); 9 signal index: Integer range 0 to 7; 10 begin 11 index vec2int(A&B&C); -- A&B&C Is a 3-bit vector 12 -- vec2int is a function that converts this vector to an integer 13 F ROM1 (index); 14 -- this statement reads the output from the ROM 15 end ROM; © Cengage Learning 2014 Introduction to VHDL 315 10.6 VHDL Operators Predefined VHDL operators can be grouped into seven classes: 1. binary logical operators: and or nand nor xor xnor 2. relational operators: = /= < <= > >= 3. shift operators: sll srl sla sra rol ror 4. adding operators: + − & (concatenation) 5. unary sign operators: + − 6. multiplying operators: / mod rem 7. miscellaneous operators: not abs When parentheses are not used, operators in class 7 have highest precedence and are applied first, followed by class 6, then class 5, etc. Class 1 operators have lowest prece-dence and are applied last. Operators in the same class have the same precedence and are applied from left to right in an expression. The precedence order can be changed by using parentheses. In the following expression, A, B, C, and D are bit_vectors: not A or B and not C & D In this expression, not is performed first, then & (concatenation), then or, and finally and. The equivalent expression using parentheses is ((not A) or B) and ((not C) &D) The binary logical operators (class 1) as well as not can be applied to bits, booleans, bit_vectors, and boolean_vectors. The class 1 operators require two operands of the same type and size, and the result is of that type and size.
Relational operators (class 2) are used to compare two expressions and return a value of FALSE or TRUE. The two expressions must be of the same type and size. Equal(=) and not equal (/=) apply to any type, but the application of the other relational oper-ators is more restricted. Note that “=” is always a relational operator, but “<=” also serves as an assignment operator. Example: If A = 5, B = 4, and C = 3 the expression (A >= B) and (B <= C) evaluates to FALSE.
Figure 10-14 shows a comparator for two integers with a restricted range. C must be of type Boolean since the condition A <= B evaluates to TRUE or FALSE. If we implement the comparator in hardware, each integer would be represented by a 4-bit signal because the range is restricted to 0 to 15. C, D, and E would each be one bit (0 for FALSE or 1 for TRUE).
FIGURE 10-14 Comparator for Integers © Cengage Learning 2014 signal A,B: integer range 0 to 15; signal C, D, E: Boolean; ---------------------------------C <= A <= B; D <= A = B; E <= A > B; A B C D E Comparator > = <= 316 Unit 10 The shift operators are used to shift or rotate a bit_vector. In the following exam-ples, A is an 8-bit vector equal to “10010101”: A sll 2 is “01010100” (shift left logical, filled with ‘0’) A srl 3 is “00010010” (shift right logical, filled with ‘0’) A sla 3 is “10101111” (shift left arithmetic, filled with rightmost bit) A sra 2 is “11100101” (shift right arithmetic, filled with leftmost bit) A rol 3 is “10101100” (rotate left) A ror 5 is “10101100” (rotate right) We will not utilize these shift operators because some software used for synthesis uses different shift operators. Instead, we will do shifting using the concatenation operator. For example, if A in the above listing is dimensioned 7 downto 0, we can implement shift right arithmetic two places as follows: A(7)&A(7)&A(7 downto 2) = ‘1’&’1’&“100101” = “11100101” This makes two copies of the sign bit followed by the left 6 bits of A, which gives the same result as A sra 2.
The + and − operators can be applied to integer or real numeric operands. The & operator can be used to concatenate two vectors (or an element and a vector, or two elements) to form a longer vector. For example, “010” & ‘1’ is “0101” and “ABC” & “DEF” is “ABCDEF.” The and / operators perform multiplication and division on integer or floating-point operands. The rem and mod operators calculate the remainder and modulus for integer operands. (We will not use rem and mod; for further discussion of these operators see Reference .) The operator raises an integer or floating-point number to an integer power, and abs finds the absolute value of a numeric operand.
10.7 Packages and Libraries Packages and libraries provide a convenient way of referencing frequently used functions and components. A package consists of a package declaration and an optional package body. The package declaration contains a set of declarations which may be shared by several design units. For example, it may contain type, signal, component, function, and procedure declarations. The package body usually con-tains component descriptions and the function and procedure bodies. The pack-age and its associated compiled VHDL models may be placed in a library, so they can be accessed as required by different VHDL designs. A package declaration has the form: package package-name is package declarations end [package][package-name]; Introduction to VHDL 317 A package body has the form package body package-name is package body declarations end [package body][package name]; We have developed a package called bit_pack which is used in a number of examples in this book. This package contains commonly used components and func-tions which use signals of type bit and bit_vector. A complete listing of this package and associated component models is included on the CD-ROM that accompanies this text. Most of the components in this package have a default delay of 10 ns, but this delay can be changed by the use of generics. For an explanation of generics, refer to one of the VHDL references. We have compiled this package and the component models and placed the result in a library called BITLIB.
One of the components in the library is a two-input NOR gate named Nor2, which has default delay of 10 ns. The package declaration for bit_pack includes the component declaration component Nor2 port (A1, A2: in bit; Z: out bit); end component; The NOR gate is modeled using a concurrent statement. The entity-architecture pair for this component is -- two-input NOR gate entity Nor2 is port (A1, A2: in bit; Z: out bit); end Nor2; architecture concur of Nor2 is begin Z <= not(A1 or A2) after 10 ns; end concur; To access components and functions within a package requires a library state-ment and a use statement. The statement library BITLIB; allows your design to access the BITLIB. The statement use BITLIB.bit_pack.all; allows your design to use the entire bit_pack package. A statement of the form use BITLIB.bit_pack.Nor2; may be used if you want to use a specific component (in this case Nor2) or function in the package.
When components from a library package are used, component declarations are not needed. Figure 10-15 shows a NOR-NOR circuit and the corresponding struc-tural VHDL code. This code instantiates three copies of the Nor2 gate component from the package bit_pack and connects the gate inputs and outputs.
318 Unit 10 10.8 IEEE Standard Logic Use of two-valued logic (bits and bit vectors) is generally not adequate for simula-tion of digital systems. In addition to ‘0’ and ‘1’, values of ‘Z’ (high-impedance or no connection) and ‘X’ (unknown) are frequently used in digital system simulation. The IEEE Standard 1164 defines a std_logic type that actually has nine values (‘U’, ‘X’, ‘0’, ‘1’, ‘Z’, ‘W’, ‘L’, ‘H’, and ‘–’). We will only be concerned with the first five values in this text. ‘U’ stands for uninitialized. When a logic circuit is first turned on and before it is reset, the signals will be uninitialized. If these signals are represented by std_logic, they will have a value of ‘U’ until they are changed. Just as a group of bits is represented by a bit_vector, a group of std_logic signals is represented by a std_logic_vector.
Figure 10-16 shows how a tri-state buffer can be represented by a concurrent statement. When the buffer is enabled (B = ‘1’), the output is A, or else it is high impedance (‘Z’). A and C could be std_logic_vectors instead of std_logic bits.
Figure 10-17 shows two tri-state buffers with their outputs connected together by a tri-state bus. If buffer 1 has an output of ‘1’ and buffer 2 has a hi-Z output, the bus value is ‘1’. When both buffers are enabled, if buffer 1 drives ‘0’ onto the bus and buffer 2 drives ‘1’ onto the bus, the result is a bus conflict. In this case, the bus value is unknown, which we represent by an ‘X’.
In the VHDL code, A, C, and F are std_logic_vectors and F represents the tri-state bus. The signal F is driven from two different sources. If the two concurrent FIGURE 10-15 NOR-NOR Circuit and Structural VHDL Code Using Library Components © Cengage Learning 2014 library BITLIB; use BITLIB.bit_pack.all; entity nor_nor is port (A,B,C,D: in bit; G: out bit); end nor_nor; architecture structural of nor_nor is signal E,F,BN,CN: bit; -- internal signals begin BN <= not B; CN <= not C; G1: Nor2 port map (A, BN, E); G2: Nor2 port map (CN, D, F); G3: Nor2 port map (E, F, G); end structural; A B′ C′ E G F D G1 G2 G3 FIGURE 10-16 Tri-State Buffer © Cengage Learning 2014 A C B signal A,B,C: std_logic; -------------------------------C <= A when B = '1' else 'Z'; FIGURE 10-17 Tri-State Buffers Driving a Bus © Cengage Learning 2014 A B signal A,C,F: std_logic_vector(3 downto 0); signal B,D: std_logic; --------------------------------------------- concurrent statements F <= A when B = '1' else "ZZZZ"; F <= C when D = '1' else "ZZZZ"; 1 C D F 2 Introduction to VHDL 319 statements assign different values to F, VHDL automatically calls a resolution func-tion to determine the resulting value. This is similar to the way the hardware works— if the two buffers have different output values, the hardware resolves the values and comes up with an appropriate value on the bus. VHDL uses the table of Figure 10-18 to resolve the bus value when two different std_logic signals, S1 and S2, drive the bus. (Only signal values ‘U’, ‘X’, ‘0’, ‘1’, and ‘Z’ are considered here.) This table is similar to Figure 9-14, which is used for four-valued logic simulation, except for the addition of a row and a column corresponding to ‘U’. When an uninitialized signal is connected to any other signal, VHDL considers that the result is uninitialized.
If A, B, and F are bits (or bit_vectors) and we write the concurrent statements F <= A; F <= not B; the compiler will flag an error because no resolution function exists for signals of type bit. If A, B, and F are std_logic bits or vectors, the compiler will generate a call to the resolution function and not report an error. If F is assigned conflicting values during simulation, then F will be set to ‘X’ (unknown).
In order to use signals of type std_logic and std_logic_vector in a VHDL module, the following declarations must be placed before the entity declaration: library ieee; use ieee.std_logic_1164.all; The IEEE std_logic_1164 package defines std_logic and related types, logic opera-tions on these types, and functions for working with these types.
The original IEEE standards for VHDL do not define arithmetic operations on bit_ vectors or on std_logic vectors. Based on these standards, we cannot add, subtract, multi-ply, or divide bit_vectors or std_logic_vectors without first converting them to other types. For example, if A and B are bit_vectors, the expression A + B is not allowed. However, VHDL libraries and packages are available that define arithmetic and comparison oper-ations on std_logic_vectors. The operators defined in these packages are referred to as overloaded operators. This means that the compiler will automatically use the proper definition of the operator depending on its context. For example, when evaluating the expression A + B, if A and B are integers, the compiler will use the integer arithmetic routine to do the addition. On the other hand, if A and B are of type std_logic_vector, the compiler will use the addition routine for standard logic vectors. In order to use overloaded operators, the appropriate library and use statements must be included in the VHDL code so that the compiler can locate the definitions of these operators.
In this text, we will use the std_logic_unsigned package, originally developed by Synopsys and now widely available. This package treats std_logic_vectors as unsigned FIGURE 10-18 Resolution Function for Two Signals © Cengage Learning 2014 S2 S1 U X 0 1 Z U U U U U U X U X X X X 0 U X 0 X 0 1 U X X 1 1 Z U X 0 1 Z 320 Unit 10 numbers. The std_logic_unsigned package defines arithmetic operators (+, −, ) and comparison operators (<, <=, =, /=, >, >=) that operate on std_logic_vectors. For +, −, and comparison operators, if the two operands are of different length, the shorter operand is filled on the left end with zeros.
These operations can also be applied when the left operand is a std_logic_vector and the right operand is an integer. The arithmetic operations return a std_logic_vector, and the comparison operations return a Boolean. For example, if A is “10011”, A + 7 returns a value of “11010”, and A >= 5 returns TRUE. In these examples, + and >= are overloaded operators, and the compiler automatically calls the appropriate routine to add an integer to a std_logic_vector or to compare an integer with a std_logic_vector.
If A and B are 4-bit std_logic vectors, A + B gives their sum as a 4-bit vector, and any carry is lost. If the carry is needed, then A must be extended to five-bits before addition. This is accomplished by concatenating a ‘0’ in front of A. Then ‘0’ & A + B gives a 5-bit sum that can be split into a carry and a 4-bit sum.
Figure 10-19 shows a binary adder and its VHDL representation using the std_ logic_ unsigned package. Addout is a 5-bit sum that is split into Sum and Cout. For example, if A = “1011”, B = “1001”, and Cin = ‘1’, Addout evaluates to “10101”, which is then split into a sum “0101” with a carry out of ‘1’.
Figure 10-20 shows how to implement the bi-directional input-output pin and tri-state buffer of Figure 9-16 using IEEE std_logic. The I/O pin declared in the port is FIGURE 10-19 VHDL Code for Binary Adder © Cengage Learning 2014 4-Bit Adder Cout Cin A B Sum library IEEE; use IEEE.std_logic_1164.all; use IEEE.std_logic_unsigned.all; --------------------------------------------signal A,B,Sum: std_logic_vector(3 downto 0); signal Addout: std_logic_vector(4 downto 0); signal Cin,Cout: std_logic; ------------------------------------Addout <= '0'&A + B + Cin; Sum <= Addout(3 downto 0); Cout <= Addout(4); FIGURE 10-20 VHDL Code for Bi-Directional I/O Pin © Cengage Learning 2014 entity IC_pin is port(IO_pin: inout std_logic); end entity; architecture bi_dir of IC_pin is component IC port(input: in std_logic; output: out std_logic); end component; signal input, output, en: std_logic; begin -- connections to bi-directional I/O pin IO_pin output when en ‘1’ else ‘Z’; input IO_pin; IC1: IC port map (input, output); end bi_dir; Introduction to VHDL 321 of mode inout. The concurrent statements in the architecture connect the IC output to the pin via a tri-state buffer and also connect the pin to the IC input.
10.9 Compilation and Simulation of VHDL Code After describing a digital system in VHDL, simulation of the VHDL code is impor-tant for two reasons. First, we need to verify the VHDL code correctly implements the intended design, and second, we need to verify that the design meets its speci-fications. Before the VHDL model of a digital system can be simulated, the VHDL code must first be compiled (see Figure 10-21). The VHDL compiler, also called an analyzer, first checks the VHDL source code to see that it conforms to the syntax and semantic rules of VHDL. If there is a syntax error such as a missing semicolon or a semantic error such as trying to add two signals of incompatible types, the com-piler will output an error message. The compiler also checks to see that references to libraries are correct. If the VHDL code conforms to all of the rules, the compiler generates intermediate code which can be used by a simulator or by a synthesizer.
In preparation for simulation, the VHDL intermediate code must be converted to a form which can be used by the simulator. This step is referred to as elaboration. During elaboration, ports are created for each instance of a component, memory storage is allocated for the required signals, the interconnections among the port signals are specified, and a mechanism is established for executing the VHDL state-ments in the proper sequence. The resulting data structure represents the digital sys-tem being simulated. After an initialization phase, the simulator enters the execution phase. The simulator accepts simulation commands which control the simulation of the digital system and specify the desired simulator output.
Understanding the role of the delta (Δ) time delays is important when interpreting output from a VHDL simulator. Although the delta delays do not show up on wave-form outputs from the simulator, they show up on listing outputs. The simulator uses delta delays to make sure that signals are processed in the proper sequence. Basically, the simulator works as follows: Whenever a component input changes, the output is scheduled to change after the specified delay or after Δ if no delay is specified. When all input changes have been processed, the simulated time is advanced to the next time at which an output change is specified. When time is advanced by a finite amount (1 ns for example), the Δ counter is reset, and simulation resumes. Real time does not advance again until all Δ delays associated with the current simulation time have been processed.
FIGURE 10-21 Compilation, Simulation, and Synthesis of VHDL Code © Cengage Learning 2014 Compiler Simulator Synthesizer Implementer Hardware Simulator Output VHDL Code VHDL Libraries Simulator Commands Intermediate Code 322 Unit 10 The following example illustrates how the simulator works for the circuit of Figure 10-22. Suppose that A changes at time = 3 ns. Statement 1 executes, and B is scheduled to change at time 3 + Δ. Then time advances to 3 + Δ, and statement 2 executes. C is scheduled to change at time 3 + 2Δ. Time advances to 3 + 2Δ, and state-ment 3 executes. D is then scheduled to change at 8 ns. You may think the change should occur at (3 + 2Δ + 5) ns. However, when time advances a finite amount (as opposed to Δ, which is infinitesimal), the Δ counter is reset. For this reason, when events are scheduled a finite time in the future, the Δ’s are ignored. Because no further changes are scheduled after 8 ns, the simulator goes into an idle mode and waits for another input change. The table gives the simulator output listing.
After the VHDL code for a digital system has been simulated to verify that it works correctly, the VHDL code can be synthesized to produce a list of required components and their interconnections. The synthesizer output can then be used to implement the digital system using specific hardware such as a CPLD or FPGA. The CAD software used for implementation generates the necessary information to program the CPLD or FPGA hardware. The synthesis and implementation of digital logic from VHDL code is discussed in more detail in Unit 17 .
In this chapter, we have covered the basics of VHDL. We have shown how to use VHDL to model combinational logic and how to construct a VHDL module using an entity-architecture pair. Because VHDL is a hardware description language, it differs from an ordinary programming language in several ways. Most importantly, VHDL statements execute concurrently because they must model real hardware in which the components are all in operation at the same time.
Problems 10.1 Write VHDL statements that represent the following circuit: (a) Write a statement for each gate.
(b) Write one statement for the whole circuit.
FIGURE 10-22 Simulation of VHDL Code © Cengage Learning 2014 1 B <= not A; 2 C <= not B; 3 D <= not C after 5 ns; D C B A A′ B C F N G I D E′ ns delta A B C D 0 +0 0 1 0 1 3 +0 1 1 0 1 3 +1 1 0 0 1 3 +2 1 0 1 1 8 +0 1 0 1 0 Introduction to VHDL 323 10.2 Draw the circuit represented by the following VHDL statements: F <= E and I; I <= G or H; G <= A and B; H <= not C and D; 10.3 (a) Implement the following VHDL conditional statement using two 2-to-1 MUXes: F <= A when D = ‘1’ else B when E = ‘1’ else C; (b) Implement the same statement using gates.
10.4 Write the VHDL code for Figure 9-6 using a conditional signal assignment state-ment. Use bit_vectors for X, Y, and Z.
10.5 Write a VHDL module that implements a full adder using an array of bit_vectors to represent the truth table.
10.6 (a) Given that A = “00101101” and B = “10011”, determine the value of F: F <= not B & “0111” or A & ‘1’ and ‘1’& A; (b) Given A = “11000”, B = “10011”, and C = “0111”, evaluate the following expression: not A + C 2 > B / 4 & “00” 10.7 Write a VHDL module that finds the average value of four 16-bit unsigned numbers that are represented by std_logic_vectors. Division by four is best accomplished by shifting. Round off your answer to the nearest integer.
10.8 Write VHDL code for the system shown in Figure 9-15. Use four concurrent state-ments to compute the signal on the tri-state bus.
10.9 (a) Draw the circuit represented by the following VHDL statements: T1 <= not A and not B and I0; T2 <= not A and B and I1; T3 <= A and not B and I2; T4 <= A and B and I3; F <= T1 or T2 or T3 or T4; (b) Draw a MUX that implements F. Then write a selected signal assignment statement that describes the MUX.
10.10 Assume that the following are concurrent VHDL statements: (a) L <= P nand Q after 10 ns; (b) M <= L nor N after 5 ns; (c) R <= not M; Initially at time t = 0 ns, P = 1, Q = 1, and N = 0. If Q becomes 0 at time t = 4 ns, (1) At what time will statement (a) execute?
(2) At what time will L be updated?
324 Unit 10 (3) At what time will statement (c) execute?
(4) At what time will R be updated?
10.11 (a) Write a single concurrent VHDL statement to represent the following circuit. Do not use parentheses in the statement.
A B D C G H E F (b) Write individual statements to represent the circuit of part (a). Assume that all NAND gates have a delay of 10 ns, all NOR gates have a delay of 15 ns, and inverters have a delay of 5 ns.
10.12 Draw a circuit that implements the following VHDL code.
V <= T and U; U <= not R or S and P or not Q or S; T <= not P or Q or R; 10.13 Suppose L, M, and N are of type std_logic. If the following are concurrent state-ments, what are the values of L, M, and N? You can use the resolution function given in Figure 10-18.
L <= ‘1’; L <= ‘0’; M <= ‘1’ when L = ‘0’ else ‘Z’ when L = ‘1’ else ‘0’; N <= M when L = ‘0’ else not M; N <= ‘Z’; 10.14 (a) Given that D = “011001” and E = ‘110”, determine the value of F.
F <= not E & “011” or “000100” and not D; (b) Given A = “101” and B = “011”, evaluate the following expression: not (A & B) < (not B & A and not A & A) 10.15 Write VHDL code to implement the following logic functions using a 16 words × 3 bits ROM.
W = A′B′C + C′D + ACD′ X = A′C′ + B′D Y = BD′ + B′C′D 10.16 The diagram shows an 8-bit-wide data bus that transfers data between a micropro-cessor and memory. Data on this bus is determined by the control signals mRead and mWrite. When mRead = ‘1’, the data on the memory’s internal bus ‘membus’ is output to the data bus. When mWrite = ‘1’, the data on the processor’s internal Introduction to VHDL 325 bus ‘probus’ is output to the data bus. When both control signals are ‘0’, the data bus must be in a high-impedance state.
I0 I3 I2 I1 A′ B B′ 0 C D F A B F C D Processor Data Bus 8-Bit Memory (a) Write VHDL statements to represent the data bus.
(b) Normally mRead = mWrite = ‘1’ does not occur. But if it occurs, what value will the data bus take?
10.17 (a) Write a selected signal assignment statement to represent the 4-to-1 MUX shown below. Assume that there is an inherent delay in the MUX that causes the change in output to occur 15 ns after a change in input.
(b) Repeat (a) using a conditional signal assignment statement.
10.18 (a) Write a complete VHDL module for a two-input NAND gate with 4-ns delay.
(b) Write a complete VHDL module for the following circuit that uses the NAND gate module of part (a) as a component.
10.19 In the following circuit, all gates, including the inverter, have an inertial delay of 10 ns.
(a) Write VHDL code that gives a dataflow description of the circuit. All delays should be inertial delays.
(b) Using the Direct VHDL simulator simulate the circuit. (Use a View Interval of 100 ns.) Initially set A = 1, B = 1 and C = 1, then run the simulator for 40 ns. Change B to 0, and run the simulator for 40 ns. Record the waveform.
(c) Change the VHDL code of part (a) so that the inverter has a delay of 5 ns.
(d) Repeat part (b).
(e) Change the VHDL code of part (c) so that the output OR gate has a transport delay rather than an inertial delay.
(f ) Repeat part (b).
(g) Explain any differences between the waveforms for parts (b), (d), and (f).
326 Unit 10 10.20 In the following circuit, all gates, including the inverter, have an inertial delay of 10 ns except for gate 3, which has delay 40 ns.
(a) Write VHDL code that gives a dataflow description of the circuit. All delays should be inertial delays.
(b) Using the Direct VHDL simulator simulate the circuit. (Use a View Interval of 150 ns.) Initially set A = 1, B = 1, C = 1 and D = 0, then run the simulator for 60 ns. Change B to 0, and run the simulator for 60 ns. Record the waveform.
(c) Change the VHDL code of part (a) so that the inverter has a delay of 5 ns.
(d) Repeat part (b).
(e) Change the VHDL code of part (c) so that gates 4 and 5 have a transport delay rather than an inertial delay.
(f ) Repeat part (b).
(g) Explain any differences between the waveforms for parts (b), (d), and (f).
10.21 Write VHDL code that gives a behavioral description of a circuit that converts the representation of decimal digits in BCD to the representation using the 2-4-2-1 weighted code, as follows: A B C D f 5 3 4 1 2 A B C f Digit 2421 code 0 0000 1 0001 2 0010 3 0011 4 0100 5 1011 6 1100 7 1101 8 1110 9 1111 Introduction to VHDL 327 For the six input combinations that do not represent valid BCD digits, the circuit output should be “XXXX”. Make the inputs and outputs of type std_logic.
(a) Write the code using the when else assignment statement.
(b) Use the VHDL simulator to verify the code of part (a) for the inputs x = 0011, 0100, 1001, and 1010.
(c) Write the code using the with select when assignment statement.
(d) Use the VHDL simulator to verify the code of part (c) for the inputs x = 0100, 0101, 1001, and 1010.
10.22 Write VHDL code that gives a behavioral description of a circuit that converts the representation of decimal digits in the weighted code with weights 8, 4, −2 and −1 to the representation using the excess-3 code.
(a) Write the code using the when else assignment statement.
(b) Use the VHDL simulator to verify the code of part (a) for the inputs x = 0011, 0100, 1001, and 1010.
(c) Write the code using the with select when assignment statement.
(d) Use the VHDL simulator to verify the code of part (c) for the inputs x = 0100, 0101, 1001, and 1010.
Design Problems 10.A (a) Design a 4-to-1 MUX using only three 2-to-1 MUXes. Write an entity- architecture pair to implement a 2-to-1 MUX. Then write an entity-architecture pair to imple-ment a 4-to-1 MUX using three instances of your 2-to-1 MUX.
(Hint: The equation for a 4-to-1 MUX can be rewritten as F = A′(I0B′ + I1B) + A(I2B′ + I3B).) Use the following port definitions: For the 2-to-1 MUX: port (i0, i1: in bit; sel: in bit; z: out bit); For the 4-to-1 MUX: port (i0, i1, i2, i3: in bit; a, b: in bit; f: out bit); (b) Simulate your code and test it using the following inputs: I0 = I2 = 1, I1 = I3 = 0, AB = 00, 01, 11, 10 10.B (a) Show how a BCD to Gray code converter can be designed using a 16 words × 4 bits ROM. Then write an entity-architecture pair to implement the converter using the ROM. For your code to function correctly, you will need to add the following two lines of code to the top of your program.
library BITLIB; use BITLIB.bit_pack.all; Use the port definition specified below for the ROM: port (bcd: in bit_vector (3 downto 0); gray: out bit_vector (3 downto 0)); 328 Unit 10 (b) Simulate your code and test it using the following inputs: BCD = 0010, 0101, 1001 10.C (a) A half adder is a circuit that can add two bits at a time to produce a sum and a carry. Design a half adder using only two gates. Write an entity-architecture pair to implement the half adder. Now write an entity-architecture pair to implement a full adder using two instances of your half adder and an OR gate. Use the port definitions specified below: For the half adder: port (a, b: in bit; s, c: out bit); For the full adder: port (a, b, cin: in bit; sum, cout: out bit); (b) Simulate your code and test it using the following inputs: a b cin = 0 0 1, 0 1 1, 1 1 1, 1 1 0, 1 0 0 10.D (a) Using a 3-to-8 decoder and two four-input OR gates, design a circuit that has three inputs and a 2-bit output. The output of the circuit represents (in binary form) the number of 1’s present in the input. For example, when the input is ABC = 101, the output will be Count = 10. Write an entity-architecture pair to implement a 3-to-8 decoder. Then write an entity-architecture pair for your cir-cuit, using the decoder as a component. Use the port definitions specified below.
For the 3-to-8 decoder: port (a, b, c: in bit; y0, y1, y2, y3, y4, y5, y6, y7: out bit); For the main circuit: port (a, b, c: in bit; count: out bit_vector (1 downto 0)); (b) Simulate your code and test it using the following inputs: a b c = 0 0 0, 0 1 0, 1 1 0, 1 1 1, 0 1 1 10.E (a) Show how a BCD to seven-segment LED code converter can be designed, using a 16 words × 7 bits ROM. Then write an entity-architecture pair to implement the converter using the ROM. Use the vec2int function in BITLIB for this prob-lem. Use the port definition specified below for the ROM: port (bcd: in bit_vector (3 downto 0); seven: out bit_vector (6 downto 0)); (b) Simulate your code and test it using the following inputs: BCD = 0000, 0001, 1000, 1001 10.F (a) Using a 3-to-8 decoder, two three-input OR gates, and one two-input OR gate, design a circuit that has three inputs and a 1-bit output. The output of the circuit is 1 when the input 3-bit number is less than 3 or is greater than 4. Write an entity-architecture pair to implement a 3-to-8 decoder. Then write an entity-architecture pair for your circuit using the decoder as a component. Use the port definitions specified below.
For the 3-to-8 decoder: port (a, b, c: in bit; y0, y1, y2, y3, y4, y5, y6, y7: out bit); For the main circuit: port (a, b, c: in bit; output : out bit); Introduction to VHDL 329 (b) Simulate your code and test it using the following inputs: a b c = 0 0 0, 1 0 0, 1 0 1, 0 0 1, 0 1 1 10.G (a) Write the VHDL code for a full subtracter, using logic equations. Assume that the full subtracter has a 5-ns delay.
(b) Write the VHDL code for a 4-bit subtracter using the module defined in (a) as a component.
(c) Simulate your code and test it using the following inputs: 1100 – 0101, 0110 – 1011 10.H (a) The diagram shows an 8-bit shifter that shifts its input one place to the left. Write a VHDL module for the shifter.
(b) Write a VHDL module that multiplies an 8-bit input (C) by 1012 to give a 11-bit product (D). This can be accomplished by shifting C two places to the left and adding the result to C. Use two of the modules written in (a) as components and an overloaded operator for addition.
(c) Simulate your code and test it using the following inputs: 10100101 11111111 10.I (a) Design a 4-to-2 priority encoder using gates (see Unit 9, Study Guide, Part 4(b)). Write a VHDL module for your encoder. Use the port declaration Port (y : in std_logic_vector(0 to 3); a1,b1,c1: out std_logic); (b) Design an 8-to-3 priority encoder (Figure 9-20), using two instances of the 4-to-2 priority encoder you designed, two 2-to-1 multiplexers, and one OR gate. Write a VHDL module for the 8-to-3 encoder. Use the port declaration Port (y : in std_logic_vector(0 to 7); a,b,c,d : out std_logic); (Hint: In building the 8-to-3 encoder, use one 4-to-2 encoder for the four most significant bits, and the other for the four least significant bits. Outputs b and c of the 8-to-3 encoder should come from the multiplexers.) (c) Simulate your code and test it using the following inputs: 00000000, 10000000, 11000000, ---, 11111111 10.J (a) Write a VHDL module for a 4-bit adder, with a carry-in and carry-out, using an overloaded addition operator and std_logic_vector inputs and outputs.
B (7 down to 0) A (7 down to 0) Lout Rin 330 Unit 10 (b) Design an 8-bit subtracter with a borrow-out, using two of the 4-bit adders you designed in (a), along with any necessary gates or inverters. Write a VHDL module for the subtracter.
(c) Simulate your code and test it using the following inputs: 11011011 – 01110110, 01110110 – 11011011 10.K (a) Write a VHDL module for a tri-state buffer, with 6-bit data inputs and outputs and one control input.
(b) Design a 4-to-1 multiplexer with 6-bit data inputs and outputs and two control inputs. Use four tri-state buffers from part (a) and a 2-to-4 decoder.
(c) Simulate your code and test it for the following data inputs: 000111, 101010, 111000, 010101 10.L (a) Write a VHDL module for a ROM with four inputs and three outputs. The 3-bit output should be a binary number equal to the number of 1’s in the ROM input.
(b) Write a VHDL module for a circuit that counts the number of 1’s in a 12-bit num-ber. Use three of the modules from (a) along with overloaded addition operators.
(c) Simulate your code and test it for the following data inputs: 111111111111, 010110101101, 100001011100 10.M (a) Write a VHDL module for a full subtracter using a ROM to implement the truth table.
(b) Write a VHDL module for a 3-bit subtracter using the module defined in part (a). Your module should have a borrow-in and a borrow-out.
(c) Simulate your code and test it for the following data: 110 − 010 with a borrow input of 1 011 − 101 with a borrow input of 0 10.N (a) Design a 4-to-2 priority encoder with an enable input, using gates. (See Unit 9, Study Guide Part 4(b)). When enable is 0, all outputs are 0. Write a VHDL mod-ule for the encoder. Use the following port declaration: Port ( y : in std_logic_vector(0 to 3); enable : in std_logic; a1,b1,c1 : out std_logic); (b) Design an 8-to-3 priority encoder (Figure 9-20) with an enable input, using two of the 4-to-2 priority encoders you designed in (a), three OR gates, an AND gate, and one inverter. Then write a VHDL module for this encoder. Use the port declaration: Port ( y : in std_logic_vector(0 to 7); main_enable : in std_logic; a,b,c,d : out std_logic); (Hint: In building the 8-to-3 encoder, use one 4-to-2 encoder for the four most significant bits, and another for the four least significant bits. Also, outputs b and c of the 8-to-3 encoder should come from OR gates. The enable input to the encoder for the least significant bits depends on the main_enable signal and the c1 output from the encoder for the most significant bits.) (c) Simulate your code and test it using the following inputs: 00000000, 10000000, 11000000, ---, 11111111 331 Latches and Flip-Flops U N I T 11 Objectives In this unit you will study one of the basic building blocks used in sequential circuits—the flip-flop. Some of the basic analysis techniques used for sequential circuits are introduced here. In particular, you will learn how to construct timing diagrams which show how each signal in the circuit varies as a function of time. Specific objectives are: 1. Explain in words the operation of S-R and gated D latches.
2. Explain in words the operation of D, D-CE, S-R, J-K, and T flip-flops.
3. Make a table and derive the characteristic (next-state) equation for such latches and flip-flops. State any necessary restrictions on the input signals.
4. Draw a timing diagram relating the input and output of such latches and flip-flops.
5. Show how latches and flip-flops can be constructed using gates. Analyze the operation of a flip-flop that is constructed of gates and latches.
332 Unit 11 Study Guide 1. Review Section 8.3, Gate Delays and Timing Diagrams. Then study Section 11.1, Introduction.
(a) In the circuit shown, suppose that at some instant of time the inputs to both inverters are 0. Is this a stable condition of the circuit?
0 0 Assuming that the output of the left inverter changes before the output of the right inverter, what stable state will the circuit reach? (Indicate 0’s and 1’s on the inverters’ inputs and outputs.) (b) Work Problem 11.1.
2. Study Section 11.2, Set-Reset Latch.
(a) Build an S-R latch in SimUaid, using NOR gates as in Figure 11-3. Place switches on the inputs and probes on the outputs. Experiment with it. Describe in words the behavior of your S-R latch.
(b) For Figure 11-4(b), what values would P and Q assume if S = R = 1?
(c) What restriction is necessary on S and R so that the two outputs of the S-R latch are complements?
(d) State in words the meaning of the equation Q+ = S + R′Q.
(e) Starting with Q = 0 and S = R = 1 in Figure 11-10(a), change S to 0 and trace signals through the latch until steady-state is reached. Then, change S to 1 and R to 0 and trace again.
(f ) Work Problems 11.2 and 11.3.
3. Study Section 11.3, Gated Latches.
(a) Build a gated D latch in SimUaid. See Figure 11-14. (Construct the S-R latch as in Study Guide Section 2(a).) Place switches on the inputs and probes on the outputs. Experiment with it. Describe in words the behavior of your gated D latch.
(b) State in words the meaning of the equation Q+ = G′Q + GD.
Latches and Flip-Flops 333 (c) Given a gated D latch with the following inputs, sketch the waveform for Q.
(d) Work Problem 11.4.
4. Study Section 11.4, Edge-Triggered D Flip-Flop.
(a) Experiment with a D flip-flop in SimUaid. Use the D flip-flop on the parts menu. Place switches on the inputs and probes on the outputs. Describe in words the behavior of your D flip-flop.
(b) Given a rising-edge-triggered D flip-flop with the following inputs, sketch the waveform for Q.
(c) Work Programmed Exercise 11.35.
(d) A D flip-flop with a falling-edge trigger is behaving erratically. It has a setup time of 2 ns and a hold time of 2 ns. The figure shows the inputs to the flip-flop over a typical clock cycle. Why might the flip-flop be behaving erratically?
(e) Suppose that for the circuit of Figure 11-21, new semiconductor technol-ogy has allowed us to improve the delays and setup times. The propagation delay of the new inverter is 1.5 ns, and the propagation delay and setup times of the new flip-flop are 3.5 ns and 2 ns, respectively. What is the short-est clock period for the circuit of Figure 11-21(a) which will not violate the timing constraints?
(f ) Work Problem 11.5.
5. Study Section 11.5, S-R Flip-Flop.
(a) Describe in words the behavior of an S-R flip-flop.
D G Q D Q Clock Clock D 1 ns 334 Unit 11 (b) Trace signals through the circuit of Figure 11-23(a) and verify the timing diagram of Figure 11-23(b).
(c) What is the difference between a master-slave flip-flop and an edge-triggered flip-flop? Assume that Q changes on the rising clock edge in both cases.
(d) Work Problem 11.6.
6. Study Section 11.6, J-K Flip-Flop.
(a) Experiment with a J-K flip-flop in SimUaid. Use the J-K flip-flop in the parts menu. Place switches on the inputs and probes on the outputs. Describe in words the behavior of your J-K flip-flop.
(b) Derive the next-state equation for the J-K flip-flop.
(c) Examine Figures 11-23(a) and 11-25. Construct a J-K flip-flop, using a master-slave S-R flip-flop and two AND gates. (Do not draw the interior of the S-R flip-flop. Just use the symbol in Figure 11-22.) (d) Work Problem 11.7 .
7. Study Section 11.7 , T Flip-Flop.
(a) Construct a T flip-flop in SimUaid from a D flip-flop as in Figure 11-28(b). Place switches on the inputs and probes on the outputs. Experiment with it. Describe in words the behavior of the T flip-flop.
(b) Complete the following timing diagram (assume that Q = 0 initially): 8. Study Section 11.8, Flip-Flops with Additional Inputs.
(a) To set the flip-flop of Figure 11-29 to Q = 1 without using the clock, the ClrN input should be set to __ and the PreN input to _. To reset this flip-flop to Q = 0 without using the clock, the Clock Q T 1 2 3 4 Latches and Flip-Flops 335 __ input should be set to _ and the __ input to __.
(b) Complete the following timing diagram for a rising-edge-triggered D flip-flop with ClrN and PreN inputs. Assume Q begins at 0.
(c) In Figure 11-31(a), what would happen if En changed from 1 to 0 while CLK = 1?
What if En changed when CLK = 0?
In order to have Q change synchronization with the clock, what restriction must be placed on the time at which En can change?
Why does this restriction not apply to Figures 11-31(b) and (c)?
(d) Make a table similar to Figure 11-29(b) that describes the operation of a D flip-flop with a falling-edge clock input, a clock enable input, and an asyn-chronous active-low clear input (ClrN), but no preset input.
(e) Work Problems 11.8 and 11.9.
9. Study Section 11.10, Summary.
(a) Given one of the flip-flops in this chapter or a similar flip-flop, you should be able to derive the characteristic equation which gives the next state of the flip-flop in terms of the present state and inputs. You should understand the meaning of each of the characteristic equations given in Section 11.10.
(b) An S-R flip-flop can be converted to a T flip-flop by adding gates at the S and R inputs. The S and R inputs must be chosen so that the flip-flop will change state whenever T = 1 and the clock is pulsed. In order to determine the S and R inputs, ask yourself the question, “Under what conditions must Q PreN ClrN D Clock 336 Unit 11 the flip-flop be set to 1, and under what conditions must it be reset?” The flip-flop must be set to 1 if Q = 0 and T = 1.
Therefore, S = _____. In a similar manner, determine the equation for R and draw the circuit which converts an S-R flip-flop to a T flip-flop.
(c) Work Problem 11.10.
10. When you are satisfied that you can meet the objectives of this unit, take the readiness test.
Latches and Flip-Flops 11.1 Introduction Sequential switching circuits have the property that the output depends not only on the present input but also on the past sequence of inputs. In effect, these circuits must be able to “remember” something about the past history of the inputs in order to produce the present output. Latches and flip-flops are commonly used memory devices in sequential circuits. Basically, latches and flip-flops are memory devices which can assume one of two stable output states and which have one or more inputs that can cause the output state to change. Several common types of latches and flip-flops are described in this unit.
In Units 12 through 16, we will discuss the analysis and design of synchronous digital systems. In such systems, it is common practice to synchronize the operation of all flip-flops by a common clock or pulse generator. Each of the flip-flops has a clock input, and the flip-flops can only change state in response to a clock pulse. The use of a clock to synchronize the operation of several flip-flops is illustrated in Units 12 and 13. A memory element that has no clock input is often called a latch, and we will follow this practice. We will then reserve the term flip-flop to describe a memory device that changes its output in response to a clock input and not in response to a data input.
Latches and Flip-Flops 337 The switching circuits that we have studied so far have not had feedback con-nections. By feedback we mean that the output of one of the gates is connected back into the input of another gate in the circuit so as to form a closed loop. In order to construct a switching circuit that has memory, such as a latch or flip-flop, we must introduce feedback into the circuit. For example, in the NOR-gate circuit of Figure 11-3(a), the output of the second NOR gate is fed back into the input of the first NOR gate. Sequential circuits must contain feedback, but not all circuits with feedback are sequential. There are a few circuits containing feedback that are combinational.
In simple cases, we can analyze circuits with feedback by tracing signals through the circuit. For example, consider the circuit in Figure 11-1(a). If at some instant of time the inverter input is 0, this 0 will propagate through the inverter and cause the output to become 1 after the inverter delay. This 1 is fed back into the input, so after the propagation delay, the inverter output will become 0. When this 0 feeds back into the input, the output will again switch to l, and so forth. The inverter output will continue to oscillate back and forth between 0 and 1, as shown in Figure 11-1(b), and it will never reach a stable condition. An oscillator can be created using any odd number of inverters. The oscillator waveform has a high and a low time that is the sum of the propagation times of the inverters. For example, with n inverters and with all having the same delay, the oscillator waveform high time is (n + 1)/2 times the high-to-low inverter propagation delay plus (n −1)/2 times the low-to-high inverter propagation delay.
Next, consider a feedback loop which has two inverters in it, as shown in Figure 11-2(a). In this case, the circuit has two stable conditions, often referred to as stable states. If the input to the first inverter is 0, its output will be 1. Then, the input to the second inverter will be 1, and its output will be 0. This 0 will feed back into the first inverter, but because this input is already 0, no changes will occur. The circuit is then in a stable state. As shown in Figure 11-2(b), a second stable state of the circuit occurs when the input to the first inverter is 1 and the input to the second inverter is 0. The simple loop of two inverters lacks any external means of initializing the state to one of the stable states. The set-reset latches in the next section have inputs for this initialization.
X X t Feedback (a) Inverter with feedback (b) Oscillation at inverter output FIGURE 11-1 1 0 0 1 (a) 0 1 1 0 (b) FIGURE 11-2 © Cengage Learning 2014 © Cengage Learning 2014 338 Unit 11 11.2 Set-Reset Latch We can construct a simple latch by introducing feedback into a NOR-gate circuit, as seen in Figure 11-3(a). As indicated, if the inputs are S = R = 0, the circuit can assume a stable state with Q = 0 and P = 1. Note that this is a stable condition of the circuit because P = 1 feeds into the second gate forcing the output to be Q = 0, and Q = 0 feeds into the first gate allowing its output to be 1. Now if we change S to 1, P will become 0. This is an unstable condition or state of the circuit because both the inputs and output of the second gate are 0; therefore Q will change to 1, leading to the stable state shown in Figure 11-3(b).
If S is changed back to 0, the circuit will not change state because Q = 1 feeds back into the first gate, causing P to remain 0, as shown in Figure 11-4(a). Note that the inputs are again S = R = 0, but the outputs are different than those with which we started. Thus, the circuit has two different stable states for a given set of inputs. If we now change R to 1, Q will become 0 and P will then change back to 1, as seen in Figure 11-4(b). If we then change R back to 0, the circuit remains in this state and we are back where we started.
This circuit is said to have memory because its output depends not only on the present inputs, but also on the past sequence of inputs. If we restrict the inputs so that R = S = 1 is not allowed, the stable states of the outputs P and Q are always complements, that is, P = Q′. To emphasize the symmetry between the operation of the two gates, the circuit is often drawn in cross-coupled form (see Figure 11-5(a)). As shown in Figures 11-3(b) and 11-4(b), an input S = 1 sets the output to Q = 1, and an input R = 1 resets the output to Q = 0. When used with the restriction that R and S cannot be 1 simultaneously, the circuit is commonly referred to as a set-reset (S-R) latch and given the symbol shown in Figure 11-5(b). Note that although Q comes out of the NOR gate with the R input, the standard S-R latch symbol has Q directly above the S input.
S P 1 (a) Q 0 0 R 0 S P 0 (b) Q 1 1 R 0 FIGURE 11-3 S P 0 (a) Q 1 0 R 0 S P 1 (b) Q 0 0 R 1 FIGURE 11-4 © Cengage Learning 2014 © Cengage Learning 2014 Latches and Flip-Flops 339 If S = R = 1, the latch will not operate properly, as shown in Figure 11-6. The notation 1 → 0 means that the input is originally 1 and then changes to 0. Note that when S and R are both l, P and Q are both 0. Therefore, P is not equal to Q′, and this violates a basic rule of latch operation that requires the latch outputs to be comple-ments. Furthermore, if S and R are simultaneously changed back to 0, P and Q may both change to 1. If S = R = 0 and P = Q = 1, then after the 1’s propagate through the gates, P and Q will become 0 again, and the latch may continue to oscillate if the gate delays are equal.
Figure 11-7 shows a timing diagram for the S-R latch. Note that when S changes to 1 at time t1, Q changes to 1 a short time (ε) later. (ε represents the response time or delay time of the latch.) At time t2, when S changes back to 0, Q does not change. At time t3, R changes to 1, and Q changes back to 0 a short time (ε) later. The dura-tion of the S (or R) input pulse must normally be at least as great as ε in order for a change in the state of Q to occur. If S = 1 for a time less than ε, the gate output will not change and the latch will not change state.
Theoretically, the two-inverter circuit of Figure 11-2 and the set-reset of Figure 11-3 can exist in a third stable state. This is the situation where the voltage level at the output of the two inverters or gates is approximately halfway between FIGURE 11-7 Timing Diagram for S-R Latch © Cengage Learning 2014 R S Q t1 t1 + ε t2 t3 t4 t t3 + ε 0 0 1 ε ε FIGURE 11-5 S-R Latch © Cengage Learning 2014 Q R Q′ R Q S S Q′ L (a) (b) FIGURE 11-6 Improper S-R Latch Operation © Cengage Learning 2014 S R P 0→1→0→1 Q 0→1→0→1 1→0 1→0 340 Unit 11 the voltage levels for a logic 0 and a logic 1. This state is referred to as a metastable state. It is metastable because any noise existing in the circuit will cause the circuit to transition to one of the truly stable states. However, certain events can cause the latch to enter the metastable state for a short time. The simultaneous change in S and R from 1 to 0 in the set-reset latch can cause the latch to enter the metastable state. Also, starting with Q = 0 and applying a pulse on S with a length on the borderline between being too short to cause Q to change and just long enough to cause Q to change may cause the circuit to enter the metastable state.
Even though a circuit in the metastable state will quickly enter a stable state, events causing the circuit to enter the metastable state must be avoided. First, the stable state entered from the metastable state is unpredictable. Second, any gates or latches with an input that is in the metastable state will respond unpredictably; the gate or latch may respond as if the input is a logic 0 or it may respond as if the input is a logic 1. Metastable behavior is discussed further in the next sections.
When discussing latches and flip-flops, we use the term present state to denote the state of the Q output of the latch or flip-flop at the time any input signal changes, and the term next state to denote the state of the Q output after the latch or flip-flop has reacted to the input change and stabilized. If we let Q(t) represent the present state and Q(t + ε) represent the next state, an equation for Q(t + ε) can be obtained from the circuit by conceptually breaking the feedback loop at Q and considering Q(t) as an input and Q(t + ε) as the output. Then for the S-R latch of Figure 11-3 Q(t + ε) = R(t)′[S(t) + Q(t)] = R(t)′S(t) + R(t)′Q(t) (11-1) and the equation for output P is P(t) = S(t)′Q(t)′ (11-2) Normally we write the next-state equation without including time explicitly, using Q to represent the present state of the latch and Q+ to represent the next state: Q+ = R′S + R′Q (11-3) P = S′Q′ (11-4) These equations are mapped in the next-state and output tables of Table 11-1. The stable states of the latch are circled. Note that for all stable states, P = Q′ except when S = R = 1. As discussed previously, this is one of the reasons why S = R = 1 is disallowed as an input combination to the S-R latch. Making S = R = 1 a don’t-care combination allows simplifying the next-state equation, as shown in Figure 11-8(a). After plotting Equation (11-3) on the map and changing two entries to don’t-cares, the next-state equation simplifies to Q+ = S + R′Q (SR = 0) (11-5) TABLE 11-1 S-R Latch Next State and Output Present State Q Next State Q+ Present Output P SR SR SR SR SR SR SR SR 00 01 11 10 00 01 11 10 0 0 0 0 1 1 1 0 0 1 1 0 0 1 0 0 0 0 © Cengage Learning 2014 Latches and Flip-Flops 341 In words, this equation tells us that the next state of the latch will be 1 either if it is set to 1 with an S input, or if the present state is 1 and the latch is not reset. The condition SR = 0 implies that S and R cannot both be 1 at the same time. An equa-tion that expresses the next state of a latch in terms of its present state and inputs will be referred to as a next-state equation, or characteristic equation. Note that the characteristic equation is not necessarily the same as the next-state equation derived from the circuit. They both give the functional behavior of the latch (or FF). How-ever, the characteristic equation is a minimal equation and it takes into account any disallowed input combinations. The next-state equation derived from the circuit is not necessarily minimal and it does not take into account any disallowed input com-binations. Compare Equations (11-3) and (11-5).
Another approach for deriving the characteristic equation for an S-R latch is based on constructing a truth table for the next state of Q We previously discussed the latch operation by tracing signals through the gates, and the truth table in Figure 11-8(b) is based on this discussion. Plotting Q+ on a Karnaugh map gives the same result as Figure 11-8(a).
The S-R latch is often used as a component in more complex latches and flip-flops and in asynchronous systems. Another useful application of the S-R latch is for debouncing switches. When a mechanical switch is opened or closed, the switch con-tacts tend to vibrate or bounce open and closed several times before settling down to their final position. This produces a noisy transition, and this noise can interfere with the proper operation of a logic circuit. The input to the switch in Figure 11-9 is connected to a logic 1 (+V). The pull-down resistors connected to contacts a and b FIGURE 11-9 Switch Debouncing with an S-R Latch © Cengage Learning 2014 S a +V 1 b R Q S R Q Switch at a Switch at b Bounce at a Bounce at b Switch between a and b FIGURE 11-8 Derivation of Q+ for an S-R Latch © Cengage Learning 2014 0 1 0 1 1 1 0 X X 0 00 RQ (a) Q+ + map S 01 11 10 S R Q Q 0 0 0 0 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 – 1 1 1 – Inputs not allowed } (b) Truth table 342 Unit 11 assure that when the switch is between a and b the latch inputs S and R will always be at a logic 0, and the latch output will not change state. The timing diagram shows what happens when the switch is flipped from a to b. As the switch leaves a, bounces occur at the R input; when the switch reaches b, bounces occur at the S input. After the switch reaches b, the first time S becomes 1, after a short delay the latch switches to the Q = 1 state and remains there. Thus Q is free of all bounces even though the switch contacts bounce. This debouncing scheme requires a double throw switch that switches between two contacts; it will not work with a single throw switch that switches between one contact and open.
An alternative form of the S-R latch uses NAND gates, as shown in Figure 11-10. We will refer to this circuit as an S-R latch, and the table describes its operation. We have labeled the inputs to this latch S and R because S = 0 will set Q to 1 and R = 0 will reset Q to 0. If S and R are 0 at the same time, both the Q and Q′ outputs are forced to 1. Therefore, for the proper operation of this latch, the condition S = R = 0 is not allowed.
11.3 Gated Latches Gated latches have an additional input called the gate or enable input. When the gate input is inactive, which may be the high or low value, the state of the latch can-not change. When the gate input is active, the latch is controlled by the other inputs and operates as indicated in the preceding section. A NAND-gate version of a gated S-R latch is shown in Figure 11-11.
FIGURE 11-10 S-R Latch © Cengage Learning 2014 S R Q Q′ S R ) b ( ) a ( S L R Q Q′ Q Q 1 1 0 0 1 1 1 1 1 0 0 0 1 0 1 0 0 1 0 1 0 1 1 1 0 0 0 – 0 0 1 – R S } (c) Inputs not allowed FIGURE 11-11 NAND-Gate Gated S-R Latch © Cengage Learning 2014 S Q P G R Latches and Flip-Flops 343 The next-state equation is Q+ = SG + Q(R′ + G′) and the equation for the P output is P = Q′ + RG The next-state and output tables are shown in Table 11-2. When G = 0, the circuit is always in a stable state; when G = 1, S = 1 sets the latch and R = 1 resets the latch. Note that P = Q′ whenever the latch is in a stable state except for the input com-bination G = S = R = 1; consequently, as for the basic latch, the S = R = 1 input combination is disallowed.
Another reason for disallowing the S = R = 1 input combination is illustrated by considering a change in G from 1 to 0 with S = R = 1. When G changes, both inputs to the basic S-R latch change from 0 to 1, as shown in Figure 11-12. This causes both gates in the basic S-R latch to attempt to change from 1 to 0; a race condition exists and the propagation delays of the gates determine whether the latch stabilizes with Q = 0 or Q = 1. This was illustrated in Figure 11-6 for the simple NOR-gate latch.
It is also instructive to examine this problem from a different viewpoint. If the equation for Q+ is plotted on a Karnaugh map (Figure 11-13), it is evident that Q+ has a static 1-hazard for the input combinations G = 1, S = 1, R = 1, Q = 1 and TABLE 11-2 Next-State and Output of Gated S-R Latch FIGURE 11-12 Race Condition in the Gated S-R Latch © Cengage Learning 2014 S Q P G R 1 0 1 0 1 0 1 1 ?
1 ?
1 Next State Q+ Present State Q G = 0 G = 1 SR SR SR SR SR SR SR SR 00 01 11 10 00 01 11 10 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 0 1 1 Present Output P Present State Q G = 0 G = 1 SR SR SR SR SR SR SR SR 00 01 11 10 00 01 11 10 0 1 1 1 1 1 1 1 1 1 0 0 0 0 0 1 1 0 © Cengage Learning 2014 344 Unit 11 G = 0, S = 1, R = 1, Q = 1. Consequently, when G changes from 1 to 0 between these two input combinations, it is possible for Q to change from 1 to 0 and, because of the feedback, to cause Q to remain at Q = 0. This is simply a different interpreta-tion of the race condition described above. Of course, the static 1-hazard exists for G changing from 0 to 1 and, again, Q may change to 0, but in this case Q is forced back to 1 by the S = R = 1 input values. So, for this change, the hazard may cause a glitch in Q, but it cannot cause the latch to stabilize with Q = 0.
There is another restriction regarding gated S-R latches. The S and R inputs must not be changing or contain glitches while G = 1. For example, assume Q = 0 when G changes from 0 to 1 and S = 0 and R = 0. If S and R remain at 0 until G returns to 0, then Q remains at 0. However, if S contains a 1 glitch, maybe due to a static 1-hazard in its circuit, then Q may be forced to a 1 and will remain there after G becomes 0. A similar problem occurs if S does not change from 1 to 0 until after G changes to 1. This is referred to as the 1’s catching problem. A NOR-gate version of the gated S-R latch has a 0’s catching problem.
Another gated latch is the gated D latch. It can be obtained from a gated S-R latch by connecting S to D and R to D′. Figure 11-14(a) shows this construction using a basic S-R latch, two AND gates and an inverter; the NAND-gate, gated S-R latch in Figure 11-11 can be converted to a gated D latch with the addition of an inverter. As indicated in Figure 11-14(b), Q of the gated D latch remains unchanged while G is inactive, G = 0 in this case, and Q becomes equal to the D after some delay when G is active. The delay is due to the propagation delay of the gates. This latch is also referred to as a transparent latch since Q becomes equal to D while G is active. Figure 11-15 shows the state table and characteristic equation for the gated D latch.
FIGURE 11-13 Karnaugh Map for Q+ © Cengage Learning 2014 SR GQ 00 01 11 10 00 01 11 10 0 1 0 1 0 1 0 0 0 1 1 1 0 1 1 1 Q+ FIGURE 11-14 Gated D Latch © Cengage Learning 2014 Q (a) (b) D G S L R Q Q′ D G 0 1 0 Latches and Flip-Flops 345 Most digital systems use a clock signal to synchronize the change in outputs of the system’s flip-flops to an edge of the clock signal, either the positive (0 to 1) or the negative (1 to 0) edge of the clock. It is tempting to think that gated latches could be used as flip-flops where the clock signal is connected to the gate inputs of the latches. However, this is not a practical approach. The following example illustrates the dif-ficulty. In the circuit of Figure 11-16, it seems that when the Clk is 1 the next value of Q should be Q′ when the input x = 1 and should be Q when x = 0. However, when Clk = 1 and x = 1, D = Q′ causes Q to change and, if Clk remains 1, the change in Q will feed back and cause Q to change again. If Clk remains at 1, Q will oscillate. Consequently, the circuit will only operate as intended if Clk remains at 1 for a short time; it has to 1 just long enough to allow Q to change but short enough to prevent the change from feeding back and causing a second change. With a single latch, it may be possible to control the clock high time so the latch operates as intended, but in a system with several latches, the variation in gate delays would make it impos-sible to provide the correct clock width to all latches.
To avoid this timing problem, more complicated flip-flops restrict the flip-flop outputs to only change on an edge of the clock, and the outputs cannot change at other times even if the inputs change. If the inputs to the flip-flop only need to be stable for a short period of time around the clock edge, then we refer to the flip-flop as edge-triggered. (See the discussion of setup and hold times in the next sec-tion.) The term master-slave flip-flop refers to a particular implementation that uses two gated latches in such a way that the flip-flop outputs only change on a clock edge. However, master-slave flip-flops are not necessarily edge-triggered flip-flops because they may require the flip-flop inputs to be stable at times during the clock period other than just around the clock edge. The S-R, J-K, and T master-slave flip-flops in later sections are examples. The master-slave D flip-flop of the next section is an exception; it uses the master-slave implementation and it is also edge triggered.
FIGURE 11-15 Symbol and Truth Table for Gated Latch © Cengage Learning 2014 D L G Q Q′ Q+ = G′Q + GD 0 0 1 0 00 01 11 10 1 1 1 0 0 Q GD 1 G D Q Q 0 0 0 0 0 0 1 1 0 1 0 0 0 1 1 1 1 0 0 0 1 0 1 0 1 1 0 1 1 1 1 1 FIGURE 11-16 Unreliable Gated D Latch Circuit © Cengage Learning 2014 Gated D Latch Clk D G x Q 346 Unit 11 11.4 Edge-Triggered D Flip-Flop A D flip-flop (Figure 11-17) has two inputs, D (data) and Ck (clock). The small arrowhead on the flip-flop symbol identifies the clock input. Unlike the D latch, the flip-flop output changes only in response to the clock, not to a change in D. If the output can change in response to a 0 to 1 transition on the clock input, we say that the flip-flop is triggered on the rising edge (or positive edge) of the clock. If the out-put can change in response to a 1 to 0 transition on the clock input, we say that the flip-flop is triggered on the falling edge (or negative edge) of the clock. An inversion bubble on the clock input indicates a falling-edge trigger (Figure 11-17(b)), and no bubble indicates a rising-edge trigger (Figure 11-17(a)). The term active edge refers to the clock edge (rising or falling) that triggers the flip-flop state change.
The state of a D flip-flop after the active clock edge (Q+) is equal to the input (D) before the active edge. For example, if D = 1 before the clock pulse, Q = 1 after the active edge, regardless of the previous value of Q. Therefore, the char-acteristic equation is Q+ = D. If D changes at most once following each clock pulse, the output of the flip-flop is the same as the D input, except that the output changes are delayed until after the active edge of the clock pulse, as illustrated in Figure 11-18.
A rising-edge-triggered D flip-flop can be constructed from two gated D latches and an inverter, as shown in Figure 11-19(a). The timing diagram is shown in Figure 11-19(b). When CLK = 0, G1 = 1, and the first latch is transparent so that the P output follows the D input. Because G2 = 0, the second latch holds the current value of Q. When CLK changes to 1, G1 changes to 0, and the current value of D is stored FIGURE 11-17 D Flip-Flops © Cengage Learning 2014 Q′ Q Ck D FF (a) Rising-edge trigger Q′ Q D FF (b) Falling-edge trigger Ck D Q Q 0 0 0 0 1 0 1 0 1 1 1 1 (c) Truth table Q+ D FIGURE 11-18 Timing for D Flip-Flop (Falling-Edge Trigger) © Cengage Learning 2014 Q Ck 1 0 1 0 1 1 0 1 1 0 0 D Latches and Flip-Flops 347 in the first latch. Because G2 = 1, the value of P flows through the second latch to the Q output. When CLK changes back to 0, the second latch takes on the value of P and holds it and, then, the first latch starts following the D input again. If the first latch starts following the D input before the second latch takes on the value of P, the flip-flop will not function properly. Therefore, the circuit designers must pay careful attention to timing issues when designing edge-triggered flip-flops. With this circuit, output state changes occur only following the rising edge of the clock. The value of D at the time of the rising edge of the clock determines the value of Q, and any extra changes in D that occur between rising clock edges have no effect on Q.
Because a flip-flop changes state only on the active edge of the clock, the propa-gation delay of a flip-flop is the time between the active edge of the clock and the resulting change in the output. However, there are also timing issues associated with the D input. To function properly, the D input to an edge-triggered flip-flop must be held at a constant value for a period of time before and after the active edge of the clock. If D changes at the same time as the active edge, the behavior is unpre-dictable. The amount of time that D must be stable before the active edge is called the setup time (tsu), and the amount of time that D must hold the same value after the active edge is the hold time (th). The times at which D is allowed to change dur-ing the clock cycle are shaded in the timing diagram of Figure 11-20. The propagation FIGURE 11-19 D Flip-Flop (Rising-Edge Trigger) © Cengage Learning 2014 D P Q D1 L (a) Construction from two gated D latches G1 Q1 D2 L G2 Q2 CLK (b) Timing analysis Q P D G1 CLK = G2 FIGURE 11-20 Setup and Hold Times for an Edge-Triggered D Flip-Flop © Cengage Learning 2014 Q D CLK tsu th tp tp 348 Unit 11 delay (tp) from the time the clock changes until the Q output changes is also indi-cated. For Figure 11-19(a), the setup time allows a change in D to propagate through the first latch before the rising edge of Clock. The hold time is required so that D gets stored in the first latch before D changes.
Using these timing parameters, we can determine the minimum clock period for a circuit which will not violate the timing constraints. Consider the circuit of Figure 11-21(a). Suppose the inverter has a propagation delay of 2 ns, and suppose the flip-flop has a propagation delay of 5 ns and a setup time of 3 ns. (The hold time does not affect this calculation.) Suppose, as in Figure 11-21(b), that the clock period is 9 ns, i.e., 9 ns is the time between successive active edges (rising edges for this figure). Then, 5 ns after a clock edge, the flip-flop output will change, and 2 ns after that, the output of the inverter will change. Therefore, the input to the flip-flop will change 7 ns after the rising edge, which is 2 ns before the next rising edge. But the setup time of the flip-flop requires that the input be stable 3 ns before the rising edge; therefore, the flip-flop may not take on the correct value.
Suppose instead that the clock period were 15 ns, as in Figure 11-21(c). Again, the input to the flip-flop will change 7 ns after the rising edge. However, because the clock is slower, this is 8 ns before the next rising edge. Therefore, the flip-flop will work properly. Note in Figure 11-21(c) that there is 5 ns of extra time between the time the D input is correct and the time when it must be correct for the setup time to be satisfied. Therefore, we can use a shorter clock period, and have less extra time, or no extra time. Figure 11-21(d) shows that 10 ns is the minimum clock period which will work for this circuit.
FIGURE 11-21 Determination of Minimum Clock Period © Cengage Learning 2014 D Q CLK D Q CLK (a) Simple flip-flop circuit (b) Setup time not satisfied (c) Setup time satisfied (d) Minimum clock period Setup time 3 ns Flip-flop delay 5 ns Inverter delay 2 ns D Q CLK Setup time 3 ns Extra time 5 ns Flip-flop delay 5 ns Inverter delay 2 ns D Q CLK Setup time 3 ns Flip-flop delay 5 ns Inverter delay 2 ns Latches and Flip-Flops 349 11.5 S-R Flip-Flop An S-R flip-flop (Figure 11-22) is similar to an S-R latch in that S = 1 sets the Q output to 1, and R = 1 resets the Q output to 0. The essential difference is that the flip-flop has a clock input, and the Q output can change only after an active clock edge. The truth table and characteristic equation for the flip-flop are the same as for the latch, but the interpretation of Q+ is different. For the latch, Q+ is the value of Q after the propagation delay through the latch, while for the flip-flop, Q+ is the value that Q assumes after the active clock edge.
Figure 11-23(a) shows an S-R flip-flop constructed from two S-R latches and gates. This flip-flop changes state after the rising edge of the clock. The circuit is often referred to as a master-slave flip-flop. When CLK = 0, the S and R inputs set the outputs of the master latch to the appropriate value while the slave latch holds the previous value of Q. When the clock changes from 0 to 1, the value of P is held in the master latch and this value is transferred to the slave latch. The master latch holds the value of P while CLK = 1, and, hence, Q does not change. When the clock changes from 1 to 0, the Q value is latched in the slave, and the master can process FIGURE 11-22 S-R Flip-Flop © Cengage Learning 2014 S Q R Q′ Ck Operation summary: S R 0 No state change S 1, R 0 Set Q to 1 (after active Ck edge) S 0, R 1 Reset Q to 0 (after active Ck edge) S R 1 Not allowed FIGURE 11-23 S-R Flip-Flop Implementation and Timing © Cengage Learning 2014 (a) Implementation with two latches (b) Timing analysis S R S1 Master R1 P P′ S2 Slave R2 Q Q′ Q CLK Q′ Q t1 t2 t3 t4 t5 P R S CLK′ CLK 350 Unit 11 new inputs. Figure 11-23(b) shows the timing diagram. Initially, S = 1 and Q changes to 1 at t1. Then R = 1 and Q changes to 0 at t3.
At first glance, this flip-flop appears to operate just like an edge-triggered flip-flop, but there is a subtle difference. For a rising-edge-triggered flip-flop the value of the inputs is sensed at the rising edge of the clock, and the inputs can change while the clock is low. For the master-slave flip-flop, if the inputs change while the clock is low, the flip-flop output may be incorrect. For example, in Figure 11-23(b) at t4, S = 1 and R = 0, so P changes to 1. Then S changes to 0 at t5, but P does not change, so at t5, Q changes to 1 after the rising edge of CLK. However, at t5, S = R = 0, so the state of Q should not change. We can solve this problem if we only allow the S and R inputs to change while the clock is high.
11.6 J-K Flip-Flop The J-K flip-flop (Figure 11-24) is an extended version of the S-R flip-flop. The J-K flip-flop has three inputs—J, K, and the clock (CK). The J input corresponds to S, and K corresponds to R. That is, if J = 1 and K = 0, the flip-flop output is set to Q = 1 after the active clock edge; and if K = 1 and J = 0, the flip-flop output is reset to Q = 0 after the active edge. Unlike the S-R flip-flop, a 1 input may be applied simultaneously to J and K, in which case the flip-flop changes state after the active clock edge. When J = K = 1, the active edge will cause Q to change from 0 to 1, or FIGURE 11-24 J-K Flip-Flop (Q Changes on the Rising Edge) © Cengage Learning 2014 Q′ ′ ′ Q J K FF CK (a) J-K flip-flop (c) J-K flip-flop timing Q K J Clock t1 tp tp tp t2 t3 (b) Truth table and characteristic equation J K Q Q 0 0 0 0 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 1 1 1 1 0 Q+ JQ K Q Latches and Flip-Flops 351 from 1 to 0. The next-state table and characteristic equation for the J-K flip-flop are given in Figure 11-24(b).
Figure 11-24(c) shows the timing for a J-K flip-flop. This flip-flop changes state a short time (tp) after the rising edge of the clock pulse, provided that J and K have appropriate values. If J = 1 and K = 0 when Clock = 0, Q will be set to 1 following the rising edge. If K = 1 and J = 0 when Clock = 0, Q will be set to 0 after the rising edge. Similarly, if J = K = 1, Q will change state after the rising edge. Referring to Figure 11-24(c), because Q = 0, J = 1, and K = 0 before the first rising clock edge, Q changes to 1 at t1. Because Q = 1, J = 0, and K = 1 before the second rising clock edge, Q changes to 0 at t2. Because Q = 0, J = 1, and K = 1 before the third rising clock edge, Q changes to 1 at t3.
One way to realize the J-K flip-flop is with two S-R latches connected in a master-slave arrangement, as shown in Figure 11-25. This is the same circuit as for the S-R master-slave flip-flop, except S and R have been replaced with J and K, and the Q and Q′ outputs are feeding back into the input gates. Because S = J·Q′·CLK′ and R = K·Q·CLK′, only one of S and R inputs to the first latch can be 1 at any given time. If Q = 0 and J = 1, then S = 1 and R = 0, regardless of the value of K. If Q = 1 and K = 1, then S = 0 and R = 1, regardless of the value of J.
11.7 T Flip-Flop The T flip-flop, also called the toggle flip-flop, is frequently used in building counters. Most CPLDs and FPGAs can be programmed to implement T flip-flops. The T flip-flop in Figure 11-26(a) has a T input and a clock input. When T = 1 the flip-flop changes state after the active edge of the clock. When T = 0, no state change occurs. The next-state table and characteristic equation for the T flip-flop are given in Figure 11-26(b). The characteristic equation states that the next state of the flip-flop (Q+) will be 1 iff the present state (Q) is 1 and T = 0 or the present state is 0 and T = 1.
FIGURE 11-25 Master-Slave J-K Flip-Flop (Q Changes on Rising Edge) © Cengage Learning 2014 J K S1 Master R1 P P′ S2 Slave R2 Q Q′ Q CLK Q′ FIGURE 11-26 T Flip-Flop © Cengage Learning 2014 Q′ Ck T FF (a) T Q Q 0 0 0 0 1 1 1 0 1 1 1 0 Q+ T Q TQ T ⊕ Q (b) Q ′ ′ 352 Unit 11 Figure 11-27 shows a timing diagram for the T flip-flop. At times t2 and t4 the T input is 1 and the flip-flop state (Q) changes a short time (tp) after the falling edge of the clock pulse. At times t1 and t3 the T input is 0, and the clock edge does not cause a change of state.
One way to implement a T flip-flop is to connect the J and K inputs of a J-K flip-flop together, as shown in Figure 11-28(a). Substituting T for J and K in the J-K characteristic equation gives Q+ = JQ′ + K′Q = TQ′ + T′Q which is the characteristic equation for the T flip-flop. Another way to realize a T flip-flop is with a D flip-flop and an exclusive-OR gate (Figure 11-28(b)). The D input is Q ⊕ T, so Q+ = Q ⊕ T = TQ′ + T′Q, which is the characteristic equation for the T flip-flop.
11.8 Flip-Flops with Additional Inputs Flip-flops often have additional inputs which can be used to set the flip-flops to an initial state independent of the clock. Figure 11-29 shows a D flip-flop with clear and preset inputs. The small circles (inversion symbols) on these inputs indicate that a logic 0 (rather than a 1) is required to clear or set the flip-flop. This type of input is often referred to as active-low because a low voltage or logic 0 will activate the clear or preset function. We will use the notation ClrN or PreN to indicate active-low clear FIGURE 11-27 Timing Diagram for T Flip-Flop (Falling-Edge Trigger) © Cengage Learning 2014 Q t2 t1 t3 t4 T tp tp Ck FIGURE 11-28 Implementation of T Flip-Flops © Cengage Learning 2014 Q′ T Q Ck Clock J (a) Conversion of J-K to T K Q′ Clock Q D T (b) Conversion of D to T Ck Latches and Flip-Flops 353 and preset inputs. Thus, a logic 0 applied to ClrN will reset the flip-flop to Q = 0, and a 0 applied to PreN will set the flip-flop to Q = 1. These inputs override the clock and D inputs. That is, a 0 applied to the ClrN will reset the flip-flop regardless of the val-ues of D and the clock. Under normal operating conditions, a 0 should not be applied simultaneously to ClrN and PreN. When ClrN and PreN are both held at logic 1, the D and clock inputs operate in the normal manner. ClrN and PreN are often referred to as asynchronous clear and preset inputs because their operation does not depend on the clock. The table in Figure 11-29(b) summarizes the flip-flop operation. In the table, ↑ indicates a rising clock edge, and X is a don’t-care. The last row of the table indicates that if Ck is held at 0, held at 1, or has a falling edge, Q does not change. The clear and preset inputs can also be synchronous, i.e., the clear and set operations occur on the active edge of the clock. Often a synchronous clear or preset will over-ride the other synchronous inputs, e.g., a D flip-flop with a synchronous clear input will clear on the active edge of the clock when the clear input is active independent of the value on D.
Figure 11-30 illustrates the operation of the clear and preset inputs. At t1, ClrN = 0 holds the Q output at 0, so the rising edge of the clock is ignored. At t2 and t3, normal state changes occur because ClrN and PreN are both 1. Then, Q is set to 1 by PreN = 0, but Q is cleared at t4 by the rising edge of the clock because D = 0 at that time.
In synchronous digital systems, the flip-flops are usually driven by a common clock so that all state changes occur at the same time in response to the same clock edge. When designing such systems, we frequently encounter situations where we want some flip-flops to hold existing data even though the data input to the flip-flops may be changing. One way to do this is to gate the clock, as shown in Figure 11-31(a). When En = 0, the clock input to the flip-flop is 0, and Q does not change. This method FIGURE 11-29 D Flip-Flop with Clear and Preset © Cengage Learning 2014 Q Q Ck ClrN PreN D (a) Ck D PreN ClrN Q x x 0 0 (not allowed) x x 0 1 1 x x 1 0 0 0 1 1 0 1 1 1 1 0,1,↓ ↑ ↑ x 1 1 Q (no change) (b) ′ Q t1 t2 t3 t4 PreN ClrN D CLK FIGURE 11-30 Timing Diagram for D Flip-Flop with Asynchronous Clear and Preset © Cengage Learning 2014 354 Unit 11 has two potential problems. First, gate delays may cause the clock to arrive at some flip-flops at different times than at other flip-flops, resulting in a loss of synchroniza-tion. Second, if En changes at the wrong time, the flip-flop may trigger due to the change in En instead of due to the change in the clock, again resulting in loss of synchronization. Rather than gating the clock, a better way is to use a flip-flop with a clock enable (CE). Such flip-flops are commonly used in CPLDs and FPGAs.
Figure 11-31(b) shows a D flip-flop with a clock enable, which we will call a D-CE flip-flop. When CE = 0, the clock is disabled and no state change occurs, so Q+ = Q. When CE = 1, the flip-flop acts like a normal D flip-flop, so Q+ = D. Therefore, the characteristic equation is Q+ = Q·CE′ + D·CE. The D-CE flip-flop is easily imple-mented using a D flip-flop and a multiplexer (Figure 11-31(c)). For this circuit, the MUX output is Q+ = D = Q·CE′ + Din·CE Because there is no gate in the clock line, this cannot cause a synchronization problem.
11.9 Asynchronous Sequential Circuits The signals on the feedback loops in a sequential circuit define the state of the cir-cuit. In asynchronous sequential circuits the state of the circuit can change whenever any input changes. The latches discussed in this chapter are asynchronous sequential circuits. In addition, even though the output of a master-slave or edge-triggered flip-flop only changes on an edge of the clock input, the internal circuitry of the flip-flop is an asynchronous circuit. In order for asynchronous circuits to operate in a well-defined manner, they must satisfy several restrictions. Asynchronous circuits are not discussed in detail in this text,1 but the examples in this section illustrate some of these restrictions necessary for correct asynchronous circuit operation.
Consider the circuit in Figure 11-32(a). It has two feedback loops and, hence, four states. To analyze the circuit, break the feedback loops at the outputs of gates 4 and 5. Label the gate outputs P+ and Q+. The next-state equations are P+ = x′P + xQ Q+ = x′P′ + xQ 1 For more details, see M. Morris Mano and Ciletti, Michael D., Digital Design (4th Ed), (Pearson Prentice Hall, 2007).
FIGURE 11-31 D Flip-Flop with Clock Enable © Cengage Learning 2014 D Q Q′ Q′ Ck CLK (a) Gating the clock (b) D-CE symbol (c) Implementation En D Q CE D Din Q Ck Ck CLK CE 0 1 Q′ Q′ Latches and Flip-Flops 355 Note that both equations contain static 1-hazards. P+ contains a static 1-hazard for xPQ = 111 ↔ 011.
Figure 11-32(b) shows the circuit’s next-state table with the stable states circled.
Consider starting the circuit in total stable state xPQ = 111 and changing x to 0. The table indicates that the next state is PQ = 10 (i.e., P does not change and Q changes to 0). However, assume the inverter for x has a delay large compared to the gate delays. Then, when x changes to 0, the output of Gate 2 changes to 0 causing the outputs of both gates 4 and 5 to change to 0. When the x inverter output changes to 1, P = 0 prevents the output of Gate 1 from changing to 1 so P remains 0; however, the output of Gate 3 changes to 1 and Q becomes 1. The circuit stabilizes in state PQ = 01. This incorrect state transition is due to the static 1-hazard in P+, which causes a 0 glitch in P if the x inverter delay is large and, because of the feedback, P never changes back to 1. This problem can be eliminated by designing the circuits to be free of hazards.
Even if the circuit is free of hazards, delays in the “wrong” places in the circuit can cause incorrect state transitions. Consider the circuit in Figure 11-32(a) start-ing the circuit in total stable state xPQ = 010 and changing x to 1; the next-state table indicates the next state should be PQ = 00. However, if there is a large delay in the line labeled d, the circuit will transition to state PQ = 11. The 1 to 0 change propagating through the x inverter, Gate 1 and Gate 4 will change P to 0. When P changes to 0, the lower inverter output changes to 1 and, if line d at Gate 3 is still 1, Gate 3 and Gate 5 change to 1. With Q = 1, Gate 2 changes to 1 which causes Gate 4 to change back to 1. Note that this incorrect operation occurs because the x change does not reach a portion of the logic for Q until after the change in P has propagated back to the logic for Q. The potential for this incorrect operation can be detected by examining the next-state table and determining whether the next state after a single change in an input is different from the next state after three changes in that input. In the preceding example, starting in total stable state xPQ = 010 and changing x to 1 produces next state PQ = 00. Changing x back to 0 produces next state PQ = 01. Finally, changing x a third time to 1, produces next state PQ = 11. The table is said to contain an essential hazard at total state xPQ = 010.
Essential hazards are properties of the next-state table; they cannot be eliminated by modifying the circuit’s logic. To prevent incorrect operation due to essential haz-ards, it is necessary to control the delays in the circuit. In general, it may be neces-sary to insert delays in the feedback loops of the circuit. For the above example, this would require inserting delays at the outputs of Gates 4 and 5. Inserting delays in the feedback loops, assures that input changes propagate through the next state logic before changes in the state variables feedback to the inputs of the logic.
FIGURE 11-32 Asynchronous Circuit © Cengage Learning 2014 Q x P (a) 3 1 2 4 5 d 0 1 x 00 PQ 01 11 10 00 00 11 10 01 01 11 10 (b) 356 Unit 11 Both of the problems noted above are due to more than one signal in the cir-cuit changing with the circuit’s response depending on which signal(s) propagate through the circuit first. The static hazard causes a glitch if an input change propa-gates over some path in the circuit more quickly than it propagates over another path. For the essential hazard problem the two signals changing are an external input and a state variable. In both cases there is a “race” between two signal changes with the circuit operation depending on which signal wins the race. A similar problem can exist if two (or more) inputs to an asynchronous circuit can change at the same time. Consider the next state table in Figure 11-33 and consider starting in total state xyPQ = 1011 and changing both x and y to 0 at the same time. The table indicates the next state should be PQ = 11. If the y change propagates through the circuit first, then the circuit enters total state xyPQ = 1011. Then after the x change propagates through the circuit, the total state becomes xyPQ = 0011. However, if the x change propagates through the circuit first, the total state becomes xyPQ = 0100. Then, after the y change propagates through the circuit, the total becomes xyPQ = 0000. The final state depends upon which input change propagates fastest and, hence, the final state may not be PQ = 11, as indicated by the next-state table.
A similar race problem can occur if more than one state variable changes at (approximately) the same time. Consider the next-state table in Figure 11-34. The total state xPQR = 0000 has next state PQR = 011 when x changes to 1. If Q changes first, the circuit will transition to state PQR = 010 and then to PQR = 011. However, if R changes first, the circuit transitions to state PQR = 001 and may stabilize there. There is a race between the Q and R changes and, since the circuit can enter two different states depending which signal changes first, the race is called a critical race. FIGURE 11-33 Multiple Input Change Example © Cengage Learning 2014 00 01 xy 00 PQ 01 11 10 00 00 11 11 10 11 10 00 00 11 10 01 01 11 00 11 00 11 FIGURE 11-34 Multiple-State Variable Change Example © Cengage Learning 2014 0 1 x 000 PQR 001 011 010 110 111 101 100 000 011 101 101 000 101 101 000 100 001 011 011 110 111 110 110 Latches and Flip-Flops 357 There is a race between the P and Q signals when the circuit starts in total state xPQR = 1011 and x changes to 0. In this case, the circuit will enter state PQR = 101 no matter which state variable changes first, so the race is not critical.
In general, it is not possible to fix the problem with races between state variables by inserting delays in the circuit. For correct operation an asynchronous circuit must not contain any critical races.
11.10 Summary In this unit, we have studied several types of latches and flip-flops. Flip-flops have a clock input, and the output changes only in response to a rising or falling edge of the clock. All of these devices have two output states: Q = 0 and Q = 1. For the S-R latch, S = 1 sets Q to 1, and R = 1 resets Q to 0. S = R = 1 is not allowed. The S-R flip-flop is similar except that Q only changes after the active edge of the clock. The gated D latch transmits D to the Q output when G = 1. When G is 0, the cur-rent value of D is stored in the latch and Q does not change. For the D flip-flop, Q is set equal to D after the active clock edge. The D-CE flip-flop works the same way, except the clock is only enabled when CE = 1. The J-K flip-flop is similar to the S-R flip-flop in that when J = 1 the active clock edge sets Q to 1, and when K = 1, the active edge resets Q to 0. When J = K = 1, the active clock edge causes Q to change state. The T flip-flop changes state on the active clock edge when T = 1; otherwise, Q does not change. Flip-flops can have asynchronous clear and preset inputs that cause Q to be cleared to 0 or preset to 1 independently of the clock.
Flip-flops can be constructed using gate circuits with feedback. Analysis of such circuits can be accomplished by tracing signal changes through the gates. Analysis can also be done using flow tables and asynchronous sequential circuit theory, but that is beyond the scope of this text. Timing diagrams are helpful in understanding the time relationships between the input and output signals for a latch or flip-flops. In general, the inputs must be applied a specified time before the active clock edge (the setup time), and they must be held constant a specified time after the active edge (the hold time). The time after the active clock edge before Q changes is the propagation delay.
The characteristic (next-state) equation for a flip-flop can be derived as follows: First, make a truth table that gives the next state (Q+) as a function of the present state (Q) and the inputs. Any illegal input combinations should be treated as don’t-cares. Then, plot a map for Q+ and read the characteristic equation from the map.
The characteristic equations for the latches and flip-flops discussed in this chap-ter are: Q+ = S + R′Q (SR = 0) (S-R latch or flip-flop) (11-6) Q+ = GD + G′Q (gated D latch) (11-7) Q+ = D (D flip-flop) (11-8) 358 Unit 11 Q+ = D·CE + Q·CE′ (D-CE flip-flop) (11-9) Q+ = JQ′ + K′Q (J-K flip-flop) (11-10) Q+ = T ⊕ Q = TQ′ + T ′Q (T flip-flop) (11-11) In each case, Q represents an initial or present state of the flip-flop, and Q+ rep-resents the final or next state. These equations are valid only when the appropriate restrictions on the flip-flop inputs are observed. For the S-R flip-flop, S = R = 1 is forbidden. For the master-slave S-R flip-flop, S and R should not change during the half of the clock cycle preceding the active edge. Setup and hold time restrictions must also be satisfied.
The characteristic equations given above apply to both latches and flip-flops, but their interpretation is different for the two cases. For example, for the gated D latch, Q+ represents the state of the flip-flop a short time after one of the inputs changes. However, for the D flip-flop, Q+ represents the state of the flip-flop a short time after the active clock edge.
Conversion of one type of flip-flop to another is usually possible by adding exter-nal gates. Figure 11-28 shows how a J-K flip-flop and a D flip-flop can be converted to a T flip-flop.
Problems 11.1 Assume that the inverter in the given circuit has a propagation delay of 5 ns and the AND gate has a propagation delay of 10 ns. Draw a timing diagram for the cir-cuit showing X, Y, and Z. Assume that X is initially 0, Y is initially 1, after 10 ns X becomes 1 for 80 ns, and then X is 0 again.
11.2 A latch can be constructed from an OR gate, an AND gate, and an inverter con-nected as follows: (a) What restriction must be placed on R and H so that P will always equal Q′ (under steady-state conditions)?
Y X Z R H Q P Latches and Flip-Flops 359 (b) Construct a next-state table and derive the characteristic (next-state) equation for the latch.
(c) Complete the following timing diagram for the latch.
11.3 This problem illustrates the improper operation that can occur if both inputs to an S-R latch are 1 and are then changed back to 0. For Figure 11-6, complete the follow-ing timing chart, assuming that each gate has a propagation delay of exactly 10 ns. Assume that initially P = 1 and Q = 0. Note that when t = 100 ns, S and R are both changed to 0. Then, 10 ns later, both P and Q will change to 1. Because these 1’s are fed back to the gate inputs, what will happen after another 10 ns?
11.4 Design a gated D latch using only NAND gates and one inverter.
11.5 What change must be made to Figure 11-19(a) to implement a falling-edge-triggered D flip-flop? Complete the following timing diagram for the modified flip-flop.
11.6 A reset-dominant flip-flop behaves like an S-R flip-flop, except that the input S = R = 1 is allowed, and the flip-flop is reset when S = R = 1.
(a) Derive the characteristic equation for a reset-dominant flip-flop.
Q P G2 D Clock = G1 P Q H R 0 Q P R S 50 100 140 150 200 t(ns) 360 Unit 11 (b) Show how a reset-dominant flip-flop can be constructed by adding gate(s) to an S-R flip-flop.
11.7 Complete the following timing diagram for the flip-flop of Figure 11-24(a).
11.8 Complete the following diagrams for the falling-edge-triggered D-CE flip-flop of Figure 11-31(c). Assume Q begins at 1.
(a) First draw Q based on your understanding of the behavior of a D flip-flop with clock enable.
(b) Now draw in the internal signal D from Figure 11-31(c), and confirm that this gives the same Q as in (a).
11.9 (a) Complete the following timing diagram for a J-K flip-flop with a falling-edge trigger and asynchronous ClrN and PreN inputs.
Q K J Clock D Q CE Din Clock Q Clock K J PreN ClrN Latches and Flip-Flops 361 (b) Complete the timing diagram for the following circuit. Note that the Ck inputs on the two flip-flops are different.
11.10 Convert by adding external gates: (a) a D flip-flop to a J-K flip-flop.
(b) a T flip-flop to a D flip-flop.
(c) a T flip-flop to a D flip-flop with clock enable.
11.11 Complete the following timing diagram for an S-R latch. Assume Q begins at 1.
11.12 Using a truth table similar to Figure 11-8(b), confirm that each of these circuits is an S-R latch. What happens when S = R = 1 for each circuit?
11.13 An AB latch operates as follows: If A = 0 and B = 0, the latch state is Q = 0; if either A = 1 or B = 1 (but not both), the latch output does not change; and when both A = 1 and B = 1, the latch state is Q = 1.
(a) Construct the state table and derive the characteristic equation for this AB latch.
(b) Derive a circuit for the AB latch that has four two-input NAND gates and two inverters.
(c) In your circuit of part (b), are there any transitions between input combinations that might cause unreliable operation? Verify your answer.
Q′ 1 Q1 Ck CLR ClrN Clock D1 Q′ 2 Q2 Ck CLR D2 Q2 Q1 Clock ClrN Q R S S R Q Q′ S R Q Q′ (a) (b) 00 01 10 0 1 11 362 Unit 11 (d) In your circuit of part (b), is there a gate output that provides the signal Q′? Verify your answer.
(e) Derive a circuit for the AB latch using four two-input NOR gates and two inverters.
(f ) Answer parts (c) and (d) for your circuit of part (e).
11.14 (a) Construct a state table for this circuit and identify the stable states of the circuit.
(b) Derive a Boolean algebra equation for the next value of the output Q in terms of Q, A and B.
(c) Analyze the behavior of the circuit. Is it a useful circuit? If not, explain why not; if yes, explain what it does.
11.15 The following circuit is intended to be a gated latch circuit where the signal G is the gate.
(a) Derive the next-state equation for this circuit using Q as the state variable and P as an output.
(b) Construct the state table and output table for the circuit. Circle the stable states of the circuit.
(c) Are there any restrictions on the allowable input combinations on M and N? Explain your answer.
(d) Is the output P usable as the complement of Q? Verify your answer.
(e) Assume that Gate 1 has a propagation delay of 30 ns and Gates 2, 3, and 4 have propagation delays of 10 ns. Construct a timing diagram for the circuit for the following input change: M = N = Q = 0 with G changing from 1 to 0.
2-to-1 MUX Y I1 I0 S 2-to-1 MUX Y I1 I0 S Q 0 A 1 B M N G P Q 1 2 3 4 Latches and Flip-Flops 363 11.16 Analyze the latch circuit shown.
(a) Derive the next-state equation for this circuit using Q as the state variable and P as an output.
(b) Construct the state table and output table for the circuit. Circle the stable states of the circuit.
(c) Are there any restrictions on the allowable input combinations on A and B? Explain your answer.
(d) Is the output P usable as the complement of Q? Verify your answer.
A B Q P R S Q G D 11.17 Derive the characteristic equations for the following latches and flip-flops in product-of-sums form.
(a) S-R latch or flip-flop (b) Gated D latch (c) D flip-flop (d) D-CE flip-flop (e) J-K flip-flop (f ) T flip-flop 11.18 Complete the following timing diagrams for a gated D latch. Assume Q begins at 0.
(a) First draw Q based on your understanding of the behavior of a gated D latch.
(b) Now draw in the internal signals S and R from Figure 11-14, and confirm that S and R give the same value for Q as in (a).
364 Unit 11 11.19 Complete the following diagrams for the rising-edge-triggered D flip-flop of Figure 11-19. Assume Q begins at 1.
(a) First draw Q based on your understanding of the behavior of a D flip-flop.
(b) Now draw in the internal signal P from Figure 11-19, and confirm that P gives the same Q as in (a).
11.20 A set-dominant flip-flop is similar to the reset-dominant flip-flop of Problem 11.6 except that the input combination S = R = 1 sets the flip-flop. Repeat Problem 11.6 for a set-dominant flip-flop.
11.21 Fill in the timing diagram for a falling-edge-triggered S-R flip-flop. Assume Q begins at 0.
11.22 Fill in the timing diagram for a falling-edge-triggered J-K flip-flop.
(a) Assume Q begins at 0.
(b) Assume Q begins at 1, but Clock, J, and K are the same.
P Q D Clock Q R S Clock Q K J Clock Latches and Flip-Flops 365 11.23 (a) Find the input for a rising-edge-triggered D flip-flop that would produce the output Q as shown. Fill in the timing diagram.
(b) Repeat for a rising-edge-triggered T flip-flop.
11.24 Here is the diagram of a 3-bit ripple counter. Assume Q0 = Q1 = Q2 = 0 at t = 0, and assume each flip-flop has a delay of 1 ns from the clock input to the Q output. Fill in Q0, Q1, and Q2 of the timing diagram. Flip-flop Q1, will be triggered when Q0 changes from 0 to 1.
11.25 Fill in the following timing diagram for a rising-edge-triggered T flip-flop with an asychronous active-low PreN input. Assume Q begins at 1.
11.26 The ClrN and PreN inputs introduced in Section 11.8 are called asynchronous because they operate independently of the clock (i.e., they are not synchronized with the clock). We can also make flip-flops with synchronous clears or preset inputs. Q T PreN Clock Q2 Q1 Q0 Clock 5 1 1 1 10 15 20 25 30 35 40 45 50 Q0 T Clock Q1 T Q2 T T D Q Clock 366 Unit 11 A D-flip-flop with an active-low synchronous ClrN input may be constructed from a regular D flip-flop as follows.
D D ClrN Q Clk Q2 Q1 D ClrN Clk Fill in the timing diagram. For Q1, assume a synchronous ClrN as above, and for Q2, assume an asynchronous ClrN as in Section 11.8. Assume Q1 = Q2 = 0 at the beginning.
11.27 (a) Construct a D flip-flop using an inverter and an S-R flip-flop.
(b) If the propagation delay and setup time of the S-R flip-flop in (a) are 2.5 ns and 1.5 ns, respectively, and if the inverter has a propagation delay of 1 ns, what are the propagation delay and setup time of the D flip-flop of part (a)?
11.28 Redesign the debouncing circuit of Figure 11-9 using the S-R latch of Figure 11-10.
11.29 (a) Use the characteristic equation for the gated D latch to implement a two-level, NAND-gate circuit for the gated D latch.
(b) What hazards exist in the part (a) circuit for Q+?
(c) Modify the circuit of part (a) to obtain a two-level, NAND gate circuit for Q+ that is free of hazards.
(d) Add another output, P, to the circuit of part (a) so that P = Q′ whenever the circuit is in a stable state. When the circuit is in an unstable state, the value of P is a don’t care. Use the simplest circuit to obtain P. (Note: The circuit for P need not be two level.) 11.30 Consider converting the gated S-R latch of Figure 11-11 into a gated D latch by add-ing an inverter and making S = D and R = D′.
(a) Derive the next-state equation for Q+ from the circuit.
(b) Does the equation from part (a) contain any hazards? Verify your answer.
(c) Show that the equation from part (a) can be simplified to the characteristic equation for the gated D latch.
Latches and Flip-Flops 367 11.31 (a) Derive a NOR-gate version of the gated S-R latch analogous to Figure 11-11 by replacing each NAND gate with a NOR gate. Re-label the inputs so that Table 11-2 is the next-state table for the circuit; carefully indicate whether the inputs are active low or active high.
(b) Derive the next-state equation for Q+ from the circuit of part (a).
(c) Determine any hazards contained in the next state equation of part (b). (Hint: It may be easiest to write the equation as a product of sums rather than as a sum of products.) (d) What would be the disadvantage of allowing S = 1 and R = 1 in this circuit? Consider the effect on the P output, any race conditions that might result, and the effect of any hazards in the Q+ equation.
11.32 (a) Redesign the circuit of Figure 11-32 so that P+ and Q+ are free of hazards. Use 6 two-input NAND gates and inverters as needed.
(b) Add two ouputs, U and V, to your circuit of part (a) so that the values on U and V count the number of times x has changed (0 to 1 and 1 to 0) modulo 4. (U and V will cycle through the values 00, 01, 10, 11, 00, 01, . . . as x changes.) Assume that initially x = 0.
11.33 For each of the 8 stable states of Figure 11-33, consider changing both inputs and (a) determine the correct next state (b) the sequence of changes if x changes first, and (c) the sequence of changes if y changes first For parts (b) and (c), indicate whether the final state is correct or not and whether there might be a glitch in P or Q.
11.34 Label the states in Figure 11-34 from a = 000 to h = 100. Determine a new assign-ment of values of P, Q and R to states a through h so that every transition from a stable state is free of races or, else, the race is noncritical. (Retain 000 as the encoding for a.) Identify any noncritical races.
Programmed Exercise 11.35 Cover the bottom part of each page with a sheet of paper and slide it down as you check your answers.
The internal logic diagram of a falling-edge-triggered D flip-flop follows. This flip-flop consists of two basic S-R latches with added gates. When the clock input (CK) is 1, the value of D is stored in the first S-R latch (P). When the clock changes from 1 to 0, the value of P is transferred to the output latch (Q). Thus, the operation is similar to that of the master-slave S-R flip-flop shown in Figure 11-23, except for the edges at which the data is stored.
368 Unit 11 Q Q′ D P R S CK In this exercise you will be asked to analyze the operation of the D flip-flop shown above by filling in a table showing the values of CK, D, P, S, R, and Q after each change of input. It will be helpful if you mark the changes in these values on the circuit diagram as you trace the signals. Initially, assume the following signal values: CK D P S R Q 0 0 0 0 1 0 (stable) CK D P S R Q 1.
0 0 0 0 1 0 (stable) 2.
1 0 0 0 1 0 ?
3.
Verify by tracing signals through the circuit that this is a stable condition of the circuit; that is, no change will occur in P, S, R, or Q. Now assume that CK is changed to 1: Trace the change in CK through the circuit to see if a change in P, S, or R will occur. If a change does occur, mark row 2 of the preceding table “unstable” and enter the new values in row 3.
Answer: 2.
1 0 0 0 1 0 (unstable) 3.
1 0 0 0 0 0 (stable) 4.
1 1 0 0 0 0 (unstable) 5.
1 1 ?
Verify that row 3 is stable; that is, by tracing signals show that no further change in P, S, R, or Q will occur. Next D is changed to 1 as shown in row 4. Verify that row 4 is unstable, fill in the new values in row 5, and indicate if row 5 is stable or unstable.
Answer: CK D P S R Q 5.
1 1 1 0 0 0 (stable) 6.
0 1 1 0 0 0 ?
7.
0 1 ?
8.
0 1 Then CK is changed to 0 (row 6). If row 6 is unstable, indicate the new value of S in row 7 . If row 7 is unstable, indicate the new value of Q in row 8. Then determine whether row 8 is stable or not.
Latches and Flip-Flops 369 Answer: CK D P S R Q 7.
0 1 1 1 0 0 (unstable) 8.
0 1 1 1 0 1 (stable) 9.
0 0 (stable) 10.
1 0 11.
1 0 Next, D is changed back to 0 (row 9). Fill in the values in row 9 and verify that it is stable. CK is changed to 1 in row 10. If row 10 is unstable, fill in row 11 and indicate whether it is stable or not.
Answer: 9.
0 0 1 1 0 1 (stable) 10.
1 0 1 1 0 1 (unstable) 11.
1 0 0 0 0 1 (stable) 12.
0 0 13.
0 0 14.
0 0 CK is changed back to 0 in row 12. Complete the rest of the table.
Answer: 12.
0 0 0 0 0 1 (unstable) 13.
0 0 0 0 1 1 (unstable) 14.
0 0 0 0 1 0 (stable) Using the previous results, plot P and Q on the following timing diagram. Verify that your answer is consistent with the description of the flip-flop operation given in the first paragraph of this exercise.
Q P D CK 2 4 6 8 10 12 Row Q P D CK 2 4 6 8 10 12 Row Answer: 370 Registers and Counters U N I T 1 2 Objectives 1. Explain the operation of registers. Show how to transfer data between registers using a tri-state bus.
2. Explain the operation of shift registers, show how to build them using flip-flops, and analyze their operation. Construct a timing diagram for a shift register.
3. Explain the operation of binary counters, show how to build them using flip-flops and gates, and analyze their operation.
4. Given the present state and desired next state of a flip-flop, determine the required flip-flop inputs.
5. Given the desired counting sequence for a counter, derive the flip-flop input equations.
6. Explain the procedures used for deriving flip-flop input equations.
7. Construct a timing diagram for a counter by tracing signals through the circuit.
Registers and Counters 371 Study Guide 1. Study Section 12.1, Registers and Register Transfers.
(a) For the diagram of Figure 12-4, suppose registers A, B, C, and D hold the 8-bit binary numbers representing 91, 70, 249, and 118, respectively. Suppose G and H are both initially 0. What are the contents of G and H (decimal equivalent) after the rising edge of the clock: (1) if EF = 10, LdG = 0, and LdH = 1 at the rising edge?
(2) if EF = 01, LdG = 0, and LdH = 1 at the next rising edge?
(3) if EF = 11, LdG = 1, and LdH = 1 at the next rising edge?
(4) if EF = 00, LdG = 1, and LdH = 0 at the next rising edge?
(5) if EF = 10, LdG = 0, and LdH = 0 at the next rising edge?
(b) Work Problem 12.1.
2. Study Section 12.2, Shift Registers.
(a) Compare the block diagrams for the shift registers of Figure 12-7 and 12-10. Which one changes state on the rising edge of the clock pulse? The falling edge?
(b) Complete the following table and timing diagram (see next page) for the shift register of Figure 12-8.
Clock Cycle Number State of Shift Register When CLK = 1 Q7 Q6 Q5 Q4 Q3 Q2 Q1 Q0 1 0 0 0 0 0 0 0 0 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 372 Unit 12 SO SI CLK 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 1 (c) Explain in words the function of the MUX on the D input of flip-flop Q3 in Figure 12-10(b). Explain in words the meaning of the first of Equation (12-1).
(d) Verify that Equations (12-1) are consistent with Table 12-1.
(e) Work Problem 12.2.
3. Study Section 12.3, Design of Binary Counters, and Section 12.4, Counters for Other Sequences.
(a) For Figure 12-14, if CBA = 101, which of the T inputs is 1?
(b) Complete the following timing diagram for the binary counter of Figure 12-14. The initial value of Clock is 1; this does not count as a rising edge.
(c) Using the results of (b), draw a transition graph for this binary counter (similar to Figure 12-22).
TA TB TC A B C 0 0 0 0 0 1 0 1 1 0 0 1 Clock Registers and Counters 373 (d) Complete the following timing diagram for the binary counter of Figure 12-16.
DA DB DC A B C Clock 0 0 0 0 0 0 1 1 0 1 0 1 (e) Use Table 12-4 to verify that the values of TC, TB, and TA in Table 12-2 are correct.
(f ) What happens if the circuit of Figure 12-24 is started in one of the don’t-care states and, then, a clock pulse occurs? In particular, augment the tran-sition graph of Figure 12-26 to indicate the result for starting in states 101 and 110.
(g) What happens if the circuit of Figure 12-27 is started in one of the don’t-care states and then a clock pulse occurs? In particular, augment the transi-tion graph of Figure 12-22 to indicate the result for starting in states 001, 101, and 110.
(h) Work Problems 12.3, 12.4, 12.5, 12.6, and 12.7 .
4. Study Section 12.5, Counter Design Using S-R and J-K Flip-Flops.
(a) Referring to Table 12-5(c): If Q = Q+ = 0, explain in words why R is a don’t-care.
If Q = Q+ = 1, explain in words why S is a don’t-care.
If Q = 0 and Q+ = 1, what value should S have and why?
If Q = 1 and Q+ = 0, what value should R have and why?
374 Unit 12 (b) For Figure 12-30, verify that the RB and SB maps are consistent with the B+ map, and verify that the Rc and Sc maps are consistent with the C+ map.
(c) In Figure 12-30, where do the gate inputs (C, B, A, etc.) come from?
(d) For Figure 12-30(c), which flip-flop inputs will be 1 if CBA = 100? What will be the state after the rising clock edge?
(e) Complete the following transition graph by tracing signals in Figure 12-30(c). Compare your answer with Figure 12-22. What will happen if the counter is in state 110 and a clock pulse occurs?
(f ) Referring to Table 12-7(c): If Q = Q+ = 0, explain in words why K is a don’t-care.
If Q = Q+ = 1, explain in words why J is a don’t-care.
If Q = 0 and Q+ = 1, explain why both JK = 10 and JK = 11 will produce the required state change.
If Q = 1 and Q+ = 0, give two sets of values for J and K which will produce the required state change, and explain why your answer is valid.
(g) Verify that the maps of Figure 12-31(b) can be derived from the maps of Figure 12-31(a).
(h) Compare the number of logic gates in Figures 12-30 and 12-31. The J-K realization requires fewer gates than the S-R realization because the J-K maps have more don’t-cares than the S-R maps.
(i) Draw in the implied feedback connections on the circuit of Figure 12-31(c). ( j) By tracing signals through the circuit, verify that the state sequence for Figure 12-31(c) is correct.
000 100 Registers and Counters 375 (k) Find a minimum expression for F1 and for F2. (Hint: No variables are required.) (l) Work Problems 12.8 and 12.9.
5. Study Section 12.6, Derivation of Flip-Flop Input Equations—Summary.
(a) Make sure that you know how to derive input equations for the different types of flip-flops. It is important that you understand the procedures for deriving the equations; merely memorizing the rules is not sufficient.
(b) Table 12-9 is provided mainly for reference. It is not intended that you memorize this table; instead you should understand the reasons for the entries in the table. If you understand the reasons why a given map entry is 0, 1, or X, you should be able to derive the flip-flop input maps without reference to a table.
6. Work the part of Problem 12.10 that you have been assigned. Bring your solu-tion to this problem with you when you come to take the readiness test.
F1 F2 0 1 00 BC A 01 11 10 X X 1 X X 1 X X 0 1 00 BC A 01 11 10 X X 0 X X X X X Registers and Counters A register consists of a group of flip-flops with a common clock input. Registers are commonly used to store and shift binary data. Counters are another simple type of sequential circuit. A counter is usually constructed from two or more flip-flops which 376 Unit 12 change states in a prescribed sequence when input pulses are received. In this unit, you will learn procedures for deriving flip-flop input equations for counters. These procedures will be applied to more general types of sequential circuits in later units.
12.1 Registers and Register Transfers Several D flip-flops may be grouped together with a common clock to form a register (Figure 12-1(a)). Because each flip-flop can store one bit of information, this register can store four bits of information. This register has a load signal that is ANDed with the clock. When Load = 0, the register is not clocked, and it holds its present value. FIGURE 12-1 4-Bit D Flip-Flop Registers with Data, Load, Clear, and Clock Inputs © Cengage Learning 2014 Q3 D3 Clr (a) Using gated clock Data in Data out 0→1 1 ClrN Load Clk 1 0 1 Q2 D2 Clr 0→1 Q1 D1 Clr 0→0 Q0 D0 Clr 0→1 Q3 D3 Clr (b) With clock enable (c) Symbol Data in Data out 0→1 1 Load ClrN Clk 1 0 1 Q2 D2 Clr 0→1 Q1 D1 Clr 0→0 Q0 D0 CE CE CE CE Clr Q D CE Load Clk 4 4 Clr ClrN 0→1 Registers and Counters 377 When it is time to load data into the register, Load is set to 1 for one clock period. When Load = 1, the clock signal (Clk) is transmitted to the flip-flop clock inputs and the data applied to the D inputs will be loaded into the flip-flops on the falling edge of the clock. For example, if the Q outputs are 0000 (Q3 = Q2 = Q1 = Q0 = 0) and the data inputs are 1101 (D3 = 1, D2 = 1, D1 = 0 and D0 = 1), after the falling edge of the clock Q will change from 0000 to 1101 as indicated. (The notation 0 →1 at the flip-flop outputs indicates a change from 0 to 1.) The flip-flops in the register have asynchronous clear inputs that are connected to a common clear signal, ClrN. The bubble at the clear inputs indicates that a logic 0 is required to clear the flip-flops. ClrN is normally 1, and if it is changed momentarily to 0, the Q outputs of all four flip-flops will become 0.
As discussed in Section 11.8, gating the clock with another signal can cause timing problems. If flip-flops with clock enable are available, the register can be designed as shown in Figure 12-1(b). The load signal is connected to all four CE inputs. When Load = 0, the clock is disabled and the register holds its data. When Load is 1, the clock is enabled, and the data applied to the D inputs will be loaded into the flip-flops, following the falling edge of the clock. Figure 12-1(c) shows a symbol for the 4-bit reg-ister using bus notation for the D inputs and Q outputs. A group of wires that perform a common function is often referred to as a bus. A heavy line is used to represent a bus, and a slash with a number beside it indicates the number of bits in the bus.
Transferring data between registers is a common operation in digital systems. Figure 12-2 shows how data can be transferred from the output of one of two regis-ters into a third register using tri-state buffers. If En = 1 and Load = 1, the output of register A is enabled onto the tri-state bus and the data in register A will be stored in Q after the rising edge of the clock. If En = 0 and Load = 1, the output of register B will be enabled onto the tri-state bus and stored in Q after the rising edge of the clock.
Figure 12-3(a) shows an integrated circuit register that contains eight D flip-flops with tri-state buffers at the flip-flop outputs. These buffers are enabled when En = 0. A symbol for this 8-bit register is shown in Figure 12-3(b).
Figure 12-4 shows how data can be transferred from one of four 8-bit registers into one of two other registers. Registers A, B, C, and D are of the type shown in Figure 12-3. FIGURE 12-2 Data Transfer Between Registers © Cengage Learning 2014 A1 FF D1 CE FF D2 Q1 Q2 CE Clk En Load FF A2 FF B1 FF B2 FF Register A Register A = Flip-flops A1 and A2 Register B = Flip-flops B1 and B2 Register Q = Flip-flops Q1 and Q2 Register B Register Q Tri-State Bus 378 Unit 12 The outputs from these registers are all connected in parallel to a common tri-state bus. Registers G and H are similar to the register of Figure 12-1 except that they have eight flip-flops instead of four. The flip-flop inputs of registers G and H are also con-nected to the bus. When EnA = 0, the tri-state outputs of register A are enabled onto the bus. If LdG = 1, these signals on the bus are loaded into register G after the rising clock edge (or into register H if LdH = 1). Similarly, the data in register B, C, or D is transferred to G (or H) when EnB, EnC, or EnD is 0, respectively and LdG = 1 (or LdH = 1). If LdG = LdH = 1, both G and H will be loaded from the bus. The four enable signals may be generated by a decoder. The operation can be summarized as follows: If EF = 00, A is stored in G (or H).
If EF = 01, B is stored in G (or H).
If EF = 10, C is stored in G (or H).
If EF = 11, D is stored in G (or H).
Note that 8 bits of data are transferred in parallel from register A, B, C, or D to register G or H. As an alternative to using a bus with tri-state logic, eight 4-to-1 multiplexers could be used, but this would lead to a more complex circuit.
Parallel Adder with Accumulator In computer circuits, it is frequently desirable to store one number in a register of flip-flops (called an accumulator) and add a second number to it, leaving the result stored in the accumulator. One way to build a parallel adder with an accumulator is to add a register to the adder of Figure 4-2, resulting in the circuit of Figure 12-5. Suppose that the number X = xn . . . x2x1 is stored in the accumulator. Then, the number Y = FIGURE 12-4 Data Transfer Using a Tri-State Bus © Cengage Learning 2014 EnA Bus 8 8 8 Clock LdG Register G Register A EnB E F 8 Register B EnC 8 Register C Decoder EnD 8 Register D CE 8 Clock LdH Register H CE FIGURE 12-3 Logic Diagram for 8-Bit Register with Tri-State Output © Cengage Learning 2014 Q1 Q2 Q7 Q8 D1 D2 D7 D8 Q ...
En Clk En Clk 8 8 (a) (b) Registers and Counters 379 yn . . . y2 y1 is applied to the full adder inputs, and after the carry has propagated through the adders, the sum of X and Y appears at the adder outputs. An add signal (Ad) is used to load the adder outputs into the accumulator flip-flops on the rising clock edge. If si = 1, the next state of flip-flop xi will be 1. If si = 0, the next state of flip-flop xi will be 0. Thus, x + i = si, and if Ad = 1, the number X in the accumulator is replaced with the sum of X and Y, following the rising edge of the clock.
Observe that the adder with accumulator is an iterative structure that consists of a number of identical cells. Each cell contains a full adder and an associated accu-mulator flip-flop. Cell i, which has inputs ci and yi and outputs ci +1 and xi, is referred to as a typical cell.
Before addition can take place, the accumulator must be loaded with X. This can be accomplished in several ways. The easiest way is to first clear the accumulator using the asynchronous clear inputs on the flip-flops, and then put the X data on the Y inputs to the adder and add to the accumulator in the normal way. Alternatively, we could add multiplexers at the accumulator inputs so that we could select either the Y input data or the adder output to load into the accumulator. This would elimi-nate the extra step of clearing the accumulator but would add to the hardware com-plexity. Figure 12-6 shows a typical cell of the adder where the accumulator flip-flop FIGURE 12-5 n-Bit Parallel Adder with Accumulator Q D CE Full Adder Q D CE Full Adder Q D CE Full Adder Q D CE Accumulator Register Full Adder ...
...
...
...
xn xi x2 x1 sn si s2 s1 xn xi x2 x1 Ad CLK ClrN yn yi y2 y1 cn ci ci + 1 cn + 1 c2 c3 c1 = 0 Q′ Q′ Q′ Q′ FIGURE 12-6 Adder Cell with Multiplexer © Cengage Learning 2014 Q D CE CK CLK FA xi ci yi si ci + 1 Ad Ld 1 0 © Cengage Learning 2014 380 Unit 12 can either be loaded directly from yi or from the sum output (si). When Ld = 1 the multiplexer selects yi, and yi is loaded into the accumulator flip-flop (xi) on the rising clock edge. When Ad = 1 and Ld = 0, the adder output (si) is loaded into xi. The Ad and Ld signals are ORed together to enable the clock when either addition or load-ing occurs. When Ad = Ld = 0, the clock is disabled and the accumulator outputs do not change.
12.2 Shift Registers A shift register is a register in which binary data can be stored, and this data can be shifted to the left or right when a shift signal is applied. Bits shifted out one end of the register may be lost, or if the shift register is of cyclic type, bits shifted out one end are shifted back in the other end. Figure 12-7(a) illustrates a 4-bit right-shift register with serial input and output constructed from D flip-flops. When Shift = 1, the clock is enabled and shifting occurs on the rising clock edge. When Shift = 0, no shifting occurs and the data in the register is unchanged. The serial input (SI) is loaded into the first flip-flop (Q3) by the rising edge of the clock. At the same time, (a) Flip-flop connections (b) Timing diagram D3 Q3 CE D2 Q2 CE D1 Q1 CE D0 Q0 CE Serial in (SI) Shift Clock Serial out (SO) Q0 Q1 Q2 Q3 SI Clock FIGURE 12-7 Right-Shift Register © Cengage Learning 2014 Registers and Counters 381 8-Bit Serial-In, Serial-Out Shift Register CLK SI (Serial in) SO (Serial out) SO (Serial out) SI (Serial in) CLK (a) Block diagram (b) Logic diagram S Q Q7 Q0 R Q′ S Q R Q′ S Q R Q′ S Q R Q′ S Q R Q′ S Q R Q′ S Q R Q′ S Q R Q′ the output of the first flip-flop is loaded into the second flip-flop, the output of the second flip-flop is loaded into the third flip-flop, and the output of the third flip-flop is loaded into the last flip-flop. Because of the propagation delay of the flip-flops, the output value loaded into each flip-flop is the value before the rising clock edge. Figure 12-7(b) illustrates the timing when the shift register initially contains 0101 and the serial input sequence is 1, 1, 0, 1. The sequence of shift register states is 0101, 1010, 1101, 0110, 1011.
If we connect the serial output to the serial input, as shown by the dashed line, the resulting cyclic shift register performs an end-around shift. If the initial contents of the register is 0111, after one clock cycle the contents is 1011. After a second pulse, the state is 1101, then 1110, and the fourth pulse returns the register to the initial 0111 state.
Shift registers with 4, 8, or more flip-flops are available in integrated circuit form. Figure 12-8 illustrates an 8-bit serial-in, serial-out shift register. Serial in means that data is shifted into the first flip-flop one bit at a time, and the flip-flops cannot be loaded in parallel. Serial out means that data can only be read out of the last flip-flop and the outputs from the other flip-flops are not connected to terminals of the integrated circuit. The inputs to the first flip-flop are S = SI and R = SI′. Thus, if SI = 1, a 1 is shifted into the register when it is clocked, and if SI = 0, a 0 is shifted in. Figure 12-9 shows a typical timing diagram.
Figure 12-10(a) shows a 4-bit parallel-in, parallel-out shift register. Parallel-in implies that all four bits can be loaded at the same time, and parallel-out implies that all bits can be read out at the same time. The shift register has two control inputs, FIGURE 12-9 Typical Timing Diagram for Shift Register of Figure 12-8 © Cengage Learning 2014 CLK SO SI 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 1 7 Clock Periods 7 Clock Periods FIGURE 12-8 8-Bit Serial-In, Serial-Out Shift Register © Cengage Learning 2014 382 Unit 12 shift enable (Sh) and load enable (L). If Sh = 1 (and L = 1 or L = 0), clocking the register causes the serial input (SI) to be shifted into the first flip-flop, while the data in flip-flops Q3, Q2, and Q1 are shifted right. If Sh = 0 and L = 1, clocking the shift register will cause the four data inputs (D3, D2, D1, D0) to be loaded in paral-lel into the flip-flops. If Sh = L = 0, clocking the register causes no change of state. Table 12-1 summarizes the operation of this shift register. All state changes occur immediately following the falling edge of the clock.
The shift register can be implemented using MUXes and D flip-flops, as shown in Figure 12-10(b). For the first flip-flop, when Sh = L = 0, the flip-flop Q3 output is selected by the MUX, so Q + 3 = Q3 and no state change occurs. When Sh = 0 and L = 1, the data input D3 is selected and loaded into the flip-flop. When Sh = 1 and FIGURE 12-10 Parallel-In, Parallel-Out Right-Shift Register © Cengage Learning 2014 4-bit Parallel-In, Parallel-Out Shift Register Parallel Output Parallel Input (a) Block diagram (b) Implementation using flip-flops and MUXes SI(Serial In) SO(Serial Out) Sh(Shift Enable) L(Load Enable) CLK D3 D2 D1 D0 Q3 Q2 Q1 Q0 00 01 10 11 D D3 SI Sh L CLK Q3 D2 D1 D0 Q Q2 Q1 Q0 00 01 10 11 D Q 00 01 10 11 D Q 00 01 10 11 D Q Inputs Next State Sh (Shift) L (Load) Q3 + Q2 + Q1 + Q0 + Action 0 0 Q3 Q2 Q1 Q0 No change 0 1 D3 D2 D1 D0 Load 1 X SI Q3 Q2 Q1 Right shift TABLE12-1 Shift Register Operation © Cengage Learning 2014 Registers and Counters 383 L = 0 or 1, SI is selected and loaded into the flip-flop. The second MUX selects Q2, D2, or Q3, etc. The next-state equations for the flip-flops are Q3 + = Sh′ · L′ · Q3 + Sh′ · L · D3 + Sh · SI Q2 + = Sh′ · L′ · Q2 + Sh′ · L · D2 + Sh · Q3 Q1 + = Sh′ · L′ · Q1 + Sh′ · L · D1 + Sh · Q2 Q0 + = Sh′ · L′ · Q0 + Sh′ · L · D0 + Sh · Q1 (12-1) A typical application of this register is the conversion of parallel data to serial data. The output from the last flip-flop (Q0) serves as a serial output as well as one of the parallel outputs. Figure 12-11 shows a typical timing diagram. The first clock pulse loads data into the shift register in parallel. During the next four clock pulses, this data is available at the serial output. Assuming that the register is initially clear (Q3Q2Q1Q0 = 0000), that the serial input is SI = 0 throughout, and that the data inputs D3D2D1D0 are 1011 during the load time (t0), the resulting waveforms are as shown. Shifting occurs at the end of t1, t2, and t3, and the serial output can be read during these clock times. During t4, Sh = L = 0, so no state change occurs.
Figure 12-12(a) shows a 3-bit shift register with the Q1 ′ output from the last flip-flop fed back into the D input of the first flip-flop. If the initial state of the reg-ister is 000, the initial value of D3 is 1, so after the first clock pulse, the register state is 100. Successive states are shown on the transition graph of Figure 12-12(b). When FIGURE 12-11 Timing Diagram for Shift Register © Cengage Learning 2014 Q0 t0 t1 t2 t3 t4 t5 Q1 Q2 Q3 D3, D1, D0 Sh(Shift) L(Load) CLK 1 0 0 0 0 1 0 0 1 0 1 0 1 (0) 1 0 1 (1) FIGURE 12-12 Shift Register with Inverted Feedback © Cengage Learning 2014 000 111 011 001 110 100 101 010 D3 Q3 Q′ 3 D2 Q2 D1 Q1 CLK (a) Flip-flop connections (b) Transition graph Q′ 2 Q′ 1 384 Unit 12 the register is in state 001, D3 is 0, and the next register state is 000. Then, successive clock pulses take the register around the loop again. Note that states 010 and 101 are not in the main loop. If the register is in state 010, then a shift pulse takes it to 101 and vice versa; therefore, we have a secondary loop on the transition graph. A circuit that cycles through a fixed sequence of states is called a counter. A shift register with inverted feedback (Figure 12-12) is called a Johnson counter or a twisted ring counter. If the feedback is not inverted (e.g., Q1 connected to D3 in Figure 12-12), the shift register counter is called a ring counter.
Figure 12-13 shows the general form of a shift register counter where the bit being shifted into the leftmost stage can be a general function of the shift register contents. If the gate logic only contains exclusive-OR gates, the counter is called a linear (feedback) shift register counter. It can be shown that, for each integer n, there exists a linear n-bit shift register counter that generates a count cycle of length 2n −1; all states are included except for the all 0’s state. For many values of n only a small number of exclusive-OR gates is required. Linear shift register counters have many applications, including as random number generators and as encoders and decoders for linear error-correcting codes.
12.3 Design of Binary Counters The counters discussed in this chapter are all synchronous counters. This means the operation of the flip-flops is synchronized by a common clock pulse so that when several flip-flops must change state, the state changes occur simultaneously. Ripple counters, in which the state change of one flip-flop triggers another flip-flop, are not discussed in detail. See Problems 11.24 and 12.19 for examples.
We will first construct a binary counter using three T flip-flops to count clock pulses (Figure 12-14). We will assume that all the flip-flops change state a short time following the rising edge of the input pulse. The state of the counter is determined by the states of the individual flip-flops; for example, if flip-flop C is in state 0, B in state 1, and A in state 1, the state of the counter is 011. Initially, assume that all flip-flops are set to the 0 state. When a clock pulse is received, the counter will change to state 001; when a second pulse is received, the state will change to 010, etc. The sequence of flip-flop states is CBA = 000, 001, 010, 011, 100, 101, 110, 111, 000, . . . Note that when the counter reaches state 111, the next pulse resets it to the 000 state, and then the sequence repeats.
First, we will design the counter by inspection of the counting sequence; then, we will use a systematic procedure which can be generalized to other types of counters. The problem is to determine the flip-flop inputs—TC, TB, and TA. From the preceding counting sequence, observe that A changes state every time a clock pulse is received. FIGURE 12-13 General Shift Register Counter © Cengage Learning 2014 Clk Gate Logic N-Bit Shift Register SI N Registers and Counters 385 Because A changes state on every rising clock edge, TA must equal 1. Next, observe that B changes state only if A = 1. Therefore, A is connected to TB as shown, so that if A = 1, B will change state when a rising clock edge occurs. Similarly, C changes state when a rising clock edge occurs only if B and A are both 1. Therefore, an AND gate is connected to TC so that C will change state if B = 1 and A = 1 when a rising clock edge occurs.
Now, we will verify that the circuit of Figure 12-14 counts properly by tracing signals through the circuit. Initially, CBA = 000, so only TA is 1 and the state will change to 001 when the first active clock edge arrives. Then, TB = TA = 1, and the state will change to 010 when the second active clock arrives. This process continues until finally when state 111 is reached, TC = TB = TA = 1, and all flip-flops return to the 0 state.
Next, we will redesign the binary counter by using a transition table (Table 12-2). This table shows the present state of flip-flops C, B, and A (before a clock pulse is received) and the corresponding next state (after the clock pulse is received). For example, if the flip-flops are in state CBA = 011 and a clock pulse is received, the next state will be C+B+A+ = 100. Although the clock is not explicit in the table, it is understood to be the input that causes the counter to go to the next state in sequence. A third column in the table is used to derive the inputs for TC, TB, and TA. Whenever the entries in the A and A+ columns differ, flip-flop A must change state and TA must be 1. Similarly, if B and B+ differ, B must change state so TB must be 1. For example, if CBA = 011, C+B+A+ = 100, all three flip-flops must change state, so TCTBTA = 111.
FIGURE 12-14 Synchronous Binary Counter © Cengage Learning 2014 C C′ TC B B′ TB A A′ TA 1 Clock Present State Next State Flip-Flop Inputs C B A C + B + A + TC TB TA 0 0 0 0 0 1 0 0 1 0 0 1 0 1 0 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 1 0 0 1 1 1 1 0 0 1 0 1 0 0 1 1 0 1 1 1 0 0 1 1 1 1 0 1 1 1 0 0 1 1 1 1 0 0 0 1 1 1 TABLE12-2 Transition Table for Binary Counter © Cengage Learning 2014 386 Unit 12 TC, TB, and TA are now derived from the table as functions of C, B, and A. By inspection, TA = 1. Figure 12-15 shows the Karnaugh maps for TC and TB, from which TC = BA and TB = A. These equations yield the same circuit derived previ-ously for Figure 12-14.
Next, we will redesign the binary counter to use D flip-flops instead of T flip-flops. The easiest way to do this is to convert each D flip-flop to a T flip-flop by adding an XOR (exclusive-OR) gate, as shown in Figure 11-28(b). Figure 12-16 shows the resulting counter circuit. The rightmost XOR gate can be replaced with an inverter because A ⊕ 1 = A′.
FIGURE 12-15 Karnaugh Maps for Binary Counter © Cengage Learning 2014 TC TB 0 1 00 BA C 01 11 10 0 0 0 0 1 1 0 0 0 1 00 BA C 01 11 10 0 0 1 1 1 1 0 0 FIGURE 12-16 Binary Counter with D Flip-Flops © Cengage Learning 2014 C C′ D Clock 1 B B′ D A A′ D We can also derive the D flip-flop inputs for the binary counter starting with its transition table (Table 12-2). For a D flip-flop, Q+ = D. By inspection of the table, QA + = A′, so DA = A′. The maps for Q + B and Q + C are plotted in Figure 12-17 . The D input equations derived from the maps are DA = A+ = A′ DB = B+ = BA′ + B′A = B ⊕ A DC = C+ = C′BA + CB′ + CA′ = C′BA + C(BA)′ = C ⊕ BA (12-2) which give the same logic circuit as was obtained by inspection.
Registers and Counters 387 FIGURE 12-18 Transition Graph and Table for Up-Down Counter © Cengage Learning 2014 000 111 110 101 100 011 010 001 U D D D D D D D D U U U U U U U C+B+A+ CBA U D 000 001 111 001 010 000 010 011 001 011 100 010 100 101 011 101 110 100 110 111 101 111 000 110 FIGURE 12-17 Karnaugh Maps for D Flip-Flops © Cengage Learning 2014 DC DA DB 0 1 00 BA C 01 11 10 0 1 0 1 1 0 0 1 0 1 00 BA C 01 11 10 0 0 1 1 0 0 1 1 0 1 00 BA C 01 11 10 1 1 0 0 0 0 1 1 The up-down counter can be implemented using D flip-flops and gates, as shown in Figure 12-19. The corresponding logic equations are DA = A+ = A ⊕ (U + D) DB = B+ = B ⊕ (UA + DA′) DC = C+ = C ⊕ (UBA + DB′A′) When U = 1 and D = 0, these equations reduce to equations for a binary up counter (Equation (12-2)).
When U = 0 and D = 1, these equations reduce to DA = A+ = A ⊕ 1 = A′ (A changes state every clock cycle) DB = B+ = B ⊕ A′ (B changes state when A = 0) DC = C+ = C ⊕ B′A′ (C changes state when B = A = 0) Next, we will analyze an up-down binary counter. The transition graph and table for an up-down counter are shown in Figure 12-18. When U = 1, the counter counts up in the sequence 000, 001, 010, 011, 100, 101, 110, 111, 000 . . . When D = 1, the counter counts down in the sequence 000, 111, 110, 101, 100, 011, 010, 001, 000 . . . When U = D = 0, the counter state does not change, and U = D = 1 is not allowed.
388 Unit 12 FIGURE 12-19 Binary Up-Down Counter © Cengage Learning 2014 C C′ Clock Clock Clock D U D D U U D B B′ D A A′ D FIGURE 12-20 Loadable Counter with Count Enable © Cengage Learning 2014 (a) Q D Clk 3 3 ClrN Ct Ld ClrN Ld Ct B+ C+ A+ 0 X X 0 0 0 1 1 X DC DB DA (load) 1 0 0 C B A (no change) 1 0 1 Present state 1 (b) + By inspection of the table in Figure 12-18, we can verify that these are the correct equations for a down counter. For every row of the table, A+ = A′, so A changes state every clock cycle. For those rows where A = 0, B+ = B′. For those rows where B = 0 and A = 0, C+ = C′.
Next, we will design a loadable counter (Figure 12-20(a)). This counter has two control signals Ld (load) and Ct (count). When Ld = 1 binary data is loaded into the counter on the rising clock edge, and when Ct = 1, the counter is incremented on the rising clock edge. When Ld = Ct = 0, the counter holds its present state. When Ld = Ct = 1, load overrides count, and data is loaded into the counter. The coun-ter also has an asynchronous clear input that clears the counter when ClrN is 0. Figure 12-20(b) summarizes the counter operation. All state changes occur on the rising edge of the clock (except for the asynchronous clear).
Figure 12-21 shows how the loadable counter can be implemented using flip-flops, MUXes, and gates. When Ld = 1, each MUX selects a Di input, and because the out-put of each AND gate is 0, the output of each XOR gate is Di, which gets stored in a flip-flop. When Ld = 0 and Ct = 1, each MUX selects one of the flip-flop outputs (C, B, or A). The circuit then becomes equivalent to Figure 12-16, and the counter is incremented on the rising clock edge.
Registers and Counters 389 The next-state equations for the counter of Figure 12-21 are A+ = DA = (Ld′·A + Ld ·DAin) ⊕ Ld′·Ct B+ = DB = (Ld′·B + Ld ·DBin) ⊕ Ld′·Ct ·A C+ = DC = (Ld′·C + Ld ·DCin) ⊕ Ld′·Ct · B · A When Ld = 0 and Ct = 1, these equations reduce to A+ = A′, B+ = B ⊕ A, and C+ = C ⊕ BA, which are the equations previously derived for a 3-bit counter.
12.4 Counters for Other Sequences In some applications, the sequence of states of a counter is not in straight binary order. Figure 12-22 shows the transition graph for such a counter. The arrows indi-cate the state sequence. If this counter is started in state 000, the first clock pulse will take it to state 100, the next pulse to 111, etc. The clock pulse is implicitly understood to be the input to the circuit and not shown on the graph. The corresponding transi-tion table for the counter is Table 12-3. Note that the next state is unspecified for the present states 001, 101, and 110.
We will design the counter specified by Table 12-3 using T flip-flops. We could derive TC, TB, and TA directly from this table, as in the preceding example. However, it is often more convenient to plot next-state maps showing C+, B+, and A+ as func-tions of C, B, and A, and then derive TC, TB, and TA from these maps. The next-state maps in Figure 12-23(a) are easily plotted from inspection of Table 12-3. From the first row of the table, the CBA = 000 squares on the C+, B+, and A+ maps are filled in with 1, 0, and 0, respectively. From the second row, the CBA = 001 squares on all three maps are filled in with don’t-cares. From the third row, the CBA = 010 squares on the C+, B+, and A+ maps are filled in with 0, 1, and 1, respectively. The next-state maps can be quickly completed by continuing in this manner.
C C′ ′ ′ Clk Ld Ld Ct D C D Cin ClrN B B Clk Ld D B D Bin ClrN A A Clk Ld D A D Ain ClrN FIGURE 12-21 Circuit for Figure 12-20 © Cengage Learning 2014 390 Unit 12 C B A C+ B+ A+ 0 0 0 1 0 0 0 0 1 – – – 0 1 0 0 1 1 0 1 1 0 0 0 1 0 0 1 1 1 1 0 1 – – – 1 1 0 – – – 1 1 1 0 1 0 TABLE 12-3 Transition Table for Figure 12-22 1 1 0 1 X X 0 0 0 00 BA C C = 0 half C = 1 half (a) Next-state maps for Table 12-3 B = 0 half B = 1 half C+ 01 11 10 X 0 1 0 1 X X 0 1 1 00 BA C B+ 01 11 10 X A = 1 half A = 0 half 0 1 0 1 X X 0 0 1 00 BA C A+ 01 11 10 X 1 0 0 1 X X 0 1 0 00 BA C C = 0 half C = 1 half (b) Derivation of T inputs TC = C′B′ + CB TB = C′A + CB′ TA = C + B B = 0 half B = 1 half TC 01 11 10 X 0 1 0 1 X X 1 0 0 00 BA C TB 01 11 10 X A = 1 half A = 0 half 0 1 0 1 X X 1 1 1 00 BA C TA 01 11 10 X FIGURE 12-23 FIGURE 12-22 Transition Graph for Counter © Cengage Learning 2014 000 011 010 111 100 © Cengage Learning 2014 © Cengage Learning 2014 Registers and Counters 391 Next, we will derive the maps for the T inputs from the next-state maps. In the fol-lowing discussion, the general symbol Q represents the present state of the flip-flop (C, B, or A) under consideration, and Q+ represents the next state (C+, B+, or A+) of the same flip-flop. Given the present state of a T flip-flop (Q) and the desired next state (Q+), the T input must be 1 whenever a change of state is required. Thus, T = 1 whenever Q+ ≠Q, as shown in Table 12-4.
In general, the next-state map for flip-flop Q gives Q+ as a function of Q and several other variables. The value written in each square of the map gives the value of Q+, while the value of Q is determined from the row or column headings. Given the map for Q+, we can then form the map for TQ by simply putting a 1 in each square of the TQ map for which Q+ is different from Q. Thus, to form the TC map in Figure 12-23(b) from the C+ map in Figure 12-23(a), we place a 1 in the CBA = 000 square of TC because C = 0 and C+ = 1 for this square. We also place a 1 in the 111 square of TC because C = 1 and C+ = 0 for this square.
If we don’t care what the next state of a flip-flop is for some combination of varia-bles, we don’t care what the flip-flop input is for that combination of variables. There-fore, if the Q+ map has a don’t-care in some square, the TQ map will have a don’t-care in the corresponding square. Thus, the TC map has don’t-cares for CBA = 001, 101, and 110 because C+ has don’t-cares in the corresponding squares.
Instead of transforming the Q+ map into the TQ map one square at a time, we can divide the Q+ map into two halves corresponding to Q = 0 and Q = 1, and trans-form each half of the map. From Table 12-4, whenever Q = 0, T = Q+, and whenever Q = 1, T = (Q+)′. Therefore, to transform the Q+ map into a T map, we copy the half for which Q = 0 and complement the half for which Q = 1, leaving the don’t-cares unchanged.
We will apply this method to transform the C+, B+, and A+ maps for our counter shown in Figure 12-23(a) into T maps. For the first map, C corresponds to Q (and C+ to Q+), so to get the TC map from the C+ map, we complement the second column (where C = 1) and leave the rest of the map unchanged. Similarly, to get TB from B+, we complement the bottom half of the B map, and to get TA from A+, we comple-ment the middle two rows. This yields the maps and equations of Figure 12-23(b) and the circuit shown in Figure 12-24. The clock input is connected to the clock (CK) input of each flip-flop so that the flip-flops can change state only in response to a clock pulse. The gate inputs connect directly to the corresponding flip-flop outputs as indicated by the dashed lines. To facilitate reading similar circuit diagrams, such connecting wires will be omitted in the remainder of the book.
The timing diagram of Figure 12-25, derived by tracing signals through the circuit, verifies that the counter functions according to the state diagram of Figure 12-22; for example, starting with CBA = 000, TC = 1 and TB = TA = 0. Therefore, when the clock pulse comes along, only flip-flop C changes state, and the new state is 100. Q Q+ T 0 0 0 0 1 1 T = Q+ ⊕ Q 1 0 1 1 1 0 TABLE 12-4 Input for T Flip-Flop © Cengage Learning 2014 392 Unit 12 Then, TC = 0 and TB = TA = 1, so flip-flops B and A change state when the next clock pulse occurs, etc. Note that the flip-flops change state following the falling clock edge.
Although the original transition table for the counter (Table 12-3) is not com-pletely specified, the next states of states 001, 101, and 110 have been specified in the process of completing the circuit design. For example, if the flip-flops are initially set to C = 0, B = 0, and A = 1, tracing signals through the circuit shows that TC = TB = 1 and TA = 0, so that the state will change to 111 when a clock pulse is applied. This behavior is indicated by the dashed line in Figure 12-26. Once state 111 is reached, FIGURE 12-24 Counter Using T Flip-Flops © Cengage Learning 2014 C C′ TC CK B B′ TB CK A A′ TA CK FF FF FF CLK C′ B′ C B C B C B′ C′ A FIGURE 12-25 Timing Diagram for Figure 12-24 © Cengage Learning 2014 CLK 0 1 1 0 0 0 0 TA TB TC A B C 0 0 1 1 1 0 0 1 0 1 0 FIGURE 12-26 Transition Graph for Counter © Cengage Learning 2014 000 011 010 111 001 100 Registers and Counters 393 successive clock pulses will cause the counter to continue in the original counting sequence as indicated on the transition graph. When the power in a circuit is first turned on, the initial states of the flip-flops may be unpredictable. For this reason, all of the don’t-care states in a counter should be checked to make sure that they eventu-ally lead into the main counting sequence unless a power-up reset is provided. Such a counter is sometimes called self-starting.
In summary, the following procedure can be used to design a counter using T flip-flops: 1. Form a transition table which gives the next flip-flop states for each combination of present flip-flop states.
2. Plot the next-state maps from the table.
3. Plot a T input map for each flip-flop. When filling in the TQ map, TQ must be 1 whenever Q+ ≠Q. This means that the TQ map can be formed from the Q+ map by complementing the Q = 1 half of the map and leaving the Q = 0 half unchanged.
4. Find the T input equations from the maps and realize the circuit.
Counter Design Using D Flip-Flops For a D flip-flop, Q+ = D, so the D input map is identical with the next-state map. Therefore, the equation for D can be read directly from the Q+ map. For the counter of Figure 12-22, the following equations can be read from the next-state maps shown in Figure 12-23(a): DC = C+ = B′ DB = B+ = C + BA′ DA = A+ = CA′ + BA′ = A′(C + B) This leads to the circuit shown in Figure 12-27 using D flip-flops. Note that the connecting wires between the flip-flop outputs and the gate inputs have been omit-ted to facilitate reading the diagram.
FIGURE 12-27 Counter of Figure 12-22 Using D Flip-Flops © Cengage Learning 2014 C C′ DC CK FF B A′ B′ B C B′ DB CK FF C B A A′ A′ DA CK FF CLK An alternative to directly designing counters for nonbinary sequences is to use a binary counter or some other counter and add decoding logic to generate the 394 Unit 12 desired outputs. This approach may result in a simpler overall circuit. As an example, the count cycle of length 5 of Figure 12-22 can be obtained using a five-stage ring counter with decoding logic. If the stages of the ring counter are Q5, Q4, . . ., Q1, then the outputs are obtained by the decoding equations OC = Q4 + Q3 OB = Q3 + Q2 + Q1 OA = Q3 + Q1 Counters and shift registers with clear, preset, or parallel load capability can also be used to generate nonbinary count cycles. Consider a binary counter with a clear input as shown Figure 12-28. The binary counter (N = 4) can be converted to a BCD decade (decimal) counter if the gate logic causes the counter to transfer from a count of 9 to a count of 0 (rather than 10). If the clear input is a synchronous clear, then the logic required is Clr = Q3Q0 assuming Q3, Q2, Q1, Q0 are the four counter outputs. Note that the counter never enters states 10 through 15 so these are don’t-cares for the Clr function. If the clear input is an asynchronous input, then the logic required is Clr = Q3Q1 In this case states 11 through 15 are don’t-cares for Clr. On the next active edge of the clock, when the counter is in state 9, the counter will temporarily enter state 10, causing Clr to become active and return the counter to state 0. Such transient states could cause glitches in other logic using the counter outputs.
FIGURE 12-28 Binary Counter with Clear © Cengage Learning 2014 CLK Clr Gate Logic N-Bit Binary Counter N As another example, consider the binary counter of Figure 12-29 (N = 4) that has a parallel load capability. It can be used to create a decimal counter that counts using the excess-3 code. The counter must cycle through states 3 through 12. The logic must generate Ld when the counter is in state 12 and the parallel inputs must be 0011.
D3 = 0, D2 = 0, D1 = 1, D0 = 1 Ld = Q3Q2 States 0, 1, 2, 13, 14 and 15 are don’t-cares.
Registers and Counters 395 12.5 Counter Design Using S-R and J-K Flip-Flops The procedures used to design a counter with S-R flip-flops are similar to the pro-cedures discussed in Sections 12.3 and 12.4. However, instead of deriving an input equation for each D or T flip-flop, the S and R input equations must be derived. We will now develop methods for deriving these S and R flip-flop input equations.
Table 12-5(a) describes the behavior of the S-R flip-flop. Given S, R, and Q, we can determine Q+ from this table. However, the problem we must solve is to deter-mine S and R given the present state Q and the desired next state Q+. If the present state of the flip-flop is Q = 0 and the desired next state is Q+ = 1, a 1 must be applied to the S input to set the flip-flop to l. If the present state is 1, and the desired next state is 0, a 1 must be applied to the R input to reset the flip-flop to 0. Restrictions on the flip-flop inputs require that S = 0 if R = 1, and R = 0 if S = 1. Thus, when forming Table 12-5(b), the rows corresponding to QQ+ = 01 and 10 are filled in with SR = 10 and 01, respectively. If the present state and next state are both 0, S must be 0 to prevent setting the flip-flop to 1. However, R may be either 0 or 1 because when Q = 0, R = 1 has no effect on the flip-flop state. Similarly, if the present state and next state are both 1, R must be 0 to prevent resetting the flip-flop, but S may be either 0 or 1. The required S and R inputs are summarized in Table 12-5(b). Table 12- 5(c) is the same as 12-5(b), except the alternative choices for R and S have been indicated by don’t-cares.
FIGURE 12-29 Binary Counter with Parallel Load © Cengage Learning 2014 Clk Ld Gate Logic N-Bit Binary Counter DN−1, ... , D0 N N TABLE 12-5 S-R Flip-Flop Inputs (a) S R Q Q+ 0 0 0 0 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 – 1 1 1 – f inputs not allowed (b) Q Q+ S R 0 0 e0 0 0 1 0 1 1 0 1 0 0 1 1 1 e0 0 1 0 (c) Q Q+ S R 0 0 0 X 0 1 1 0 1 0 0 1 1 1 X 0 © Cengage Learning 2014 396 Unit 12 Next, we will redesign the counter of Figure 12-22 using S-R flip-flops. Table 12-3 is repeated in Table 12-6 with columns added for the S and R flip-flop inputs. These columns can be filled in using Table 12-5(c). For CBA = 000, C = 0 and C+ = 1, so SC = 1, RC = 0. For CBA = 010 and 011, C = 0 and C+ = 0, so SC = 0 and RC = X. For CBA = 100, C = 1 and C+ = 1, so SC = X and RC = 0. For row 111, C = 1 and C+ = 0, so SC = 0 and RC = l. For CBA = 001, 101, and 110, C+ = X, so SC = RC = X. Similarly, the values of SB and RB are derived from the values of B and B+, and SA and RA are derived from A and A+. The resulting flip-flop input functions are mapped in Figure 12-30(b).
It is generally faster and easier to derive the S-R flip-flop input maps directly from the next-state maps than to derive them from the transition table as was done in Table 12-6. For each flip-flop, we will derive the S and R input maps from the next-state (Q+) map using Table 12-5(c) to determine the values for S and R. Just as we did for the T flip-flop, we will use the next-state maps for C+, B+, and A+ in Figure 12-23(a) as a starting point for deriving the S-R flip-flop input equations. For convenience, these maps are repeated in Figure 12-30(a). We will consider one-half of each next-state map at a time when deriving the input maps. We will start with flip-flop C (Q = C and Q+ = C+) and consider the C = 0 column of the map. From Table 12-5(c), if C = 0 and C+ = 1, then S = 1 and R = 0. Therefore, for every square in the C = 0 column where C+ = 1, we plot SC = 1 and RC = 0 (or blank) in the cor-responding squares of the input maps. Similarly, for every square in the C = 0 column where C+ = 0, we plot SC = 0 and RC = X on the input maps. For the C = 1 column, if C+ = 0, we plot SC = 0 and RC = 1; if C+ = 1, we plot SC = X and RC = 0. Don’t-cares on the C+ map remain don’t-cares on the SC and RC maps, because if we do not care what the next state is, we do not care what the input is. In a similar manner, we can derive the SB and RB maps from the B+ map by working with the B = 0 (top) half of the map and the B = 1 (bottom) half of the map. As before, 1’s are placed on the S or R map when the flip-flop must be set or reset. S is a don’t-care if Q = 1 and no state change is required, and R = X if Q = 0 and no state change is required. Finally, SA and RA are derived from the A+ map. Figure 12-30(c) shows the resulting circuit.
The procedure used to design a counter with J-K flip-flops is very similar to that used for S-R flip-flops. The J-K flip-flop is similar to the S-R flip-flop except that J and K can be 1 simultaneously, in which case the flip-flop changes state. Table 12-7(a) gives the next state (Q+) as a function of J, K, and Q. Using this table, we can derive the required input conditions for J and K when Q and Q+ are given. Thus if a change from Q = 0 to Q+ = 1 is required, either the flip-flop can be set to 1 by using J = 1 C B A C+ B+ A+ SC RC SB RB SA RA 0 0 0 1 0 0 1 0 0 X 0 X 0 0 1 – – – X X X X X X 0 1 0 0 1 1 0 X X 0 1 0 0 1 1 0 0 0 0 X 0 1 0 1 1 0 0 1 1 1 X 0 1 0 1 0 1 0 1 – – – X X X X X X 1 1 0 – – – X X X X X X 1 1 1 0 1 0 0 1 X 0 0 1 TABLE 12-6 © Cengage Learning 2014 Registers and Counters 397 (and K = 0) or the state can be changed by using J = K = 1. In other words, J must be l, but K is a don’t-care. Similarly, a state change from 1 to 0 can be accomplished by resetting the flip-flop with K = 1 (and J = 0) or by changing the flip-flop state with J = K = 1. When no state change is required, the inputs are the same as the corresponding inputs for the S-R flip-flops. The J-K flip-flop input requirements are summarized in Tables 12-7(b) and 12-7(c).
We will now redesign the counter of Figure 12-22 using J-K flip-flops. Table 12-3 is repeated in Table 12-8 with columns added for the J and K flip-flop inputs. We will fill in these columns using Table 12-7(c). For CBA = 000, C = 0 1 1 0 1 X X 0 0 0 00 BA C (a) Next-state maps B = 0 half B = 1 half C+ 01 11 10 X 0 1 X X X 1 X 00 BA C (b) S-R flip-flop equations (c) Logic circuit RC 01 11 10 X 1 X X X SC RC = A SC = B′ X 0 1 X X X 1 00 BA C RB 01 11 10 X 1 X X X SB RB = C′A SB = C X X 0 1 X X X 1 1 00 BA C RA 01 11 10 X 1 X 1 X SA RA = A SA = CA′ + BA′ = A′(C + B) X 0 1 0 1 X X 0 1 1 00 BA C B+ 01 11 10 X A = 1 half A = 0 half 0 1 0 1 X X 0 0 1 00 BA C A+ 01 11 10 X Q Q′ C C′ B′ A CLK S R Q Q′ B B′ A C′ C S R Q Q′ A A′ A S R A′ B C FIGURE 12-30 Counter of Figure 12-22 Using S-R Flip-Flops © Cengage Learning 2014 398 Unit 12 and C+ = 1, so JC = 1 and KC = X. For CBA = 010 and 011, C = 0 and C+ = 0, so JC = 0 and KC = X. The remaining table entries are filled in similarly. The result-ing J-K flip-flop input functions are plotted in Figure 12-31(b). After deriving the flip-flop input equations from the J-K maps, we can draw the logic circuit of Figure 12-31(c).
12.6 Derivation of Flip-Flop Input Equations—Summary The input equation for the flip-flops in a sequential circuit may be derived from the next-state equations by using truth tables or by using Karnaugh maps. For circuits with three to five variables, it is convenient to first plot maps for the next-state equa-tions, and then transform these maps into maps for the flip-flop inputs.
Given the present state of a flip-flop (Q) and the desired next state (Q+), Table 12-9 gives the required inputs for various types of flip-flops. For the D flip-flop, the input is the same as the next state. For the T flip-flop, the input is 1 whenever a state change is required. For the S-R flip-flop, S is 1 whenever the flip-flop must be set to 1 and R is 1 when it must be reset to 0. We do not care what S is if the flip-flop state is 1 and must remain 1; we do not care what R is if the flip-flop state is 0 and C B A C+ B+ A+ JC KC JB KB JA KA 0 0 0 1 0 0 1 X 0 X 0 X 0 0 1 – – – X X X X X X 0 1 0 0 1 1 0 X X 0 1 X 0 1 1 0 0 0 0 X X 1 X 1 1 0 0 1 1 1 X 0 1 X 1 X 1 0 1 – – – X X X X X X 1 1 0 – – – X X X X X X 1 1 1 0 1 0 X 1 X 0 X 1 (a) J K Q Q+ 0 0 0 0 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 1 1 1 1 0 TABLE 12-7 J-K Flip-Flop Inputs (b) Q Q+ J K 0 0 e0 0 0 1 0 1 e1 0 1 1 1 0 e0 1 1 1 1 1 e0 0 1 0 (c) Q Q+ J K 0 0 0 X 0 1 1 X 1 0 X 1 1 1 X 0 TABLE 12-8 © Cengage Learning 2014 © Cengage Learning 2014 Registers and Counters 399 must remain 0. For a J-K flip-flop, the J and K inputs are the same as S and R, respec-tively, except that when one input is 1 the other input is X. This difference arises because S = R = 1 is not allowed, but J = K = 1 causes a change of state.
Table 12-9 summarizes the rules for transforming next-state maps into flip-flop input maps. Before applying these rules, we must copy any don’t-cares from the next-state maps onto the input maps. Then, we must work with the Q = 0 and Q = 1 halves of each next-state map separately. The rules given in Table 12-9 are easily derived by comparing the values of Q+ with the corresponding input values. For example, in the Q = 0 column of the table, we see that J is the same as Q+, so the Q = 0 half of the J map is the same as the Q+ map. In the Q = 1 column, J = X (inde-pendent of Q+), so we fill in the Q = 1 half of the J map with X’s.
1 1 0 1 X X 0 0 0 00 BA C (a) Next-state maps B = 0 half B = 1 half C+ 01 11 10 X 0 1 X X X 1 X 00 BA C (b) J-K flip-flop input equations (c) Logic circuit (omitting the feedback lines) JC 01 11 10 X X X X X X 1 KC JC = B′ KC = A X 0 1 0 1 0 1 0 1 X X X X X X 1 00 BA C JB 01 11 10 X X 1 X X KB JB = C KB = C′A X 0 1 X X 1 X 1 X 00 BA C JA 01 11 10 X X X X X 1 X 1 X KA JA = C + B KA = 1 0 1 0 1 X X 0 1 1 00 BA C B+ 01 11 10 X A = 1 half A = 0 half 0 1 0 1 X X 0 0 1 00 BA C A+ 01 11 10 X C C′ B′ A CLK JC KC B B′ C′ A C JB KB A A′ 1 JA KA C B CK CK CK FF FF FF FIGURE 12-31 Counter of Figure 12-22 Using J-K Flip-Flops © Cengage Learning 2014 400 Unit 12 For the S-R flip-flop, note that when Q = 0, R = X if Q+ = 0; and when Q = 1, R = 1 if Q+ = 0. Therefore, to form the R map from the Q+ map, replace 0’s with X’s on the Q = 0 half of the map and replace 0’s with 1’s on the Q = 1 half (and fill in 0’s for the remaining entries). Similarly, to form the S map from the Q+ map, copy the 1’s on the Q = 0 half of the map, and replace the 1’s with X’s on the Q = 1 half.
Type of Flip-Flop Input Q = 0 Q = 1 Rules for Forming Input Map From Next-State Map Q+ = 0 Q+ = 1 Q+ = 0 Q+ = 1 Q = 0 Half of Map Q = 1 Half of Map Delay D 0 1 0 1 no change no change Toggle T 0 1 1 0 no change complement Set-Reset S 0 1 0 X no change replace 1’s with X’s R X 0 1 0 replace 0’s with X’s complement J-K J 0 1 X X no change fill fill in with X’s K X X 1 0 in with X’s complement Q+ means the next state of Q X is a don’t-care Always copy X’s from the next-state map onto the input maps first.
Fill in the remaining squares with 0’s.
0 1 0 1 1 0 0 0 1 00 AB Q Q+ Next-state map 01 11 10 X 0 X 0 1 1 0 0 0 1 00 AB Q S = AB′ + Q′A′B 01 11 10 X X 0 0 1 0 1 X 1 0 00 AB Q R = QB S-R input maps 01 11 10 X 0 X 0 1 1 X 0 X 1 00 AB Q J = A′B + AB′ 01 11 10 X X 0 0 1 X 1 X 1 X 00 AB Q K = B J-K input maps 01 11 10 X 0 1 0 1 1 0 0 0 1 00 AB Q D = Q′A′B + QB′ + AB′ D input map 01 11 10 X 0 0 0 1 1 1 0 1 1 00 AB Q T = A′B + AB′ + QB T input map 01 11 10 X TABLE 12-9 Determination of Flip-Flop Input Equations from Next-State Equations Using Karnaugh Maps Example (illustrating the use of Table 12-9) © Cengage Learning 2014 Registers and Counters 401 Examples of deriving four-variable input maps are given in Figure 12-32. In each case, Qi represents the flip-flop for which input equations are being derived A, B, and C represent other variables on which the next state depends. As shown in Figure 12-32(a), a 1 is placed on the T1 map whenever Q1 must change state. In Figure 12-32(b), 1’s are placed on the Q2 = 0 half of the S2 map whenever Q2 must be set to 1, and 1’s are placed on the Q2 = 1 half of the R2 map whenever Q2 must be reset. Figure 12-32(c) illustrates derivation of J3 and K3 by using separate J and K maps. As will be seen in Unit 14, the methods used to derive flip-flop input equa-tions for counters are easily extended to general sequential circuits.
The procedures for deriving flip-flop input equations discussed in this unit can be extended to other types of flip-flops. If we want to derive input equations for a dif-ferent type of flip-flop, the first step is to construct a table which gives the next state FIGURE 12-32 Derivation of Flip-Flop Input Equations Using Four-Variable Maps © Cengage Learning 2014 0 1 0 1 00 01 11 10 X 1 1 0 1 X X 1 0 00 BC Q1A 01 11 10 0 0 X 0 1 1 0 00 01 11 10 X 1 0 1 1 X X 0 0 00 BC Q1A T1 Q1 = 0 half Q2 = 0 half 01 11 10 0 1 X 1 X 1 0 00 01 11 10 0 0 X 1 1 0 X 1 X 00 CQ2 AB 01 11 10 0 0 1 0 X 0 X 00 01 11 10 1 1 X 0 0 1 X 0 X 00 CQ2 AB R2 01 11 10 X X 0 1 X 1 0 00 01 11 10 0 0 X X X 0 X X X 00 CQ2 AB S2 01 11 10 0 0 1 Q1 = 1 half Q1 + Q2 + Q 3 + (a) (b) 0 0 1 X 00 01 11 10 0 1 X 1 X X 0 0 1 00 Q3C AB 01 11 10 1 1 0 0 0 1 X 00 01 11 10 0 1 X 1 X X X X X 00 Q3C AB J3 = A + BC 01 11 10 X X X X X X X 00 01 11 10 X X X X X X 1 1 0 00 Q3C AB K3 = C + AB′ 01 11 10 0 0 1 (c) Q2 = 1 half Q3 = 0 half Q3 = 1 half 402 Unit 12 (Q+) as a function of the present state (Q) and the flip-flop inputs. From this table, we can construct another table which gives the required flip-flop input combinations for each of the four possible pairs of values of Q and Q+. Then, using this table, we can plot a Karnaugh map for each input function and derive minimum expressions from the maps.
Problems 12.1 Consider a 6-bit adder with an accumulator, as in Figure 12-5. Suppose the X reg-ister contains a number from a previous calculation. We do not want this number. Instead, we want X to equal 3 × Y. (X = x5x4x3x2x1x0 and Y = y5y4y3y2y1y0.) On the timing diagram, give values for Ad and ClrN so that we will have X = 3 × Y held in the accumulator.
12.2 The shift register of Figure 12-10 can be made to shift to the left by adding external connections between the Q outputs and D inputs. Draw a block diagram like the one in Figure 12-10(a) and indicate the appropriate connections. Which input line would serve as a serial input in this case? With the connections you have made, what should Sh and L be for a left shift? For a right shift?
12.3 Show how to modify the internal circuitry of the shift register of Figure 12-10 so that it will also shift to the left without external connections as in Problem 12.2. Replace Sh and L with A and B and let the register operate according to the following table: 12.4 (a) Design a 4-bit synchronous binary counter using T flip-flops.
(Hint: Add one flip-flop, with necessary gates, to the left side of Figure 12-14.
Verify that the gates for the other three flip-flops do not change.) (b) Repeat (a) using D flip-flops. See Figure 12-16.
Inputs Next State Action A B Q + 3 Q + 2 Q + 1 Q + 0 0 0 Q3 Q2 Q1 Q0 no change 0 1 SI Q3 Q2 Q1 right shift 1 0 Q2 Q1 Q0 SI left shift 1 1 D3 D2 D1 D0 load ClrN Ad CLK Registers and Counters 403 12.5 Repeat Problem 12.4(a) using D flip-flops, but implement each D input as a sum of products, without using XOR gates. (Hint: Use Equations (12-2). As in Problem 12.4, you will need one more equation.) 12.6 Design a circuit using D flip-flops that will generate the sequence 0, 0, 1, 0, 1, 1 and repeat. Do this by designing a counter for any sequence of states such that the first flip-flop takes on this sequence. There are many correct answers, but do not duplicate states, because each state can have only one next state.
12.7 Design a 3-bit counter which counts in the sequence: 001, 011, 010, 110, 111, 101, 100, (repeat) 001, . . .
(a) Use D flip-flops.
(b) Use T flip-flops.
In each case, what will happen if the counter is started in state 000?
12.8 Design a 3-bit counter which counts in the sequence: 001, 011, 010, 110, 111, 101, 100, (repeat) 001, . . .
(a) Use J-K flip-flops.
(b) Use S-R flip-flops.
In each case, what will happen if the counter is started in state 000?
12.9 An M-N flip-flop works as follows: If MN = 00, the next state of the flip-flop is 0.
If MN = 01, the next state of the flip-flop is the same as the present state.
If MN = 10, the next state of the flip-flop is the complement of the present state.
If MN = 11, the next state of the flip-flop is 1.
(a) Complete the following table (use don’t-cares when possible): (b) Using this table and Karnaugh maps, derive and minimize the input equations for a counter composed of three M-N flip-flops which counts in the following sequence: CBA = 000, 001, 011, 111, 101, 100, (repeat) 000, . . .
12.10 Design a counter which counts in the sequence that has been assigned to you. Use D flip-flops and NAND gates. Simulate your design using SimUaid.
(a) 000, 001, 011, 101, 111, 010, (repeat) 000, . . .
(b) 000, 011, 101, 111, 010, 110, (repeat) 000, . . .
(c) 000, 110, 111, 100, 101, 001, (repeat) 000, . . .
(d) 000, 100, 001, 110, 101, 111, (repeat) 000, . . .
(e) 000, 010, 111, 101, 011, 110, (repeat) 000, . . .
Present State Next State Q Q+ M N 0 0 0 1 1 0 1 1 404 Unit 12 (f ) 000, 100, 001, 111, 110, 101, (repeat) 000, . . .
(g) 000, 010, 111, 101, 001, 110, (repeat) 000, . . .
(h) 000, 101, 010, 011, 001, 110, (repeat) 000, . . .
(i) 000, 100, 010, 001, 110, 111, (repeat) 000, . . .
(j) 000, 001, 111, 010, 110, 011, (repeat) 000, . . .
(k) 000, 100, 010, 001, 101, 111, (repeat) 000, . . .
(l) 000, 011, 111, 110, 001, 100, (repeat) 000, . . .
(m) 000, 100, 111, 110, 010, 011, (repeat) 000, . . .
(n) 000, 011, 111, 110, 010, 100, (repeat) 000, . . .
12.11 Redesign the right-shift register circuit of Figure 12-10 using four D flip-flops with clock enable, four 2-to-1 MUXes, and a single OR gate.
12.12 Design a left-shift register similar to that of Figure 12-10. Your register should shift left if Sh = 1, load if Sh = 0 and L = 1, and hold its state if Sh = L = 0.
(a) Draw the circuit using four D flip-flops and four 4-to-1 MUXes.
(b) Give the next-state equations for the flip-flops.
12.13 A 74178 shift register is described by the given table. All state changes occur on the 1-0 transition of the clock. The shift register is connected as shown. Complete the timing diagram.
Sh Ld Q + A Q + B Q + C Q + D 0 0 QA QB QC QD 0 1 DA DB DC DD 1 X SI QA QB QC QD SI = QC QB QA Ld Sh Clock QD QA QB QC DD DA DB DC 74178 0 1 0 1 SI Sh Ld Clock Registers and Counters 405 12.14 Design a 5-bit synchronous binary counter. (Hint: See Problem 12.4.) (a) Use T flip-flops.
(b) Use D flip-flops.
12.15 Construct a 4-bit Johnson counter using J-K flip-flops. (See Figure 12-12 for a Johnson counter.) What sequence of states does the counter go through if it is started in state 0000? State 0110?
12.16 Design a 3-bit binary up-down counter which functions the same as the up-down counter of Figure 12-18 and Figure 12-19. Use a 3-bit register of D flip-flops, a 3-bit adder, and one OR gate. (If you are clever enough, you can do it without the OR gate.) (Hint: To subtract one, add 111.) 12.17 Design a decade counter which counts in the sequence: 0000, 0001, 0010, 0011, 0100, 0101, 0110, 0111, 1000, 1001, 0000, . . .
(a) Use D flip-flops.
(b) Use J-K flip-flops.
(c) Use S-R flip-flops.
(d) Use T flip-flops.
(e) Draw a complete state diagram for the counter of (b) showing what happens when the counter is started in each of the unused states.
12.18 Repeat Problem 12.17 for the downward decade sequence: 0000, 1001, 1000, 0111, 0110, 0101, 0100, 0011, 0010, 0001, 0000, . . .
12.19 (a) Derive the state graph for the ripple counter below. Show the transient states that occur between stable states.
(b) Modify the ripple counter so that it cycles through the same states but in reverse order. (Use the same type of flip-flop.) (Hint: First construct a state graph for the modified counter showing the transient states between stable states.) 12.20 Design a 3-bit counter which counts in the sequence: 001, 100, 101, 111, 110, 010, 011, 001, . . .
(a) Use D flip-flops.
(b) Use J-K flip-flops.
J Q Q′ K Clk Clk 1 Q0 Q1 Q2 Q3 Clk Clk Clk J Q Q′ K J Q Q′ K J Q Q′ K 406 Unit 12 (c) Use T flip-flops.
(d) Use S-R flip-flops.
(e) What will happen if the counter of (a) is started in state 000?
12.21 Design a decade counter using the following 2-4-2-1 weighted code for decimal digits. Use NAND gates and the indicated flip-flop types.
(a) Use D flip-flops.
(b) Use J-K flip-flops.
(c) Use T flip-flops.
(d) Use S-R flip-flops.
12.22 Repeat Problem 12.21 using NOR gates instead of NAND gates.
12.23 Design a decade counter using the excess-3 code for decimal digits. Use NAND gates and the indicated flip-flop types.
(a) Use D flip-flops.
(b) Use J-K flip-flops.
(c) Use T flip-flops.
(d) Use S-R flip-flops.
12.24 Repeat Problem 12.23 using NOR gates instead of NAND gates.
12.25 The following binary counter increments on each rising clock edge unless the exter-nal clear (ClrN) control input is low.
(a) Implement a modulo 12 counter using this binary counter assuming the Clr con-trol input is a synchronous control input.
(b) Repeat part (a) assuming Clr is an asynchronous control input.
Digit ABCD 0 0000 1 0001 2 0010 3 0011 4 0100 5 1011 6 1100 7 1101 8 1110 9 1111 CLK Clr 4-Bit Counter Q3Q2Q1Q0 ClrN Registers and Counters 407 12.26 The following binary counter operates according to the function table given. Using this binary counter, implement a decimal counter that uses the 2-4-2-1 weighted code for representing decimal digits. Minimize the gate logic required by using the parallel load inputs only to change the counting sequence from straight binary to 2-4-2-1 code.
ClrN Ld Function 0 — Clear 1 1 Parallel Load 1 0 Increment CLK Clr 4-Bit Counter Ld P3 P2 P1 P0 Q3Q2Q1Q0 ClrN 12.27 For each value of N, there exists an exclusive-OR circuit for the linear shift register counter of Figure 12-13 so that the counter cycles through 2N −1 counts.
(a) For N = 3, construct the transition graph for the counter if Sin = Q2 ⊕ Q1. (The shift register stages are numbered Q0, Q1, Q2 from left to right.) (b) For N = 4, find an exclusive-OR circuit so that the counter cycles through 15 counts.
(c) Make a simple modification to the logic of part (b) so that the counter cycles through 16 counts. (The counter is no longer linear.) 12.28 When started in state 0, an n-stage Johnson (twisted-ring) counter cycles through 2n states. Other count cycles will be obtained if the counter is started in other states. Determine all count cycles for the Johnson counter when (a) n = 3, (b) n = 4, and (c) n = 5.
12.29 When started in state 0, an n-stage Johnson (twisted-ring) counter cycles through 2n states. A simple modification of the counter will cause it to cycle through 2n −1 states. (Assume the counter is implemented with D flip-flops.) (a) Determine the equation for the shift register input so that the all 1’s state is eliminated from the cycle with 2n states to obtain a cycle of length 2n −1.
(b) Repeat part (a) for the case when the all 0’s state is eliminated.
12.30 Repeat Problem 12.29 assuming the counter is implemented with J-K flip-flops.
12.31 Binary up counters can be designed using J-K flip-flops by noting that the least signif-icant stage, Q0, always toggles and stage Qi always toggles when stages 0, . . . (i −1) are 1. This approach can be modified to design counters with a shorter cycle and obtaining nearly minimum equations. Note that an optimum solution may not have the same equations for J and K.
408 Unit 12 (a) Modify the binary up counter design to obtain a BCD decade up counter using J-K flip-flops.
(b) Modify the binary up counter design to obtain an excess-3 decade up counter using J-K flip-flops.
(c) Modify the design for part (b) so that the counters can be cascaded to obtain excess-3 counters that can count to 99, 999, etc.
12.32 A three-stage binary up-down counter has control input U; when U = 0, the counter counts down and when U = 1, the counter counts up. Design this counter with a minimum number of NAND gates, using (a) reset-dominant S-R flip-flops.
(b) D-CE flip-flops.
12.33 A two-stage counter has two input control lines, M and N. The count sequences are as follows: (a) Design the counter assuming the outputs come directly from J-K flip-flops.
(b) Design the counter assuming a two-stage binary counter is used with the J-K flip-flop outputs decoded.
12.34 A pulse-generating circuit generates eight repetitive pulses as shown in the figure. Implement the pulse-generating circuit using the counter circuits listed and a mini-mum of gate logic. Use J-K flip-flops for the counters that trigger on the falling edge of a clock that has a frequency eight times the frequency of one of the pulses. The pulses must be free of glitches; explain any restrictions on the propagation delays of gates and flip-flops so that the pulses will be glitch free.
(a) Ring counter (A ring counter is a shift register with end-to-end feedback.) (b) Johnson counter (c) Binary counter MN Sequence 00 0, 1, 2, 3, 0, . . . .
01 0, 1, 0, 1, 0, 1, . . .
10 2, 0, 2, 0, 2, 0, . . .
11 1, 2, 1, 2, 1, 2, . . .
T0 T1 T2 T3 T4 T5 T6 T7 Registers and Counters 409 12.35 A U-V flip-flop behaves as follows: If UV = 00, the flip-flop does not change state.
If UV = 10, the flip-flop is set to Q = 0.
If UV = 11, the flip-flop changes state.
The input combination UV = 01 is not allowed.
(a) Give the characteristic (next-state) equation for this flip-flop.
(b) Complete the following table, using don’t-cares where possible.
(c) Realize the following next-state equation for Q using a U-V flip-flop: Q+ = A + BQ. Find equations for U and V.
12.36 A M-F flip-flop behaves as follows: If MF = 01, the flip-flop changes state.
If MF = 11, the flip-flop is set to Q = 0.
If MF = 00, the flip-flop is set to Q = 1.
The input combination MF = 10 is not allowed.
(a) Give the characteristic (next-state) equation for this flip-flop.
(b) Complete the table, using don’t-cares where possible.
(c) Realize the following next-state equation for Q using a MF flip-flop: Q+ = CQ + DQ′. Find equations for M and F.
12.37 An L-M flip-flop works as follows: If LM = 00, the next state of the flip-flop is 1.
If LM = 01, the next state of the flip-flop is the same as the present state.
If LM = 10, the next state of the flip-flop is the complement of the present state.
If LM = 11, the next state of the flip-flop is 0.
(a) Complete the following table (use don’t-cares when possible): Q Q+ M F 0 0 0 1 1 0 1 1 Present State Next State Q Q+ L M 0 0 0 1 1 0 1 1 Q Q+ U V 0 0 0 1 1 0 1 1 410 Unit 12 (b) Using this table and Karnaugh maps, derive and minimize the input equations for a counter composed of three L-M flip-flops which counts in the following sequence: ABC = 000, 100, 101, 111, 011, 001, 000, . . . 12.38 A sequential circuit contains a register of four flip-flops. Initially a binary number N (0000 ≤N ≤1100) is stored in the flip-flops. After a single clock pulse is applied to the circuit, the register should contain N + 0011. In other words, the function of the sequential circuit is to add 3 to the contents of a 4-bit register. Design the circuit using J-K flip-flops.
12.39 When an adder is part of a larger digital system, an arrangement like the given figure often works well. For the control signals and the input data in the following table, give the value of the addend, the accumulator, and the bus at the end of each clock cycle (i.e., immediately before the active clock edge). Express the register and bus values in decimal.
Accumulator Register 8-Bit Adder CE LdAc Addend Register CE LdAd 8 8 8 8 8 8 8 EnAd 8 8 EnIn Input Data Bus Clock Cycle Input Data EnIn EnAd LdAc LdAd Accumulator Register Addend Register Bus 0 18 1 0 1 0 0 0 18 1 13 1 0 0 1 2 15 0 1 1 0 3 93 1 0 0 1 4 47 0 1 1 0 5 22 1 0 0 1 6 0 0 1 0 0 12.40 A digital system can perform any four-variable bitwise logic function, but it may take several clock cycles. (A bitwise logic function performs the same logic function on each bit.) Recall that the NAND operation is functionally complete (i.e., we can do any logic function by a series of NAND operations). On the following 8-bit registers, En is a tri-state buffer enable as in Figure 12-3, and CE is a clock enable as in Figure 12-1.
Registers and Counters 411 CE En A CK 8 8 8 8 8 8 8 CE En B CK CE 8 NAND Gates En R X Y C CK CE En D CK 8 8 Inputs Next State Action A B Q + 3 Q + 2 Q + 1 Q + 0 0 0 Q3 Q2 Q1 Q0 No change 0 1 SI Q3 Q2 Q1 Right shift 1 0 D3 D2 D1 D0 Load 1 1 Q0 Q1 Q2 Q3 Reverse bits (a) Show how to connect a 2-to-4 decoder (with inverting outputs) so that the next rising edge of the clock will load the result into register A, B, C, or D for control inputs G0G1 = 00, 01, 10, or 11, respectively.
(b) Show how to connect three control signals, E0, E1, and E2, to the registers so that E0 = 0 places the A register contents on the X bus, E0 = 1 places B onto the X bus, E1E2 = 00 places C onto the Y bus, E1E2 = 01 places D onto the Y bus, E1E2 = 10 places 00000000 on the Y bus, and E1E2 = 11 places 11111111 on the Y bus. You may use a few additional gates. (Hint: Connect E2 to all 8 data inputs on the tri-state buffer on the right side of the circuit.) (c) Show how to make the bits in the C register be the OR of the correspond-ing bits in the A register and in the D register, in four clock cycles. Tell what G0, G1, E0, E1, and E2 should be for each cycle. (Hint: Use DeMorgan’s law and X′ = (X NAND 1).) 12.41 Show how to make the shift register of Figure 12-10 reverse the order of its bits (i.e., Q3 + = Q0, Q+ 2 = Q1, Q+ 1 = Q2, and Q+ 0 = Q3).
(a) Use external connections between the Q outputs and the D inputs. What should the values of Sh and L be for a reversal?
(b) Change the internal circuitry to allow bit reversal, so that the D inputs may be used for other purposes. Replace Sh and L with A and B, and let the register operate according to the following table: 412 Analysis of Clocked Sequential Circuits U N I T 13 Objectives 1. Analyze a sequential circuit by signal tracing.
2. Given a sequential circuit, write the next-state equations for the flip-flops and derive the state graph or state table. Using the state graph, determine the state sequence and output sequence for a given input sequence.
3. Explain the difference between a Mealy machine and a Moore machine.
4. Given a state table, construct the corresponding state graph, and conversely.
5. Given a sequential circuit or a state table and an input sequence, draw a tim-ing chart for the circuit. Determine the output sequence from the timing chart, neglecting any false outputs.
6. Draw a general model for a clocked Mealy or Moore sequential circuit. Explain the operation of the circuit in terms of these models. Explain why a clock is needed to ensure proper operation of the circuit.
Analysis of Clocked Sequential Circuits 413 Study Guide 1. Study Section 13.1, A Sequential Parity Checker.
(a) Explain how parity can be used for error detection.
(b) Verify that the parity checker (Figure 13-4) will produce the output wave-form given in Figure 13-2 when the input waveform is as shown.
2. Study Section 13.2, Analysis by Signal Tracing and Timing Charts.
(a) What is the difference between a Mealy machine and a Moore machine?
(b) For normal operation of clocked sequential circuits of the types discussed in this section, when should the inputs be changed?
When do the flip-flops change state?
At what times can the output change for a Moore circuit?
At what times can the output change for a Mealy circuit?
(c) At what time (with respect to the clock) should the output of a Mealy cir-cuit be read?
(d) Why can false outputs appear in a Mealy circuit and not in a Moore circuit?
What can be done to eliminate the false outputs?
If the output of a Mealy circuit is used as an input to another Mealy circuit syn-chronized by the same clock, will false outputs cause any problem? Explain.
(e) Examine the timing diagram of Figure 13-8. The value of Z will always be correct just before the falling (active) clock edge that causes the state change. Note there are two types of false outputs. A false 0 output occurs if Z is 1 just before two successive falling clock edges, and Z goes to 0 between the clock edges. A false 1 output occurs if Z is 0 just before two successive falling clock edges and Z goes to 1 between the edges. When the output is 0 (or 1) just before an active clock edge and 1 (or 0) just before the next, the output may be temporarily incorrect after the state changes 414 Unit 13 following the first active edge but before the input has changed to its next value. In this case, we will not say that a false output has occurred because the sequence of outputs is still correct.
3. Study Section 13.3, State Tables and Graphs.
(a) In Equations (13-1) through (13-5), at what time (with respect to the clock) is the right-hand side evaluated?
What does Q+ mean?
(b) Derive the timing chart of Figure 13-6 using Table 13-2(a).
(c) What is the difference between the state graphs for Mealy and Moore machines?
(d) For a state table, Table 13-3(b) for example, what do the terms “present state,” “next state,” and “present output” mean with respect to the active clock edge?
(e) Why does a Moore state table have only one output column?
(f ) For ease in making state tables from Karnaugh maps and vice versa, tran-sition tables with three or four states are often written with states in the order 00, 01, 11, 10. However, this is not necessary. (In fact, for sequential circuits with five or more states, it is impossible.) For example, the follow-ing transition table is equivalent to Table 13-2(a); the third and fourth rows have been interchanged. It equally represents the circuit of Figure 13-5.
AB A+B+ X = 0 X = 1 Z 00 10 01 0 01 00 11 1 10 11 01 1 11 01 11 0 Clock X A B Z Zd 4. The following timing chart was derived from the circuit of Figure 13-7 .
Analysis of Clocked Sequential Circuits 415 (a) Noting that extra input changes which occur between clock pulses cannot affect the state of the circuit, what is the effective input sequence seen by the flip-flops in the circuit?
(b) Using Table 13-3, verify the waveforms given for A, B, and Z.
(c) Indicate any false outputs. What is the correct output sequence from the circuit?
(d) Using the effective input sequence from (a), determine the output sequence from the state graph (Figure 13-11). This output sequence should be the same as your answer to (c).
(e) The output Z is fed into a clocked D flip-flop, using the same clock (Clock) as the circuit. Sketch the waveform for Zd. Does Zd have any false outputs?
(f ) Starting with Figure 13-11, construct the corresponding state table. Verify that your answer is the same as Table 13-3(b). Note that the output label on a given arrow of the graph is associated with the state from which the arrow originates.
(g) Assume that the flip-flops in Figure 13-7 are changed to flip-flops which trig-ger on the rising edge of the clock; that is, the inversion circles are removed from the clock inputs. Also, the clock waveform in Figure 13-8 is replaced with The input waveform is left unchanged. What changes, if any, would occur in the remainder of the timing diagram? Explain.
5. Consider the following state tables: D Clock CK Q′ Q Z d Z Clock Moore N.S.
P.S.
X = 0 1 Z S0 S1 S0 0 S1 S3 S2 0 S2 S3 S0 0 S3 S3 S0 1 Mealy N.S.
Z P.S.
X = 0 1 X = 0 1 S0 S1 S0 0 0 S1 S0 S2 1 0 S2 S0 S0 1 0 416 Unit 13 (a) Draw the corresponding state graphs.
(b) Show that the same output sequence is obtained from both state graphs when the input sequence is 010 (ignore the initial output for the Moore circuit).
(c) Using the state tables, complete the following timing diagrams for the two circuits. Note that the Mealy circuit has a false output, but the Moore does not. Also note that the output from the Moore circuit is delayed with respect to the Mealy.
Clock Mealy 0 1 0 0 1 State X S0 S1 S2 S0 Z Moore 0 1 0 X S0 Z D Clock Combinational Circuit D Q2 Q1 Z1 Z2 X1 X2 Q1 + Q2 + (d) Work Programmed Exercise 13.1.
(e) Work Problems 13.2 and 13.3.
6. Study Section 13.4, General Models for Sequential Circuits.
(a) A Mealy sequential circuit has the form shown. The combinational circuit realizes the following equations: Q+ 1 = X1 ′Q1 + X1Q1 ′Q2 ′ Z1 = X1Q1 Q+ 2 = X1Q2 ′ + X2 ′Q1 Z2 = X1 ′Q1 + X2Q2 ′ Analysis of Clocked Sequential Circuits 417 Initially, X1 = X2 = 1 and Q1 = Q2 = 0 as shown.
(1) Before the falling clock edge, show the values of the four combinational circuit outputs on the preceding diagram and on the following timing chart.
(2) Show the signal values on the circuit and timing chart immediately after the falling edge.
(3) Show any further changes in signal values which will occur after the new values of Q1 and Q2 have propagated through the circuit.
(4) Next change X1 to 0 and repeat steps (1), (2), and (3). Show the values for each step on the circuit and on the timing chart.
(5) Next change the inputs to X1 = 1 and X2 = 0 and repeat steps (1), (2), and (3).
(6) Change X2 to 1 and repeat.
Clock X1 X2 Q1 Q2 Z1 Z2 (b) Draw a block diagram for a general model of a Mealy circuit, using J-K flip- flops as memory elements. If the circuit has n output variables and k flip-flops, how many outputs will the combinational subcircuit have?
(c) If the circuit of Figure 13-5 were not synchronized using a clock, but instead, the flip-flops were updated continuously, and if the XOR gate had a longer delay than the OR gate, what problem could appear?
(d) The minimum clock period for a Moore circuit is determined the same way as for a Mealy circuit. Should tc be determined by the combinational subcir-cuit for the flip-flop inputs or for the outputs? (See Figure 13-19.) (e) We can think of the binary counter of Figure 12-15 as a Moore circuit if we say the outputs Z1, Z2, and Z3 are Z1 = A, Z2 = B, and Z3 = C. (The com-binational subcircuit for outputs has no gates, but that is okay.) If the XOR gates have a propagation delay of 4 ns and the AND gate has a propagation 418 Unit 13 delay of 2 ns, what is the longest total propagation delay through the combi-national subcircuit for flip-flops (i.e., the XOR gates and the AND gate) to the D inputs of the flip-flops? If the flip-flops have tsu = 3 ns and tp = 3 ns, what is the minimum clock period for the binary counter?
(f ) In Equations (13-6) and (13-7), what do the symbols δ and λ mean?
Equation (13-7) is for a Mealy circuit. What is the corresponding equation for a Moore circuit?
(g) For Table 13-5, 7. Work Problems 13.4 through 13.6.
8. When you are satisfied that you can meet the objectives, take the readiness test.
δ(S3, 1) = __ λ(S3, 1) = __ δ(S1, 2) = __ λ(S1, 2) = __ Analysis of Clocked Sequential Circuits The sequential circuits which we discussed in Chapter 12 perform simple functions such as shifting or counting. The counters we designed go through a fixed sequence of states and have no inputs other than a clock pulse that causes the state to change. We will now consider sequential circuits that have additional inputs. In general, the sequence of outputs and the sequence of flip-flop states for such circuits will depend on the input sequence which is applied to the circuit. Given a sequential circuit and an input sequence, we can analyze the circuit to determine the flip-flop state sequence and the output sequence by tracing the 0 and 1 signals through the circuit. Although signal tracing may be adequate for small circuits, for larger circuits it is better to construct a state graph or state table which represents the behavior Analysis of Clocked Sequential Circuits 419 of the circuit. Then, we can determine the output and state sequences from the graph or table. Such graphs and tables are also useful for the design of sequential circuits.
In this chapter we will also study the timing relationships between the inputs, the clock, and the outputs for sequential circuits by constructing timing diagrams. These timing relationships are very important when a sequential circuit is used as part of a larger digital system. After analyzing several specific sequential circuits, we will discuss a general model for a sequential circuit which consists of a combinational circuit together with flip-flops that serve as memory.
0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 1 1 0 1 1 0 1 1 0 1 0 1 0 1 1 0 1 1 1 0 0 0 0 8-Bit Word 7 Data Bits Parity Bits Parity Checker Z Clock X (Data Input) FIGURE 13-1 Block Diagram for Parity Checker © Cengage Learning 2014 13.1 A Sequential Parity Checker When binary data is transmitted or stored, an extra bit (called a parity bit) is fre-quently added for purposes of error detection. For example, if data is being trans-mitted in groups of 7 bits, an eighth bit can be added to each group of 7 bits to make the total number of 1’s in each block of 8 bits an odd number. When the total num-ber of 1 bits in the block (including the parity bit) is odd, we say that the parity is odd. Alternately, the parity bit could be chosen such that the total number of 1’s in the block is even, in which case we would have even parity. Some examples of 8-bit words with odd parity are If any single bit in the 8-bit word is changed from 0 to 1 or from 1 to 0, the parity is no longer odd. Thus, if any single bit error occurs in transmission of a word with odd parity, the presence of this error can be detected because the number of 1 bits in the word has been changed from odd to even.
As a simple example of a sequential circuit which has one input in addition to the clock, we will design a parity checker for serial data. (Serial implies that the data enters the circuit sequentially, one bit at a time.) This circuit has the form shown in Figure 13-1. When a sequence of 0’s and 1’s is applied to the X input, the output of 420 Unit 13 the circuit should be Z = 1 if the total number of 1 inputs received is odd; that is, the output should be 1 if the input parity is odd. Thus, if data which originally had odd parity is transmitted to the circuit, a final output of Z = 0 indicates that an error in transmission has occurred.
The value of X is read at the time of the active clock edge. The X input must be synchronized with the clock so that it assumes its next value before the next active clock edge. The clock input is necessary in order to distinguish consecutive 0’s or consecutive 1’s on the X input. Typical input and output waveforms are shown in Figure 13-2.
We will start the design by constructing a state graph (Figure 13-3). The sequen-tial circuit must “remember” whether the total number of 1 inputs received is even or odd; therefore, only two states are required. We will designate these states as S0 and S1, corresponding respectively to an even number of 1’s received and an odd number of 1’s received. We will start the circuit in state S0 because initially zero 1’s have been received, and zero is an even number. As indicated in Figure 13-3, if the circuit is in state S0 (even number of 1’s received) and X = 0 is received, the circuit must stay in S0 because the number of 1’s received is still even. However, if X = 1 is received, the circuit goes to state S1 because the number of 1’s received is then odd. Similarly, if the circuit is in state S1 (odd number of 1’s received) a 0 input causes no state change, but a 1 causes a change to S0 because the number of 1’s received is then even. The output Z should be 1 whenever the circuit is in state S1 (odd number of 1’s received). The output is listed below the state on the state graph.
Table 13-1(a) gives the same information as the state graph in tabular form. For example, the table shows that if the present state is S0, the output is Z = 0, and if the input is X = 1, the next state will be S1.
Because only two states are required, a single flip-flop (Q) will suffice. We will let Q = 0 correspond to state S0 and Q = 1 correspond to S1. We can then set up a table which shows the next state of flip-flop Q as a function of the present state and X. If we use a T flip-flop, T must be 1 whenever Q and Q+ differ. From Table 13-1(b), the T input must be 1 whenever X = 1. Figure 13-4 shows the resulting circuit.
Figure 13-2 shows the output waveform for the circuit. When X = 1, the flip-flop changes state after the falling edge of the clock. Note that the final value of Z is 0 because an even number of 1’s was received. If the number of 1’s received had been odd, the final value of Z would be l. In this case, it would be necessary to reset the FIGURE 13-2 Waveforms for Parity Checker © Cengage Learning 2014 Clock 1 1 1 1 0 0 0 0 X Z = Q FIGURE 13-3 State Graph for Parity Checker © Cengage Learning 2014 S0 Z = 0 X = 1 X = 1 S1 Z = 1 X = 0 X = 0 Analysis of Clocked Sequential Circuits 421 flip-flop to the proper initial state (Q = 0) before checking the parity of another input sequence.
13.2 Analysis by Signal Tracing and Timing Charts In this section we will analyze clocked sequential circuits to find the output sequence resulting from a given input sequence by tracing 0 and 1 signals through the circuit. The basic procedure is as follows: 1. Assume an initial state of the flip-flops (all flip-flops reset to 0 unless otherwise specified).
2. For the first input in the given sequence, determine the circuit output(s) and flip-flop inputs.
3. Determine the new set of flip-flop states after the next active clock edge.
4. Determine the output(s) that corresponds to the new states.
5. Repeat 2, 3, and 4 for each input in the given sequence.
As we carry out the analysis, we will construct a timing chart which shows the relationship between the input signal, the clock, the flip-flop states, and the circuit output. We have already seen how to construct timing charts for flip-flops (Unit 11) and counters (Unit 12).
In this unit we will use edge-triggered flip-flops that change state shortly after the active edge (rising or falling edge) of the clock. We will assume that the flip-flop inputs are stable a sufficient time before and after the active clock edge so that setup and hold time requirements are met. When the state of the sequential circuit changes, the change will always occur in response to the active clock edge. The circuit output may change at the time the flip-flops change state or at the time the input changes depending on the type of circuit.
(a) Present State Next State Present Output X = 0 X = 1 S0 S0 S1 0 S1 S1 S0 1 Clock CK Q′ Q T Z X FIGURE 13-4 Parity Checker TABLE 13-1 State and Transition Tables for Parity Checker (b) Q Q+ T Z X = 0 X = 1 X = 0 X = 1 0 0 1 0 1 0 1 1 0 0 1 1 © Cengage Learning 2014 © Cengage Learning 2014 422 Unit 13 Two types of clocked sequential circuits will be considered—those in which the out-put depends only on the present state of the flip-flops and those in which the output depends on both the present state of the flip-flops and on the value of the circuit inputs. If the output of a sequential circuit is a function of the present state only (as in Figures 13-4 and 13-5), the circuit is often referred to as a Moore machine. The state graph for a Moore machine has the output associated with the state (as in Figures 13-3 and 13-9). If the output is a function of both the present state and the input (as in Figure 13-7), the circuit is referred to as a Mealy machine. The state graph for a Mealy machine has the output associated with the arrow going between states (as in Figure 13-11).
As an example of a Moore circuit, we will analyze Figure 13-5 using an input sequence X = 01101. In this circuit, the initial state is A = B = 0, and all state changes occur after the rising edge of the clock, as shown in Figure 13-6. The X input is synchro-nized with the clock so that it assumes its next value after each rising edge. Because Z is a function only of the present state (in this case, Z = A ⊕ B) the output will only change when the state changes. Initially, X = 0, so D A = 1 and DB = 0, and the state will change to A = 1 and B = 0 after the first rising clock edge. Then X is changed to 1, so DA = 0, DB = 1 and the state changes to AB = 01 after the second rising clock edge. After the state change, X remains 1, so DA = DB = 1, and the next rising edge causes the state to change to 11. When X changes to 0, DA = 0 and DB = 1, and the state changes to AB = 01 on the fourth rising edge. Then, with X = 1, DA = DB = 1, so the Clock Clock A′ A DA Z X X A B′ B′ B DB FIGURE 13-5 Moore Sequential Circuit to Be Analyzed (0) 1 1 0 1 0 Clock X A B Z FIGURE 13-6 Timing Chart for Figure 13-5 © Cengage Learning 2014 © Cengage Learning 2014 Analysis of Clocked Sequential Circuits 423 fifth rising clock edge causes the state to change to AB = 11. The input, state, and out-put sequences are plotted on the timing chart of Figure 13-6 and are also listed below.
X = 0 1 1 0 1 A = 0 1 0 1 0 1 B = 0 0 1 1 1 1 Z = (0) 1 1 0 1 0 When the circuit is reset to its initial state (A = B = 0), the initial output is Z = 0. Because this initial 0 is not in response to any X input, it should be ignored. The resulting output sequence is Z = 11010. Note that for the Moore circuit, the output which results from application of a given input does not appear until after the active clock edge; therefore, the output sequence is displaced in time with respect to the input sequence.
As an example of a Mealy circuit, we will analyze Figure 13-7 and construct a timing chart using the input sequence X = 10101. The input is synchronized with the clock so that input changes occur after the falling edge, as shown in Figure 13-8. In this example, the output depends on both the input (X) and the flip-flop states (A and B), so Z may change either when the input changes or when the flip-flops change state. Initially, assume that the flip-flop states are A = 0, B = 0. If X = 1, the output is Z = 1 and JB = KA = 1. After the falling edge of the first clock pulse, B changes to 1 so Z changes to 0. If the input is changed to X = 0, Z will change back to 1. All flip-flop inputs are then 0, so no state change occurs with the second falling edge. When X is changed to 1, Z becomes 0 and JA = KA = JB = 1. A changes to 1 on the third falling clock edge, at which time Z changes to 1. Next, X is changed to 0 so Z becomes 0, and no state change occurs with the fourth clock pulse. Then, X is changed to 1, and Z becomes 1. Because JA = KA = JB = KB = 1, the fifth clock pulse returns the circuit to the initial state. The input, state, and output sequences are plotted on the timing chart of Figure 13-8 and are also listed below.
X = 1 0 1 0 1 A = 0 0 0 1 1 0 B = 0 1 1 1 1 0 Z = 1(0) 1 0(1) 0 1 (False outputs are indicated in parentheses.) FIGURE 13-7 Mealy Sequential Circuit to Be Analyzed © Cengage Learning 2014 A′ A JA KA Z X X B CK Clock Clock B′ B JB KB X X B′ X A X′ A′ B X A CK 424 Unit 13 A careful interpretation of the output waveform (Z) of the Mealy circuit is nec-essary. After the circuit has changed state and before the input is changed, the output may temporarily assume an incorrect value, which we call a false output. As indi-cated on the timing chart, this false value arises when the circuit has assumed a new state but the old input associated with the previous state is still present.
For a clocked sequential circuit, the value of the input immediately preceding the active clock edge determines the next state of the flip-flops. Extra input changes which might occur between active clock edges do not affect the state of the flip-flops. In a similar manner, the output from a Mealy circuit is only of interest immediately preceding the active clock edge, and extra output changes (false outputs) which might occur between active clock edges should be ignored.
Two types of false outputs can occur, as indicated in Figure 13-8. In one case the output Z momentarily goes to 0 and returns to 1 before the active clock edge. In the other case, the output Z momentarily goes to 1 and returns to 0 before the active edge. These false outputs are often referred to as glitches and spikes. In both cases, two changes of output occur when no change is expected. Ignoring the false outputs by reading the output just before the falling clock edge, the output sequence for the circuit is Z = 11001. If circuit delays are negligible, the false outputs could be eliminated if the input X was allowed to change only at the same time as the falling edge of the clock. If the output of the circuit is fed into a second sequential circuit which uses the same clock, the false outputs will not cause any problem because the inputs to the second circuit can cause a change of state only when a falling clock edge occurs. Because the output of a Moore circuit can change state only when the flip-flops change state and not when the input changes, no false outputs can appear in a Moore circuit.
For the Mealy circuit, the output which corresponds to a given input appears shortly after the application of that input. Because the correct output appears before the active clock edge, the output sequence is not displaced in time with respect to the input sequence as was the case for the Moore circuit. There are a few examples of Moore circuits (i.e., a circuit whose outputs only depend on the present state) whose outputs are not delayed with respect to the input sequence. (See Problem 13.17 for an example.) 1 1 "False" 1 output "False" 0 output 1 0 0 0 1 1 1 0 Clock X A B Z FIGURE 13-8 Timing Chart for Circuit of Figure 13-7 © Cengage Learning 2014 Analysis of Clocked Sequential Circuits 425 13.3 State Tables and Graphs In the previous section we analyzed clocked sequential circuits by signal tracing and the construction of timing charts. Although this is satisfactory for small circuits and short input sequences, the construction of state tables and graphs provides a more systematic approach which is useful for the analysis of larger circuits and which leads to a general synthesis procedure for sequential circuits.
The transition table and the state table for a sequential circuit specify the next state and output of the circuit in terms of its present state and input. A state in a transition table is specified by the flip-flop output values corresponding to the state. A state in a state table is specified symbolically. When analyzing a sequential circuit, the transition table is derived from the circuit as described below. Given a transition table, a state table for the circuit is derived by assigning symbols to the states. The design process for a sequential circuit reverses this process; usually a state table is determined first; then a transition table is derived by assigning binary combinations to the states.
The following method can be used to construct the transition table: 1. Determine the flip-flop input equations and the output equations from the circuit.
2. Derive the next-state equation for each flip-flop from its input equations, using one of the following relations: D flip-flop Q+ = D (13-1) D-CE flip-flop Q+ = D·CE + Q·CE′ (13-2) T flip-flop Q+ = T ⊕ Q (13-3) S-R flip-flop Q+ = S + R′Q (13-4) J-K flip-flop Q+ = JQ′ + K′Q (13-5) 3. Plot a next-state map for each flip-flop.
4. Combine these maps to form the transition table. Such a transition table, which gives the next state of the flip-flops as a function of their present state and the circuit inputs.
As an example of this procedure, we will derive the transition table for the circuit of Figure 13-5: 1. The flip-flop input equations and output equation are DA = X ⊕ B′ DB = X + Α Z = A ⊕ B 2. The next-state equations for the flip-flops are A+ = X ⊕ B′ B+ = X + A 426 Unit 13 4. Combining these maps yields the transition table in Table 13-2(a), which gives the next state of both flip-flops (A+B+) as a function of the present state and input. The output function Z is then added to the table. In this example, the out-put depends only on the present state of the flip-flops and not on the input, so only a single output column is required.
Using Table 13-2(a), we can construct the timing chart of Figure 13-6 or any other timing chart for some given input sequence and specified initial state. Initially AB = 00 and X = 0, so Z = 0 and A+B+ = 10. This means that after the rising clock edge, the flip-flop state will be AB = 10. Then, with AB = 10, the output is Z = 1. The next input is X = 1, so A+B+ = 01 and the state will change after the next rising clock edge. Continuing in this manner, we can complete the timing chart.
If we are not interested in the flip-flop output values corresponding to the states, we can replace each combination of flip-flop states with a single symbol which rep-resents the state of the circuit. Replacing 00 with S0, 01 with S1, 11 with S2, and 10 with S3 in Table 13-2(a) yields the state table shown in Table 13-2(b). The Z column is labeled Present Output because it is the output associated with the Present State. The state graph of Figure 13-9 represents Table 13-2(b). Each node of the graph represents a state of the circuit, and the corresponding output is placed in the circle below the state symbol. The arc joining two nodes is labeled with the value of X which will cause a state change between these nodes. Thus, if the circuit is in state S0 and X = 1, a clock edge will cause a transition to state S1.
1 0 0 1 0 1 0 1 1 00 AB A+ X 01 11 10 0 0 1 0 1 0 1 1 1 1 00 AB B+ X 01 11 10 1 3. The corresponding maps are (a) AB A+B+ Z X = 0 X = 1 00 10 01 0 01 00 11 1 11 01 11 0 10 11 01 1 TABLE 13-2 Moore Transition and State Tables for Figure 13-5 (b) Present State Next State Present Output (Z) X = 0 X = 1 S0 S3 S1 0 S1 S0 S2 1 S2 S1 S2 0 S3 S2 S1 1 © Cengage Learning 2014 Analysis of Clocked Sequential Circuits 427 Next, we will construct the state table and graph for the Mealy machine of Figure 13-7. The next-state and output equations are A+ = JAA′ + KA ′A = XBA′ + X′A B+ = JBB′ + KB ′B = XB′ + (AX)′B = XB′ + X′B + A′B Z = X′A′B + XB′ + XA The next-state and output maps (Figure 13-10) combine to form the transition table in Table 13-3(a). Given values for A, B, and X, the current value of the output is determined from the Z column of this table, and the states of the flip-flops after the active clock edge are determined from the A+ B+ columns.
We can construct the timing chart of Figure 13-8 using Table 13-3(a). Initially with A = B = 0 and X = 1, the table shows that Z = 1 and A+B+ = 01. Therefore, after the falling clock edge, the state of flip-flop B will change to 1, as indicated in Figure 13-8. Now, from the 01 row of the table, if X is still 1, the output will be 0 until the input is changed to X = 0. Then, the output is Z = 1, and the next falling clock edge produces no state change. Finish stepping through the state table in this man-ner and verify that A, B, and Z are as given in Figure 13-8.
If we let AB = 00 correspond to circuit state S0, 01 to S1, 11 to S2, and 10 to S3, we can construct the state table in Table 13-3(b) and the state graph of Figure 13-11. In Table 13-3(b), the Present Output column gives the output associated with the 0 0 0 1 0 1 1 0 1 00 AB A+ X 01 11 10 0 0 1 0 1 1 1 1 0 0 00 AB B+ X 01 11 10 1 0 1 0 1 1 0 0 1 0 00 AB Z X 01 11 10 1 FIGURE 13-10 1 1 0 0 0 0 1 1 S0 0 S1 1 S2 0 S3 1 FIGURE 13-9 Moore State Graph for Figure 13-5 © Cengage Learning 2014 © Cengage Learning 2014 428 Unit 13 present state and present input. Thus, if the present state is S0 and the input changes from 0 to 1, the output will immediately change from 0 to 1. However, the state will not change to the next state (S1) until after the clock pulse. For Figure 13-11, the labels on the arrows between states are of the form X/Z, where the symbol before the slash is the input and the symbol after the slash is the corresponding output. Thus, in state S0 an input of 0 gives an output of 0, and an input of 1 gives an out-put of 1. For any given input sequence, we can easily trace out the state and output sequences on the state graph. For the input sequence X = 10101, verify that the cor-responding output sequence is 11001. This agrees with Figure 13-8 if the false out-puts are ignored. Note that the false outputs do not show on the state graph because the inputs are read at the active clock edge, and no provision is made for extra input changes between active edges.
Next, we will analyze the operation of a serial adder (Figure 13-12(a)) that adds two n-bit binary numbers X = xn–1 · · · x1x0 and Y = yn–1 · · · y1y0. The operation of the serial adder is similar to the parallel adder of Figure 4-2 except that the binary num-bers are fed in serially, one pair of bits at a time, and the sum is read out serially, one bit at a time. First, x0 and y0 are fed in; a sum digit s0 is generated, and the carry c1 is stored. At the next clock time, x1 and y1 are fed in and added to c1 to give the next sum digit s1 and the new carry c2, which is stored. This process continues until all bits have been added. A full adder is used to add the xi, yi and ci bits to form ci+1 and si. A D flip-flop is used to store the carry (ci+1) on the rising edge of the clock. The xi and yi inputs must be synchronized with the clock.
Figure 13-13 shows a timing diagram for the serial adder. In this example we add 10011 + 00110 to give a sum of 11001 and a final carry of 0. Initially the carry flip-flop must be cleared so that c0 = 0. We start by adding the least-significant (right-most) bits in each word. Adding 1 + 0 + 0 gives s0 = 1 and c1 = 0, which is stored in the flip-flop at the rising clock edge. Because y1 is 1, adding 1 + 1 + 0 gives s1 = 0 (a) AB A+B+ Z X = 0 1 X = 0 1 00 00 01 0 1 01 01 11 1 0 11 11 00 0 1 10 10 01 0 1 TABLE 13-3 Mealy Transition and State Tables for Figure 13-7 (b) Present State Next State Present Output X = 0 1 X = 0 1 S0 S0 S1 0 1 S1 S1 S2 1 0 S2 S2 S0 0 1 S3 S3 S1 0 1 S0 S3 S1 S2 0 0 1 0 1 1 1 1 0 0 1 1 0 0 0 1 FIGURE 13-11 Mealy State Graph for Figure 13-7 © Cengage Learning 2014 © Cengage Learning 2014 Analysis of Clocked Sequential Circuits 429 and c2 = 1, which is stored in the flip-flop on the rising clock edge. This process con-tinues until the addition is completed. Reading the sum output just before the rising edge of the clock gives the correct result.
The truth table for the full adder (Table 4-4) is repeated in Figure 13-12(b) in modified form. Using this table, we can construct a state graph (Figure 13-14) for the serial adder. The serial adder is a Mealy machine with inputs xi and yi and output si. The two states represent a carry (ci) of 0 and 1, respectively. From the table, ci is the present state of the sequential circuit, and ci+1 is the next state. If we start in S0 (no carry), and xi yi = 11, the output is si = 0 and the next state is S1. This is indicated by the arrow going from state S0 to S1.
Table 13-4 shows a state table for a Mealy sequential circuit with two inputs and two outputs. Figure 13-15 shows the corresponding state graph. The notation 00, 01/00 on the arc from S3 to S2 means if X1 = X2 = 0 or X1 = 0 and X2 = 1, then Z1 = 0 and Z2 = 0.
FIGURE 13-12 Serial Adder © Cengage Learning 2014 Clock CK Q′ Q D xi yi ci si ci + 1 (a) With D flip-flop Full Adder FIGURE 13-13 Timing Diagram for Serial Adder © Cengage Learning 2014 1 1 1 0 0 Clock xi yi ci ci + 1 si xi yi ci ci 1 si 0 0 0 0 0 0 0 1 0 1 0 1 0 0 1 0 1 1 1 0 1 0 0 0 1 1 0 1 1 0 1 1 0 1 0 1 1 1 1 1 (b) Truth table FIGURE 13-14 State Graph for Serial Adder © Cengage Learning 2014 xiyisi 00 0 01 1 10 1 11 0 00 1 , , 01 0 10 0 11 1 , , S0 S1 430 Unit 13 Construction and Interpretation of Timing Charts Several important points concerning the construction and interpretation of timing charts are summarized as follows: 1. When constructing timing charts, note that a state change can only occur after the rising (or falling) edge of the clock, depending on the type of flip-flop used.
2. The input will normally be stable immediately before and after the active clock edge.
3. For a Moore circuit, the output can change only when the state changes, but for a Mealy circuit, the output can change when the input changes as well as when the state changes. A false output may occur between the time the state changes and the time the input is changed to its new value. (In other words, if the state has changed to its next value, but the old input is still present, the output may be temporarily incorrect.) 4. False outputs are difficult to determine from the state graph, so use either signal tracing through the circuit or use the state table when constructing timing charts for Mealy circuits.
Present State Next State Present Output (Z1Z2) X1X2 = 00 01 10 11 X1X2 = 00 01 10 11 S0 S3 S2 S1 S0 00 10 11 01 S1 S0 S1 S2 S3 10 10 11 11 S2 S3 S0 S1 S1 00 10 11 01 S3 S2 S2 S1 S0 00 00 01 01 TABLE 13-4 A State Table with Multiple Inputs and Outputs 00 10 10 11 01 10 01 10 11 11 11 01 11 01 00 00 10 01 00 00 01 10 10 11 10 11 11 01 00, 01 00 , S0 S1 S2 S3 FIGURE 13-15 State Graph for Table 13-4 © Cengage Learning 2014 © Cengage Learning 2014 Analysis of Clocked Sequential Circuits 431 5. When using a Mealy state table for constructing timing charts, the procedure is as follows: (a) For the first input, read the present output and plot it.
(b) Read the next state and plot it (following the active edge of the clock pulse).
(c) Go to the row in the table which corresponds to the next state and read the output under the old input column and plot it. (This may be a false output.) (d) Change to the next input and repeat steps (a), (b), and (c). (Note: If you are just trying to read the correct output sequence from the table, step (c) is naturally omitted.) 6. For Mealy circuits, the best time to read the output is just before the active edge of the clock, because the input(s) must be stable at that time and the output will be correct.
The example in Figure 13-16 shows a state graph, a state table, a circuit that imple-ments the table, and a timing chart. When the state is S0 and the input is X = 0, the output from the state graph, state table, circuit, and timing chart is Z = 1 (labeled A on the figure). Note that this output occurs before the rising edge of the clock. In a Mealy circuit, the output is a function of the present state and input; therefore, the output should be read just before the clock edge that causes the state to change.
S1 S0 Clock State, Q X Z A S0 S1 S1 Z X A A B B F F A E D D E B C D Read X and Z in shaded area (before rising edge of clock).
Inital values are shown.
E F 0 1 0 0 Q D Q′ 1 1 0/1 1/1 0/0 0 1 Q X = 0 1 1 0 0 0 S0 S1 S1 1 S1 S0 S1 , 1/0 Clock FIGURE 13-16 © Cengage Learning 2014 432 Unit 13 As you continue to study this example, each time the input X changes, trace the changes on the state graph, the state table, the circuit, and the timing chart. Because the input X was 0 before the first rising edge of the clock, the state changes to S1 after the first rising edge of the clock. Because of the state change, the output also changes (B on the timing chart), but because the input has not yet changed to its new value, the output value may not be correct. We refer to this as a false output or glitch. If the input changes several times before it assumes its correct value, the output may also change several times (C). The input must assume its correct value before the ris-ing edge of the clock, and the output should be read at this time (D). After the rising clock edge, the state stays the same and the output stays the same for this particular example. In general, the state may change after a rising edge of the clock, and the state change may result in an output change. Again, the output value may be wrong because the input still has the old value (E). When the input is changed to its new value, the output changes to its new value (F), and this value should be read before the next rising clock edge.
If we look at the input and output just before each rising edge of the clock, we find the following sequences: X = 0 1 0 Z = 1 1 0 You should be able to verify the sequence for Z using the state graph, using the state table, and using the circuit diagram.
The synthesis procedure for sequential circuits, discussed in detail in Units 14 through 16, is just the opposite of the procedure used for analysis. Starting with the specifications for the sequential circuit to be synthesized, a state graph is con-structed. This graph is then translated to a state table, and the flip-flop output values are assigned for each state. The flip-flop input equations are then derived, and finally, the logic diagram for the circuit is drawn. For example, to synthesize the circuit in Figure 13-7 , we would start with the state graph of Figure 13-11. Then, we would derive the state table in Table 13-3(b), the transition table in Table 13-3(a), the next-state and output equations, and, finally, the circuit of Figure 13-7 .
13.4 General Models for Sequential Circuits A sequential circuit can be divided conveniently into two parts—the flip-flops which serve as memory for the circuit and the combinational logic which realizes the input functions for the flip-flops and the output functions. The combinational logic may be implemented with gates, with a ROM, or with a PLA. Figure 13-17 illustrates the general model for a clocked Mealy sequential circuit with m inputs, n outputs, and k clocked D flip-flops used as memory. Drawing the model in this form emphasizes the presence of feedback in the sequential circuit because the flip-flop outputs are fed back as inputs to the combinational subcircuit. The combinational subcircuit realizes Analysis of Clocked Sequential Circuits 433 the n output functions and the k next-state functions, which serve as inputs to the D flip-flops: Z1 = f1(X1, X2, . . . , Xm, Q1, Q2, . . . , Qk) Z2 = f2(X1, X2, . . . , Xm, Q1, Q2, . . . , Qk) ⋮ Zn = fn(X1, X2, . . . , Xm, Q1, Q2, . . . , Qk) . n output functions Q+ 1 = D1 = g1(X1, X2, . . . , Xm, Q1, Q2, . . . , Qk) Q+ 2 = D2 = g2(X1, X2, . . . , Xm, Q1, Q2, . . . , Qk) ⋮ Q+ k = Dk = gk(X1, X2, . . . , Xm, Q1, Q2, . . . , Qk) . k next-state functions FIGURE 13-17 General Model for Mealy Circuit Using Clocked D Flip-Flops © Cengage Learning 2014 Dk Qk CK Clock Combinational Subcircuit Q2 Q1 D1 D2 Z1 Z2 X1 X2 Qk Zn Xm Qk + CK Q2 Q2 + CK Q1 Q1 + ...
...
...
...
.........
When a set of inputs is applied to the circuit, the combinational subcircuit gener-ates the outputs (Z1, Z2, . . . , Zn) and the flip-flop inputs (D1, D2, . . . , Dk). Then, a clock pulse is applied and the flip-flops change to the proper next state. This process is repeated for each set of inputs. Note that at a given point in time, the outputs of the flip-flops represent the present state of the circuit (Q1, Q2, . . . , Qk). These Qi’s feed back into the combinational circuit, which generates the flip-flop inputs using the Qi’s and the X inputs. When D flip-flops are used, Di = Q+ i ; therefore, the combi-national circuit outputs are labeled Q+ 1 , Q+ 2 , etc. Although the model in Figure 13-17 uses D flip-flops, a similar model may be used for other types of clocked flip-flops, in 434 Unit 13 which case the combinational circuit must generate the appropriate flip-flop inputs instead of the next-state functions.
The clock synchronizes the operation of the flip-flops and prevents timing prob-lems. The gates (or other logic) in the combinational subcircuit have finite propaga-tion delays, so when the inputs to the circuit are changed, a finite time is required before the flip-flop inputs reach their final values. Because the gate delays are not all the same, the flip-flop input signals may contain transients, and they may change at different times. If the next active clock edge does not occur until all flip-flop input signals have reached their final steady-state values, the unequal gate delays will not cause any timing problems. All flip-flops which must change state do so at the same time in response to the active edge of the clock. When the flip-flops change state, the new flip-flop outputs are fed back into the combinational subcircuit. However, no further change in the flip-flop states can occur until the next clock pulse.
We can determine the fastest clock speed (the minimum clock period) from the general model of the Mealy circuit in Figure 13-17 . The computation of the minimum clock period is similar to that of Figure 11-21, except that we must also consider the effect of the X inputs. Figure 13-18 shows the sequence of events during one clock period. Following the active edge of the clock the flip-flops change state, and the flip-flop output is stable after the propagation delay (tp). The new values of Q then propagate through the combinational circuit so that the D values are stable after the combinational circuit delay (tc). Then, the flip-flop setup time (tsu) must elapse before the next active clock edge. Thus, the propagation delay in the flip-flops, the propaga-tion delay in the combinational subcircuit, and the setup time for the flip-flops deter-mine how fast the sequential circuit can operate, and the minimum clock period is tclk (min) = tp + tc + tsu The preceding discussion assumes that the X inputs are stable no later than tc + tsu before the next active clock edge. If this is not the case, then we must calculate the minimum clock period by tclk (min) = tx + tc + tsu where tx is the time after the active clock edge at which the X inputs are stable.
Another property of the circuit affecting the minimum clock period is the clock skew. The clock edge that causes the flip-flops to change state does not necessarily reach all flip-flop clock inputs at the same time; the difference in the arrival time of the clock edges to two flip-flops is the clock skew for those two flip-flops. Clock skew is caused by differing propagation delays over the clock lines and by different clock buffer propagation delays. In Figure 13-18, assume that the clock skew between the two flip-flops is tsk. Furthermore, assume that the clock skew is such that the second flip-flop receives the clock edge before first flip-flop does. Then, the clock skew is added to setup time as part of the clock period. The minimum clock period is Tclk (min) = tp + tc + tsu + tsk A different constraint applies if the clock skew is such that the second flip-flop receives the clock edge after the first flip-flop does. In this case, proper circuit Analysis of Clocked Sequential Circuits 435 operation requires that the input to the second flip-flop not change until after the clock skew time plus the flip-flop hold time, th. It is necessary that tp + tc ≥tsk + th In the worst case, there may not be any combinational logic between the two flip-flops (e.g., a shift register does not have any logic between the flip-flops). In this case, tp ≥tsk + th In order to satisfy this constraint, it may be necessary to route the clock line so the second flip-flop receives the clock signal before the first clock signal.
The general model for the clocked Moore circuit (Figure 13-19) is similar to the clocked Mealy circuit. The output subcircuit is drawn separately for the Moore cir-cuit because the output is only a function of the present state of the flip-flops and not a function of the circuit inputs. Operation of the Moore circuit is similar to that of the Mealy except when a set of inputs is applied to the Moore circuit, the result-ing outputs do not appear until after the clock causes the flip-flops to change state.
To facilitate the study of sequential circuits with multiple inputs and outputs, the assignment of symbols to represent each combination of input values and each combination of output values is convenient. For example, we can replace Table 13-4 Minimum Clock Period (tclk) Flip-Flop Propagation Delay (tp) Combinational Circuit Delay (tc) Setup Time (tsu) Active edge of Clock Q Outputs Stable D Inputs Stable Next active Edge of Clock FIGURE 13-18 Minimum Clock Period for a Sequential Circuit FIGURE 13-19 General Model for Moore Circuit Using Clocked D Flip-Flops © Cengage Learning 2014 Dk Qk CK Clock Combinational Subcircuit (for Flip-Flop Inputs) Combinational Subcircuit (for Outputs) Q2 Q1 D1 D2 Z1 Z2 X1 X2 Qk Zn Xm Qk + CK Q2 Q2 + CK Q1 Q1 + ...
...
...
...
.........
.........
.........
© Cengage Learning 2014 436 Unit 13 with Table 13-5 if we let X = 0 represent the input combination X1X2 = 00, X = 1 represent X1X2 = 01, etc., and similarly let Z = 0 represent the output combination Z1Z2 = 00, Z = 1, represent Z1Z2 = 01, etc. In this way we can specify the behavior of any sequential circuit in terms of a single input variable X and a single output variable Z.
Table 13-5 specifies two functions, the next-state function and the output function. The next-state function, designated δ, gives the next state of the circuit (i.e., the state after the clock pulse) in terms of the present state (S) and the present input (X): S+ = δ(S, X) (13-6) The output function, designated λ, gives the output of the circuit (Z) in terms of the present state (S) and input (X): Z = λ(S, X) (13-7) Values of S+ and Z can be determined from the state table. From Table 13-5, we have δ(S0, 1) = S2 δ(S2, 3) = S1 λ(S0, 1) = 2 λ(S2, 3) = 1 We will use the λ and δ notation when we discuss equivalent sequential circuits in Unit 15.
Programmed Exercise 13.1 Cover the answer to each exercise with a sheet of paper and slide it down as you check your answers.
13.1(a) In this exercise you will analyze the following sequential circuit using a state table and a timing chart.
Derive the next-state and output equations.
A+ = ______ B+ = ______ Z = ______ Present State Next State Present Output (Z) X = 0 1 2 3 X = 0 1 2 3 S0 S3 S2 S1 S0 0 2 3 1 S1 S0 S1 S2 S3 2 2 3 3 S2 S3 S0 S1 S1 0 2 3 1 S3 S2 S2 S1 S0 0 0 1 1 TABLE 13-5 State Table with Multiple Inputs and Outputs © Cengage Learning 2014 Analysis of Clocked Sequential Circuits 437 Answer A′ A A DA Z B CK Clock B′ B JB KB X′ X′ X X B X A A′ CK Z = XA + X′B, B+ = (A′ ⊕ X)B′ + XB = A′B′X′ + AB′X + XB A+ = B(A + X) 13.1(b) Plot these equations on maps and complete the transition table.
0 1 00 AB A+ X 01 11 10 0 1 00 AB B+ X 01 11 10 0 1 00 AB Z X 01 11 10 AB A+B+ Z X = 0 1 0 1 00 01 11 10 Answer to 13.1(b) AB A+B+ Z X = 0 1 0 1 S0 00 01 00 0 0 S1 01 00 11 1 0 S2 11 10 11 1 1 S3 10 00 01 0 1 13.1(c) Convert your transition table to a state table using the given state numbering.
Next State Output X = 0 1 0 1 S0 S1 S2 S3 438 Unit 13 Answer to 13.1(c) X = 0 1 0 1 S0 S1 S0 0 0 S1 S0 S2 1 0 S2 S3 S2 1 1 S3 S0 S1 0 1 13.1(d) Complete the corresponding state graph.
S0 S1 S2 S3 0 0 1 0 Answer to 13.1(d) S0 S1 S2 S3 1 0 1 1 1 1 0 1 0 0 1 0 0 0 0 1 Analysis of Clocked Sequential Circuits 439 13.1(e) Using this graph, determine the state sequence and output sequence if the initial state is S0 and the input sequence is X = 0, 1, 0, 1.
(1) The initial output with X = 0 in state S0 is Z = _ and the next state is __.
(2) The output in this state when the next input (X = 1) is applied is Z = _ and the next state is __.
(3) When the third input (X = 0) is applied, the output is Z = _ and the next state is __.
(4) When the last input is applied, Z = __ and the final state is _.
In summary, the state sequence is S0, __, _, __, _. The output sequence is Z = __.
Clock X Answer to 13.1(e) S0, S1, S2, S3, S1 Z = 0011 13.1(f) This sequence for Z is the correct output sequence. Next, we will determine the timing chart including any false outputs for Z. Assuming that X changes midway between falling and rising clock edges, draw the waveform for X (X = 0, 1, 0, 1).
Clock X A B AB A+B+ 1 X = 0 00 01 00 01 00 11 11 10 11 10 00 01 13.1(g) Referring to the transition table, sketch the waveforms for A and B assuming that initially A = B = 0. The state sequence is AB = 00, _, __, _, __.
Answer 440 Unit 13 Answer (Note that A and B change immediately after the falling clock edge.) Clock X A B Z t7 t6 t5 t4 t3 t2 t1 AB Z X = 0 1 00 0 0 01 1 0 11 1 1 10 0 1 Check your state sequence against the answer to 13.1(e), noting that S0 = 00, S1 = 01, S2 = 11 and S3 = 10.
13.1(h) Using the output table, sketch the waveform for Z. At time t1, X = A = B = 0, so Z = _. At time t2, X = _ and AB = _, so Z = __. At time t3, X = _ and AB = __, so Z = _. Complete the waveform for Z, showing the output at t4, t5, etc.
Answer (Note that Z can change immediately following the change in X or immediately following the falling clock edge.) Clock X Z t7 t6 t5 t4 t3 t2 t1 13.1(i) (1) Because this is a Mealy circuit, the correct times to read the output are during intervals t1, _, _, and _.
(2) The correct output sequence is therefore Z = _.
(3) False outputs may occur during intervals __, _, and __.
(4) In two of these intervals, false outputs actually occur. These intervals are _ and __.
Analysis of Clocked Sequential Circuits 441 Answer (1) t1, t3, t5 and t7 (2) Check your Z sequence against the answer to 13.1(e).
(3) t2, t4, and t6 (4) t2 and t6 (output during t4 is not false because it is the same as t5).
13.1(j) Finally, we will verify part of the timing chart by signal tracing on the original circuit (see 13.1(a)).
(1) Initially, A = B = 0 and X = 0, so DA = _, JB = __, KB = _, and Z = __.
(2) After the clock pulse A = _, B = __, and Z = _.
(3) After X is changed to 1, DA = __, JB = _, KB = __, and Z = _.
(4) After the clock pulse, A = __, B = __, and Z = _____.
Check your answers against the timing chart. Answer to (1) corresponds to t1, (2) to t2, (3) to t3, and (4) to t4.
S R Clock CK X Z S R CK Q2 Q2 Q3 S R CK Q3 Q1 Q1 ′ ′ ′ 13.3 (a) For the following sequential circuit, find the next-state equation or map for each flip-flop. (Is this a Mealy or Moore machine?) Using these next-state equations or maps, construct a transition table and graph for the circuit.
(b) What is the output sequence when the input sequence is X = 01100?
(c) Draw a timing diagram for the input sequence in (b). Show the clock, X, A, B, and Z. Assume that the input changes between falling and rising clock edges.
Problems 13.2 Construct a transition graph for the shift register shown. (X is the input, and Z is the output.) Is this a Mealy or Moore machine?
442 Unit 13 13.4 A sequential circuit has the form shown in Figure 13-17 , with D1 = Q2Q3 ′ D3 = Q2 ′ + X D2 = Q3 Z = XQ2 ′ + X′Q2 (a) Construct a transition table and state graph for the circuit. (Is this a Mealy or Moore machine?) (b) Draw a timing diagram for the circuit showing the clock, X, Q1, Q2, Q3 and Z. Use the input sequence X = 01011. Change X between clock edges so that we can see false outputs, and indicate any false outputs on the diagram.
(c) Compare the output sequence obtained from the timing diagram with that from the transition graph.
(d) At what time with respect to the clock should the input be changed in order to eliminate the false output(s)?
13.5 Below is a transition table with the outputs missing. The output should be Z = X′B′ + XB.
(a) Is this a Mealy machine or Moore machine?
(b) Fill in the outputs on the transition table.
(c) Give the transition graph.
(d) For an input sequence of X = 10101, give a timing diagram for the clock, X, A, B, C, and Z. State changes occur on the rising clock edge. What is the cor-rect output sequence for Z? Change X between rising and falling clock edges so that we can see false outputs, and indicate any false outputs on the diagram.
Clock A ′ A JA KA X′ X′ Z A ′ B′ B X CK Clock B′ B JB KB CK A+B+C+ ABC X = 0 X = 1 000 011 010 001 000 100 010 100 100 011 010 000 100 100 001 Analysis of Clocked Sequential Circuits 443 13.6 A sequential circuit of the form shown in Figure 13-17 is constructed using a ROM and two rising-edge-triggered D flip-flops. The contents of the ROM are given in the table. Assume the propagation delay of the ROM is 8 ns, the setup time for the flip-flops is 2 ns, and the propagation delay of the flip-flops is 4 ns.
(a) What is the minimum clock period for this circuit?
(b) Draw a timing diagram for this circuit, using the given delays and the mini-mum clock period of part (a). Give the clock, X, D1, D2, Q1, Q2 and Z. Assume Q1Q2 = 00 to start with and assume X takes on its new value 4 ns after each rising edge. Use the input sequence X = 0, 1, 1, 0. Specify the correct output sequence for Z.
(c) Construct a state table and a state graph for the circuit.
13.7 (a) Construct a transition table and state graph for the circuit shown.
(b) Construct a timing chart for the circuit for an input sequence X = 10111. (Assume that initially Q1 = Q2 = 0 and that X changes midway between the rising and falling clock edges.) (c) List the output values produced by the input sequence.
Q1 Q2 X D1 D2 Z 0 0 0 1 0 0 0 0 1 1 0 0 0 1 0 0 0 0 0 1 1 1 1 0 1 0 0 1 1 0 1 0 1 0 1 1 1 1 0 0 1 1 1 1 1 1 1 1 X Z Clk Ck FF Q1 J1 K1 Ck FF Q2 J2 K2 Q2 ′ Q1 ′ 444 Unit 13 13.9 (a) Construct a transition table and state graph for the circuit shown.
(b) Construct a timing chart for the input sequence X1X2 = 11, 11, 01, 10, 10, 00. (Assume that initially Q1 = Q2 = 0 and that X1 and X2 change midway between the rising and falling clock edges.) (c) List the output values produced by the input sequence.
X Z Clk Ck FF Q1 J1 K1 Ck FF Q2 J2 K2 Q2 ′ Q1 ′ 13.8 (a) Construct a transition table and state graph for the circuit shown.
(b) Construct a timing chart for the input sequence X = 10101. (Assume that ini-tially Q1 = Q2 = 0 and that X changes midway between the rising and falling clock edges.) Indicate the times Z has the correct value.
(c) List the output values produced by the input sequence.
Clock Z Ck D2 Q2 Q2 ′ Ck D1 Q1 Q1 ′ Q1 Q1 Q2 X 1′ Q2 X 1 X 1 ′ X 2 ′ X 1 ′ X 2 ′ X 2 Q2 Q1 ′ Analysis of Clocked Sequential Circuits 445 13.11 (a) Construct a transition table and state graph for the given circuit.
(b) Construct a timing chart for the circuit for an input sequence X = 10011. Indicate at what times Z has the correct value and specify the correct output sequence. (Assume that X changes midway between falling and rising clock edges.) Initially, Q1 = Q2 = 0.
Clock X 2 Z Ck D2 Q2 Q2 ′ Ck D1 Q1 Q1 ′ Q1 ′ Q2 X 1 Q1 Q1 Q2 X 2 Q2 1 X 1 X 2′ X′ X 2 Q2 Q1 ′ Q1 Q1 Q2 Q2 J1 K1 J2 K2 X X X X Z X Q2 Q1 Clock Clock ′ ′ ′ 13.10 (a) Construct a transition table and state graph for the circuit shown.
(b) Construct a timing chart for the input sequence X1X2 = 01, 10, 01, 11, 11, 01. (Assume that initially Q1 = Q2 = 0 and that X1 and X2 change midway between the rising and falling clock edges.) (c) List the output values produced by the input sequence.
446 Unit 13 13.13 A sequential circuit has one input X, one output Z, and three flip-flops Q1, Q2 and Q3. The transition and output tables for the circuit follow: 13.12 Repeat Problem 13.11 for the circuit below and X1X2 = 10, 01, 10, 11, 11, 10.
X 2 Clock Q1 Q1 Q2 Q2 D1 D2 Z Q1 Q1 Clock Q2 X 1 X 1 X 2 X 1 X 2 X 1 Q2 Q2 Q1 ′ ′ ′ ′ ′ Present State Next State Output (Z) X = 0 X = 1 X = 0 X = 1 000 100 101 1 0 001 100 101 0 1 010 000 000 1 0 011 000 000 0 1 100 111 110 1 0 101 110 110 0 1 110 011 010 1 0 111 011 011 0 1 (a) Construct a timing chart for the input sequence X = 0101 and initial state Q1Q2Q3 = 000. Identify any false outputs. (Assume that the flip-flops are rising-edge triggered and that the input changes midway between the rising and falling edges of the clock.) (b) List the output values produced by the input sequence.
13.14 Repeat Problem 13.13 for the input sequence X = 1001 and initial state Q1Q2Q3 = 000.
13.15 A sequential circuit has the form shown in Figure 13-17 with D1 = Q2Q3 ′ + XQ1 ′ D3 = Q2 ′ + X D2 = Q3 + X′Q2 Z = XQ2 ′ + X′Q2 Analysis of Clocked Sequential Circuits 447 (a) Construct a state table and state graph for the circuit.
(b) Draw a timing diagram for the circuit showing the clock, X, Q1, Q2, Q3 and Z. Use the input sequence X = 01011 and assume that X changes midway between falling and rising clock edges. Indicate any false outputs on the diagram.
(c) Compare the output sequence obtained from the timing diagram with that from the state graph.
(d) At what time with respect to the clock should the input be changed in order to eliminate the false output(s)?
13.16 Repeat Problem 13.15 for the given equations and the input sequence X = 01100.
D1 = Q3 ′X′ D3 = Q3 ′X + Q1Q2 D2 = Q3 ′Q1 + XQ2 ′ Z = XQ3 + X′Q′ 13.17 Two sequential circuits have the form shown in Figure 13-17. The initial state of both circuits is Q2Q1Q0 = 000. The two circuits perform the same function but with different timing between the input and output.
(a) Construct a state table and state graph for each circuit. (In the state graphs only include states reachable from the initial state.) (b) Describe in words when each circuit produces Z = 1. (Hint: Consider three consecu-tive inputs as a 3-bit binary number with the most significant bit being sent first.) (c) Considering the dependence of the output on the input, are the circuits Moore or Mealy circuits?
(d) Considering the timing of when Z = 1 with respect to the input, do the circuits have Mealy or Moore type timing?
Circuit 1 Circuit 2 Q+ 2 = Q2 ′Q0 Q+ 1 = XQ2 ′Q1 + XQ2 ′Q0 ′ Q+ 0 = Q2 ′ Z = Q2Q1 Q+ 2 = Q2 ′Q0 Q+ 1 = XQ1 + XQ0 ′ + Q2Q1 Q+ 0 = Q2 ′ Z = Q1Q0 ′ 13.18 Analyze the following clocked synchronous sequential circuit by performing the following steps: (a) Write the equations for the flip-flop inputs and the output equation.
(b) Construct the transition and output tables.
(c) Construct the transition graph.
(d) Give a one sentence description of when the circuit produces an output of 0.
Q X D Z Q′ Clk Clk Q D Q′ Clk Q1 Q2 448 Unit 13 13.19 Repeat Problem 13.18 for the following circuit: X Z Clk Q D Q′ Clk Q1 Q D Q′ Clk Q2 X Z Clk Ck FF Q1 J1 K1 Ck FF Q2 J2 K2 Q2 ′ Q2 Q1 Q2 ′ Q1 ′ 13.21 A Mealy sequential circuit has one input, one output, and two flip-flops. A timing dia-gram for the circuit follows. Construct a transition table and state graph for the circuit.
X Q1 Q2 Z Clock 13.20 Consider the circuit shown.
(a) Construct a transition table and state graph for the following circuit. Is the circuit a Mealy or Moore circuit? Does the circuit have any unused states? Assume 00 is the initial state.
(b) Draw a timing diagram for the input sequence X = 01100.
(c) What is the output sequence for the input sequence?
Analysis of Clocked Sequential Circuits 449 13.22 Repeat Problem 13.21 for the following timing diagram.
13.23 Given the following timing chart for a sequential circuit, construct as much of the transition table as possible. Is this a Mealy or Moore circuit?
13.24 Given the following timing chart for a sequential circuit, construct as much of the transition table as possible.
Clock X Q1 Q2 Z Q1 Q2 X1 X2 Z1 Z2 Clock X1 X2 Q1 Q2 Z1 Z2 Clock 450 Unit 13 13.25 For the following sequential circuit, the table gives the contents of the PLA. (All PLA outputs are 0 for input combinations not listed in the table.) (a) Construct a transition table and draw a state graph.
(b) Draw a timing diagram showing the clock, X, Q1, Q2, and Z for the input sequence X = 10011. Assume that initially Q1 = Q2 = 0.
(c) Identify any false outputs in the timing diagram. What is the correct output sequence for Z?
X Q1 Q2 D1 D2 Z 0 1 – 1 0 0 1 0 1 1 0 0 0 – 1 0 1 1 1 0 0 0 1 1 1 1 0 0 0 1 Ck D2 Q2 + + Q1 PLA Q2 X Z Ck D1 Q1 Clock 13.26 A sequential circuit of the form shown in Figure 13-17 is constructed using a ROM and two D flip-flops. The contents of the ROM are given in the table.
(a) Draw a timing diagram for the circuit for the input sequence X1X2 = 10, 01, 11, 10. Assume that input changes occur midway between rising and falling clock edges. Indicate any false outputs on the diagram, and specify the correct output sequence for Z1 and Z2.
(b) Construct a transition table and state graph for the circuit.
Q1 Q2 X1 X2 D1 D2 Z1 Z2 0 0 0 0 0 0 1 0 0 0 0 1 0 0 1 0 0 0 1 0 0 1 1 0 0 0 1 1 0 1 1 0 0 1 0 0 1 1 0 0 0 1 0 1 1 1 1 0 0 1 1 0 1 0 0 1 0 1 1 1 1 0 1 1 1 0 0 0 1 1 0 0 1 0 0 1 0 0 0 0 1 0 1 0 1 1 0 1 1 0 1 1 0 0 0 1 1 1 0 0 1 0 0 0 1 1 0 1 0 1 0 0 1 1 1 0 1 0 0 0 1 1 1 1 0 1 0 0 Analysis of Clocked Sequential Circuits 451 13.27 For the following state graph, construct a transition table. Then, give the timing dia-gram for the input sequence X = 101001. Assume X changes midway between the falling and rising edges of the clock, and that the flip-flops are falling-edge triggered. What is the correct output sequence?
1 0 1 0 1 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 S0 S3 S4 S1 S2 13.28 For the circuit of Problem 13.3, assume the delays of the NAND gates and NOR gates are 3 ns, and assume the delay of the inverter is 2 ns. Assume the propagation delays and setup times for the J-K flip-flops are 4 ns and 2 ns, respectively.
(a) Fill in the given timing diagram. The clock period is 15 ns, and 1-ns increments are marked on the clock signal. Does the circuit operate properly with these timing parameters?
(b) What is the minimum clock period for this circuit, if X is changed early enough? How late may X change with this clock period without causing improper opera-tion of the circuit?
X A B JA KA JB = KB Z 5 ns 10 ns 15 ns 20 ns 25 ns 30 ns 35 ns Clock 13.29 Draw a timing diagram for the following circuit starting with an initial state ABC = 000 and using an input sequence X = 01010. Assume that the input changes occur midway between the falling and rising clock edges. Give the output sequence, and indicate false outputs, if any. Verify that your answer is correct by making a state table for the circuit.
452 Unit 13 13.30 (a) For the following sequential circuit, write the next-state equations for flip-flops A and B.
(b) Using these equations, find the transition table and draw the state graph.
A′ A J K X′ C X C′ Ck C′ C J K Ck B′ B D X C′ X′ C A′ X 0 X A Ck X Z B X′ A B′ X′ C′ X A B′ Clock A′ A S R X2 X2 ′ X2 ′ X2 ′ X1 Z1 Z2 ′ X1 ′ X1 ′ X1 ′ B B′ B B A A B′ B′ A′ A′ Clk B′ B T Clk 453 Derivation of State Graphs and Tables U N I T 1 4 Objectives 1. Given a problem statement for the design of a Mealy or Moore sequential circuit, find the corresponding state graph and table.
2. Explain the significance of each state in your graph or table in terms of the input sequences required to reach that state.
3. Check your state graph using appropriate input sequences.
454 Unit 14 Study Guide 1. Study Section 14.1, Design of a Sequence Detector.
(a) Verify that the state graph in Figure 14-4 will produce the correct output sequence for Z when the input sequence for X is as given in Equation (14-1).
(b) Using the equations from the Karnaugh maps on p. 460, construct the next-state table for the circuit and verify that it is the same as given in Table 14-2, except that the new table will have four states because the don’t-cares were assigned in the process of designing the circuit.
(c) Complete the design of the Moore sequential circuit whose transition table is given by Table 14-4. Use clocked J-K flip-flops for A and B.
(d) Verify that the state graph of Figure 14-6 gives the correct output sequence when the input sequence (14-1) is applied. (Ignore the initial output for the Moore graph.) 2. Study Section 14.2, More Complex Design Problems.
3. Study Section 14.3, Guidelines for Construction of State Graphs. Study the exam-ples carefully and observe how some of the guidelines were applied.
4. Work through Programmed Exercises 14.1, 14.2, and 14.3.
5. A very important part of deriving state tables or state graphs is knowing how to tell when your answer is right (or wrong!). One way to do this is to make up a suitable list of test sequences, apply them to the state graph, and check the resulting output sequences.
6. To gain proficiency in construction of state tables or graphs requires a fair amount of practice. Work Problems 14.4, 14.5, 14.6, 14.7 , and 14.8. The problems on the readiness tests will be about the same order of difficulty as these prob-lems, so make sure that you can work them in a reasonable time.
Note: Do not look at the answers to these problems in the back of the book until you have tried the problems and checked your answers using the fol-lowing test sequences: 14.4 X = 0 1 1 1 0 1 0 1 Z = (0) 0 0 0 0 1 1 1 1 (Your solution should have five self-loops. A self-loop is an arrow which starts at one state and goes back to the same state.) 14.5 X = 1 0 1 0 1 0 0 1 0 0 0 1 0 0 Z1 = 0 0 0 1 0 1 0 0 0 0 0 0 0 0 Z2 = 0 0 0 0 0 0 1 0 0 1 0 0 0 1 (Your solution should have four self-loops.) 14.6 X1 = 1 0 0 1 0 1 1 0 0 0 X2 = 1 0 0 0 0 1 0 0 1 0 Z = (0) 0 1 1 1 0 0 0 1 1 0 (Your solution should have at least four self-loops.) Derivation of State Graphs and Tables 455 14.7 (a) X = 0 0 1 1 0 1 0 1 0 1 1 Z = 1 1 0 0 0 1 1 0 0 0 1 (Your solution should have three self-loops.) (b) X = 1 1 1 0 0 1 0 1 0 1 Z = 0 0 0 0 1 0 0 0 0 1 14.8 (a) X1 = 0 0 1 1 1 1 0 0 1 0 0 X2 = 0 1 0 1 1 0 1 0 0 1 1 Z1 = 0 1 1 1 0 0 0 0 1 0 0 Z2 = 0 0 0 0 0 1 1 1 0 1 0 (b) You should get the same sequences as in (a) after an initial output of Z1Z2 = 00.
7. If you have the LogicAid program available, use it to check your state tables. This has several advantages over looking at the answers in the back of the book. First, LogicAid will determine whether or not your solution is correct even if your states are numbered differently from those in the solution, or even if the number of states is different. Second, if your solution is wrong, LogicAid will find a short input sequence for which your state table fails, and you can use this sequence to help locate the error in your solution. If you are having trouble learning to derive state graphs, LogicAid has a state graph tutor mode which can be used to check partial state graphs. By using the partial graph checker, you can check your graph after adding each state, and then correct any errors before proceeding to the next state.
8. Read Section 14.4, Serial Data Code Conversion.
(a) Complete the following timing diagram, showing waveforms for the NRZ, NRZI, RZ, and Manchester coding schemes: Bit sequence 0 1 0 0 1 1 1 0 NRZ NRZI RZ Manchester Clock (b) The timing chart of Figure 14-21(b) shows several glitches. By referring to the state table, explain why the second glitch is present.
(c) Consider Figure 14-21. If an error in data transmission occurs, the input sequence X = 01 or 10 could occur. Add an Error state to the state dia-gram. The circuit should go to this error state if such an error occurs.
(d) Work Problem 14.9.
456 Unit 14 9. Read Section 14.5, Alphanumeric State Graph Notation.
(a) Sometimes all outputs are 0 for a given state or arc. We denote this by plac-ing a 0 in the place of the output. For example, a Moore state with all out-puts being 0 might be labeled S3/0, and a Mealy arc with all outputs being 0 might be labeled X′Y/0.
(b) Try to write the row of a Mealy state table that describes state S3 in the following partial state graph. You cannot, because there are two contradic-tory directions when S = N = 1. Also, the row is not completely specified. Redraw state S3 so that S takes priority over N, and so that the circuit stays in state S3 with no output if no directions are specified by the partial state graph. Then, give the state table row. Show that it has no contradictions and that it is completely specified.
t0 t1 t2 t0 t1 t2 X = 1 0 0 Z = – – 0 (– is a don’t-care output) 1 1 0 – – 1 S1 S5 S3 N Z S 0 X Z Circuit A Circuit C B Sequential Circuit Subsystem (c) Work Problems 14.10 and 14.11.
10. Read Section 14.6, Incompletely Specified State Tables.
Complete the following example: The sequential circuit shown below has three parts. Assume that circuit A can only generate two possible output sequences, X = 100 and X = 110. Thus, the sequential circuit subsystem (B) has only two possible input sequences. When the third input in the sequence is received, the output of B is to be Z = 0 if 100 was received and Z = 1 if 110 was received. Assume that circuit C ignores the value of Z at other times so that we do not care what Z is during the first two inputs in the X sequence.
The possible input-output sequences for circuit B are listed in the following table, where t0, t1, and t2 represent successive clock times.
Derivation of State Graphs and Tables 457 Derivation of State Graphs and Tables In Unit 13 we analyzed sequential circuits using timing charts and state graphs. Now, we will consider the design of sequential circuits starting from a problem statement which specifies the desired relationship between the input and output sequences. The first step in the design is to construct a state table or graph which specifies the desired behavior of the circuit. Flip-flop input equations and output equations can then be derived from this table. Construction of the state table or graph, one of the most important and challenging parts of sequential circuit design, is discussed in detail in this unit.
14.1 Design of a Sequence Detector To illustrate the design of a clocked Mealy sequential circuit, we will design a sequence detector. The circuit has the form shown in Figure 14-1.
X = 0 1 0 1 S0 – S1 – – S1 S2 S3 Complete the following incompletely specified state table for circuit B: Note that the next state entry for S0 with X = 0 is a don’t-care because 0 can never occur as the first input in the sequence. When the third input in the sequence is received, why will the next state and output for X = 1 be don’t-cares?
11. When you are satisfied that you can meet all of the objectives, take the readiness test.
458 Unit 14 The circuit will examine a string of 0’s and 1’s applied to the X input and generate an output Z = 1 only when a prescribed input sequence occurs. It will be assumed that the input X can only change between clock pulses. Specifically, we will design the circuit so that any input sequence ending in 101 will produce an output Z = 1 coincident with the last 1. The circuit does not reset when a 1 output occurs. A typical input sequence and the corresponding output sequence are X = 0 0 1 1 0 1 1 0 0 1 0 1 0 1 0 0 Z = 0 0 0 0 0 1 0 0 0 0 0 1 0 1 0 0 (time: 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15) (14-1) Initially, we do not know how many flip-flops will be required, so we will designate the circuit states as S0, S1, etc., and later assign flip-flop states to correspond to the circuit states. We will construct a state graph to show the sequence of states and outputs which occur in response to different inputs. Initially, we will start the circuit in a reset state des-ignated S0. If a 0 input is received, the circuit can stay in S0 because the input sequence we are looking for does not start with 0. However, if a 1 is received, the circuit must go to a new state (S1) to “remember” that the first input in the desired sequence has been received (Figure 14-2). The labels on the graph are of the form X/Z, where the symbol before the slash is the input and the symbol after the slash is the corresponding output.
When in state S1, if we receive a 0, the circuit must change to a new state (S2) to remember that the first two inputs of the desired sequence (10) have been received. If a 1 is received in state S2, the desired input sequence (101) is complete and the output should be l. The question arises whether the circuit should then go to a new state or back to S0 or S1. Because the circuit is not supposed to reset when an output occurs, we cannot go back to S0. However, because the last 1 in a sequence can also be the first 1 in a new sequence, we can return to S1, as indicated in Figure 14-3.
1 0 0 0 S0 S1 FIGURE 14-2 1 0 1 1 0 0 0 0 S0 S1 S2 FIGURE 14-1 Sequence Detector to Be Designed © Cengage Learning 2014 Z X Clock © Cengage Learning 2014 FIGURE 14-3 © Cengage Learning 2014 Derivation of State Graphs and Tables 459 State S0 is the starting state, state S1 indicates that a sequence ending in 1 has been received, and state S2 indicates that a sequence ending in 10 has been received. An alternative way to start the solution would be to first define states in this manner and then construct the state graph. Converting the state graph to a state table yields Table 14-1. For example, the arc from S2 to S1 is labeled 1/1. This means that when the present state is S2 and X = 1, the present output is 1. This 1 output is present as soon as X becomes 1, that is, before the state change occurs. Therefore, the 1 is placed in the S2 row of the table.
FIGURE 14-4 Mealy State Graph for Sequence Detector © Cengage Learning 2014 1 0 1 0 1 1 0 0 0 0 0 0 S0 S1 S2 Present State Next State X = 0 X = 1 Present Output X = 0 X = 1 S0 S0 S1 0 0 S1 S2 S1 0 0 S2 S0 S1 0 1 TABLE 14-1 The graph of Figure 14-3 is still incomplete. If a 1 input occurs when in state S1, we can stay in S1 because the sequence is simply restarted. If a 0 input occurs in state S2, we have received two 0’s in a row and must reset the circuit to state S0 because 00 is not part of the desired input sequence, and going to one of the other states could lead to an incorrect output. The final state graph is given in Figure 14-4. Note that for a single input variable each state must have two exit lines (one for each value of the input vari-able) but may have any number of entry lines, depending on the circuit specifications.
AB A+B+ X = 0 X = 1 Z X = 0 X = 1 00 00 01 0 0 01 10 01 0 0 10 00 01 0 1 TABLE 14-2 At this point, we are ready to design a circuit which has the behavior described by the state table. Because one flip-flop can have only two states, two flip-flops are needed to represent the three states. Designate the two flip-flops as A and B. Let flip-flop states A = 0 and B = 0 correspond to circuit state S0; A = 0 and B = 1 cor-respond to S1; and A = 1 and B = 0 correspond to circuit state S2. Each circuit state is then represented by a unique combination of flip-flop states. Substituting the flip-flop states for S0, S1, and S2 in the state table yields the transition table (Table 14-2).
© Cengage Learning 2014 © Cengage Learning 2014 460 Unit 14 The flip-flop inputs are then derived from the next-state maps using the same method that was used for counters (Section 12.4). If D flip-flops are used, DA = A+ = X′B and DB = B+ = X, which leads to the circuit shown in Figure 14-5. Initially, we will reset both flip-flops to the 0 state. By tracing signals through the cir-cuit, you can verify that an output Z = 1 will occur when an input sequence ending in 101 occurs. To avoid reading false outputs, always read the value of Z after the input has changed and before the active clock edge.
Clock Ck A′ A D Ck B′ B D Z X The procedure for finding the state graph for a Moore machine is similar to that used for a Mealy machine, except that the output is written with the state instead of with the transition between states. We will rework the previous example as a Moore machine to illustrate this procedure. The circuit should produce an output of 1 only if an input sequence ending in 101 has occurred. The design is similar to that for the From this table, we can plot the next-state maps for the flip-flops and the map for the output function Z: FIGURE 14-5 © Cengage Learning 2014 0 0 0 1 1 0 X X 0 00 A B X 01 11 10 0 A+ = X′B 0 1 0 1 0 1 X X 0 00 AB B+ = X X 01 11 10 1 0 0 0 1 0 0 X X 0 00 AB Z = XA X 01 11 10 1 Derivation of State Graphs and Tables 461 We now complete the graph, as shown in Figure 14-6. Note the sequence 100 resets the circuit to S0. A sequence 1010 takes the circuit back to S2 because another 1 input should cause Z to become 1 again.
1 0 0 S0 0 S1 0 S2 0 1 1 0 0 S0 0 S1 0 S2 0 S3 1 Now, when a 1 input occurs to complete the 101 sequence, the output must become 1; therefore, we cannot go back to state S1 and must create a new state S3 with a 1 output: FIGURE 14-6 Moore State Graph for Sequence Detector © Cengage Learning 2014 1 1 1 1 0 0 0 0 S0 0 S1 0 S2 0 S3 1 The state table corresponding to the circuit is given by Table 14-3. Note that there is a single column for the output because the output is determined by the present state and does not depend on X. Note that in this example the Moore machine requires one more state than the Mealy machine which detects the same input sequence.
Present State Next State X = 0 X = 1 Present Output(Z ) S0 S0 S1 0 S1 S2 S1 0 S2 S0 S3 0 S3 S2 S1 1 TABLE 14-3 Mealy machine up until the input sequence 10 has occurred, except that 0 output is associated with states S0, S1, and S2: © Cengage Learning 2014 462 Unit 14 Because there are four states, two flip-flops are required to realize the circuit. Using the state assignment AB = 00 for S0, AB = 01 for S1, AB = 11 for S2, and AB = 10 for S3, the following transition table for the flip-flops results (Table 14-4): AB A+B+ X = 0 X = 1 Z 00 00 01 0 01 11 01 0 11 00 01 0 10 11 01 1 TABLE 14-4 The output function is Z = AB′. Note that Z depends only on the flip-flop states and is independent of Z, while for the corresponding Mealy machine, Z was a func-tion of X. The derivation of the flip-flop input equations is straightforward and will not be given here.
The preceding 101 sequence detectors can be called sliding window sequence detectors because the sequence being detected can occur anywhere in the input sequence. The windows can be overlapping or they may be restricted to be nonoverlapping. The first two output sequences in Figure 14-7 illustrate the dis-tinction between overlapping and nonoverlapping windows for an example input sequence and 101 sequence detectors. (The circuits corresponding to Figure 14-4 and Figure 14-6 allow overlapping windows.) In addition, these examples assume that the complete 101 sequence must occur after time 0 to be recognized; this is equivalent to assuming that the circuit responds as if the initial state were preceded by a 0 input. An alternative assumption is that the circuit responds as if the initial state were preceded by a 1 input; the third and fourth output sequences in Figure 14-7 are for this assumption. If state S1 were made the initial state in Figure 14-4 and Figure 14-6, then the circuits would respond as if the initial state were preceded by a 1 input.
In contrast to a sliding window sequence detector, a disjoint window sequence detector divides the input sequence into windows of fixed length (normally the length of the sequence to be detected) and only recognizes the input sequence when confined to one of the windows. The last output sequence in Figure 14-7 is for the 101 sequence detector using disjoint windows of length 3. (Making the window longer than the sequence is equivalent to changing the sequence recognized. For example, detecting 101 anywhere in disjoint windows of length 4 is equivalent to detecting any of the sequences: 0101, 1101, 1010, and 1011.) A sequence detector for disjoint windows will usually be more complex than a similar detector for sliding windows, because the detector must record where bits occur within the window in addition to detecting the sequence.
Disjoint window sequence detectors apply naturally in certain cases. For exam-ple, if an input sequence contains successive BCD digits, then the input sequence would be divided into disjoint windows of length 4. A sequence detector might examine each window to determine if it contains a valid BCD digit, or a different detector might determine the parity of each BCD digit.
© Cengage Learning 2014 Derivation of State Graphs and Tables 463 14.2 More Complex Design Problems In this section we will derive a state graph for a sequential circuit of somewhat greater complexity than the previous examples. The circuit to be designed again has the form shown in Figure 14-1. The output Z should be 1 if the input sequence ends in either 010 or 1001, and Z should be 0 otherwise. Before attempting to draw the state graph, we will work out some typical input-output sequences to make sure that we have a clear understanding of the problem statement. We will determine the desired output sequence for the following input sequence: X = 0 0 1 0 1 0 0 1 0 0 0 1 0 0 1 1 0 ↑ ↑ ↑ ↑ ↑ ↑ a b c d e f Z = 0 0 0 1 0 1 0 1 1 0 0 0 1 0 1 0 0 At point a, the input sequence ends in 010, one of the sequences for which we are looking, so the output is Z = 1. At point b, the input again ends in 010, so Z = 1. Note that overlapping sequences are allowed because the problem statement does not say anything about resetting the circuit when a 1 output occurs. At point c, the input sequence ends in 1001, so Z is again 1. Why do we have a 1 output at points d, e, and f ? This is just one of many input sequences. A state machine that gives the cor-rect output for this sequence will not necessarily give the correct output for all other sequences.
We will start construction of the state graph by working with the two sequences which lead to a 1 output. Then, we will later add arrows and states as required to make sure that the output is correct for other cases. We start off with a reset state S0 which corresponds to having received no inputs. Whenever an input is received that corresponds to part of one of the sequences for which we are looking, the cir-cuit should go to a new state to “remember” having received this input. Figure 14-8 shows a partial state graph which gives a 1 output for the sequence 010. In this graph S1 corresponds to having received a sequence ending in 0, S2 to a sequence ending in 01, and S3 to a sequence ending in 010. Now, if a 1 input is received in state S3, we again have a sequence ending in 01, which is part of the input sequence for which we FIGURE 14-7 Different Types of Sequence Detector Different 101 Sequence Detectors X 0 1 0 1 0 1 0 1 1 1 0 1 0 1 0 1 0 1 Sliding windows, overlapping Z 0 0 0 1 0 1 0 1 0 0 0 1 0 1 0 1 0 1 Sliding windows, nonoverlapping Z 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 1 0 0 Sliding windows, overlapping, initial 1 Z 0 1 0 1 0 1 0 1 0 0 0 1 0 1 0 1 0 1 Sliding windows, nonoverlapping, initial 1 Z 0 1 0 0 0 1 0 0 0 0 0 1 0 0 0 1 0 0 Disjoint windows Z 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 © Cengage Learning 2014 464 Unit 14 are looking. Therefore, we can go back to state S2 (arrow a) because S2 corresponds to having received a sequence ending in 01. Then, if we get another 0 in state S2, we go to S3 with a 1 output. This is correct because the sequence again ends in 010.
Next, we will construct the part of the graph corresponding to the sequence 1001. Again, we start in the reset state S0, and when we receive a 1 input, we go to S4 (Figure 14-9, arrow b) to remember that we have received the first 1 in the sequence 1001. The next input in the sequence is 0, and when this 0 is received, we should ask the question: Should we create a new state to correspond to a sequence ending in 10, or can we go to one of the previous states on the state graph? Because S3 cor-responds to a sequence ending in 10, we can go to S3 (arrow c). The fact that we did not have an initial 0 this time does not matter because 10 starts off the sequence for which we are looking. If we get a 0 input when in S3, the input sequence received will end in 100 regardless of the path we took to get to S3. Because there is so far no state corresponding to the sequence 100, we create a new state S5 to indicate having received a sequence ending in 100.
If we get a 1 input when in state S5, this completes the sequence 1001 and gives a 1 output as indicated by arrow e. Again, we ask the question: Can we go back to one of the previous states or do we have to create a new state? Because the end of the sequence 1001 is 01, and S2 corresponds to a sequence ending in 01, we can go back to S2 (Figure 14-10). If we get another 001, we have again completed the sequence 1001 and get another 1 output.
0 0 0 1 1 0 a 1 0 S3 S2 S0 S1 FIGURE 14-8 State Sequence Received S0 Reset S1 0 S2 01 S3 010 0 0 0 0 0 0 0 1 1 ?
1 1 0 e b c d 1 0 1 0 S3 S2 S0 S5 S1 S4 FIGURE 14-9 State Sequence Ends in S0 Reset S1 0 (but not 10) S2 01 S3 10 S4 1 (but not 01) S5 100 © Cengage Learning 2014 © Cengage Learning 2014 Derivation of State Graphs and Tables 465 We have now taken care of putting out a 1 when either the sequence 010 or 1001 is completed. Next, we will go back and complete the state graph to take care of the other input sequences, for which we have not already accounted. In state S1, we have accounted for a 1 input but not a 0 input. If we are in S1 and get a 0 input, to which state should we go? If a 0 input occurs in S1, we have a sequence ending in 00. Because 00 is not part of either of the input sequences for which we are looking, we can ignore the extra 0 and stay in S1 (arrow f). No matter how many extra 0’s occur, we still have a sequence ending in 0, and we stay in S1 until a 1 input occurs. In S2, we have taken care of the 0 input case but not the 1 input case. If a 1 is received, the input sequence ends in 11. Because 11 is not part of either the sequence 010 or 1001, we do not need a state which corresponds to a sequence ending in 11. We cannot stay in S2 because S2 corresponds to a sequence ending in 01. Therefore, we go to S4, which corresponds to having received a sequence ending in 1 (arrow g). S3 already has arrows corresponding to 0 and 1 inputs, so we examine S4 next. If a 1 is received in S4, the input sequence ends in 11. We can stay in S4 and ignore the extra 1 (arrow h) because 11 is not part of either sequence for which we are looking. In S5, if we get a 0 input, the sequence ends in 000. Because 000 is not contained in either 010 or 1001, we can go back to S1, because S1 corresponds to having received a sequence ending in one (or more) 0’s. This completes the state graph because every state has arrows leaving it which correspond to both 0 and 1 inputs. We should now go back and check the state graph against the original input sequences to make sure that a 1 output is always obtained for a sequence ending in 010 or 1001 and that a 1 output does not occur for any other sequence.
Next, we will derive the state graph for a Moore sequential circuit with one input X and one output Z. The output Z is to be 1 if the total number of 1’s received is odd and at least two consecutive 0’s have been received. A typical input and output sequence is X = 1 0 1 1 0 0 1 1 ↑ ↑ ↑↑↑ a b c d e Z = (0) 0 0 0 0 0 1 0 1 State Sequence Ends in S0 Reset S1 0 (but not 10) S2 01 S3 10 S4 1 (but not 01) S5 100 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 0 i e h c g f 1 0 1 0 1 0 1 0 S3 S2 S0 S5 S1 S4 FIGURE 14-10 © Cengage Learning 2014 466 Unit 14 We have shifted the Z sequence to the right to emphasize that for a Moore circuit an input change does not affect Z immediately, but Z can change only after the next active clock edge. The initial 0 in parentheses is the output associated with the reset state. At points a and b in the preceding sequence, an odd number of 1’s has been received, but two consecutive 0’s have not been received, so the output remains 0. At points c and e, an odd number of 1’s and two consecutive 0’s have been received, so Z = 1. At point d, Z = 0 because the number of 1’s is even.
We start construction of the Moore state graph (Figure 14-11) with the reset state S0, and we associate a 0 output with this state. First, we will consider keeping track of whether the number of 1’s is even or odd. If we get a 1 input in S0, we will go to state S1 to indicate an odd number of 1’s received. The output for S1 is 0 because two consecutive 0’s have not been received. When a second 1 is received, should we go to a new state or go back to S0? For this problem, it is unnecessary to distinguish between an even number of 1’s and no 1’s received, so we can go back to S0. A third 1 then takes us to S1 (odd number of 1’s), a fourth 1 to S0 (even 1’s), and so forth.
If a 0 is received in S0, this starts a sequence of two consecutive 0’s, so we go to S2 (0 output) in Figure 14-12. Another 0 then takes us to S3 to indicate two consecutive 0’s received. The output is still 0 in S3 because the number of 1’s received is even. Now if we get a 1 input, we have received an odd number of 1’s and go to S4. (Why can we not go to S1?) In S4 we have received two consecutive 0’s and an odd number of 1’s, so the output is 1.
If we receive a 1 in S4, we have an even number of 1’s and two consecutive 0’s, so we can return to S3 (arrow a). The output in S3 is 0, and when we get another 1 input, the number of 1’s is odd, so we again go to S4 with a 1 output. Now, suppose that we are in S1 (odd number of 1’s received), and we get a 0. We cannot go to S2 (Why?), so we go to a new state S5 (Figure 14-13, arrow b) which corresponds to an odd number of 1’s followed by a 0. Another 0 results in two consecutive 0’s, and we can go to S4 (arrow c) which gives us a 1 output.
Reset or even 1’s Odd 1’s 1 1 S0 0 S1 0 FIGURE 14-11 State Sequence Received S0 Reset or even 1’s S1 Odd 1’s S2 Even 1’s and ends in 0 S3 Even 1’s and 00 has occurred S4 00 has occurred and odd 1’s 0 0 a 1 1 S0 0 S1 0 S2 0 1 1 S4 1 S3 0 FIGURE 14-12 © Cengage Learning 2014 © Cengage Learning 2014 Derivation of State Graphs and Tables 467 Now, we must go back and complete the state graph by making sure that there are two arrows leaving each state. In S2, a 1 input means that we have received an odd number of 1’s. Because we have not received two consecutive 0’s, we must return to S1 (arrow d) and start counting 0’s over again. Similarly, if we receive a 1 in S5, we return to S0 (Why?). Now, what should happen if we receive a 0 in S3? Referring to the original problem statement, we see that once two consecutive 0’s have been received, additional 0’s can be ignored. Therefore, we can stay in S3 (arrow f). Similarly, extra 0 inputs can be ignored in S4 (arrow g). This completes the Moore state diagram, and we should go back and verify that the correct output sequence is obtained for various input sequences.
0 0 0 0 0 0 e d b g c f 1 1 1 1 S0 0 S1 0 S2 0 1 Even 1’s Odd 1’s 1 S4 1 S5 0 S3 0 State Input Sequences S0 Reset or even 1’s S1 Odd 1’s S2 Even 1’s and ends in 0 S3 Even 1’s and 00 has occurred S4 Odd 1’s and 00 has occurred S5 Odd 1’s and ends in 0 FIGURE 14-13 14.3 Guidelines for Construction of State Graphs Although there is no one specific procedure which can be used to derive state graphs or tables for every problem, the following guidelines should prove helpful: 1. First, construct some sample input and output sequences to make sure that you understand the problem statement.
2. Determine under what conditions, if any, the circuit should reset to its initial state.
3. If only one or two sequences lead to a nonzero output, a good way to start is to construct a partial state graph for those sequences.
4. Another way to get started is to determine what sequences or groups of sequences must be remembered by the circuit and set up states accordingly.
5. Each time you add an arrow to the state graph, determine whether it can go to one of the previously defined states or whether a new state must be added.
6. Check your graph to make sure there is one and only one path leaving each state for each combination of values of the input variables.
7. When your graph is complete, test it by applying the input sequences formulated in part 1 and making sure the output sequences are correct.
© Cengage Learning 2014 468 Unit 14 Several examples of deriving state graphs or tables follow.
A sequential circuit has one input (X) and one output (Z). The circuit examines groups of four consecutive inputs and produces an output Z = 1 if the input sequence 0101 or 1001 occurs. The circuit resets after every four inputs. Find the Mealy state graph.
Solution A typical sequence of inputs and outputs is X = 0101 0010 1001 ` 0100 Z = 0001 0000 0001 0000 The vertical bars indicate the points at which the circuit resets to the initial state. Note that an input sequence of either 01 or 10 followed by 01 will produce an output of Z = 1. Therefore, the circuit can go to the same state if either 01 or 10 is received. The partial state graph for the two sequences leading to a 1 output is shown in Figure 14-14.
Note that the circuit resets to S0 when the fourth input is received. Next, we add arrows and labels to the graph to take care of sequences which do not give a 1 output, as shown in Figure 14-15.
Example 1 FIGURE 14-14 Partial State Graph for Example 1 © Cengage Learning 2014 1 1 0 0 0 0 0 0 1 0 1 0 S3 S4 S0 S1 S2 State Sequence Received S0 Reset S1 0 S2 1 S3 01 or 10 S4 010 or 100 1 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 1 0 1 0 1 0 1 0 S3 S4 S0 S1 S2 S5 S6 FIGURE 14-15 Complete State Graph for Example 1 © Cengage Learning 2014 State Sequence Received S0 Reset S1 0 S2 1 S3 01 or 10 S4 010 or 100 S5 Two inputs received, no 1 output is possible S6 Three inputs received, no 1 output is possible Derivation of State Graphs and Tables 469 The addition of states S5 and S6 was necessary so that the circuit would not reset to S0 before four inputs were received. Note that once a 00 or 11 input sequence has been received (state S5), no output of 1 is possible until the circuit is reset.
A sequential circuit has one input (X) and two outputs (Z1 and Z2). An output Z1 = 1 occurs every time the input sequence 100 is completed, provided that the sequence 010 has never occurred. An output Z2 = 1 occurs every time the input sequence 010 is completed. Note that once a Z2 = 1 output has occurred, Z1 = 1 can never occur but not vice versa. Find a Mealy state graph and table.
Solution A typical sequence of inputs and outputs is: X = 1 0 0 1 1 0 0 1 0 1 ┆ 0 1 0 0 1 0 1 1 0 1 0 0 Z1 = 0 0 1 0 0 0 1 0 0 0 ┆ 0 0 0 0 0 0 0 0 0 0 0 0 Z2 = 0 0 0 0 0 0 0 0 1 0 ┆ 1 0 1 0 0 1 0 0 0 0 1 0 Note that the sequence 100 occurs twice before 010 occurs, and Z1 = 1 each time. However, once 010 occurs and Z2 = 1, Z1 = 0 even when 100 occurs again. Z2 = 1 all five times that 010 occurs. Because we were not told to reset the circuit, 01010 means that 010 occurred twice.
We can begin to solve this problem by constructing the part of the state graph which will give the correct outputs for the sequences 100 and 010. Figure 14-16(a) shows this portion of the state graph.
An important question to ask at this point is, what does this circuit need to remember to give the correct outputs? The circuit will need to remember how much progress has been made on the sequence 010, so it will know when to output Z2 = 1. The cir-cuit will also need to remember how much progress has been made on the sequence 100 and whether 010 has ever occurred, so it will know when to output Z1 = 1.
Keeping track of what is remembered by each state will help us make the cor-rect state graph. Table 14-5 will help us to do this. State S0 is the initial state of the Example 2 FIGURE 14-16 Partial Graphs for Example 2 © Cengage Learning 2014 1 00 1 00 1 00 0 00 0 00 0 00 0 10 0 01 1 00 0 01 1 00 1 00 0 10 0 00 1 00 0 00 S4 S0 S1 S3 S2 S4 S0 S1 S3 S2 (a) (b) 470 Unit 14 circuit, so there is no progress on either sequence, and 010 has never occurred. State S1 is the state we go to when a 1 is received from S0, so in state S1, we have made progress on the sequence 100 by getting a 1. In state S1, we have made progress on the sequence 100 by getting 10. Similarly, states S3 and S4 represent progress of 0 and 01 toward 010. In S1, there is no progress toward the sequence 010, and in S3, there is no progress toward the sequence 100. However, in S2, we have received 10, so if the next two inputs are 1 and 0, the sequence 010 will be completed. Therefore, in S2, we have not only made progress of 10 toward 100, but we have also made progress of 0 toward 010. Similarly, in S4, we have made progress of 1 toward 100, as well as progress of 01 toward 010.
Using this information, we can fill in more of the state graph to get Figure 14-16(b). If the circuit is in state S1 and a 1 is received, then the last two inputs are 11. The previous 1 is of no use toward the sequence 100. However, the circuit will need to remember the new 1, and there is a progress of 1 toward the sequence 100. There is no progress on the sequence 010, and 010 has never occurred, but this is the same situation as state S1. Therefore, the circuit should return to state S1. Similarly, if a 0 is received in state S3, the last two inputs are 00. There is a progress only of 0 toward the sequence 010, there is no progress toward 100, and 010 has never occurred, so the circuit should return to state S3. In state S2, if a 0 is received, the sequence 100 is complete and the circuit should output Z1 = 1. Then, there is no progress on another sequence of 100, and 010 has still not occurred. However, the last input is 0, so there is progress of 0 toward the sequence 010. We can see from Table 14-5 that this is the same situation as S3, so the circuit should go to state S3. If, in state S2, a 1 is received, we have made progress of 01 toward 010 and progress of 1 toward 100, and 010 has still not occurred. We can see from Table 14-5 that the circuit should go to state S4.
If a 0 is received in state S4, the sequence 010 is complete, and we should output Z2 = 1. At this point we must go to a new state (S5) to remember that 010 has been received so that Z1 = 1 can never occur again. When S5 is reached, we stop looking for 100 and only look for 010. Figure 14-17(a) shows a partial state graph that out-puts Z2 = 1 when the input sequence ends in 010. In S5 we have progress of 0 toward 010 and additional 0’s can be ignored by looping back to S5. In S6 we have progress of 01 toward 010. If a 0 is received, the sequence is completed, Z2 = 1 and we can go back to S5 because this 0 starts the 010 sequence again.
TABLE 14-5 State Descriptions for Example 2 State Description S0 No progress on 100 No progress on 010 010 has never occurred S1 Progress of 1 on 100 No progress on 010 S2 Progress of 10 on 100 Progress of 0 on 010 S3 No progress on 100 Progress of 0 on 010 S4 Progress of 1 on 100 Progress of 01 on 010 S5 Progress of 0 on 010 010 has occurred S6 Progress of 01 on 010 S7 No Progress on 010 © Cengage Learning 2014 Derivation of State Graphs and Tables 471 If we receive a 1 in state S6, the 010 sequence is broken and we must add a new state (S7) to start looking for 010 again. In state S7 we ignore additional 1’s, and when a 0 is received, we go back to S5 because this 0 starts the 010 sequence over again. Figure 14-17(b) shows the complete state graph, and the corresponding table is Table 14-6.
FIGURE 14-17 State Graphs for Example 2 © Cengage Learning 2014 1 00 1 00 1 00 0 00 1 00 1 00 1 00 1 00 1 00 1 00 0 10 0 00 0 00 0 01 0 01 0 01 0 01 1 00 0 00 0 00 0 00 S4 S0 S1 S3 S2 S5 S6 S7 S6 S5 (a) Partial graph for 010 (b) Complete state graph TABLE 14-6 Present State Next State Output (Z1Z2) X = 0 X = 1 X = 0 X = 1 S0 S3 S1 00 00 S1 S2 S1 00 00 S2 S3 S4 10 00 S3 S3 S4 00 00 S4 S5 S1 01 00 S5 S5 S6 00 00 S6 S5 S7 01 00 S7 S5 S7 00 00 Example 3 A sequential circuit has two inputs (X1, X2) and one output (Z). The output remains a constant value unless one of the following input sequences occurs: (a) The input sequence X1 X2 = 01, 11 causes the output to become 0.
(b) The input sequence X1 X2 = 10, 11 causes the output to become 1.
(c) The input sequence X1 X2 = 10, 01 causes the output to change value.
(The notation X1X2 = 01, 11 means X1 = 0, X2 = 1 followed by X1 = 1, X2 = 1.) Derive a Moore state graph for the circuit.
Solution The only sequences of input pairs which affect the output are of length two. There-fore, the previous and present inputs will determine the output, and the circuit must remember only the previous input pair. At first, it appears that three states are © Cengage Learning 2014 472 Unit 14 required, corresponding to the last input received being X1X2 = 01, 10 and (00 or 11). Note that it is unnecessary to use a separate state for 00 and 11 because neither input starts a sequence which leads to an output change. However, for each of these states the output could be either 0 or 1, so we will initially define six states as follows: Using this state designation, we can then set up a state table (Table 14-7). The six-row table given here can be reduced to five rows, using the methods given in Unit 15.
The S4 row of this table was derived as follows. If 00 is received, the input sequence has been 10, 00, so the output does not change, and we go to S0 to remember that the last input received was 00. If 01 is received, the input sequence has been 10, 01, so the output must change to 1, and we go to S3 to remember that the last input received was 01. If 11 is received, the input sequence has been 10, 11, so the output should become 1, and we go to S1. If 10 is received, the input sequence has been 10, 10, so the output does not change, and we remain in S4. Verify for yourself that the other rows in the table are correct. The state graph is shown in Figure 14-18. Previous Input (X1X2) Output (Z) State Designation 00 or 11 0 S0 00 or 11 1 S1 01 0 S2 01 1 S3 10 0 S4 10 1 S5 TABLE 14-7 FIGURE 14-18 State Graph for Example 3 © Cengage Learning 2014 00, 11 00, 11 00, 11 00, 11 11 11 10 00 00 10 10 01 01 01 01 01 01 10 10 10 S3 1 S4 0 S1 1 S5 1 S0 0 S2 0 Present Next State State Z X1X2 = 00 01 11 10 S0 0 S0 S2 S0 S4 S1 1 S1 S3 S1 S5 S2 0 S0 S2 S0 S4 S3 1 S1 S3 S0 S5 S4 0 S0 S3 S1 S4 S5 1 S1 S2 S1 S5 © Cengage Learning 2014 Derivation of State Graphs and Tables 473 14.4 Serial Data Code Conversion As a final example of state graph construction, we will design a converter for serial data. Binary data is frequently transmitted between computers as a serial stream of bits. As shown in Figure 14-19(a), a clock signal is often transmitted along with the data, so the receiver can read the data at the proper time. Alternatively (Figure 14-19(b)), only the serial data is transmitted, and a clock recovery circuit (called a digital phase-locked loop) is used to regenerate the clock signal at the receiver.
Figure 14-20 shows four different coding schemes for serial data together with the clock used to synchronize the data transmission. The example shows the transmission of the bit sequence 0, 1, 1, 1, 0, 0, 1, 0. With the NRZ (non-return-to-zero) code, each bit is transmitted for one bit time without any change. With the NRZI (non-return-to-zero-inverted) code, the data is encoded by the presence or absence of transitions in the output signal. For each 0 in the original sequence, the FIGURE 14-19 Serial Data Transmission © Cengage Learning 2014 Serial Data Clock Transmitter Receiver (a) Serial Data Clock Transmitter Receiver (b) Clock Recovery Circuit FIGURE 14-20 Coding Schemes for Serial Data Transmission © Cengage Learning 2014 Bit Sequence 0 1 1 1 0 0 1 0 NRZ NRZI RZ Manchester Clock 1 bit time 474 Unit 14 bit transmitted is the same as the previous bit transmitted. For each 1 in the origi-nal sequence, the bit transmitted is the complement of the previous bit transmitted. Thus, the preceding sequence is encoded as 0, 1, 0, 1, 1, 1, 0, 0. In other words, a 0 is encoded by no change in the transmitted value, and a 1 is encoded by inverting the previous transmitted value. For the RZ (return-to-zero) code, a 0 is transmitted as a 0 for one full bit time, but a 1 is transmitted as a 1 for the first half of the bit time and, then, the signal returns to 0 for the second half. For the Manchester code, a 0 is transmitted as 0 for the first half of the bit time and 1 for the second half, but a 1 is transmitted as 1 for the first half and 0 for the second half. Thus, the encoded bit always changes in the middle of the bit time. When the original bit sequence has a long string of 1’s and 0’s, the Manchester code has more transitions. This makes it easier to recover the clock signal.
We will design a sequential circuit which converts an NRZ-coded bit stream to a Manchester-coded bit stream (Figure 14-21(a)). In order to do this, we will use a clock, Clock2, that is twice the frequency of the basic clock (Figure 14-21(b)). In this way, all output changes will occur on the same edge of Clock2, and we can use the standard synchronous design techniques which we have been using in this unit. First, we will design a Mealy circuit to do the code conversion. Note that if the NRZ bit is 0, it will be 0 for two Clock2 periods. Similarly, if the NRZ bit is 1, it will be 1 for two Clock2 periods. Thus, starting in the reset state (S0 in Figure 14-21(c)), the only two possible input sequences are 00 and 11. For the sequence 00, when the first 0 is received, the output is 0. At the end of the first Clock2 period, the circuit goes to S1. The input is still 0, so the output becomes 1 and remains 1 for one Clock2 period, and then the circuit resets to S0. For the sequence 11, when the first 1 is received, the output is 1 for one Clock2 period and, then, the circuit goes to S2. Then, the output is 0 for one Clock2 period, and the circuit resets to S0.
When we convert the Mealy graph to a state table (Figure 14-21(d)), the next state of S1 with an input of 1 is not specified and is represented by a dash. Similarly, the next state of S2 with a 0 input is not specified. The dashes are like don’t-cares, in that we do not care what the next state will be because the corresponding input sequence never occurs. A careful timing analysis for the Mealy circuit shows some possible glitches (false outputs) in the output waveform (Figure 14-21(b)). The input waveform may not be exactly synchronized with the clock, and we have exagger-ated this condition in the figure by shifting the input waveform to the right so that the input changes do not line up with the clock edges. For this situation, we will use the state table to analyze the occurrence of glitches in the Z output. The first glitch shown in the timing chart occurs when the circuit is in state S1, with an input X = 0. The state table shows that the output is Z = 1, and when the clock goes low, the state changes to S0. At this time, the input is still X = 0, so Z becomes 0. Then X changes to 1, Z becomes 1 again, so a glitch has occurred in the output during the time inter-val between the clock change and the input change. The next glitch occurs in S2 with X = 1 and Z = 0. When the clock goes low, the output momentarily becomes 1 until X is changed to 0.
Derivation of State Graphs and Tables 475 FIGURE 14-21 Mealy Circuit for NRZ to Manchester Conversion © Cengage Learning 2014 NRZ (X) Manchester (Ideal) Clock2 State Z (Actual) 0 0 0 0 0 0 0 0 1 0 S0 S1 S0 S2 S0 S2 S0 S2 S0 S1 S0 S1 S0 S2 S0 S1 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Clock Period Z X NRZ Data Clock2 Manchester Data Conversion Circuit (a) Conversion circuit (b) Timing chart (c) State graph S0 S2 S1 0 1 1 0 0 0 1 1 Present State Next State Output (Z) X = 0 X = 1 X = 0 X = 1 S0 S1 S2 0 1 S1 S0 – 1 – S2 – S0 – 0 (d) State table To overcome the possible glitch problem with the Mealy circuit, we will redesign the circuit in Moore form (Figure 14-22 on the next page). Because the output of a Moore circuit cannot change until after the active edge of the clock, the output will be delayed by one clock period. Starting in S0, the input sequence 00 takes us to state S1 with a 0 output and, then, to S2 with a 1 output. Starting in S0, 11 takes us to S3 with a 1 output, and the second 1 can take us back to S0 which has a 0 output. To complete the graph, we add the two arrows starting in S2. Note that a 1 input cannot occur in S1, and a 0 output cannot occur in S3, so the corresponding state table has two don’t-cares.
476 Unit 14 14.5 Alphanumeric State Graph Notation When a state sequential circuit has several inputs, it is often convenient to label the state graph arcs with alphanumeric input variable names instead of 0’s and 1’s. This makes it easier to understand the state graph and often leads to a simpler state graph. Consider the following example: A sequential circuit has two inputs (F = forward, R = reverse) and three outputs (Z1, Z2, and Z3). If the input sequence is all F ’s, the output sequence is Z1Z2Z3Z1Z2Z3 . . . ; if the input sequence is all R’s, the output sequence is Z3Z2Z1Z3Z2Z1 . . . . Figure 14-23(a) shows a preliminary Moore state graph that gives the specified output sequences. An arc label F means that the corresponding state transition occurs when F = 1. The notation Z1 within a state means that the output Z1 is 1, and the other outputs (Z2 and Z3) are 0. As long as F is 1, the graph cycles through the states S0, S1, S2, S0, . . . which gives the output sequence Z1Z2Z3Z1 . . . . When R = 1 the state and output sequences occur in reverse order.
At this point the state graph is not completely specified. What happens if both inputs are 0? What happens if both are 1 at the same time? For example, in state S0 if F = R = 1, does the circuit go to state S1 or to S2? Because the circuit can only be FIGURE 14-22 Moore Circuit for NRZ to Manchester Conversion © Cengage Learning 2014 X (NRZ) Clock2 State Z 0 0 0 0 0 0 0 0 1 0 0 S0 S1 S2 S3 S0 S3 S0 S3 S0 S1 S2 S1 S2 S3 S0 S1 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Clock Period (a) Timing chart (b) State graph 1 1 1 0 0 0 S0 0 S1 0 S3 1 S2 1 Present State Next State Present Output (Z ) X = 0 X = 1 S0 S1 S3 0 S1 S2 – 0 S2 S1 S3 1 S3 – S0 1 (c) State table Derivation of State Graphs and Tables 477 in one state at a time, we must assign a priority. We will assume that input F takes priority over input R. We can then modify the state graph to implement this priority. By replacing R with F′R, this means that the corresponding state transition only occurs if R = 1 and F = 0. When F = R = 0, we will assume that the output should not change. This can be accomplished by adding a self-loop to each state with an arc label F′R′. The resulting state graph (Figure 14-23(b)) is completely specified for all combinations of values of F and R, and if both inputs are 1, F takes precedence over R. If we convert the graph to a table, the result is Table 14-8.
FIGURE 14-23 State Graphs with Variable Names on Arc Labels © Cengage Learning 2014 S0 Z1 F F F R R R S2 Z3 S1 Z2 S0 Z1 F F F′R′ F F′R F′R F′R S2 Z3 S1 Z2 (a) (b) F′R′ F′R′ TABLE 14-8 State Table for Figure 14-23 NS Output PS FR = 00 01 10 11 Z1 Z2 Z3 S0 S0 S2 S1 S1 1 0 0 S1 S1 S0 S2 S2 0 1 0 S2 S2 S1 S0 S0 0 0 1 When we construct a state graph using input variable names on the arcs, we should be careful to make sure that the graph is properly specified. To do this, we can check the labels on all the arcs emanating from each state. For state S0, if we OR together all of the arc labels, we simplify the result to get F + F′ R + F′ R′ = F + F′ = 1 This result indicates that for any combination of values of the input variables, one of the labels must be 1.
If we AND together every possible pair of arc labels emanating from S0 we get F·F′ R = 0, F·F′ R′ = 0, F′ R·F′R′ = 0 This result indicates that for any combination of input values, only one arc label can have a value of 1.
In general, a completely specified state graph has the following properties: (1) When we OR together all input labels on arcs emanating from a state, the result reduces to 1. (2) When we AND together any pair of input labels on arcs emanating from a state, the result is 0. Property (1) ensures that for every input combination, at least one next state is defined. Property (2) ensures that for every input combination, © Cengage Learning 2014 478 Unit 14 no more than one next state is defined. If both properties are true, then exactly one next state is defined, and the graph is properly specified. If we know that cer-tain input combinations cannot occur, then an incompletely specified graph may be acceptable.
We will use the following notation on Mealy state graphs for sequential circuits: XiXj/ZpZq means if inputs Xi and Xj are 1 (we don’t care what the other input values are), the outputs Zp and Zq are 1 (and the other outputs are 0). That is, for a circuit with four inputs (X1, X2, X3, and X4) and four outputs (Z1, Z2, Z3, and Z4), X1X4 ′/Z2Z3 is equivalent to 1--0/0110. This type of notation is very useful for large sequential circuits where there are many inputs and outputs.
We will use a dash to indicate that all inputs are don’t-cares. For example, an arc label – ∕Z1 means that for any combination of input values, the indicated state transi-tion will occur and the output Z1 will be 1.
14.6 Incompletely Specified State Tables In some situations particular input sequences will never occur as inputs to a sequen-tial circuit. In other cases, the output from a sequential circuit is only observed at cer-tain times rather than at every clock time. These situations lead to unspecified next states or outputs in the state table. A state table containing such don’t-cares is called an incompletely specified state table. Similar to using don’t-cares to simplify combina-tional logic, don’t-cares in state tables can be used to simplify the sequential circuit.
As an example of restricted input sequences, assume an input sequence contains successive BCD digits with the most significant bit of each digit occurring first. A Mealy model sequential circuit (a disjoint window sequence detector) examines the input sequence and generates an output of 1 when the last bit of a BCD digit is received if the parity of the digit is even; otherwise, the sequential circuit output is 0. (The parity of a BCD digit is even if it contains an even number of 1’s, i.e., zero or two 1’s.) A state graph for the sequential circuit is shown in Figure 14-24 and a state table in Table 14-9. FIGURE 14-24 State Graph for BCD Parity Detector © Cengage Learning 2014 S0 S1 0 0 S3 0 0 0 1 , 1 0 0 0 , 1 1 S6 S2 S4 S5 S7 0 0 0 0 0 0 0 0 1 0 1 0 1 0 1 0 Derivation of State Graphs and Tables 479 State S0 is the initial state of the circuit and, also, the state at the beginning of each BCD digit. State S1 (S2) is the state if the first bit of the BCD digit is 0 (1). After two inputs the possible states are S3, S4, and S5, and after three inputs S6 and S7 are the possible states. Note that if the first bit (the most significant bit) is 1, then the next two bits must be 0. (The only BCD digits starting with 1 are 1000 and 1001.) Consequently, the next states and outputs of states S2 and S5 for an input of 1 are not specified—they are don’t-cares. Using the don’t-cares to simplify the table (graph) is discussed in Section 15.5.
As an example where the outputs of a sequential circuit are only observed part of the time, consider the 101 sequence detector for disjoint windows and assume that the output from the sequence detector is only used at the end of a window. (A sepa-rate counter could be used to determine whether an input is the first, second, or third input of a window.) The outputs from the sequence detector can be left unspecified for the first and second inputs in a window. A state graph for the circuit is shown in Figure 14-25, and Table 14-10 is the corresponding state table. Again the don’t-cares allow simplifying the state graph (table); this is discussed in Section 15.5.
TABLE 14-9 State Table for Figure 14-24 Present State Next State Output X = 0 X = 1 X = 0 X = 1 S0 S1 S2 0 0 S1 S3 S4 0 0 S2 S5 – 0 – S3 S6 S7 0 0 S4 S7 S6 0 0 S5 S7 – 0 – S6 S0 S0 1 0 S7 S0 S0 0 1 FIGURE 14-25 Disjoint Window 101 Detector © Cengage Learning 2014 S0 S2 1− S4 0 − 0 0 , 1 1 0−, 1− 0 0 , 1 0 S1 S3 1 − 0 − TABLE 14-10 State Table for Figure 14-25 Present State Next State Output X = 0 X = 1 X = 0 X = 1 S0 S1 S2 – – S1 S3 S3 – – S2 S4 S3 – – S3 S0 S0 0 0 S4 S0 S0 0 1 © Cengage Learning 2014 © Cengage Learning 2014 480 Unit 14 Programmed Exercise 14.1 Cover the answer to each problem with a sheet of paper and slide it down as you check your answers. Write your answer in the space provided before looking at the correct answers.
Problem: A clocked Mealy sequential circuit with one input (X) and one output (Z ) is to be designed. The output is to be 0, unless the input is 0 following a sequence of exactly two 0 inputs followed by a 1 input.
To make sure you understand the problem statement, specify the output sequence for each of the following input sequences: (a) X = 0010 Z = __ (b) X = . . . 1 0 0 1 0 ( . . . means any input sequence not ending in 00) Z = . . . __ (c) X = . . . 00010 Z = . . . _ (d) X = 00100100010 Z = __ (e) Does the circuit reset after a 1 output occurs? Answers Answer S0 S1 S2 S3 0 1 0 0 1 0 0 0 S0 S1 S2 S3 State Sequence Received S0 (Reset) S1 0 or 0010 S2 S3 S4 Note that the arrow from S3 returns to S1 so that an additional input of 010 will pro-duce another 1 output.
Add a state to the preceding graph which corresponds to “three or more con-secutive 0’s received.” Also complete the preceding table to indicate the sequence received which corresponds to each state.
(a) Z = 0001 (b) Z = . . . 00001 (c) Z = . . . 00000 (b) Z = 00010010000 (e) No Note that no 1 output occurs in answer (c) because there are three input 0’s in a row.
Add arrows to the following graph so that the sequence X = 0010 gives the cor-rect output (do not add another state).
Derivation of State Graphs and Tables 481 Answer The preceding state graph is not complete because there is only one arrow leav-ing most states. Complete the graph by adding the necessary arrows. Return to one of the previously used states when possible. Answer Verify that this state graph gives the proper output sequences for the input sequences listed at the start of this exercise. Write down the Mealy state table which corresponds to the preceding graph. Answer S0 S1 S2 S4 S3 0 1 0 0 0 0 0 0 1 0 1 0 1 0 1 0 1 0 0 0 State Sequence Received S0 (Reset) S1 0 or 0010 S2 00 S3 001 S4 3 (or more) consecutive 0’s Present State Next State Output 0 1 0 1 S0 S1 S0 0 0 S1 S2 S0 0 0 S2 S4 S3 0 0 S3 S1 S0 1 0 S4 S4 S0 0 0 S0 S1 S2 S4 S3 0 1 0 0 0 0 0 0 1 0 0 0 482 Unit 14 Programmed Exercise 14.2 Problem: A clocked Moore sequential circuit should have an output of Z = 1 if the total number of 0’s received is an even number greater than zero, provided that two consecutive 1’s have never been received.
To make sure that you understand the problem statement, specify the output sequence for the following input sequence: X = 0 0 0 0 1 0 1 0 1 1 0 0 0 0 Z = (0)___ this 0 is the initial output before any inputs have been received Answer ↑ Z = (0)01011001100000 Note that once two consecutive 1’s have been received, the output can never become 1 again.
To start the state graph, consider only 0 inputs and construct a Moore state graph which gives an ou tput of 1 if the total number of 0’s received is an even number greater than zero. Answer Now add states to the above graph so that starting in S0, if two consecutive 1’s are received followed by any other sequence, the output will remain 0. Also, complete the preceding table to indicate the sequence received that corresponds to each state.
S0 0 0 0 0 S1 0 S2 1 State Sequence Received S0 (Reset) S1 Odd number of 0’s S2 S3 S4 S0 0 0 0 0 1 1 1 0 S3 0 S4 0 S1 0 S2 1 State Sequence Received S0 (Reset) S1 Odd number of 0’s S2 Even number of 0’s S3 1 S4 11 (followed by any sequence) S5 S6 Answer Derivation of State Graphs and Tables 483 Now complete the graph so that each state has both a 0 and 1 arrow leading away from it. Add as few extra states to the graph as possible. Also, complete the preced-ing table.
S0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 0 S3 0 S4 0 S5 0 S1 0 S2 1 S6 1 S5 — odd number of 0’s followed by 1.
S6 — even number of 0’s followed by 1.
Present State Next State Output 0 1 S0 S1 S3 0 S1 S2 S5 0 S2 S1 S6 1 S3 S1 S4 0 S4 S4 S4 0 S5 S2 S4 0 S6 S1 S4 1 Answer Verify that this state graph gives the proper output sequence for each input sequence at the start of this exercise. Write down the Moore state table which cor-responds to the preceding graph. (Note that a Moore table has only one output column.) Answer 484 Unit 14 Programmed Exercise 14.3 Derive the state graph and table for a Moore sequential circuit which has an output of 1 iff (1) an even number of 0’s have occurred as inputs and (2) an odd number of (non overlapping) pairs of 1’s have occurred. For purposes of this prob-lem, a pair of 1’s consists of two consecutive 1’s. If three consecutive 1’s occur fol-lowed by a 0, the third 1 is ignored. If four consecutive 1’s occur, this counts as two pairs, etc.
(a) The first step is to analyze the problem and make sure that you understand it. Note that both condition (1) and condition (2) must be satisfied in order to have a 1 output. Consider condition (1) by itself. Would condition (1) be satisfied if zero 0’s occurred? _ If one 0 occurred? __ Two 0’s? __ Three 0’s? __.
(Hint: Is zero an even or odd number? _) (b) How many states would it take to determine if condition (1) by itself is satisfied, and what would be the meaning of each state?
_________ (c) Now consider condition (2) by itself. For each of the following patterns, deter-mine whether condition (2) is satisfied: 010__ 0110_ 01110__ 011110__ 01010_ 011010__ 0110110_ Now check your answers to (a), (b), and (c). Answers to (a) yes, no, yes, no, even Answers to (b) two states: even number of 0’s, odd number of 0’s Answers to (c) From left to right: no, yes, yes, no, no, yes, no (d) Consider condition (2) by itself and consider an input sequence of consecutive 1’s. Draw a Moore state diagram (with only 1 inputs) which will give a 1 output when condition (2) is satisfied. State the meaning of each of the four states in your diagram (for example, odd pairs of 1’s).
Derivation of State Graphs and Tables 485 Answer to (d) 1 1 1 1 S0 0 S1 0 S2 1 S3 1 S0 = even pairs of 1’s, S1 = even pairs of 1’s + one 1.
S2 = odd pairs of 1’s, S3 = odd pairs of 1’s + one 1 (e) For the original problem, determine the sequence for Z for the following example: X = 1 1 0 0 1 1 1 1 1 0 0 0 1 1 1 1 0 Z = 0 _____ Answer to (e) X = 1 1 0 0 1 1 1 1 1 0 0 0 1 1 1 1 0 Z = 0 0 1 0 1 1 0 0 1 1 0 1 0 0 0 0 0 1 (f ) Considering that we must keep track of both even or odd 0’s, and even or odd pairs of 1’s, how many states should the final graph have? __ (g) Construct the final Moore state graph. Draw the graph in a symmetric manner with even 0’s on the top side and odd 0’s on the bottom side. List the meanings of the states such as S0 = even 0’s and even pairs of 1’s.
(h) Check your answer using the test sequence from part (e). Then, check your answers below. Answer to (f) Eight states 486 Unit 14 Answer to (g) 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 S0 0 S4 0 S1 0 S5 0 S2 1 S6 0 S3 1 S7 0 S0 = even 0’s and even pairs of 1’s, S1 = even 0’s and even pairs of 1’s + one 1, S2 = even 0’s and odd pairs of 1’s, S3 = even 0’s and odd pairs of 1’s + one 1, S4 = odd 0’s and even pairs of 1’s, S5 = odd 0’s and even pairs of 1’s + one 1, S6 = odd 0’s and odd pairs of 1’s, S7 = odd 0’s and odd pairs of 1’s + one 1 Problems 14.4 A sequential circuit has one input and one output. The output becomes 1 and remains 1 thereafter when at least two 0’s and at least two 1’s have occurred as inputs, regardless of the order of occurrence. Draw a state graph (Moore type) for the circuit (nine states are sufficient). Your final state graph should be neatly drawn with no crossed lines.
14.5 A sequential circuit has one input (X) and two outputs (Z1 and Z2). An output Z1 = 1 occurs every time the input sequence 010 is completed, provided that the sequence 100 has never occurred. An output Z2 = 1 occurs every time the input 100 is completed. Note that once a Z2 = 1 output has occurred, Z1 = 1 can never occur but not vice versa. Find a Mealy state graph and state table (minimum number of states is eight).
14.6 A sequential circuit has two inputs (X1 and X2) and one output (Z). The output begins as 0 and remains a constant value unless one of the following input sequences occurs: (a) The input sequence X1X2 = 01, 00 causes the output to become 0.
(b) The input sequence X1X2 = 11, 00 causes the output to become 1.
(c) The input sequence X1X2 = 10, 00 causes the output to change value.
Derive a Moore state table.
Derivation of State Graphs and Tables 487 14.7 A sequential circuit has one input (X) and one output (Z).
Draw a Mealy state graph for each of the following cases: (a) The output is Z = 1 iff the total number of 1’s received is divisible by 3. (Note: 0, 3, 6, 9,… are divisible by 3.) (b) The output is Z = 1 iff the total number of 1’s received is divisible by 3 and the total number of 0’s received is an even number greater than zero (nine states are sufficient).
14.8 A sequential circuit has two inputs and two outputs. The inputs (X1 and X2) repre-sent a 2-bit binary number, N. If the present value of N is greater than the previous value, then Z1 is 1. If the present value of N is less than the previous value, then Z2 is 1. Otherwise, Z1 and Z2 are 0. When the first pair of inputs is received, there is no previous value of N, so we cannot determine whether the present N is greater than or less than the previous value; therefore, the “otherwise” category applies.
(a) Find a Mealy state table or graph for the circuit (minimum number of states, including starting state, is five).
(b) Find a Moore state table for the circuit (minimum number of states is 11).
14.9 (a) Derive the state graph and table for a Mealy sequential circuit which converts a serial stream of bits from NRZ code to NRZI code. Assume that the clock period is the same as the bit time as in Figure 14-20.
(b) Repeat (a) for a Moore sequential circuit.
(c) Draw a timing diagram for your answer to (a), using the NRZ waveform in Figure 14-20 as the input waveform to your circuit. If the input changes occur slightly after the clock edge, indicate places in the output waveform where glitches (false outputs) can occur.
(d) Draw the timing diagram for your answer to (b), using the same input waveform as in (c).
14.10 For the following state graph, construct the state table, and demonstrate that it is completely specified.
14.11 Design a sequential circuit which will output Z = 1 for exactly four clock cycles each time a person pushes a button (which sets X = 1). The clock for a digital cir-cuit is usually much faster than a person’s finger! The person probably will not have released the button by the time four clock cycles have passed, so X may still be 1 when the four Z = 1 outputs have been generated. Therefore, after Z is 1 for four clock cycles, Z should go to 0, until X returns to 0 and then becomes 1 again. Design a Mealy state graph for this circuit, using the alphanumeric state graph notation given in Section 14.5.
S0 S1 AC′ DF A′C′ DE AB′ E A B F A′ D C 0 488 Unit 14 14.12 (a) A Moore sequential circuit has one input (x) and one output (z). z = 1 if and only if the most recent input was 1 and it was preceded by exactly two 0’s. Derive a state table for the circuit.
(b) Repeat for a Mealy circuit (i.e., z = 1 if and only if the most recent input is 1 and it was preceded by exactly two 0’s). Derive a state table for the circuit.
14.13 (a) A Mealy sequential circuit has one input (x) and one output (z). z can be 1 when the fourth, eighth, twelfth, etc. inputs are present, and z = 1 if and only if the most recent input combined with the preceding three inputs was not a valid BCD encoding for a decimal digit; otherwise, z = 0. Assume the BCD digits are received most significant bit first. Derive a state table for the circuit. (Eight states are sufficient.) (b) Repeat for a Moore circuit (i.e., z = 1 if and only if, after the fourth, eighth, twelfth, etc. inputs have been received, the previous four inputs were not a valid BCD digit). (Nine states are sufficient.) (c) Is it possible for a Moore circuit to generate the correct output while the fourth input bit is present rather than after it has been received? Explain your answer.
14.14 (a) A Mealy sequential circuit has one input (x) and one output (z). z = 1 if and only if the most recent input, combined with the preceding three inputs, was not a valid BCD encoding of a decimal digit; otherwise, z = 0. Assume the BCD digits are received most significant bit first. Derive a state table for the circuit. (Seven states are sufficient.) (b) Repeat for a Moore circuit (i.e., z = 1 if and only if the previous four inputs were not a valid BCD digit). (Thirteen states are sufficient.) (c) Is it possible for a Moore circuit to generate the correct output while the fourth input bit is present rather than after it has been received? Explain your answer.
14.15 (a) A Mealy sequential circuit has one input (x) and one output (z). z can be 1 when the fourth, eighth, twelfth, etc. inputs are present, and z = 1 if and only if the most recent input combined with the preceding three inputs was not a valid BCD encoding of a decimal digit; otherwise, z = 0. Assume the BCD digits are received least significant bit first. Derive a state table for the circuit. (Six states are sufficient.) (b) Repeat for a Moore circuit (i.e., z = 1 if and only if, after the fourth, eighth, twelfth, etc. inputs have been received, the previous four inputs were not a valid BCD digit).
(c) Is it possible for a Moore circuit to generate the correct output while the fourth input bit is present rather than after it has been received? Explain your answer.
14.16 (a) A Mealy sequential circuit has one input (x) and one output (z). z = 1 if and only if the most recent input, combined with the preceding three inputs, was not a valid BCD encoding of a decimal digit; otherwise, z = 0. Assume the BCD digits are received least significant bit first. Derive a state table for the circuit. Assume that in the reset state all previous inputs were 0. (Three states are sufficient.) Derivation of State Graphs and Tables 489 (b) Repeat for a Moore circuit (i.e., z = 1 if and only if the previous four inputs were not a valid BCD digit). (Four states are sufficient.) (c) Is it possible for a Moore circuit to generate the correct output while the fourth input bit is present rather than after it has been received? Explain your answer.
14.17 (a) A Mealy sequential circuit has one input (x) and one output (z). z can be 1 when the fourth, eighth, twelfth, etc. inputs are present, and z = 1 if and only if the most recent input, combined with the preceding three inputs, was not a valid excess-3 encoding of a decimal digit; otherwise, z = 0. Assume the excess-3 dig-its are received most significant bit first. Derive a state table for the circuit. (Ten states are sufficient.) (b) Repeat for a Moore circuit (i.e., z = 1 if and only if, after the fourth, eighth, twelfth, etc. inputs have been received, the previous four inputs were not a valid excess-3 digit). (Eleven states are sufficient.) (c) Is it possible to for a Moore circuit to generate the correct output while the fourth input bit is present rather than after it has been received? Explain your answer.
14.18 (a) A Mealy sequential circuit has one input (x) and one output (z). z = 1 if and only if the most recent input, combined with the preceding three inputs, was not a valid excess-3 encoding of a decimal integer; otherwise, z = 0. Assume the excess-3 digits are received most significant bit first. Derive a state table for the cir-cuit. Assume that in the reset state all previous inputs were 0. (Eight states are sufficient.) (b) Repeat for a Moore circuit (i.e., z = 1 if and only if the previous four inputs were not a valid excess-3 digit). (Fourteen states are sufficient.) (c) Is it possible for a Moore circuit to generate the correct output while the fourth input bit is present rather than after it has been received? Explain your answer.
14.19 (a) A Mealy sequential circuit has one input (x) and one output (z). z can be 1 when the fourth, eighth, twelfth, etc. inputs are present, and z = 1 if and only if the most recent input, combined with the preceding three inputs, was not a valid excess-3 encoding of a decimal digit; otherwise, z = 0. Assume the excess-3 dig-its are received least significant bit first. Derive a state table for the circuit. (Nine states are sufficient.) (b) Repeat for a Moore circuit (i.e., z = 1 if and only if, after the fourth, eighth, twelfth, etc. inputs have been received, the previous four inputs were not a valid excess-3 digit). (Ten states are sufficient.) (c) Is it possible for a Moore circuit to generate the correct output while the fourth input bit is present rather than after it has been received? Explain your answer.
14.20 (a) A Mealy sequential circuit has one input (x) and one output (z). z = 1 if and only if the most recent input combined with the preceding three inputs was not a valid excess-3 encoding of a decimal digit; otherwise, z = 0. Assume the excess-3 digits are received least significant bit first. Derive a state table for the circuit. Assume that in the reset state all previous inputs were 0. (Six states are sufficient.) 490 Unit 14 (b) Repeat for a Moore circuit (i.e., z = 1 if and only if the previous four inputs were not a valid excess-3 digit). (Eight states are sufficient.) (c) Is it possible for a Moore circuit to generate the correct output while the fourth input bit is present rather than after it has been received? Explain your answer.
14.21 A sequential circuit has one input and one output. The output becomes 1 and remains 1 thereafter when at least one 1 and three 0’s have occurred as inputs, regardless of the order of occurrence. Draw a state graph (Moore type) for the cir-cuit (eight states are sufficient). Your final state graph should be neatly drawn with no crossed lines.
14.22 A sequential circuit has one input (X) and two outputs (Z1 and Z2). An output Z1 = 1 occurs every time the input sequence 100 is completed provided that the sequence 011 has never occurred. An output Z2 = 1 occurs every time the input 011 is completed. Note that once a Z2 = 1 output has occurred, Z1 = 1 can never occur but not vice versa. Find a Mealy state graph and state table (minimum number of states is eight).
14.23 A sequential circuit has two inputs (X1 and X2) and one output (Z). The output begins as 0 and remains a constant value unless one of the following input sequences occurs: (a) The input sequence X1X2 = 11, 10 causes the output to become 0.
(b) The input sequence X1X2 = 00, 10 causes the output to become 1.
(c) The input sequence X1X2 = 01, 10 causes the output to toggle.
Derive a Moore state table and state graph.
14.24 A sequential circuit has one input (X) and one output (Z).
Draw a Mealy state graph for each of the following cases: (a) The output is Z = 1 iff the total number of 1’s received is divisible by 4.
(Note: 0, 4, 8, 12,… are divisible by 4.) (b) The output is Z = 1 iff the total number of 1’s received is divisible by 4 and the total number of 0’s received is an odd number (eight states are sufficient).
14.25 A sequential circuit has two inputs and two outputs. The inputs (X1 and X2) repre-sent a 2-bit binary number, N. If the present value of N plus the previous value of N is greater than 2, then the Z1 is 1. If the present value of N times the previous value of N is greater than 2, then Z2 is 1. Otherwise, Z1 and Z2 are 0. When the first pair of inputs is received, use 0 as the previous value of N.
(a) Find a Mealy state table or graph for the circuit (minimum number of states is four).
(b) Find a Moore state table for the circuit (minimum number of states is 10, but any correct answer with 16 or fewer states is acceptable).
14.26 A Moore sequential circuit has one input and one output. When the input sequence 011 occurs, the output becomes 1 and remains 1 until the sequence 011 occurs again Derivation of State Graphs and Tables 491 in which case the output returns to 0. The output then remains 0 until 011 occurs a third time, etc. For example, the input sequence X = 0 1 0 1 1 0 1 0 1 1 0 1 0 0 1 1 1 has the output Z = (0) 0 0 0 0 1 1 1 1 1 0 0 0 0 0 0 1 1 Derive the state graph (six states minimum).
14.27 Work Problem 14.26 if the input sequence 101 causes the output to change value. For example, the input sequence X = 0 1 0 1 0 1 0 0 1 0 1 0 1 1 0 1 0 has the output Z = (0) 0 0 0 1 1 0 0 0 0 0 1 1 0 0 0 1 1 (six states minimum).
14.28 A Mealy sequential circuit has two inputs and one output. If the total number of 0’s received is ≥4 and at least three pairs of inputs have occurred, then the output should be 1 coincident with the last input pair in the sequence. Whenever a 1 output occurs, the circuit resets. Derive a state graph and state table. Specify the meaning of each state. For example, S0 means reset, S1 means one pair of inputs received but no 0’s received, etc.
Example: 14.29 A Moore sequential circuit has one input and one output. The output should be 1 if the total number of 1’s received is odd and the total number of 0’s received is an even number greater than 0. Derive the state graph and table (six states).
14.30 A Mealy sequential circuit has one input (X) and two outputs (Z1 and Z2). The cir-cuit produces an output of Z1 = 1 whenever the sequence 011 is completed, and an output of Z2 = 1 whenever the sequence 0111 is completed. Derive the state graph and table.
14.31 A Moore sequential circuit has two inputs (X1 and X2) and one output (Z). Z begins at 0. It becomes 1 when X1 = 1 and X2 = 1 either concurrently, or one after the other Input sequence: X1 = 1 1 1 0 0 0 1 1 1 0 0 0 1 1 0 0 0 1 0 X2 = 1 0 0 0 0 0 1 1 1 1 1 1 0 1 0 0 0 1 0 Output sequence: Z = 0 0 0 1 0 0 1 0 0 0 0 0 1 0 0 1 0 0 1 492 Unit 14 (in either order). Z returns to zero when X1 = X2 = 0. The following input and out-put sequence should help you understand the problem: X1 = 0 1 0 0 1 0 0 0 1 1 0 1 1 0 X2 = 0 0 1 1 0 0 1 1 0 0 0 1 0 0 Z = (0) 0 0 1 1 1 0 0 0 1 1 0 1 1 0 Give the Moore state graph and table.
14.32 A Mealy sequential circuit has one input (X) and one output (Z). The circuit should transmit its input, except that it should prevent the sequence 00110 from occurring. So Z should be the same as X, except that if the input sequence 00110 occurs, Z should be 1 rather than 0 when the last 0 is received, so that the sequence X = 0 0 1 1 0 is replaced with Z = 0 0 1 1 1. Derive the state graph and table.
14.33 A Moore sequential circuit has one input and one output. The output is 1 if and only if both of the following conditions are met: (a) The input sequence contains exactly two groups of 1’s, and (b) Each of these groups contains exactly two 1’s.
Each group of 1’s must be separated by at least one 0. A single 1 is considered a group of 1’s containing one 1. For example, the sequence X = 0 1 1 0 0 0 1 1 0 1 1 1 0 satisfies both conditions after the first two pairs of 1’s. However, when more 1’s appear, condition (a) is no longer satisfied. Therefore, the output sequence should be Z = (0) 0 0 0 0 0 0 0 1 1 0 0 0 0 On the other hand, the sequence X = 1 0 1 1 0 1 1 0 never satisfies condition (b), because the first group of 1’s contains only one 1. Besides, after the second pair of 1’s, (a) is no longer satisfied because the input sequence con-tains three groups of 1’s. Therefore, the output should always be 0.
Z = (0) 0 0 0 0 0 0 0 0 Derive a state graph and table.
14.34 A sequential circuit has an input (X) and an output (Z). The output is the same as the input was two clock periods previously. For example, X = 0 1 0 1 1 0 1 0 1 1 0 1 0 0 0 1 Z = 0 0 0 1 0 1 1 0 1 0 1 1 0 1 0 0 The first two values of Z are 0. Find a Mealy state graph and table for the circuit.
Derivation of State Graphs and Tables 493 14.35 A sequential circuit has an input (X) and an output (Z). The output is the same as the input was three clock periods previously. For example, X = 0 1 0 1 1 0 1 0 1 1 0 1 0 0 0 1 Z = 0 0 0 0 1 0 1 1 0 1 0 1 1 0 1 0 The first three values of Z are 0. Find a Mealy state graph and table for the circuit.
14.36 (a) Construct a Moore state table for the circuit of Problem 14.34. The initial out-puts are 0.
(b) How many states are required in a Moore state table for the circuit of Problem 14.35? Explain 14.37 A sequential circuit has an input (X) and two outputs (S and V). X represents a 4-bit binary number N which is input least significant bit first. S represents a 4-bit binary number equal to N + 2, which is output least significant bit first. At the time the fourth input occurs, V = 1 if N + 2 is too large to be represented by four bits; otherwise, V = 0. The circuit always resets after the fourth bit of X is received. Find a Mealy state graph and table for the circuit.
Example: X = 0111 (binary 14 with the least significant bit first) S = 0000 (because 14 + 2 = 16, and 16 requires 5 bits) V = 0001 14.38 A sequential circuit has an input (X) and two outputs (D and B). X represents a 4-bit binary number N which is input least significant bit first. D represents a 4-bit binary number equal to N −2, which is output least significant bit first. At the time the fourth input occurs, B = 1 if N −2 is less than 0; otherwise B = 0. The circuit always resets after the fourth bit of X is received. Find a Mealy state graph and table for the circuit.
Example: X = 0001 1000 1100 D = 0110 1111 1000 B = 0000 0001 0000 14.39 A sequential circuit has an input (X) and outputs (Y and Z). YZ represents a 2-bit binary number equal to the number of 1’s that have been received as inputs. The circuit resets when the total number of 1’s received is 3, or when the total number of 0’s received is 3. Find a Moore state graph and table for the circuit.
14.40 A sequential circuit has an input X and outputs (Yand Z). YZ represents a 2-bit binary number equal to the number of pairs of adjacent 1’s that have been received as inputs. For example, the input sequence 0110 contains one pair, the sequence 01110 two pairs, and the sequence 0110111 contains three pairs of adjacent 1’s. The 494 Unit 14 circuit resets when the total number of pairs of 1’s received reaches four. Find a Moore state graph and table for the circuit.
Input Output 00XX 0000 01XX 0011 10XX 1100 11XX 1111 Input sequence: X = 0 1 0 1 1 0 1 1 1 0 0 1 0 1 0 1 0 1 1 1 0 1 1 0 1 1 0 0 1 0 Output sequences: Y = 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 1 1 1 1 1 Z = 0 0 0 0 1 1 1 0 1 1 1 1 1 1 1 1 1 1 0 0 0 0 1 1 1 0 0 0 0 0 Input sequence: X = 1 1 1 1 1 1 1 1 Output sequences: Y = 0 0 1 1 0 0 0 1 Z = 0 1 0 1 0 0 1 0 Inputs: N = 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 D = 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 Q = 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 Outputs: R = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 C = 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 Examples: (Hint: Be sure that the circuit resets as shown in the examples.) 14.41 A sequential circuit with one input and one output is used to stretch the first two bits of a 4-bit sequence as follows: After every 4 bits, the circuit resets. Find a Mealy state graph and table for the circuit. The third and fourth bits of the input sequence can be either 1 or 0, so make sure that the circuit will work for all possible combinations.
14.42 A sequential circuit is to be used to control the operation of a vending machine which dispenses a $0.25 product. The circuit has three inputs (N, D, and Q) and two outputs (R and C). The coin detector mechanism in the vending machine is synchronized with the same clock as the sequential circuit you are to design. The coin detector outputs a single 1 to the N, D, or Q input for every nickel, dime, or quarter, respectively, that the customer inserts. Only one input will be 1 at a time. When the customer has inserted at least $0.25 in any combination of nickels, dimes, and quarters, the vending machine must give change and dispense the product. The coin return mechanism gives change by returning nickels to the customer. For every 1 output on C, the coin return mecha-nism will return one nickel to the customer. The product is dispensed when the circuit outputs a single 1 on output R. The circuit should reset after dispensing the product.
Example: The customer inserts a nickel, a dime, and a quarter. The circuit inputs and outputs could look like this: Derivation of State Graphs and Tables 495 Note that any number of 0’s can occur between 1 inputs.
Derive a Moore state table for the sequential circuit, and for each state indicate how much money the customer has inserted or how much change is due.
14.43 (a) Derive the state graph and table for a Mealy sequential circuit that converts a serial stream of bits from Manchester code to NRZ code. Assume that a double frequency clock (Clock2) is available.
(b) Repeat (a) for a Moore sequential circuit.
(c) Draw a timing diagram similar to Figure 14-21(b) for your answer to (a), using the Manchester waveform in Figure 14-21(b) as the input waveform to your cir-cuit. If the input changes occur slightly after the clock edge, indicate places in the output waveform where glitches (false outputs) can occur. If possible, assign the don’t-cares in the output part of your state table to eliminate some of the glitches.
(d) Draw the timing diagram for your answer to (b), using the same input waveform as in (c).
14.44 Design a sequential circuit to control a phone answering machine. The circuit should have three inputs (R, A, and S) and one output (Z).R = 1for one clock cycle at the end of each phone ring. A = 1 when the phone is answered. S selects whether the machine should answer the phone after two rings (S = 0) or four rings (S = 1). To cause the tape recorder to answer the phone, the circuit should set the output Z = 1 after the end of the second (S = 0) or fourth (S = 1) ring, and hold Z = 1 until the recorder circuit answers the phone (i.e., when A goes to 1). If a person answers the phone at any point, A will become 1, and the circuit should reset. Assume that S is not changed while the phone is counting rings. Give a Moore state graph for this circuit, using the alphanumeric state graph notation given in Section 14.5.
14.45 For the following state graph, derive the state table.
S1 S2 X1 ′ X2/Z1Z2 X1 ′ X2/0 X1 ′ X2 ′/0 X1 ′ X2 ′/0 S0 X1 ′X2 ′/Z2 X1/Z2 X1/0 X1/0 X1 ′ X2/Z1 496 Unit 14 14.47 Modify the BCD parity detector of Table 14-9 for the case where the least significant bit of the BCD digits is received first. Construct the incompletely specified Mealy model state table. (Hint: It can be constructed by specifying states to remember the first 3 bits of a BCD digit, but not all sequences of length three have to be distin-guished. It requires at most 11 states.) 14.48 In the parity detector of Table 14-9, assume the decimal digits are encoded using the excess-3 code instead of BCD. Construct the incompletely specified state table for this case. (Ten states are required.) 14.49 In the parity detector of Table 14-9, assume the decimal digits are encoded using the Gray code instead of BCD. Construct the incompletely specified state table for this case. (Eleven states are required.) 14.50 The decimal digits 0 through 5 are encoded as 3-bit binary numbers. They are trans-mitted in disjoint windows of length 3 least significant bit first and are input to a Mealy model circuit. The circuit generates an output of 1 (0) when the third bit is received if the 3 bits have even (odd) parity; the circuit output is a don’t-care for the first 2 bits. Construct an incompletely specified table for the circuit.
14.51 Redo Problem 14.50 assuming the bits are sent most significant bit first.
X2 X1 ′ X2 X1 ′ X2 ′ S0 X1 ′ X2 X1 Z1 X1 ′ X2 ′ X1 ′ X2 ′ X1X2 X1 S1 Z2 S2 Z3 14.46 There are two errors in the state graph shown. One state is not completely specified for one combination of X1 and X2. In another state, there is a contradiction for one combination of X1 and X2. Correct the state graph by making two minor changes. Demonstrate that the modified state graph is completely specified.
497 Reduction of State Tables State Assignment U N I T 1 5 Objectives 1. Define equivalent states, state several ways of testing for state equivalence, and determine if two states are equivalent.
2. Define equivalent sequential circuits and determine if two circuits are equivalent.
3. Reduce a state table to a minimum number of rows.
4. Specify a suitable set of state assignments for a state table, eliminating those assignments which are equivalent with respect to the cost of realizing the circuit.
5. State three guidelines which are useful in making state assignments, and apply these to making a good state assignment for a given state table.
6. Given a state table and assignment, form the transition table and derive flip-flop input equations.
7. Make a one-hot state assignment for a state graph and write the next-state and output equations by inspection.
498 Unit 15 Study Guide 1. Study Section 15.1, Elimination of Redundant States.
2. Study Section 15.2, Equivalent States.
(a) State in words the meaning of λ1(p, X ) = λ2(q, X ).
(b) Assuming that N1 and N2 are identical circuits with the following state graph, use Definition 15.1 to show that p is not equivalent to q. (Calculate λ(p, X ) and λ(q, X ) for X = 0, X = 1, X = 00, X = 01, etc.) r q p 1 1 1 0 1 0 0 0 0 0 0 0 (c) Suppose you were given two sequential circuits (N1 and N2) in black boxes with only input and output terminals available. Each box has a reset button. The button on N1 resets it to state p and the button on N2 resets it to state q. Could you experimentally determine if p = q using Definition 15.1? Explain.
(d) Apply Theorem 15.1 to show that in Table 15-9, S2 ≢S3.
(e) Note the difference between the definition of state equivalence (Definition 15.1) and the state equivalence theorem (Theorem 15.1). The definition requires an examination of output sequences but not next states, while the theorem requires looking at both the output and next state for each single input. Make sure that you know both the definition and the theorem. Write out the definition of equivalent states: Write out the state equivalence theorem: When you check your answers, note that the theorem requires equal out-puts and equivalent next states. This distinction between equal and equiva-lent is very important. For example, in the following state table, no two states have equal next states, but we can still reduce the table to two states, Reduction of State Tables State Assignment 499 because some next states are equivalent. Note that the state equivalence theorem tells us that S3 ≡S0 if S3 ≡S0, When this happens, we may say S3 ≡S0. What other pair of states are equivalent?
Present State Next State Z S0 S1 S0 0 S1 S0 S2 1 S2 S3 S2 1 S3 S1 S3 0 Next State Present Output X = 0 1 X = 0 1 a a b 0 0 b d a 0 1 c a b 0 1 d g f 0 0 f d g 0 1 g d f 0 1 a b c d f g f d c b Next State Present Output X = 0 1 X = 0 1 a b c 0 1 b d b 0 0 c e a 0 1 d d e 0 0 e e e 0 0 3. Study Section 15.3, Determination of State Equivalence Using an Implication Table.
(a) Fill in the following implication chart to correspond to the given table (first pass only).
Your answer should have eight squares with X’s, two squares with one implied pair, and four squares with two implied pairs. There should be a check in square f-g because the only nontrivial implication of f-g is f-g itself.
(b) Now go through your chart and eliminate all nonequivalent pairs (several passes may be required). What is the only equivalent state pair? According to the state equivalence theorem, why is b ≢d? Why is a ≢b?
(c) Find all of the equivalent states in the following table using an implication table: (You should have found four pairs of equivalent states. If you found only two pairs, reread Section 15.3).
Reduce the table to two rows.
500 Unit 15 4. Study Section 15.4, Equivalent Sequential Circuits. Define equivalent sequential circuits. (Make sure you know the difference between equivalent states and equiv-alent circuits.) 5. Work Problems 15.1, 15.2, and 15.3 using the methods of Sections 15.3 and 15.4. When forming the implication charts for state equivalence, follow the convention used in the text. That is, label the bottom of the chart starting with the first state and ending with the next-to-last state. Then, label the left side of the chart start-ing with the second state at the top and ending with the last state at the bottom.
6. Study Section 15.5, Reducing Incompletely Specified State Tables.
(a) State two reasons why a state table might be incompletely specified.
(b) For Table 15-5(a), construct the implication chart and find the maximal compatibles. Use the maximal compatibles to construct the reduced table with two states.
(c) Show that the state table in Study Guide 10 of Unit 14 can be reduced to two states.
7. Read Section 15.6, Derivation of Flip-Flop Input Equations.
(a) Derive JC and KC from the C+ map of Figure 15-10(a).
00 01 11 10 00 01 11 10 00 01 11 10 00 01 11 10 00 01 11 10 00 01 11 10 (b) Plot the map for the output function (Z) from the transition table of Table 15-9(b) and derive the minimum equation for Z.
Reduction of State Tables State Assignment 501 (c) Derive the J-K input equations for flip-flop A from the next-state map of Figure 15-11. Your answers should be JA = X2B, KA = X2 ′B′ (d) Work Problem 15.4.
8. Study Section 15.7 , Equivalent State Assignments.
(a) Fill in the missing assignments (numbered 8 through 18) in Table 15-11. First, list the remaining assignments with 01 in the first row and then the assignments with 10 in the first row.
(b) Why is it unnecessary to try all possible state assignments to be assured of finding a minimum cost circuit?
(c) For symmetrical flip-flops, why is it always possible to assign all 0’s to the starting state and still obtain a minimum circuit?
(d) Complete the following transition table for Table 15-12 using assignment A. Then, complete the next-state maps and derive D1 and D2.
Q1Q2 X = 0 1 00 00 10 01 10 0 1 X X 00 Q1Q2 X 01 11 10 Q1 = D1 + 0 1 X X 00 Q1Q2 X 01 11 10 Q2 = D2 + Starting with the equations for assignment A, replace all of the 1’s with 2’s and all 2’s with 1’s. Verify that the resulting equations are the same as those for assignment B.
Starting with the J and K equations for assignment A, replace each Q with Q′ and vice versa. Then, replace the equations for J with the corresponding K equations and vice versa. (This corresponds to the transformation given in Figure 15-13.) Verify that the resulting equations are the same as for assignment C.
Complement the right-hand side of the D equations for assignment A and, then, replace each Q with Q′ and vice versa. (This corresponds to the 502 Unit 15 transformation given in Figure 15-14.) Verify that the resulting equations are the same as for assignment C.
(e) Show that each of the assignments in Table 15-11 is equivalent to one of the assignments in Table 15-13. (f ) Why are the following two state assignments equivalent in cost?
10 11 01 01 01 11 00 00 00 11 10 10 (1) (3) (5) (3) (1) (5) 0 0 0 0 0 0 0 0 1 0 0 1 0 1 0 1 0 0 1 1 1 1 1 1 A 000 011 B 001 111 C 011 101 D 101 110 E 100 010 F 010 001 G 110 000 (g) Show that each of the following assignments can be generated from Table 15-13 by permuting and/or complementing columns: (h) Why is the trial-and-error method of state assignment of limited usefulness?
(i) Read Problem 15.5, and then answer the following questions regarding state assignments before you work the problem: (1) Why should a column not be assigned all 0’s or all 1’s?
(2) Why should two columns not be given the same assignment?
(3) Does interchanging two columns affect the cost of realizing the circuit?
(4) Does interchanging two rows affect the cost?
(5) Why is an assignment which has two identical rows invalid?
(6) Consider the following two assignments (the number at the top of each column is the decimal equivalent of the binary number in the column): If we try the column assignment (1) (3) (5), why is it unnecessary to try (3) (1) (5)?
Why is it desirable to assign the column values in increasing numerical order?
Reduction of State Tables State Assignment 503 9. Study Section 15.8, Guidelines for State Assignment.
(a) Why do the guidelines for making state assignments help in making an economical assignment?
(b) What should be done if all the adjacencies specified by the guidelines cannot be satisfied?
(c) The state assignment guidelines for Figure 15-15(a) indicate that the fol-lowing sets of states should be given adjacent assignments: (1) (S0, S1, S3, S5) (S3, S5) (S4, S6) (S0, S2, S4, S6) (2) (S1, S2) (S2, S3) (S1, S4) (S2, S5)2X (S1, S6)2X Because the adjacencies from guideline 1 are generally most important, we will start by placing one of the largest groups from guideline 1 in four adjacent squares: S0 S1 S3 S5 Note that (S3, S5) is also satisfied by this grouping. Place S2, S4, and S6 in the remaining squares to satisfy as many of the remaining guidelines as possible. Keeping in mind that groups labeled 2X should be given preference over groups which are not repeated. Compare your answer with Figure 15-15(b).
(d) Complete the transition table for the state table of Figure 15-17(a), using the assignment of Figure 15-17(b).
(e) Complete the next-state and output maps, and verify that the cost of real-izing the corresponding equations with an AND-OR gate circuit is 13 gates and 35 gate inputs. (f ) Find J1 and K1 from the Q+ 1 map.
J1 = ____ K1 = ____ Q+ 1 Q+ 2 Q+ 3 Q1 Q2 Q3 X = 0 1 0 1 a 0 0 0 000 100 0 0 b 1 1 1 011 110 0 1 c 1 0 0 100 000 0 0 504 Unit 15 10. Work Problems 15.6, 15.7 , and 15.8.
11. Study Section 15.9, Using a One-Hot State Assignment.
(a) A one-hot state assignment does not usually give a solution that uses less hardware because of the extra flip-flops required. In what situation is it often advantageous to use it anyway?
(b) It is easy to derive flip-flop input equations directly from a state graph for a one-hot state assignment by inspecting the arcs leading into a given state. Give the next-state equation for Q5. Only the parts of the state graph which are needed to find Q+ 5 are given.
(c) For the state graph in Figure 15-20 and the one-hot state assignment shown, determine the next-state equations for Q2 and Q3.
Q+ 2 = _ and Q+ 3 = ____ (d) For the state graph in Figure 15-20 and the one-hot state assignment shown, determine the output equations for Ad and Done.
Ad = _ and Done = ___ (e) Work Problem 15.9.
12. When you are satisfied that you can meet all of the objectives, take the readiness test.
Q2Q3 Q1 + 0 1 0 1 00 01 11 10 X X 0 1 00 XQ1 01 11 10 Q2Q3 Q2 + 0 0 0 0 00 01 11 10 X X 1 1 00 XQ1 01 11 10 Q2Q3 Q3 + 0 0 0 0 00 01 11 10 X X 1 0 00 XQ1 01 11 10 Q2Q3 Z D1 = 0 0 0 0 00 01 11 10 X X 0 1 00 XQ1 01 11 10 D2 = D3 = Z = S2 S5 X′ 0 X 0 X′Y P , 505 Reduction of State Tables State Assignment Given a description of the desired input-output behavior of a sequential circuit, the first step in designing the circuit is to derive a state table using methods similar to the ones discussed in the previous unit. Before we realize this state table using flip-flops and logic gates, reduction of the state table to a minimum number of states is desir-able. In general, reducing the number of states in a table will reduce the amount of logic required, and the number of flip-flops may also be reduced. For example, if a table with nine states is reduced to eight states, the number of flip-flops required is reduced from four to three, with a possible corresponding reduction in the amount of input logic for the flip-flops. If the table is further reduced to six states, three flip-flops are still required, but the presence of more don’t-cares in the flip-flop input equations will probably further reduce the required logic.
Given the reduced state table, the next step in synthesizing the circuit is to assign binary flip-flop states to correspond to the circuit states. The way in which this assign-ment is made will determine the amount of logic required for the circuit. The problem of finding a good state assignment which leads to an economical circuit is a difficult one, but some guidelines for achieving this are discussed in Sections 15.7–15.8.
The next step in designing the sequential circuit is to derive the flip-flop input equations. We have already done this for counters in Unit 12, and we will show how to apply these techniques to more general sequential circuits.
15.1 Elimination of Redundant States In Unit 14, we were careful to avoid introducing unnecessary states when setting up a state graph or table. We will now approach the problem of deriving the state graph somewhat differently. Initially, when first setting up the state table, we will not be overly concerned with inclusion of extra states, but when the table is complete, we will eliminate any redundant states. In previous units, we have used the notation S0, S1, S2, . . . to represent states in a sequential circuit. In this unit, we will frequently use A, B, C, . . . (or a, b, c, . . . ) to represent these states.
We will rework Example 1 in Section 14.3. Initially, we will set up enough states to remember the first three bits of every possible input sequence. Then, when the fourth bit comes in, we can determine the correct output and reset the circuit to the 506 Unit 15 initial state. As indicated in Table 15-1, we will designate state A as the reset state. If we receive a 0, we go to state B; if we receive a 1, we go to state C. Similarly, starting in state B, a 0 takes us to state D to indicate that the sequence 00 has been received, and a 1 takes us to state E to indicate that 01 has been received. The remaining states are defined in a similar manner. When the fourth input bit is received, we return to the reset state. The output is 0 unless we are in state J or L and receive a 1, which corresponds to having received 0101 or 1001.
Next, we will attempt to eliminate redundant states from the table. The input sequence information was only used in setting up the table and will now be disre-garded. Looking at the table, we see that there is no way of telling states H and I apart. That is, if we start in state H, the next state is A and the output is 0; similarly, if we start in state I, the next state is A and the output is 0. Hence, there is no way of telling states H and I apart, and we can replace I with H where it appears in the next-state portion of the table. Having done this, there is no way to reach state I, so row I can be removed from the table. We say that H is equivalent to I(H ≡I). Similarly, rows K, M, N, and P have the same next state and output as H, so K, M, N, and P can be replaced by H, and these rows can be deleted. Also, the next states and outputs are the same for rows J and L, so J ≡L. Thus, L can be replaced with J and eliminated from the table. The result is shown in Table 15-2.
Having made these changes in the table, rows D and G are identical and so are rows E and F. Therefore, D ≡G, and E ≡F, so states F and G can be eliminated. Figure 15-1 shows a state diagram for the final reduced table. Note that this is identical to the state graph of Figure 14-15, except for the designations for the states. The proce-dure used to find equivalent states in this example is known as row matching. In general, row matching is not sufficient to find all equivalent states, except in the special case where the circuit resets to the starting state after receiving a fixed number of inputs. Input Sequence Present State Next State Present Output X = 0 X = 1 X = 0 X = 1 reset A B C 0 0 0 B D E 0 0 1 C F G 0 0 00 D H I 0 0 01 E J K 0 0 10 F L M 0 0 11 G N P 0 0 000 H A A 0 0 001 I A A 0 0 010 J A A 0 1 011 K A A 0 0 100 L A A 0 1 101 M A A 0 0 110 N A A 0 0 111 P A A 0 0 TABLE 15-1 State Table for Sequence Detector © Cengage Learning 2014 Reduction of State Tables State Assignment 507 Present State Next State Present Output X = 0 X = 1 X = 0 X = 1 A B C 0 0 B D E 0 0 C F E G D 0 0 D H I H 0 0 E J K H 0 0 F L J M H 0 0 G N H P H 0 0 H A A 0 0 I A A 0 0 J A A 0 1 K A A 0 0 L A A 0 1 M A A 0 0 N A A 0 0 P A A 0 0 FIGURE 15-1 Reduced State Table and Graph for Sequence Detector © Cengage Learning 2014 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 1 1 1 1 0 1 0 1 0 1 0 A B D H J E C (b) Present Next State Output State X 0 X 1 X 0 X 1 A B C 0 0 B D E 0 0 C E D 0 0 D H H 0 0 E J H 0 0 H A A 0 0 J A A 0 1 (a) TABLE 15-2 State Table for Sequence Detector 15.2 Equivalent States As we have seen in the previous example, state tables can be reduced by eliminating equivalent states. A state table with fewer rows often requires fewer flip-flops and logic gates to realize; therefore, the determination of equivalent states is important in order to obtain economical realizations of sequential circuits.
© Cengage Learning 2014 508 Unit 15 Let us now consider the general problem of state equivalence. Basically, two states are equivalent if there is no way of telling them apart through observation of the circuit inputs and outputs. Consider two sequential circuits (these may be dif-ferent circuits or two copies of the same circuit), one which is started in state p and one which is started in state q (Figure 15-2): Let X represent a sequence of inputs X1, X2, . . . , Xn. Feed the same input sequence X into both circuits and observe the output sequences Z1 and Z 2. If these output sequences are the same, so far so good. Then, reset the circuits to the states p and q and try a different input sequence for X and again compare output sequences. If, for every possible input sequence X, these output sequences are the same, then there is no way of telling states p and q apart by observing the terminal behavior of the circuits, and we say p is equivalent to q( p ≡q). On the other hand, if, for some input sequence X, the output sequences Z1 and Z 2. are different, then we can distinguish between states p and q, and they are not equivalent. Because the output sequence is a function of the initial state and the input sequence, we will write Z1 = λ1( p, X ) Z 2 = λ 2(q, X ) We can then state formally the definition of state equivalence as follows: N1 Z1 Z2 X p N2 q Definition 15.1 FIGURE 15-2 Let N1 and N2 be sequential circuits (not necessarily different). Let X represent a sequence of inputs of arbitrary length. Then state p in N1 is equivalent to state q in N2 iff λ1( p, X ) = λ2(q, X ) for every possible input sequence X.
To apply Definition 15.1 directly, we should first test the circuits with X = 0 and X = 1. Then, we should test with all input sequences of length 2: X = 00, 01, 10, and 11. Next, we should test with all input sequences of length 3: X = 000, 001, 010, 011, 100, 101, 110, and 111. We should then continue this process with all input sequences of length 4, length 5, and so forth. Definition 15.1 is not practical to apply directly in prac-tice because it requires testing the circuit with an infinite number of input sequences in order to prove that two states are equivalent. A more practical way of testing for state equivalence uses the following theorem: Theorem15.11 Two states p and q of a sequential circuit are equivalent iff for every single input X, the outputs are the same and the next states are equivalent, that is, λ( p, X ) = λ(q, X ) and δ( p, X ) ≡δ(q, X ) where λ(p, X) is the output given the present state p and input X, and δ( p, X ) is the next state given the present state p and input X. Note that the next states do not have to be equal, just equivalent. For example, in Table 15-1, D ≡G, but the next states (H and N for X = 0, and I and P for X = 1) are not equal.
1See Appendix D for proof.
© Cengage Learning 2014 Reduction of State Tables State Assignment 509 The row matching procedure previously discussed is a special case of Theorem 15.1 where the next states are actually the same instead of just being equivalent. We will use this theorem to show that Table 13-4 has no equivalent states. By inspection of the output part of the table, the only possible pair of equivalent states is S0 and S2. From the table, S0 ≡S2 iff (S3 ≡S3, S2 ≡S0, S1 ≡S1, and S0 ≡S1) But S0 ≢S1 (because the outputs differ), so the last condition is not satisfied and S0 ≢S2.
15.3 Determination of State Equivalence Using an Implication Table In this section we will discuss a procedure for finding all of the equivalent states in a state table. If the equivalent states found by this procedure are eliminated, then the table can be reduced to a minimum number of states. We will use an implication table (sometimes referred to as a pair chart) to check each pair of states for possible equivalence. The nonequivalent pairs are systematically eliminated until only the equivalent pairs remain.
We will use the example of Table 15-3 to illustrate the implication table method. The first step is to construct a chart of the form shown in Figure 15-3. This chart has a square for every possible pair of states. A square in column i and row j corresponds to state pair i-j. Thus, the squares in the first column correspond to state pairs a-b, a-c, etc. Note that the squares above the diagonal are not included in the chart because if i ≡j, j ≡i, and only one of the state pairs i-j and j-i is needed. Also, squares corresponding to pairs a-a, b-b, etc., are omitted. To fill in the first column of the chart, we compare row a of Table 15-3 with each of the other rows. Because the output for row a is different than the output for row c, we place an X in a-c square of the chart to indicate that a ≢c. Similarly, we place X’s in squares a-e, a-f, and a-h to indicate that a ≢e, a ≢f, and a ≢h because of output differences. States a and b have the same outputs, and thus, by Theorem 15.1, a ≡b iff d ≡f and c ≡h To indicate this, we place the implied pairs, d-f and c-h, in the a-b square. Similarly, because a and d have the same outputs, we place a-d and c-e in the a-d square to indicate that a ≡d iff a ≡d and c ≡e Present State Next State Present Output X = 0 1 a d c 0 b f h 0 c e d 1 d a e 0 e c a 1 f f b 1 g b h 0 h c g 1 TABLE 15-3 © Cengage Learning 2014 510 Unit 15 The entries b-d and c-h in the a-g square indicate that a ≡g iff b ≡d and c ≡h Next, row b of the state table is compared with each of the remaining rows of the table, and column b of the implication chart is filled in. Similarly, the remaining col-umns in the chart are filled in to complete Figure 15-3. Self-implied pairs are redun-dant, so a-d can be eliminated from square a-d, and c-e from square c-e.
At this point, each square in the implication table has either been filled in with an X to indicate that the corresponding state pair is not equivalent (because the out-puts are different) or filled in with implied pairs. We now check each implied pair. If one of the implied pairs in square i-j is not equivalent, then by Theorem 15.1, i ≢j. The a-b square of Figure 15-3 contains two implied pairs (d-f and c-h). Because d ≢f (the d-f square has an X in it), a ≢b and we place an X in the a-b square, as shown in Figure 15-4. Continuing to check the first column, we note that the a-d square contains the implied pair c-e. Because square c-e does not contain an X, we cannot determine at FIGURE 15-3 Implication Chart for Table 15-3 © Cengage Learning 2014 a b c d e f g f g h e d c b a ≡ b iff d ≡ f and c ≡ h b ≢ c because the outputs differ d–f c–h a–d c–e a–f e–h c–e a–d e–f b–d c–f a–b b–d c–h a–b e–h c–e d–g c–f b–g a–g b–f FIGURE 15-4 Implication Chart After First Pass © Cengage Learning 2014 a b c d e f g f g h e d c b d–f c–h c–e a–f e–h a–d e–f b–d c–f a–b b–d c–h a–b e–h c–e d–g c–f b–g a–g b–f Reduction of State Tables State Assignment 511 this point whether or not a ≢d. Similarly, because neither square b-d nor c-h contains an X, we cannot determine immediately whether a ≢g or not. Going on to the second column, we place X’s in squares b-d and b-g because we have already shown a ≢f and b ≢f. In a similar manner, we check each of the remaining columns and X out squares c-f, d-g, e-f, and f-h. Figure 15-4 shows the resulting chart.
In going from Figure 15-3 to Figure 15-4, we found several additional nonequiva-lent state pairs. Therefore, we must go through the chart again to see if the added X’s make any other pairs nonequivalent. Rechecking column a, we find that we can place an X in square a-g because square b-d has an X. Checking the remaining columns, we X out squares c-h and e-h because d-g and a-g have X’s. This completes the second pass through the implication table, as shown in Figure 15-5. Because we added some X’s on the second pass, a third pass is required.
No new X’s are added on the third pass through the table, so all squares which corre-spond to nonequivalent state pairs have been Xed out. The coordinates of the remaining squares must then correspond to equivalent state pairs. Because square a-d (in column a, row d) does not contain an X, we conclude that a ≡d. Similarly, square c-e does not con-tain an X, so c ≡e. All other squares contain X’s, so there are no other equivalent state pairs. Note that we determined equivalent states from the column-row coordinates of the squares without X’s, not by reading the implied pairs contained within the squares.
If we replace d with a and e with c in Table 15-3, we can eliminate rows d and e, and the table reduces to six rows, as shown in Table 15-4.
FIGURE 15-5 Implication Chart After Secong Pass © Cengage Learning 2014 a b c d e f g f g h e d c b d–f c–h c–e a–f e–h a–d e–f b–d c–f a–b b–d c–h a–b e–h c–e d–g c–f b–g a–g b–f Present State Next State Output X = 0 1 a a c 0 b f h 0 c c a 1 f f b 1 g b h 0 h c g 1 TABLE 15-4 © Cengage Learning 2014 512 Unit 15 The implication table method of determining state equivalence can be summa-rized as follows: 1. Construct a chart which contains a square for each pair of states.
2. Compare each pair of rows in the state table. If the outputs associated with states i and j are different, place an X in square i-j to indicate that i ≢j. If the outputs are the same, place the implied pairs in square i-j. (If the next states of i and j are m and n for some input x, then m-n is an implied pair.) If the outputs and next states are the same (or if i-j only implies itself), place a check (Ë) in square i-j to indicate that i ≡j.
3. Go through the table square-by-square. If square i-j contains the implied pair m-n, and square m-n contains an X, then i ≢j, and an X should be placed in square i-j.
4. If any X’s were added in step 3, repeat step 3 until no more X’s are added.
5. For each square i-j which does not contain an X, i ≡j.
If desired, row matching can be used to partially reduce the state table before con-structing the implication table. Although we have illustrated this procedure for a Moore table, the same procedure applies to a Mealy table.
15.4 Equivalent Sequential Circuits In the last section, we found the equivalent states within a single state table so that we could reduce the number of rows in the table. Reducing the number of rows usu-ally leads to a sequential circuit with fewer gates and flip-flops. In this section, we will consider equivalence between sequential circuits. Essentially, two sequential circuits are equivalent if they are capable of doing the same “work.” Equivalence between sequential circuits is defined as follows: Definition 15.2 Sequential circuit N1 is equivalent to sequential circuit N2 if for each state p in N1, there is a state q in N2 such that p ≡q, and conversely, for each state s in N2, there is a state t in N1 such that s ≡t.
Thus, if N1 ≡N2, for every starting state p in N1, we can find a corresponding start-ing state q such that λ1(p, X ) ≡λ2(q, X ) for all input sequences X (i.e., the output sequences are the same for the same input sequence). Then, in a given application, N1 could be replaced with its equivalent circuit N2.
If N1 and N2 have only a few states, one way to show that N1 ≡N2 is to match up pairs of equivalent states by inspection and, then, show that Theorem 15.1 is satis-fied for each pair of equivalent states. If both N1 and N2 have a minimum number of states and N1 ≡N2, then N1 and N2 must have the same number of states. Otherwise, one circuit would have a state left over which was not equivalent to any state in the other circuit, and Definition 15.2 would not be satisfied.
Figure 15-6 shows two reduced state tables and their corresponding state graphs. By inspecting the state graphs, it appears that if the circuits are equivalent, we must have A Reduction of State Tables State Assignment 513 equivalent to either S2 or S3 because these are the only states in N2 with self-loops. Because the outputs of A and S2 correspond, the only possibility is A ≡S2. If we assume that A ≡S2, this implies that we must have B ≡S0, which in turn implies that we must have D ≡S1 and C ≡S3. Using the state tables, we can verify that these assumptions are correct because for every pair of assumed equivalent states, the next states are equivalent and the outputs are equal when X ≡0 and also when X ≡1. This verifies that N1 ≡N2.
The implication table can easily be adapted for determining the equivalence of sequential circuits. Because the states of one circuit must be checked for equivalence against states of the other circuit, an implication chart is constructed with rows cor-responding to states of one circuit and columns corresponding to states of the other. For example, for the circuits of Figure 15-6 we can set up the implication table of Figure 15-7(a). The first column of Figure 15-7(a) is filled in by comparing row A of the state table in Figure 15-6(a) with each of the rows in Figure 15-6(b). Because states A and S0 have different outputs, an X is placed in the A-S0 square. Because states A and S1 have the same outputs, the implied next-state pairs (B-S3 and A-S0) are placed in the A-S1 square, etc. The remainder of the table is filled in similarly.
In the next step (Figure 15-7(b)), squares corresponding to additional nonequiva-lent state pairs are crossed out. Thus, square A-S1 is crossed out because A ≢S0. FIGURE 15-6 Tables and Graphs for Equivalent Circuits © Cengage Learning 2014 S2 S0 S1 S3 1 0 1 0 0 0 0 0 0 0 0 0 1 1 1 1 C A D B 1 0 0 0 0 0 0 0 0 0 1 1 1 1 1 0 N1 X = X = X = X = 0 1 0 1 A B A 0 0 B C D 0 1 C A C 0 1 D C B 0 0 N2 0 1 0 1 S0 S3 S1 0 1 S1 S3 S0 0 0 S2 S0 S2 0 0 S3 S2 S3 0 1 (b) (a) FIGURE 15-7 Implication Tables for Determining Circuit Equivalence © Cengage Learning 2014 A B C D S0 S1 S2 S3 A–S3 C–S1 C–S3 D–S1 B–S3 A–S0 B–S0 A–S2 C–S0 B–S2 C–S2 D–S3 A–S2 C–S3 C–S3 B–S0 A B C D S0 S1 S2 S3 A–S3 C–S1 C–S3 D–S1 B–S3 A–S0 B–S0 A–S2 C–S0 B–S2 C–S2 D–S3 A–S2 C–S3 C–S3 B–S0 (a) (b) 514 Unit 15 Similarly, square B-S3 is crossed out because C ≢S2, square C-S0 because A ≢S3, and square D-S2 because B ≢S2. Another pass through the table reveals no additional nonequivalent pairs; therefore, the remaining equivalent state pairs are A ≡S2 B ≡S0 C ≡S3 D ≡S1 Since each state in N1 has an equivalent state in N2 and conversely, N1 ≡N2.
15.5 Reducing Incompletely Specified State Tables Reducing incompletely specified state tables is more complicated than reducing completely specified tables. We give only a brief introduction here.2 At first it might be thought that trying different values for the don’t-cares and reducing the resulting completely specified table will produce the minimal state table. We give two exam-ples to show that this would be very complex for tables with many don’t-cares and, in fact, often does not produce the minimal table. Table 15-5(a) contains two don’t-cares labelled –1 and –2 so we can try reducing it by trying the four combinations of values for the don’t-cares. Figure 15-8 shows the implication charts for the four com-binations (DC1 = 0 and 1, DC2 = 0 and 1); the table only reduces when both don’t-cares are 1. In this case the resulting two-state table is the minimal table. However, trying all possibilities if there are many don’t-cares would be very complex and, as Table 15-5(b) shows, does not always produce a minimal table.
If the don’t-care in Table 15-5(b) is replaced by a 0, the outputs make S0 and S2 plus S1 and S2 nonequivalent. Then S0 and S1 are not equivalent because they have next states S1 and S2. Similarly, there are no equivalent states if the don’t-care is replaced by a 1. However, this table can be reduced to two states. If S1 is duplicated with one copy made equivalent to S0 and the other copy made equivalent to S2 as shown in Table 15-6, then S0 is equivalent to S1 1 and S2 is equivalent to S2 1 and the table can be reduced to two states.
2See McCluskey, Edward J., Logic Design Principles (Upper Saddle River, NJ: Prentice Hall, 1986) for a more complete discussion.
Present State Next State Output X = 0 X = 1 X = 0 X = 1 S0 S1 S3 0 −2 S1 S2 S3 −1 0 S2 S1 S0 1 0 S3 S2 S3 0 1 (a) TABLE 15-5 Incompletely Specified Examples Present State Next State Output X = 0 X = 1 X = 0 X = 1 S0 S2 S1 0 1 S1 S1 S0 – 1 S2 S2 S1 1 1 (b) © Cengage Learning 2014 Reduction of State Tables State Assignment 515 For a completely specified table, if S0 ≡S1 and S1 ≡S2, then S0 ≡S2. (Equiva-lence satisfies the transitivity property.) In the preceding example, for any input sequence, S0 and S1 will generate the same output sequence values wherever both output sequences have defined values; S0 and S1 are said to be compatible. (We will use the symbol ~ to denote compatibility.) Similarly, S1 and S2 are compatible (i.e., for any input sequence they will generate the same output sequence values wherever both output sequences have defined values). But this is not true for S0 and S2; for the single input x = 0, they have different outputs. Compatibility does not satisfy transi-tivity; S0 ~ S1 and S1 ~ S2 does not imply that S0 ~ S2.
To reduce a completely specified table, we find all the maximal sets of states containing pairwise equivalent states; since equivalence is transitive, a state of the table is contained in just one of the maximal equivalence classes. The states of the reduced table correspond to these maximal equivalence classes. The first step in reducing an incompletely specified table is to find all maximal sets of states that are pairwise compatible—the maximal compatibles. However, since compatibility does not satisfy transitivity, a given state may be contained in more than one maximal compatible. To reduce an incompletely specified table, a minimum of the maximal compatibles are selected, say C1, C2, . . . , Ck, so that (1) each state of the table appears in at least one of the Ci, and (2) for each input combination x and each Ci, the next states of the states in Ci are contained in some Cj. (It may be that j = i.) The second condition allows the construction of a state table with the states cor-responding to the selected maximal compatibles; the reduced table will contain k states. (This procedure is valid for most incompletely specified tables. In some cases the states of the reduced table are specified by subsets of the maximal compatibles.) As an example, consider a circuit that receives binary encodings for decimal digits 0, 1, 2, 3, 4 and 5 in disjoint windows of length 3. The bits are received most FIGURE 15-8 Implication Charts for Table 15-5(a) © Cengage Learning 2014 S0 S1 S1, S2 S1, S2 S1, S2 S0, S3 S0, S3 S0, S3 DC1=0, DC2=0 DC1=0, DC2 =1 DC1 =1, DC2 =0 DC1=1, DC2 = 1 S2 S3 S1 S2 S0 S1 S2 S3 S1 S2 S0 S1 S2 S3 S1 S2 S0 S1 S2 S3 S1 S2 Present State Next State Output X = 0 X = 1 X = 0 X = 1 S0 S2 S1 1 0 1 S1 1 S2 1 S0 0 1 S2 1 S2 1 S0 1 1 S2 S2 S1 1 1 1 TABLE 15-6 Modified Table 15-5(b) © Cengage Learning 2014 516 Unit 15 significant bit first and the circuit generates an output of 1 (0) for the third input bit if the 3 bits have even (odd) parity. The output is a don’t-care for the first 2 bits. Table 15-7 was constructed for the circuit where the states are entered for the input sequences shown. Figure 15-9 is the implication chart for Table 15-7 . All pairs of states are compatible except for S1 and S2 and S3 and S4. S0 ~ S1, S0 ~ S3, and S1 ~ S3 implies that (S0 S1 S3) is a compatible set. Similarly, (S0 S2 S3), (S0 S1 S4), and (S0 S2 S4) are compatible sets. (S0 S1 S3), and (S0 S2 S3) cannot be combined into a larger set since S1 and S2 are not compatible. None of these will combine, so (S0 S1 S3), (S0 S2 S3), (S0 S2 S4) and (S0 S2 S4) are the maximal compatible sets.
The next states of (S0 S1 S3) for X = 1 are (S0 S2 S4), so if (S0 S1 S3) is one of the states in the reduced table, then (S0 S2 S4) must be one of the other states. The next states of (S0 S2 S4) for X = 0 are (S0 S1 S4), so if (S0 S2 S4) is one of the states in the reduced table, then (S0 S1 S4) must be one of the other states. Examining the next states for X = 0 and X = 1 shows that (S0 S1 S3), (S0 S1 S4), and (S0 S2 S4) can be used to form a state table; Table 15-8 is the resulting table. (S0 S2 S3) has next states (S0 S1 S4) for X = 0, so if (S0 S2 S3) were included, the table would have four states; Table 15-8 is the minimal reduced table for Table 15-7 .
FIGURE 15-9 Implication Chart for Table 15-7 © Cengage Learning 2014 S1 S1, S3 S2, S4 S0, S1 S0, S2 S0, S3 S0, S4 S1, S4 S3, S4 S0, S4 S0, S1 S0, S2 S0, S3 S0, S4 S0, S4 S2 S3 S0 S4 S1 S2 S3 Present State Next State Output X = 0 X = 1 X = 0 X = 1 S0 S1 S2 – – 0 S1 S3 S4 – – 1 S2 S4 – – – 00 S3 S0 S0 1 0 01, 10 S4 S0 S0 0 1 TABLE 15-7 Even Parity Detector For 0 Through 5 Present State Next State Output X = 0 X = 1 X = 0 X = 1 S0 S1 S3 A A B 1 0 S0 S2 S4 B C B 0 1 S0 S1 S4 C A B 0 1 TABLE 15-8 Reduced Table for Table 15-7 © Cengage Learning 2014 © Cengage Learning 2014 Reduction of State Tables State Assignment 517 15.6 Derivation of Flip-Flop Input Equations After the number of states in a state table has been reduced, the following procedure can be used to derive the flip-flop input equations: 1. Assign flip-flop state values to correspond to the states in the reduced table.
2. Construct a transition table which gives the next states of the flip-flops as a func-tion of the present states and inputs.
3. Derive the next-state maps from the transition table.
4. Find flip-flop input maps from the next-state maps using the techniques devel-oped in Unit 12 and find the flip-flop input equations from the maps.
As an example, we will design a sequential circuit to realize Table 15-9(a). Because there are seven states, we will need three flip-flops. We will designate the flip-flop outputs as A, B, and C.
(a) State table X = 0 1 0 1 S0 S1 S2 0 0 S1 S3 S2 0 0 S2 S1 S4 0 0 S3 S5 S2 0 0 S4 S1 S6 0 0 S5 S5 S2 1 0 S6 S1 S6 0 1 TABLE 15-9 (b) Transition table A+B+C+ Z ABC X = 0 1 0 1 000 110 001 0 0 110 111 001 0 0 001 110 011 0 0 111 101 001 0 0 011 110 010 0 0 101 101 001 1 0 010 110 010 0 1 We could make a straight binary state assignment for which S0 is represented by flip-flop states ABC = 000, S1 by ABC = 001, S2 by ABC = 010, etc. However, because the correspondence between flip-flop states and the state names is arbitrary, we could use many different state assignments. Using a different assignment may lead to simpler or more complex flip-flop input equations. As an example, we will use the following assignment for the states of flip-flops A, B, and C: S0 = 000, S1 = 110, S2 = 001, S3 = 111, S4 = 011, S5 = 101, S6 = 010 (15-1) This state assignment is derived in Section 15.8, and the reasons why it leads to an economical solution are given in that section. Starting with Table 15-9(a), we substitute 000 for S0, 110 for S1, 001 for S2, etc. Table 15-9(b) shows the resulting transition table. This table gives the next states of flip-flops A, B, and C in terms of the present states and the input X. We can fill in the next-state maps, Figure 15-10(a), directly from this table. For XABC = 0000 the next-state entry is 110, so we fill in A+ = 1, B+ = 1, and C+ = 0; for XABC = 1000 the next-state entry is 001, so we fill in A+ = 0, B+ = 0, and C+ = 1; etc. Because the state assignment ABC = 100 is not used, the map squares corresponding to XABC = 0100 and 1100 are filled with don’t-cares.
© Cengage Learning 2014 518 Unit 15 Once the next-state maps have been plotted from the transition table, the flip-flop input equations can be derived using the techniques developed in Unit 12. As shown in Figure 15-10(a), the D flip-flop input equations can be derived directly from the next-state maps because DA = A+, DB = B+, and DC = C+. If J-K flip-flops are used, the J and K input equations can be derived from the next-state maps as illustrated in Figure 15-10(b). As was shown in Section 12.5, the A = 0 half of the JA map is the same as the A+ map and the A = 1 half is all don’t-cares. The A = 1 half of the KA map is the complement of the A = 1 half of the A+ map, and the A = 0 half is all don’t-cares. We can plot the JB and KB in a similar manner by looking at the B = 0 and B = 1 halves of the B+ map. Derivation of the JC and KC maps from the C+ map is left as an exercise.
FIGURE 15-10 Next-State Maps for Table 15-9 © Cengage Learning 2014 A+ = DA = X′ 1 X X 0 00 01 11 10 1 1 0 0 1 1 0 0 1 00 BC XA 01 11 10 1 0 0 JA = X′ 1 X X 0 00 01 11 10 1 X X 0 1 X X 0 1 00 BC XA 01 11 10 X X 0 KA = X X X X X 00 01 11 10 X 0 1 X X 0 1 X X 00 BC XA 01 11 10 0 1 X JB = X′A′ + A′C 1 X X 0 00 01 11 10 1 1 0 0 X X X X 00 BC XA 01 11 10 X X X X KB = AC + XA X X X X 00 01 11 10 X X X X 1 1 0 0 1 00 BC XA 01 11 10 0 0 0 B+ = DB = X′C′ + A′C + A′B 1 X X 0 00 01 11 10 1 0 0 1 1 0 0 1 1 00 BC XA 01 11 10 1 0 1 C+ = DC = A + XB′ 0 X X 1 00 01 11 10 0 1 1 1 0 1 1 0 0 00 BC XA 01 11 10 1 1 0 (a) Derivation of D flip-flop input equations (b) Derivation of J-K flip-flop input equations A = 1 A = 0 A = 0 B = 0 B = 0 (a) State table P.S.
Next State X1X2 = Outputs (Z1Z2) X1X2 = 00 01 11 10 00 01 11 10 S0 S0 S0 S1 S1 00 00 01 01 S1 S1 S3 S2 S1 00 10 10 00 S2 S3 S3 S2 S2 11 11 00 00 S3 S0 S3 S2 S0 00 00 00 00 TABLE 15-10 (b) Transition table AB A+B+ X1X2 = Outputs (Z1Z2) X1X2 = 00 01 11 10 00 01 11 10 00 00 00 01 01 00 00 01 01 01 01 10 11 01 00 10 10 00 11 10 10 11 11 11 11 00 00 10 00 10 11 00 00 00 00 00 © Cengage Learning 2014 Reduction of State Tables State Assignment 519 Table 15-10(a) represents a sequential circuit with two inputs (X1 and X2) and two outputs (Z1 and Z2). Note that the column headings are listed in Karnaugh map order because this will facilitate derivation of the flip-flop input equations. Because the table has four states, two flip-flops (A and B) are required to realize the table. We will use the state assignment AB = 00 for S0, AB = 01 for S1, AB = 11 for S2, and AB = 10 for S3. By substituting the corresponding values of AB for the state names, we obtain the transition table, Table 15-10(b). We can then fill in the next-state and output maps (Figure 15-11) from the transition table. For example, when X1X2AB = 0011, A+B+ = 10, and Z1Z2 = 11; therefore, we fill in the 0011 squares of the A+, B+, Z1, and Z2 maps with l, 0, 1, and 1, respectively. We can read the D flip-flop input equations directly from the next-state maps.
FIGURE 15-11 Next-State Maps for Table 15-10 © Cengage Learning 2014 DA = A+ = X2B + AB + X2A 0 0 0 0 00 01 11 10 0 1 1 0 1 1 1 1 0 00 AB X1X2 X1X2 X1X2 X1X2 01 11 10 1 1 0 DB = B+ = X1A′ + X′2A′B + X1B + X1X2 0 0 1 1 00 01 11 10 1 0 1 1 0 0 1 1 0 00 AB 01 11 10 0 1 0 0 0 0 0 00 01 11 10 0 1 1 0 1 1 0 0 0 00 AB 01 11 10 0 0 0 0 0 1 1 00 01 11 10 0 0 0 0 1 1 0 0 0 00 AB 01 11 10 0 0 0 Z2 = X1A′B′ + X′ 1AB Z1 = X2A′B + X′ 1AB If J-K, T, or S-R flip-flops are used, the flip-flop input maps can be derived from the next-state maps using the techniques given in Section 12.6. As an example, the S-R equations for Table 15-10 are derived in Figure 15-12. The SA and RA maps are derived from the A+ map by applying Table 12-5(c) to the A = 0 and A = 1 halves of the map. SB and RB are derived in a similar manner.
FIGURE 15-12 Derivation of S-R Equations for Table 15-10 © Cengage Learning 2014 SA = X2B 0 0 0 0 00 01 11 10 0 1 1 0 X X X X 0 00 AB X1X2 X1X2 X1X2 X1X2 01 11 10 X X 0 X X X X 00 01 11 10 X 0 0 X 0 0 0 0 1 00 AB 01 11 10 0 0 1 SB = X1X2 + X1A′ 0 0 1 1 00 01 11 10 X 0 X X 0 0 X X 0 00 AB 01 11 10 0 1 0 RB = X′ 1X2 + X′ 1A X X 0 0 00 01 11 10 0 1 0 0 1 1 0 0 X 00 AB 01 11 10 X 0 X RA = X′ 2B′ A = 0 B = 1 B = 0 B = 0 A = 1 15.7 Equivalent State Assignments After the number of states in a state table has been reduced, the next step in real-izing the table is to assign flip-flop states to correspond to the states in the table. The cost of the logic required to realize a sequential circuit is strongly dependent on the way this state assignment is made. Several methods for choosing state assignments to obtain economical realizations are discussed in this chapter. The trial-and-error 520 Unit 15 method described next is useful for only a small number of states. The guideline method discussed in Section 15.8 produces good solutions for some problems, but it is not entirely satisfactory in other cases.
If the number of states is small, it may be feasible to try all possible state assign-ments, evaluate the cost of the realization for each assignment, and choose the assign-ment with the lowest cost. Consider a state table with three states (S0, S1, and S2) as in Table 14-1. Two flip-flops (A and B) are required to realize this table. The four possible assignments for state S0 are AB = 00, AB = 01, AB = 10, and AB = 11. Choosing one of these assignments leaves three possible assignments for state S1 because each state must have a unique assignment. Then, after state S1 is assigned, we have two possible assignments for state S2. Thus, there are 4 × 3 × 2 = 24 possible state assignments for the three states, as shown in Table 15-11. As an example, for assignment 7 , the entry 01 in the S0 row means that flip-flops A and B are assigned values 0 and l, respectively.
Trying all 24 of these assignments is not really necessary. If we interchange two columns in one of the given assignments, the cost of realization will be unchanged because interchanging columns is equivalent to relabeling the flip-flop variables. For example, consider assignment 1 in Table 15-11. The first column of this assignment shows that flip-flop A is assigned the values 0, 0, and 1 for states S0, S1, and S2, respec-tively. Similarly, the second column shows that B is assigned the values 0, 1, and 0. If we interchange the two columns, we get assignment 3, for which A has the values 0, 1, and 0 and B has the values 0, 0, and 1. We could have achieved the same result by using assignment 1 and labeling the flip-flop variables BA instead of AB. If we inter-change the columns of assignment 2, we get assignment 4, so assignments 2 and 4 have the same cost. Similarly, assignments 5 and 6 have the same cost. Interchanging rows, however, will usually change the cost of realization. Thus, assignments 4 and 6 will have a different cost for many state tables.
1 2 3 4 5 6 7 19 20 21 22 23 24 S0 00 00 00 00 00 00 01 . . .
11 11 11 11 11 11 S1 01 01 10 10 11 11 00 00 00 01 01 10 10 S2 10 11 01 11 01 10 10 01 10 00 10 00 01 FIGURE 15-13 Equivalent Circuits Obtained by Complementing Qk © Cengage Learning 2014 p′ f1 Qk J K f2 p f1 Qk Q′ k Q′ k J K f2 (a) Circuit A (b) Circuit B (identical to A except leads to flip-flop Qk are crossed) TABLE 15-11 State Assignments for 3-Row Tables © Cengage Learning 2014 Reduction of State Tables State Assignment 521 If symmetrical flip-flops such as T, J-K, or S-R are used, complementing one or more columns of the state assignment will have no effect on the cost of realiza-tion. Consider a J-K flip-flop imbedded in a circuit, Figure 15-13(a). Leave the circuit unchanged and interchange the J and K input connections and the Qk and Qk ′ output connections, Figure 15-13(b). If circuit A is started with Qk = p and circuit B with Qk = p′, the behavior of the two circuits will be identical, except the value of Qk will always be complemented in the second circuit because whenever J is 1 in the first circuit, K will be 1 in the second and conversely. The state table for the second circuit is therefore the same as for the first, except the value of Qk is complemented for the second circuit. This implies that complementing one or more columns in the state assignment will not affect the cost of the realization when J-K flip-flops are used. Similar reasoning applies to T and S-R flip-flops. Thus, in Table 15-11, assignments 2 and 7 have the same cost, and so do assignments 6 and 19.
If unsymmetrical flip-flops are used such as a D flip-flop, it is still true that per-muting (i.e., rearranging the order of) columns in the state assignment will not affect the cost; however, complementing a column may require adding an inverter to the circuit, as shown in Figure 15-14. If different types of gates are available, the circuit can generally be redesigned to eliminate the inverter and use the same number of gates as the original. If circuit A in Figure 15-14 is started with Qk = p and circuit B with Qk = p′, the behavior of the two circuits will be identical, except the value of Qk will always be complemented in circuit B because f is the same in both circuits and D = f ′ for circuit B.
Table 15-12 illustrates the effect of interchanging or complementing state assign-ment columns on the equations for realizing a specific state table.
FIGURE 15-14 Equivalent Circuits Obatined by Complemeting Qk © Cengage Learning 2014 p′ f Qk D p f Qk D (a) Circuit A (b) Circuit B (identical to A except for connections to flip-flop Qk) Q′ k Q′ k Assignments Present State Next State Output A3 B3 C3 X = 0 1 0 1 00 00 11 S1 S1 S3 0 0 01 10 10 S2 S2 S1 0 1 10 01 01 S3 S3 S3 1 0 TABLE 15-12 © Cengage Learning 2014 522 Unit 15 The J-K and D flip-flop input equations for the three assignments can be derived, using Karnaugh maps as explained in Unit 12 and Section 15.6. The resulting J and K input equations are: Assignment A Assignment B Assignment C J1 = XQ2 ′ J2 = XQ1 ′ K1 = XQ2 K1 = X′ K2 = X′ J1 = X′ J2 = X′Q1 J1 = X′Q2 K2 = X′Q1 ′ K2 = X K1 = X J2 = X Z = X′Q1 + XQ2 Z = X′Q2 + XQ1 Z = X′Q1 ′ + XQ2 ′ D1 = XQ2 ′ D2 = XQ1 ′ D1 = X′ + Q2 ′ D2 = X′(Q1 + Q2) D1 = X′(Q2 + Q1) D2 = X + Q1Q2 Note that assignment B in Table 15-12 was obtained by interchanging the columns of A. The corresponding equations for assignment B are the same as for A, except that subscripts 1 and 2 are interchanged. Assignment C was obtained by complement-ing the columns of A. The Z equation for C is the same as for A, except that Q1 and Q2 are complemented. The K and J equations for C are the same, respectively, as the J and K equations for A with the Q’s complemented. The D equations for C can be obtained by complementing those for A and, then, complementing the Q’s. Thus, the cost of realizing Table 15-12 using J-K flip-flops and any kind of logic gates will be exactly the same for all three assignments. If both AND and OR (or NAND and NOR) gates are available, the cost of realizing the three sets of D equations will be the same. If only NOR gates are available, for example, then realizing D1 and D2 for assignment C would require two additional inverters compared with A and B.
By complementing one or more columns, any state assignment can be converted to one in which the first state is assigned all 0’s. If we eliminate assignments which can be obtained by permuting or complementing columns of another state assign-ment, Table 15-11 reduces to three assignments (Table 15-13). Thus, when realizing a three-state sequential circuit with symmetrical flip-flops, it is only necessary to try three different state assignments to be assured of a minimum cost realization. Simi-larly, only three different assignments must be tried for four states.
3-State Assignments 4-State Assignments States 1 2 3 1 2 3 a 00 00 00 00 00 00 b 01 01 11 01 01 11 c 10 11 01 10 11 01 d – – – 11 10 10 TABLE 15-13 Nonequivalent Assignments for Three and Four States © Cengage Learning 2014 Reduction of State Tables State Assignment 523 We will say that two state assignments are equivalent if one can be derived from the other by permuting and complementing columns. Two state assignments which are not equivalent are said to be distinct. Thus, a four-row table has three distinct state assign-ments, and any other assignment is equivalent to one of these three. Unfortunately, the number of distinct assignments increases very rapidly with the number of states, as shown in Table 15-14. Hand solution is feasible for two, three, or four states; computer solution is feasible for five through eight states; but for more than nine states it is not practical to try all assignments even if a high-speed computer is used.
15.8 Guidelines for State Assignment Because trying all nonequivalent state assignments is not practical in most cases, other methods of state assignment are needed. The next method to be discussed involves trying to choose an assignment which will place the 1’s on the flip-flop input maps in adjacent squares so that the corresponding terms can be combined. This method does not apply to all problems, and even when applicable, it does not guar-antee a minimum solution.
Assignments for two states are said to be adjacent if they differ in only one variable. Thus, 010 and 011 are adjacent, but 010 and 001 are not. The following guidelines are useful in making assignments which will place 1’s together (or 0’s together) on the next-state maps: 1. States which have the same next state for a given input should be given adjacent assignments.
2. States which are the next states of the same state should be given adjacent assignments.
A third guideline is used for simplification of the output function: 3. States which have the same output for a given input should be given adjacent assignments.
Number of States Minimum Number of State Variables Number of Distinct Assignments 2 1 1 3 2 3 4 2 3 5 3 140 6 3 420 7 3 840 8 3 840 9 4 10,810,800 · · · · · · · · · 16 4 ≈5.5 × 1010 TABLE 15-14 Number of Distinct (Nonequivalent) State Assignments © Cengage Learning 2014 524 Unit 15 The application of Guideline 3 will place 1’s together on the output maps.
When using the state assignment guidelines, the first step is to write down all of the sets of states which should be given adjacent assignments according to the guidelines. Then, using a Karnaugh map, try to satisfy as many of these adjacencies as possible. A fair amount of trial and error may be required to fill in the map so that the maximum number of desired state adjacencies is obtained. When filling in the map, keep in mind the following: (a) Assign the starting state (reset state) to the “0” square on the map. (For an exception to this rule, see the one-hot assignment in Section 15-9.) Nothing is to be gained by trying to put the starting state in different squares on the map because the same number of adjacencies can be found no matter where you put the starting state. Usually, assigning “0” to the starting state simplifies the initialization of the circuit using the clear inputs on the flip-flops.
(b) Adjacency conditions from Guideline 1 and adjacency conditions from Guide-line 2 that are required two or more times should be satisfied first.
(c) When guidelines require that three or four states be adjacent, these states should be placed within a group of four adjacent squares on the assignment map.
(d) If the output table is to be considered, then Guideline 3 should also be applied. The priority given to adjacency conditions from Guideline 3 should generally be less than that given to Guidelines 1 and 2 if a single output function is being derived. If there are two or more output functions, a higher priority for Guide-line 3 may be appropriate.
The following example should clarify the application of Guidelines 1 and 2. The state table from Table 15-9 is repeated in Figure 15-15(a) so that we can illustrate derivation of the state assignment. According to Guideline 1, S0, S2, S4, and S6 should be given adjacent assignments because they all have S1 as a next state (with input 0). Similarly, S0, S1, S3, and S5 should have adjacent assignments because they have S2 as a next state (with input 1); also, S3 and S5 should have adjacent assignments and so should S4 and S6. The application of Guideline 2 indicates that S1 and S2 should be 0 1 00 BC A 01 11 10 S0 S2 S4 S6 S0 S1 S3 S5 S5 S3 S1 S6 S4 S2 0 1 00 BC A 01 11 10 (b) Assignment maps ABC X 0 1 0 1 000 S0 S1 S2 0 0 110 S1 S3 S2 0 0 001 S2 S1 S4 0 0 111 S3 S5 S2 0 0 011 S4 S1 S6 0 0 101 S5 S5 S2 1 0 010 S6 S1 S6 0 1 (a) State table = FIGURE 15-15 © Cengage Learning 2014 Reduction of State Tables State Assignment 525 given adjacent assignments because they are both next states of S0. Similarly, S2 and S3 should have adjacent assignments because they are both next states of S1. Further application of Guideline 2 indicates that S1 and S4, S2 and S5 (two times), and S1 and S6 (two times) should be given adjacent assignments. In summary, the sets of adja-cent states specified by Guidelines 1 and 2 are 1. (S0, S1, S3, S5) (S3, S5) (S4, S6) (S0, S2, S4, S6) 2. (S1, S2) (S2, S3) (S1, S4) (S2, S5)2x (S1, S6)2x We will attempt to fulfill as many of these adjacency conditions as possible. A Karnaugh map will be used to make the assignments so that states with adjacent assignments will appear in adjacent squares on the map. If the guidelines require that three or four states be adjacent, these states should be placed within a group of four adjacent squares on the assignment map. Two possible ways of filling in the assign-ment maps are shown in Figure 15-15(b). These maps were filled in by trial and error, attempting to fulfill as many of the preceding adjacency conditions as possible. The conditions from Guideline 1 are given preference to conditions from Guideline 2. The conditions which are required two times (such as S2 adjacent to S5, and S1 adja-cent to S6) are given preference over conditions which are required only once (such as S1 adjacent to S2, and S2 adjacent to S3).
The left assignment map in Figure 15-15(b) implies an assignment for the states of flip-flops A, B, and C which is listed to the left of the state table in Figure 15-15(a). This assignment is the same as the one given in Equations (15-1). We derived the D flip-flop input equations and J and K input equations for this assignment in Section 15.6. The cost of realizing the D flip-flop input equations given in Figure 15-10(a) is six gates and 13 inputs. If a straight binary assignment (S0 = 000, S1 = 001, S2 = 010, etc.) were used instead, the cost of realizing the flip-flop input equations would be 10 gates and 39 inputs. Although application of the guidelines gives good results in this example, this is not always the case.
Next, we will explain why the guidelines help to simplify the flip-flop equations when the assignment of Figure 15-15(a) is used. Figure 15-16 shows a next-state map which was constructed using this assignment. Note that if X = 0 and ABC = 000, the next state is S1; if X = 1 and ABC = 000, the next state is S2. Because Guideline 1 was used in making the state assignment, S1 appears in four adjacent squares on the next-state map, S5 appears in two adjacent squares, etc.
The next-state maps for the individual flip-flops, Figure 15-16(b), can be derived in the usual manner from a transition table, or they can be derived directly from Figure 15-16(a). Using the latter approach, wherever S1 appears in Figure 15-16(a), it is replaced with 110 so that 1, 1 and 0 are plotted on the corresponding squares of the A+, B +, and C+ maps, respectively. The other squares on the next-state maps are filled in similarly.
Because four S1’s are adjacent in Figure 15-16(a), the corresponding squares on the A+, B +, and C+ maps have four adjacent 1’s or four adjacent 0’s as indicated by the blue shading. This illustrates why Guideline 1 helps to simplify the flip-flop equations. Each time Guideline 2 is applied, two out of the three next-state maps will 526 Unit 15 have an additional pair of adjacent 1’s or adjacent 0’s. This occurs because two of the three state variables are the same for adjacent assignments.
Next, we will apply the state assignment guidelines to Figure 15-17(a). First, we list the sets of adjacent states specified by each Guideline: 1. (b, d) (c, f ) (b, e) 2. (a, c)2x (d, f ) (b, d) (b, f ) (c, e) 3. (a, c) (b, d) (e, f ) Next, we try to arrange the states on a map so as to satisfy as many of these pairs as possible, but giving preference to the duplicated pairs (b, d ) and (a, c). Two such arrangements and the corresponding assignments are given in Figure 15-17(b) and (c). For Figure 15-17(c), all adjacencies are satisfied except (b, f ), (c, e), and (e, f ). We will derive D flip-flop input equations for this assignment. First, we construct the transition table (Table 15-15) from the state table (Figure 15-17(a)) by replacing a with 100, b with 111, c with 000, etc. Then, we plot the next-state and output maps FIGURE 15-16 Next-State Maps for Figure 15-15 © Cengage Learning 2014 X X 00 01 11 10 00 BC S1 S2 S1 S5 S2 S4 S1 S5 S2 S6 S1 S3 S2 S6 XA 01 11 10 Adjacent because S1, S3, and S5 have adjacent assignments Adjacent because S4 and S6 have adjacent assignments Adjacent because S3 and S5 have adjacent assignments Adjacent because S0, S2, S4, and S6 have adjacent assignments (a) Next-state maps for Figure 15-15 (b) Next-state maps for Figure 15-15 (cont.) 1 X X 1 00 01 11 10 1 0 0 1 1 0 0 1 1 00 01 11 10 1 0 1 0 X X 1 00 01 11 10 0 1 1 1 0 1 1 0 0 00 01 11 10 1 1 0 1 X X 0 00 01 11 10 1 1 0 0 1 1 0 0 1 00 BC XA A+ = DA = X′ B+ = DB = X′C′ + A′C + A′B C+ = DC = A + XB′ 01 11 10 1 0 0 These pairs are adjacent because S2 and S5 have adjacent assignments Reduction of State Tables State Assignment 527 (Figure 15-18) from the transition table. The D flip-flop input equations can be read directly from these maps: D1 = Q+ 1 = X′Q1Q2 ′ + XQ1 ′ D2 = Q+ 2 = Q3 D3 = Q+ 3 = XQ1 ′Q2 + X′Q3 and the output equation is Z = XQ2Q3 + X′Q2 ′Q3 + XQ2Q3 ′ The cost of realizing these equations is 10 gates and 26 gate inputs.
FIGURE 15-17 State Tables and Assignments 0 1 00 01 11 10 a d c a d f e c b f e b 0 1 00 01 11 10 ) c ( ) b ( ) a ( a = 000 b = 111 c = 100 d = 011 e = 101 f = 110 a = 100 b = 111 c = 000 d = 011 e = 101 f = 010 Q1 Q2Q3 Q1 Q2Q3 X 0 1 X 0 1 a a c 0 0 b d f 0 1 c c a 0 0 d d b 0 1 e b f 1 0 f c e 1 0 = = FIGURE 15-18 Next-State and Output Maps for Table 15-15 © Cengage Learning 2014 Q1 = D1 0 1 0 1 00 01 11 10 X 1 0 X 0 0 0 1 0 00 XQ1 Q2Q3 01 11 10 X X 1 + Q2 = D2 0 0 0 0 00 01 11 10 X 1 1 X 1 1 1 1 0 00 XQ1 Q2Q3 01 11 10 X X 0 + Q3 = D3 0 0 0 0 00 01 11 10 X 1 0 X 1 1 0 1 0 00 XQ1 Q2Q3 01 11 10 X X 1 + Z 0 0 0 0 00 01 11 10 X 1 0 X 0 0 1 1 1 00 XQ1 Q2Q3 01 11 10 X X 0 Q1Q2 Q3 Q1 +Q2 +Q3 + X = 0 1 X = 0 1 1 0 0 100 000 0 0 1 1 1 011 010 0 1 0 0 0 000 100 0 0 0 1 1 011 111 0 1 1 0 1 111 010 1 0 0 1 0 000 101 1 0 TABLE 15-15 Transition Table for Figure 15-17(a) © Cengage Learning 2014 © Cengage Learning 2014 528 Unit 15 The assignment of Figure 15-17(b) satisfies all of the guidelines except (d, f ) and (e, f ). Using this assignment, the cost of realizing the state table with D flip-flops is 13 gates and 35 gate inputs. We would expect that this assignment would produce better results than Figure 15-17(c) because it satisfies one more of the adjacencies given by the guidelines, but just the opposite is true. As illustrated by this example, the assignment which satisfies the most guidelines is not necessarily the best assign-ment. In general, it is a good idea to try several assignments which satisfy most of the guidelines and choose the one which gives the lowest cost solution.
The guidelines work best for D flip-flops and J-K flip-flops. They do not work as well for T and S-R flip-flops. In general, the best assignment for one type of flip-flop is not the best for another type.
15.9 Using a One-Hot State Assignment When designing with CPLDs and FPGAs, we should keep in mind that each logic cell contains one or more flip-flops. These flip-flops are there whether we use them or not. This means that it may not be important to minimize the number of flip-flops used in the design. Instead, we should try to reduce the total number of logic cells used and try to reduce the interconnections between cells. When several cells must be cascaded to realize a function as in Figure 9-40(b), the propagation delay is longer, and the logic runs slower. In order to design faster logic, we should try to reduce the number of cells required to realize each equation. Using a one-hot state assignment may help to accomplish this.
The one-hot assignment uses one flip-flop for each state, so a state machine with N states requires N flip-flops. Exactly one of the flip-flops is set to one in each state. For example, a system with four states (S0, S1, S2, and S3) could use four flip-flops (Q0, Q1, Q2, and Q3) with the following state assignment: S0: Q0 Q1 Q2 Q3 = 1000, S1: 0100, S2: 0010, S3: 0001 (15-2) The other 12 combinations are not used.
We can write next-state and output equations by inspecting the state graph. Con-sider the partial state graph given in Figure 15-19. Because four arcs lead into S3, there are four conditions under which the next state is S3. These conditions are as follows: FIGURE 15-19 Partial State Graph © Cengage Learning 2014 S0 S1 S3 S2 X1 Z1 X3 Z1 X2 Z2 X4 Z2 Reduction of State Tables State Assignment 529 present state (PS) = S0 and X1 = 1, PS = S1 and X2 = 1, PS = S2 and X3 = 1, PS = S3 and X4 = 1. The next state of flip-flop Q3 is 1 under these four conditions (and 0 other-wise). Therefore, the next-state equation for Q3 can be written as: Q+ 3 = X1 (Q0 Q1 ′ Q2 ′ Q3 ′) + X2 (Q0 ′ Q1 Q2 ′ Q3 ′) + X3 (Q0 ′ Q1 ′ Q2 Q3 ′) + X4 (Q0 ′ Q1 ′ Q2 ′ Q3) However, because Q0 = 1 implies Q1 = Q2 = Q3 = 0, the Q1 ′ Q2 ′ Q3 ′ term is redun-dant and can be eliminated. Similarly, all of the primed state variables can be elimi-nated from the other terms, so the next-state equation reduces to Q+ 3 = X1Q0 + X2Q1 + X3Q2 + X4Q3 In general, when a one-hot state assignment is used, each term in the next-state equation for each flip-flop contains exactly one state variable, and the reduced equa-tion can be written by inspecting the state graph.
Similarly, each term in each reduced output equation contains exactly one state variable. Because Z1 = 1 when PS = S0 and X1 = 1, and also when PS = S2 and X3 = 1, we can write Z1 = X1Q0 + X3Q2. By inspecting the state graph, we can also write Z2 = X2Q1 + X4Q3.
When a one-hot assignment is used, resetting the system requires that one flip-flop be set to 1 instead of resetting all flip-flops to 0. If the flip-flops used do not have a preset input, then we can modify the one-hot assignment by replacing Q0 with Q0 ′ throughout. For the Assignment (15-2), the modification is S0: Q0 Q1 Q2 Q3 = 0000, S1: 1100, S2: 1010, S3: 1001 (15-3) and the modified equations are: Q+ 3 = X1Q0 ′ + X2Q1 + X3Q2 + X4Q3 Z1 = X1Q0 ′ + X3Q2, Z2 = X2Q1 + X4Q3 For the Moore machine of Figure 14-23(b), we will make the following one-hot assignment for flip-flops Q0 Q1 Q2: S0 = 100, S1 = 010, and S2 = 001. When Q0 = 1, the state is S0; when Q1 = 1, the state is S1; and when Q2 = 1, the state is S2. By inspection, because three arcs lead into each state, the next-state equations are Q0 + = F′R′Q0 + FQ2 + F′RQ1 Q1 + = F′R′Q1 + FQ0 + F′RQ2 Q2 + = F′R′Q2 + FQ1 + F′RQ0 The output equations are trivial because each output occurs in only one state: Z1 = Q0, Z2 = Q1, Z3 = Q2 As another example, consider the state graph in Figure 15-20, which represents a sequential circuit that controls a binary multiplier. The circuit has three inputs (St, M, and K), and four outputs (Load, Ad, Sh, and Done). Starting in state S0, if St = 0, then the circuit stays in S0. If St = 1, the circuit outputs Load = 1 (the other outputs are 0), and the next state is S1. In S1, if M = 1, then Ad = 1 and the next state 530 Unit 15 is S2. If M = 0 and K = 0, the output is Sh = 1 and the next state is S1. If M = 0 and K = 1, the output is Sh = 1 and the next state is S3. In S2, the output is Sh = 1 for both K = 0 and K = 1. If K = 0, the next state is S1, and if K = 1, the next state is S3. In S3, the output is Done = 1 and the next state is S0.
Because there are four states, a one-hot state assignment requires four flip-flops. The one-hot assignments for each state are shown on the state graph. Only Q0 is 1 in S0 and the other Q’s are 0. Similarly, only Q1 is 1 in S1 and the other Q’s are 0, etc. To determine the next-state equation for Q0, note that two arrows lead into state S0. The loop from state S0 back to itself indicates Q+ 0 = 1 if Q0 = 1 and St = 0. The arrow from S3 to S0 indicates Q+ 0 = 1 if Q3 = 1. Therefore, Q0 + = Q0St′ + Q3 Because three arrows lead into S1, Q+ 1 has three terms: Q1 + = Q0St + Q1K′M′ + Q2K′ We can also determine the output functions by inspection of the state graph. In S0, Load = 1 when St = 1 and Load = 0 for all other states and inputs; therefore, Load = Q0St. The output Sh appears in four places on the graph. Sh = 1 in S1 if K′M′ = 1 or if KM′ = 1; also, Sh = 1 in S2 if K′ = 1 or K = 1. Therefore, Sh = Q1 (K′M′ + KM′) + Q2 (K′ + K) = Q1M′ + Q2 When designing with CPLDs or FPGAs, you should try both an assignment with a minimum number of state variables and a one-hot assignment to see which one leads to a design with the smallest number of logic cells. Alternatively, if the speed of operation is important, the design which leads to the fastest logic should be chosen. When a one-hot assignment is used, more next-state equations are required, but for some state graphs both the next-state and output equations may contain fewer variables. An equation with fewer variables may require fewer logic cells to realize. The more cells which are cascaded, the longer the propagation delay, and the slower the operation.
FIGURE 15-20 Multiplier Control State Graph © Cengage Learning 2014 Done S0 S1 S2 S3 K′M′ _ St′ 0 St Load Sh M Ad KM′ Sh K′ Sh K Sh Q0Q1Q2Q3 =1000 0001 0100 0010 Reduction of State Tables State Assignment 531 Problems 15.1 (a) Reduce the following state table to a minimum number of states.
Present State Next State Present Output X = 0 X = 1 X = 0 X = 1 A A E 1 0 B C F 0 0 C B H 0 0 D E F 0 0 E D A 0 0 F B F 1 0 G D H 0 0 H H G 1 0 (b) You are given two identical sequential circuits which realize the preceding state table. One circuit is initially in state B and the other circuit is initially in state G. Specify an input sequence of length three which could be used to distinguish between the two circuits and give the corresponding output sequence from each circuit.
15.2 Reduce the following state table to a minimum number of states.
Present State Next State Present Output (Z) X = 0 1 a e e 1 b c e 1 c i h 0 d h a 1 e i f 0 f e g 0 g h b 1 h c d 0 i f b 1 15.3 Digital engineer B. I. Nary has just completed the design of a sequential circuit which has the following state table: Present State Next State Output X = 0 1 0 1 S0 S5 S1 0 0 S1 S5 S6 0 0 S2 S2 S6 0 0 S3 S0 S1 1 0 S4 S4 S3 0 0 S5 S0 S1 0 0 S6 S5 S1 1 0 532 Unit 15 His assistant, F. L. Ipflop, who has just completed this course, claims that his design can be used to replace Mr. Nary’s circuit. Mr. Ipflop’s design has the following state table: Next State Output X = 0 1 0 1 a a b 0 0 b a c 0 0 c a b 1 0 (a) Is Mr. Ipflop correct? (Prove your answer.) (b) If Mr. Nary’s circuit is always started in state S0, is Mr. Ipflop correct? (Prove your answer by showing equivalent states, etc.) 15.4 Realize the following state table using a minimum number of AND and OR gates together with (a) a D flip-flop (b) an S-R flip-flop 15.5 It is sometimes possible to save logic by using more than the minimum number of flip-flops. For both (a) and (b), fill in each state assignment by columns and, then, check for duplicate rows instead of filling in the assignments by rows and checking for permuted columns. If the columns are assigned in ascending numerical order and the first row is all 0’s, then equivalent assignments will not be generated. Do not list degenerate assignments for which two columns are identical or complements of each other, or assignments where one column is all 0’s or all 1’s.
(a) Consider a state table with three states to be realized using three J-K flip-flops. To be sure of getting the minimum amount of logic, how many different state assignments must be tried? Enumerate these assignments.
(b) For four states and three flip-flops, 29 assignments must be tried. Enumerate 10 of these, always assigning 000 to the first state.
15.6 A sequential circuit with one input and one output has the following state table: X1X2X3 000 001 010 011 100 101 110 111 Z A A A B B B B A A 0 B A B B A A B B A 1 Present State Next State Present Output X = 0 X = 1 S1 S5 S4 0 S2 S1 S6 1 S3 S7 S8 1 S4 S7 S1 0 S5 S2 S3 1 S6 S4 S2 0 S7 S6 S8 0 S8 S5 S3 1 Reduction of State Tables State Assignment 533 (a) For this part of the problem, do not consider the flip-flop input equations (this means that you can ignore the next-state part of the table). Make a state assign-ment which might minimize the output equation, and derive the minimum out-put equation for your assignment.
(b) Forget about your solution to (a). Apply Guidelines 1 and 2 to make a state assignment, assigning 000 to S1. Derive input equations for D flip-flops using this assignment.
15.7 The following table is to be realized using D flip-flops.
(a) Find a good state assignment using the three guidelines (do not reduce the table first.) Try to satisfy as many of the adjacency conditions as possible.
(b) Using this assignment, derive the D flip-flop input equations and the output equations.
15.8 (a) For the following state table, use the three guidelines to determine which of the three possible nonequivalent state assignments should give the best solution.
X = 0 1 Z X = 0 1 A F D 0 0 B D B 0 0 C A C 0 1 D F D 0 0 E A C 0 1 F F B 0 0 Z1Z2 X1X2 = 00 01 11 10 X1X2 = 00 01 11 10 A A C B D 00 00 00 00 B B B D D 00 00 10 10 C C A C A 01 01 01 01 D B B C A 01 01 10 10 (b) Using your answer to (a), derive the T flip-flop input equations and the output equations.
15.9 Implement the given state graph using D flip-flops and gates. Use a one-hot assign-ment and write down the logic equations by inspecting the state graph.
S0 S2 S1 X′ S X P X P Y 0 X′ 0 XY′ PS X′Y′ P 534 Unit 15 15.10 (a) Reduce the following state table to a minimum number of states.
(b) You are given two identical sequential circuits which realize this state table. One circuit is initially in state d, and the other circuit is initially in state c. Specify an input sequence of length two which could be used to distinguish between the two circuits, and give the corresponding output sequence from each circuit.
15.11 For the following state table: (a) Reduce the table to a minimum number of states.
(b) Using the basic definition of state equivalence, show that state a is not equiva-lent to state b.
15.12 A Moore sequential circuit has a single input (X) and a single output (Z). Z is 1 if the most recent four inputs contained exactly two consecutive 1’s or exactly two con-secutive 0’s (i.e., the input sequences 0011, 0010, 1001, 1100, 0110, 0100, 1011, and 1101). (The initial state S0 acts as if the preceding inputs were all 0’s.) The following state table was constructed using a sufficient number of states to remember the last four inputs and the output for each state assigned according to the sequence remem-bered by that state.
(a) Reduce the table to a minimum number of states. (Hint: First use the simple exam-ple of state equivalence used in Section 15.1 to eliminate as many states as possible.) (b) For each state in the reduced table, give the input pattern remembered by that state.
(c) Convert the reduced table from part (a) into a Mealy state table that produces the same outputs.
(d) Reduce the Mealy state table to a minimum number of states.
Present State Next State Present Output X = 0 1 X = 0 1 a h c 1 0 b c d 0 1 c h b 0 0 d f h 0 0 e c f 0 1 f f g 0 0 g g c 1 0 h a c 1 0 Present State Next State Present Output X = 0 X = 1 X = 0 X = 1 a e g 0 1 b d f 0 1 c e c 1 0 d b f 0 1 e g f 0 1 f b d 1 0 g e c 1 0 Reduction of State Tables State Assignment 535 15.13 A sequential circuit has a single input (X) and a single output (Z). The circuit exam-ines each disjoint block of four inputs and determines whether the block is a valid BCD representation of a decimal digit; if not, Z = 1. State S0 is the initial state, and the circuit enters state S0 after the fourth input. The BCD digits are received most significant bit first. The following state table was constructed as a Mealy table using a sufficient number of states to remember the last three inputs with the output pro-duced when the fourth input bit of a block is received.
(a) Does the resulting table specify a Mealy or a Moore circuit?
(b) Reduce the state table to a minimum number of states. (Hint: Use the simple exam-ple of state equivalence used in Section 15.1 to eliminate as many states as possible.) (c) For each state in the reduced table, give the input pattern remembered by that state.
Input Pattern Present State Next State Output X = 0 X = 1 Z 0000 S0 S0 S1 0 0001 S1 S2 S3 0 0010 S2 S4 S5 1 0011 S3 S6 S7 1 0100 S4 S8 S9 1 0101 S5 S10 S11 0 0110 S6 S12 S13 1 0111 S7 S14 S15 0 1000 S8 S0 S1 0 1001 S9 S2 S3 1 1010 S10 S4 S5 0 1011 S11 S6 S7 1 1100 S12 S8 S9 1 1101 S13 S10 S11 1 1110 S14 S12 S13 0 1111 S15 S14 S15 0 Input Pattern Present State Next State Present Output Z X = 0 X = 1 X = 0 X = 1 – S1 S2 S3 0 0 0 S2 S4 S5 0 0 1 S3 S6 S7 0 0 00 S4 S8 S9 0 0 01 S5 S10 S11 0 0 10 S6 S12 S13 0 0 11 S7 S14 S15 0 0 000 S8 S1 S1 0 0 001 S9 S1 S1 0 0 010 S10 S1 S1 0 0 011 S11 S1 S1 0 0 100 S12 S1 S1 0 0 101 S13 S1 S1 1 1 110 S14 S1 S1 1 1 111 S15 S1 S1 1 1 536 Unit 15 15.14 A sequential circuit has a single input (X) and a single output (Z). The circuit exam-ines each disjoint block of four inputs and determines whether the block is a valid BCD representation of a decimal digit; if not, Z = 1. State S0 is the initial state, and the circuit enters state S0 after the fourth input. The BCD digits are received least significant bit first. A Mealy state table can be constructed using a sufficient number of states to remember the last three inputs with the output produced when the fourth input bit of a block is received.
(a) Using the method indicated by Problem 15.13, construct a state table for this circuit.
(b) Reduce the state table to a minimum number of states. (Hint: Use the simple example of state equivalence used in Section 15.1 to eliminate as many states as possible.) (c) For each state in the reduced table, give the input pattern(s) remembered by that state.
15.15 Reduce each of the following state tables to a minimum number of states: (a) XY = 00 01 11 10 Z a a c e d 0 b d e e a 0 c e a f b 1 d b c c b 0 e c d f a 1 f f b a d 1 (b) X = 0 1 0 1 a b c 1 0 b e d 1 0 c g d 1 1 d e b 1 0 e f g 1 0 f h b 1 1 g h i 0 1 h g i 0 1 i a a 0 1 15.16 Reduce each of the following tables to a minimum number of states: (a) XY = 00 01 11 10 Z a b i c g 0 b b c f g 0 c h d d f 1 d h c e g 1 e b c i g 0 f f i i k 0 g j k g h 0 h e f c g 0 i i i i d 0 j b f c g 0 k a c e g 1 Reduction of State Tables State Assignment 537 15.17 Circuits N and M have the state tables that follow.
(a) Without first reducing the tables, determine whether circuits N and M are equivalent.
(b) Reduce each table to a minimum number of states, and then show that N is equivalent to M by inspecting the reduced tables.
(b) XY = 00 01 11 10 XY = 00 01 11 10 a a a g k 1 0 0 0 b c f g d 0 0 0 0 c g c a i 1 0 0 0 d a d g i 1 0 0 0 e f h g a 0 0 0 0 f g c d k 1 0 0 0 g c j g e 0 1 0 0 h g h d k 1 0 0 0 i h h g d 0 0 0 0 j j j g k 1 0 0 0 k c c g d 0 0 0 0 M X = 0 1 S0 S3 S1 0 S1 S0 S1 0 S2 S0 S2 1 S3 S0 S3 1 N X = 0 1 A E A 1 B F B 1 C E D 0 D E C 0 E B D 0 F B C 0 15.18 Below is an incompletely specified state table.
(a) Reduce the state table to four states in two different ways by filling in the don’t-care in the state table in different ways.
(b) Show that your two state tables in part (a) are not equivalent, using an implica-tion table similar to Figure 15-7 .
(c) Show that your two state tables in (a) are not equivalent by giving a short input sequence which gives different outputs for the two state tables.
Present State Next State Present Output (Z ) X = 0 1 S0 S1 S0 0 S1 S0 S2 0 S2 S3 S4 1 S3 S0 S3 0 S4 S0 – 0 538 Unit 15 15.19 Repeat 15.18 for this state table (four states).
Present State Next State Present Output (Z) X = 0 1 X = 0 1 S0 S1 S5 0 0 S1 S3 S2 1 1 S2 S2 S4 0 1 S3 S4 S2 1 1 S4 S4 S2 – 1 S5 S5 S2 0 1 (i) (ii) (iii) (iv) (v) S0 000 010 100 110 001 S1 001 111 101 010 111 S2 010 001 000 111 101 S3 011 110 001 011 011 S4 100 000 111 000 000 S5 101 100 110 100 010 15.20 The following are possible state assignments for a six-state sequential circuit.
(a) Which two state assignments are equivalent?
(b) For each assignment (except (i)), give an equivalent assignment for which state S0 is assigned to 000.
(c) Give a state assignment which is not equivalent to any of the assignments.
15.21 (a) For an eight-state sequential circuit using three flip-flops, give three state assign-ments that assign 000 to S0 and are equivalent to a straight binary assignment.
(b) Give three state assignments that assign 111 to S0 and are not equivalent to a straight binary assignment or to each other.
15.22 A sequential circuit with one input and one output has the following state table: Present State Next State Present Output X = 0 X = 1 A D G 1 B E H 0 C B F 1 D F G 0 E C A 1 F H C 0 G E A 1 H D B 0 (a) For this part of the problem, do not consider the flip-flop input equations (this means that you can ignore the next-state part of the table). Make a state assign-ment which will minimize the output equation, and derive the minimum output equation for your assignment.
Reduction of State Tables State Assignment 539 (b) Forget about your solution to (a). Apply Guidelines 1 and 2 to make a state assignment, assigning 000 to A. Derive input equations for D flip-flops using this assignment.
15.23 (a) For the following state table, use the three guidelines to determine which of the three possible nonequivalent state assignments should give the best solution.
Z1Z2 X1X2 = 00 01 11 10 X1X2 = 00 01 11 10 A A A C C 01 01 01 01 B B D B D 11 11 11 11 C A A B D 11 11 00 00 D D B A C 01 01 01 01 (b) Using your answer to (a), derive J-K flip-flop input equations and the output equations.
15.24 Consider the following Moore sequential circuit.
(a) Derive the equations for a one-hot state assignment.
(b) Use Guidelines 1 and 2 to make a “good” state assignment using three state variables. Derive the next-state equations assuming D flip-flops are used.
Present State Next State Present Output Z X = 0 X = 1 A B A 0 B C A 0 C E D 0 D B A 1 E E A 0 15.25 (a) Reduce the following state table to a minimum number of states using implica-tion charts.
(b) Use the guideline method to determine a suitable state assignment for the reduced table.
(c) Realize the table using D flip-flops.
(d) Realize the table using J-K flip-flops.
X = 0 1 Z A A B 1 B C E 0 C F G 1 D C A 0 E I G 1 F H I 1 G C F 0 H F B 1 I C E 0 540 Unit 15 15.26 Repeat Problem 15.25 for the following table: X = 0 1 Z A I C 1 B B I 1 C C G 1 D I C 0 E D E 0 F I C 0 G E F 0 H H A 1 I A C 1 15.27 Make a suitable state assignment and realize the state graph of Figure 14-10 using: (a) D flip-flops (b) S-R flip-flops 15.28 Make a suitable state assignment and realize the state graph of Figure 14-13 using: (a) J-K flip-flops (b) T flip-flops 15.29 Make a suitable state assignment and realize the state table of Problem 14.22 using D flip-flops and NAND gates.
15.30 Make a suitable state assignment and realize the state table of Problem 14.5 using J-K flip-flops and NAND gates.
15.31 Reduce the state table of Problem 14.6 to a minimum number of rows. Then, make a suitable state assignment and realize the state table using D flip-flops.
15.32 Reduce the state table of Problem 14.23 to a minimum number of rows. Then, make a suitable state assignment and realize the state table using D flip-flops.
15.33 A logic designer who had not taken this course designed a sequential circuit with an input W using three T flip-flops, A, B, and C. The input equations for these flip-flops are TA = W′A′B + W′BC′ + A′BC′ + AB′C + WB′C + WAC TB = W′A′C + W′A′B + A′BC + AB′C′ + WB′C′ + WAC′ TC = W′AC + W′B′C′ + WBC + WA′C′ and the output equation is Z = W′BC′. Find an equivalent sequential circuit which uses fewer states. Realize it, trying to minimize the amount of logic required.
15.34 Modify the given state graph so that it is completely specified. Assume that if X = Y = 1, X takes precedence. Then implement the state graph using D flip-flops Reduction of State Tables State Assignment 541 and gates. Use a one-hot assignment and write down the logic equations by inspect-ing the state graph.
X′Y X′Y′ 0 XY′ 0 XY S X S Y S P Y 0 X 0 S1 S2 S3 S0 15.35 Implement the following state graph using D flip-flops and gates. Use a one-hot assignment and write down the logic equations by inspecting the state graph.
S0 X′Y S1 S2 0 XY′ 0 X′Y′ 0 X′Y Z X′Y Z X Y 0 XY 0 , XY Z Y′ 0 Y′ 0 15.36 A state graph for a single-input sequential circuit is given. Implement the circuit using a three-bit parallel loading counter that has the given operation table. Label the counter outputs Q2, Q1, Q0, where Q0 is the least significant bit and the parallel inputs P2, P1, P0. (Hint: Because the Ld signal overrides the Cnt signal, the counting sequence can easily be changed by doing a parallel load at the appropriate times.) Clr Ld Cnt Function 0 — — Clear 1 1 — Parallel Load 1 0 1 Increment 1 0 0 Hold (No change) 000 0,1 001 011 010 0 0,1 0,1 1 542 Unit 15 15.37 Consider the following Mealy sequential circuit.
Present State Next State Present Output X = 0 X = 1 X = 0 X = 1 A B A 0 0 B C A 0 0 C D A 0 1 D D A 0 0 (a) Use a one-hot state assignment, and implement the circuit using D flip-flops.
(b) Use the state assignment A = 00, B = 01, C = 11, and D = 10, and implement the circuit using D flip-flops.
(c) Implement the circuit using a 4-bit parallel loading counter instead of flip-flops for memory. Assume the synchronous counter controls are as follows: s1 s0 Function 0 0 Hold 0 1 Increment 1 0 Parallel load 1 1 Clear Q3Q2Q1Q0 are the outputs; P3P2P1P0 are the parallel inputs; and Q0 is the least significant bit of the counter. (With the proper state assignment, this can be done without using the parallel load function of the counter.) (d) Implement the circuit using a 4-bit parallel loading shift register instead of flip-flops for memory. Assume the synchronous shift register controls are as follows: S1 S0 Function 0 0 Hold 0 1 Shift right 1 0 Parallel load 1 1 Clear Sin is the input for the shift; Q3Q2Q1Q0 are the outputs; P3P2P1P0 are the parallel inputs. When shifting, Sin →Q3, Q3 →Q2, Q2 →Q1, Q1 →Q0. (With the proper state assignment, this can be done without using the parallel load function of the shift register.) 15.38 A sequential circuit contains two D flip-flops; the excitation equations for the flip-flops are D1 = XQ1 + XQ2 and D2 = XQ1 + XQ2′.
(a) Convert the circuit into an equivalent one where each D flip-flop is replaced by a T flip-flop. Do this by converting the next-state equations into the form for a T flip-flop. (Hint: MQ + NQ′ = (M′Q + NQ′)′Q + (M′Q + NQ′)Q′.) (b) Repeat part (a) by constructing an excitation table for the T flip-flops (i.e., a truth table for T1 and T2 as a function of X, Q1, and Q2).
Reduction of State Tables State Assignment 543 (c) Convert the circuit into an equivalent one where each D flip-flop is replaced by a J-K flip-flop. Do this by converting the next-state equations into the form for a J-K flip-flop.
(d) Repeat part (c) by constructing an excitation table for the J-K flip-flops (i.e., a truth table for the J and K flip-flop inputs as a function of X, Q1, and Q2).
15.39 A sequential circuit contains two J-K flip-flops; the excitation equations for the flip-flops are J1 = Q2, K1 = Q1, J2 = X + Q1 ′, and K2 = 1.
(a) Convert the circuit into an equivalent one where each J-K flip-flop is replaced by a T flip-flop. Do this by converting the next-state equations into the form for a T flip-flop. (Hint: MQ + NQ′ = (M′Q + NQ′)′Q + (M′Q + NQ′)Q′.) (b) Repeat part (a) by constructing an excitation table for the T flip-flops (i.e., a truth table for T1 and T2 as a function of X, Q1, and Q2).
(c) Convert the circuit into an equivalent one where each D flip-flop is replaced by an S-R flip-flop. Do this by converting the next-state equations into the form for a S-R flip-flop.
(d) Repeat part (c) by constructing an excitation table for the S-R flip-flops (i.e., a truth table for the S and R flip-flop inputs as a function of X, Q1, and Q2).
15.40 Show that the following incompletely specified table can be reduced to a table with seven states. (Hint: This table can be reduced by applying row matching where a don’t-care “matches” anything.) Present State Next State Output (Z) X = 0 X = 1 X = 0 X = 1 S0 S1 S2 0 0 S1 S3 S4 0 0 S2 S5 S6 0 0 S3 S7 S8 0 0 S4 S8 S9 0 0 S5 S10 S9 0 0 S6 S9 S8 0 0 S7 S0 S0 1 0 S8 S0 – 0 – S9 S0 – 1 – S10 S0 S0 0 1 15.41 (a) Find the maximal compatibles for Table 14-10.
(b) Reduce the table to a minimum number of states.
(c) Consider a circuit designed from the reduced table. Describe in words the func-tion of the circuit.
15.42 (a) Find the maximal compatibles for Table 14-9. (There are seven.) (b) Reduce the table to a minimum number of states.
544 Unit 15 15.43 Modify the BCD Parity Generator of Table 14-9 so that the outputs are don’t-cares for the first three inputs. The new state table is given below.
(a) Find the maximal compatibles for this table. (There are eight.) (b) Reduce this table to a minimum number of states.
Present State Next State Output X = 0 X = 1 X = 0 X = 1 S0 S1 S2 – – 0 S1 S3 S4 – – 1 S2 S5 S6 – – 00 S3 S0 S0 1 0 01 S4 S0 – 0 – 10 S5 S0 S0 0 1 11 S6 S0 – 1 – Present State Next State Output X = 0 X = 1 X = 0 X = 1 S0 S1 S2 – – S1 S3 S4 – – S2 S5 – – – S3 S6 S7 – – S4 S7 S6 – – S5 S7 – – – S6 S0 S0 1 0 S7 S0 S0 0 1 15.44 (a) Find the maximal compatibles for the incompletely specified table below.
(b) Reduce the table to a minimum number of states.
15.45 (a) Find the maximal compatibles for the table below. (There are eight.) (b) Try reducing the table using the maximal compatibles. How many states are required?
(c) Show that this table can be reduced to six states using pairs of compatible states. (This is an example of a table that cannot be reduced using only maximal compatibles.) Present State Next State Output (Z) X = 0 X = 1 X = 0 X = 1 S0 S1 S2 – – S1 S3 S4 – – S2 S4 S3 – – S3 S5 S6 – – S4 S6 S5 – – S5 S0 S0 1 0 S6 S0 S0 0 1 545 Sequential Circuit Design U N I T 16 Objectives 1. Design a sequential circuit using gates and flip-flops.
2. Test your circuit by simulating it and by implementing it in lab.
3. Design a unilateral iterative circuit. Explain the relationship between iterative and sequential circuits, and convert from one to the other.
4. Show how to implement a sequential circuit using a ROM or PLA and flip-flops.
5. Explain the operation of CPLDs and FPGAs and show how they can be used to implement sequential logic.
546 Unit 16 Study Guide 1. Study Sections 16.1, Summary of Design Procedure for Sequential Circuits, and 16.2, Design Example—Code Converter.
(a) Why are the states in the next-state part of Table 16-2 listed in a different order from the states in Table 15-1?
(b) Consider the design of a sequential circuit to convert an 8-4-2-1 code to a 6-3-1-1 code (see Table 1-2). If the least significant bit of an 8-4-2-1 coded digit is fed into the circuit at t0, can the least significant bit of the 6-3-1-1 coded digit be determined immediately? Explain. Why can the technique described in this section not be used to design the 8-4-2-1 to 6-3-1-1 code converter?
2. Study Section 16.3, Design of Iterative Circuits (a) Draw a state graph for the comparator of Table 16-4. Compare several pairs of binary numbers using the scheme represented by Table 16-4 and make sure you understand why this method works. Draw a circuit similar to Figure 16-6 with five cells. Show the values of all the cell inputs and outputs if X = 10101 and Y = 10011.
(b) If the state table for a typical cell of an iterative circuit has n states, what is the minimum number of signals required between each pair of adjacent cells?
(c) Work Problem 16.17 .
3. Study Section 16.4, Design of Sequential Circuits Using ROMs and PLAs.
(a) Review Section 9.5, Read-Only Memories, and Section 9.6, Programmable Logic Devices.
(b) What size ROM would be required to realize a state table with 13 states, two input variables, and three output variables?
(c) In going from Table 16-6(b) to 16-6(c), note that for X = 0, Q1Q2Q3 = 000, Z = 1, and Q+ 1 Q+ 2 Q+ 3 = D1D2D3 = 001; therefore, 1001 is entered in the first row of the truth table. Verify that the other truth table entries are correct.
(d) Continue the analysis of the PLA realization of the code converter which was started in the paragraph following Table 16-7 . In particular, if Q1Q2Q3 = 100 and X = 1, what will be the PLA outputs? What will the state be after the clock?
Sequential Circuit Design 547 (e) Work Problems 16.15 and 16.16.
4. Study Section 16.5, Sequential Circuit Design Using CPLDs, and Section 16.6, Sequential Circuit Design Using FPGAs.
(a) How many macrocells of a CoolRunner-II are needed to implement a Moore machine with six states, one input, and two outputs? With two inputs?
(b) How many LUT’s of a Virtex/Spartan II are needed to implement each of these Moore machines? How many CLB’s?
(c) Rewrite the equations for Q+ 2, Q+ 1 , and Q+ 0 of Equations 12-1 to fit into one LUT each, as we did for Q+ 3 in Equation (16-2), using CE = Ld + Sh.
5. Study Section 16.7 , Simulation and Testing of Sequential Circuits.
(a) Observe the simulator output of Figure 16-23(b), and note the times at which the Z output changes. Assuming that each gate and flip-flop in Figure 16-22 has a 10-ns delay, explain the Z waveform.
(b) Suppose that you are testing the circuit of Figure 16-4, and that when you set X = 0 and Q1Q2Q3 = 011 and pulse the clock, the circuit goes to state 100 instead of 000. What would you do to determine the cause of the malfunction?
6. Read Section 16.8, Overview of Computer-Aided Design, for general information.
7. Work out your assigned design problem by hand. Then, use LogicAid to check your state table using the state table checker, and then verify that your logic equations are correct. Try at least two different state assignments and choose the one which requires the smallest number of logic gates.
8. Answer the following questions before you simulate your circuit or test it in lab. At which of the following times will the output of your circuit be correct? (If you are not absolutely sure that your answer is correct, review Section 13.2, paying particular attention to the timing charts for Mealy circuits.) (a) Just before the rising clock edge (b) Just after the rising clock edge (after the state has changed but before the input is changed to the next value) (c) After the input has been changed to the next value, but before the next rising edge occurs 9. (a) Explain how it is possible to get false outputs from your circuit even though the circuit is correctly designed and working properly.
548 Unit 16 (b) If the output of your circuit was fed into another sequential circuit using the same clock, would the false outputs cause any problems? Explain.
10. When you get your circuit working properly, determine the output sequences for the given test sequences. Demonstrate the operation of your circuit to a proctor and have him or her check your output sequences. After successful com-pletion of the project, turn in your design and the test results. (No readiness test is required.) Sequential Circuit Design We have already studied the various steps in sequential circuit design—derivation of state tables (Unit 14), state table reduction (Unit 15), state assignment (Unit 15), and derivation of flip-flop input equations (Units 12 and 15). This unit contains a summary of the design procedure, a comprehensive design example, and procedures for testing your circuit in lab.
16.1 Summary of Design Procedure for Sequential Circuits 1. Given the problem statement, determine the required relationship between the input and output sequences and derive a state table. For many problems, it is easiest to first construct a state graph.
2. Reduce the table to a minimum number of states. First, eliminate duplicate rows by row matching and, then, form an implication table and follow the procedure in Section 15.3.
Sequential Circuit Design 549 3. If the reduced table has m states (2n–1 < m ≤2n), n flip-flops are required. Assign a unique combination of flip-flop states to correspond to each state in the reduced table. The guidelines given in Section 15.8 may prove helpful in finding an assignment which leads to an economical circuit.
4. Form the transition table by substituting the assigned flip-flop states for each state in the reduced state table. The resulting transition table specifies the next states of the flip-flops, and the output in terms of the present states of the flip-flops and the input.
5. Plot next-state maps and input maps for each flip-flop and derive the flip-flop input equations. (Depending on the type of gates to be used, either determine the sum-of-products form from the 1’s on the map or the product-of-sums form from the 0’s on the map.) Derive the output functions.
6. Realize the flip-flop input equations and the output equations using the avail-able logic gates.
7. Check your design by signal tracing, computer simulation, or laboratory testing.
16.2 Design Example—Code Converter We will design a sequential circuit to convert BCD to excess-3 code. This circuit adds three to a binary-coded-decimal digit in the range 0 to 9. The input and output will be serial with the least significant bit first. A list of allowed input and output sequences is shown in Table 16-1.
Table 16-1 lists the desired inputs and outputs at times t0, t1, t2, and t3. After receiving four inputs, the circuit should reset to the initial state, ready to receive another group of four inputs. It is not clear at this point whether a sequential circuit can actually be realized to produce the output sequences as specified in Table 16-1 without delaying the output.
X Input (BCD) Z Output (excess-3) t3 t2 t1 t0 t3 t2 t1 t0 0 0 0 0 0 0 1 1 0 0 0 1 0 1 0 0 0 0 1 0 0 1 0 1 0 0 1 1 0 1 1 0 0 1 0 0 0 1 1 1 0 1 0 1 1 0 0 0 0 1 1 0 1 0 0 1 0 1 1 1 1 0 1 0 1 0 0 0 1 0 1 1 1 0 0 1 1 1 0 0 TABLE 16-1 © Cengage Learning 2014 550 Unit 16 For example, if at t0 some sequences required an output Z = 0 for X = 0 and other sequences required Z = 1 for X = 0, it would be impossible to design the cir-cuit without delaying the output. For Table 16-1 we see that at t0 if the input is 0 the output is always 1, and if the input is 1 the output is always 0; therefore, there is no conflict at t0. At time t1 the circuit will have available only the inputs received at t1 and t0. There will be no conflict at t1 if the output at t1 can be determined only from the inputs received at t1 and t0. If 00 has been received at t1 and t0, the output should be 1 at t1 in all three cases where 00 occurs in the table. If 01 has been received, the output should be 0 at t1 in all three cases where 01 occurs. For sequences 10 and 11 the outputs at t1 should be 0 and 1, respectively. Therefore, there is no output conflict at t1. In a similar manner we can check to see that there is no conflict at t2, and at t3 all four inputs are available, so there is no problem.
We will now proceed to set up the state table (Table 16-2), using the same pro-cedure as in Section 15.1. The arrangement of next states in the table is different from that in Table 15-1 because in this example the input sequences are received with least significant bit first, while for Table 15-1 the first input bit received is listed first in the sequence. Dashes (don’t-cares) appear in this table because only 10 of the 16 possible 4-bit sequences can occur as inputs to the code converter. The output part of the table is filled in, using the reasoning discussed in the preceding paragraph. For example, if the circuit is in state B at t1 and a 1 is received, this means that the sequence 10 has been received and the output should be 0.
Next, we will reduce the table using row matching. When matching rows which contain dashes (don’t-cares), a dash will match with any state or with any output value. By matching rows in this manner, we have H ≡I ≡J ≡K ≡L and M ≡N ≡P. After eliminating I, J, K, L, N, and P, we find E ≡F ≡G and the table reduces to seven rows (Table 16-3).
Time Input Sequence Received (Least Significant Bit First) Present State Next State Present Output (Z ) X = 0 1 X = 0 1 t0 reset A B C 1 0 t1 0 B D F 1 0 1 C E G 0 1 t2 00 D H L 0 1 01 E I M 1 0 10 F J N 1 0 11 G K P 1 0 t3 000 H A A 0 1 001 I A A 0 1 010 J A − 0 − 011 K A − 0 − 100 L A − 0 − 101 M A − 1 − 110 N A − 1 − 111 P A − 1 − TABLE 16-2 State Table for Code Converter © Cengage Learning 2014 Sequential Circuit Design 551 An alternate approach to deriving Table 16-2 is to start with a state graph. The state graph (Figure 16-1) has the form of a tree. Each path starting at the reset state represents one of the ten possible input sequences. After the paths for the input sequences have been constructed, the outputs can be filled in by working backward along each path. For example, starting at t3, the path 0 0 0 0 has outputs 0 0 1 1 and the path 1 0 0 0 has outputs 1 0 1 1. Verify that Table 16-2 corresponds to this state graph.
Three flip-flops are required to realize the reduced table because there are seven states. Each of the states must be assigned a unique combination of flip-flop states. Some assignments will lead to economical circuits with only a few gates, while other assignments will require many more gates. Using the guidelines given in Section 15.8, states B and C, D and E, and H and M should be given adjacent assignments in order to simplify the next-state functions. To simplify the output function, states (A, B, E, and M) and (C, D, and H) should be given adjacent assignments. A good assignment for this example is given on the map and table in Figure 16-2. After the state assignment has been made, the transition table is filled in according to the assignment, and the next-state maps are plotted as shown in Figure 16-3. The D input equations are then read off the Q+ maps as indicated. Figure 16-4 shows the result-ing sequential circuit.
FIGURE 16-1 State Graph for Code Converter © Cengage Learning 2014 t0 t1 t2 t3 A N I J L H P G C E F B D K M Reset 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 1 0 1 0 1 0 1 1 0 1 0 1 0 1 0 1 0 1 1 1 1 1 1 1 1 Time Present State Next State Present Output (Z ) X = 0 1 X = 0 1 t0 A B C 1 0 t1 B D E 1 0 C E E 0 1 t2 D H H 0 1 E H M 1 0 t3 H A A 0 1 M A − 1 − TABLE 16-3 Reduced State Table for Code Converter © Cengage Learning 2014 552 Unit 16 FIGURE 16-3 Karnaugh Maps for Code Converter Design © Cengage Learning 2014 D3 = Q+ 3=Q1Q2Q3+X′Q1Q′ 3+XQ′ 1Q′ 2 D2=Q2 +=Q1 D1 = Q1 +=Q2 1 1 1 1 00 01 11 10 X 1 1 X 0 0 0 0 0 0 0 00 XQ1 Q2Q3 01 11 10 X 0 1 1 0 00 01 11 10 X 1 1 X 0 1 1 0 0 1 1 00 XQ1 Q2Q3 01 11 10 X 0 1 0 1 00 01 11 10 X 0 0 X 0 1 1 0 0 1 0 00 XQ1 Q2Q3 01 11 10 X Z =X′Q′ 3+XQ3 1 1 0 0 00 01 11 10 X 0 1 X 0 0 1 1 1 1 0 00 XQ1 Q2Q3 01 11 10 X ′ FIGURE 16-4 Code Converter Circuit © Cengage Learning 2014 Q3 A6 A5 Z Q 2 D FF1 G1 G2 G3 G4 G5 G6 Q′ Q D FF2 I1 Q′ Q D FF3 Q′ Q Q1 Q1 CLK Q1 Q1 A1 A2 A3 D3 X X′ Q1 ′ ′ Q 1 Q2 Q3 Q3 X′ X ′ Q2 Q2 Q3 ′ Q2 ′ ′ ′ G7 Q+ 1 Q+ 2 Q+ 3 Z Q1Q2Q3 X = 0 X = 1 X = 0 X = 1 A 0 0 0 1 0 0 1 0 1 1 0 B 1 0 0 1 1 1 1 1 0 1 0 C 1 0 1 1 1 0 1 1 0 0 1 D 1 1 1 0 1 1 0 1 1 0 1 E 1 1 0 0 1 1 0 1 0 1 0 H 0 1 1 0 0 0 0 0 0 0 1 M 0 1 0 0 0 0 x x x 1 x – 0 0 1 x x x x x x x x (b) Transition table 0 1 00 Q2Q3 Q1 01 11 10 A B H D M E C (a) Assignment map FIGURE 16-2 Assignment Map and Transition Table for Flip-Flops © Cengage Learning 2014 Sequential Circuit Design 553 16.3 Design of Iterative Circuits Many of the design procedures used for sequential circuits can be applied to the design of iterative circuits. An iterative circuit consists of a number of identical cells intercon-nected in a regular manner. Some operations, such as binary addition, naturally lend themselves to realization with an iterative circuit because the same operation is per-formed on each pair of input bits. The regular structure of an iterative circuit makes it easier to fabricate in integrated circuit form than circuits with less regular structures.
The simplest form of an iterative circuit consists of a linear array of combina-tional cells with signals between cells traveling in only one direction (Figure 16-5). Each cell is a combinational circuit with one or more primary inputs (xi) and pos-sibly one or more primary outputs (zi). In addition, each cell has one or more sec-ondary inputs (ai) and one or more secondary outputs (ai +1). The ai signals carry information about the “state” of one cell to the next cell.
The primary inputs to the cells (x1, x2, . . . , xn) are applied in parallel; that is, they are all applied at the same time. The ai signals then propagate down the line of cells. Because the circuit is combinational, the time required for the circuit to reach a steady-state condition is determined only by the delay times of the gates in the cells. As soon as steady state is reached, the outputs may be read. Thus, the iterative circuit can func-tion as a parallel-input, parallel-output device, in contrast with the sequential circuit in which the input and output are serial. One can think of the iterative circuit as receiving its inputs as a sequence in space in contrast with the sequential circuit which receives its inputs as a sequence in time. The parallel adder of Figure 4-3 is an example of an iterative circuit that has four identical cells. The serial adder of Figure 13-12 uses the same full adder cell as the parallel adder, but it receives its inputs serially and stores the carry in a flip-flop instead of propagating it from cell to cell.
Design of a Comparator As an example, we will design a circuit which compares two n-bit binary numbers and determines if they are equal or which one is larger if they are not equal. Direct design as a 2n-input combinational circuit is not practical for n larger than 4 or 5, so we will try the iterative approach. Designate the two binary numbers to be compared as X = x1x2 . . . xn and Y = y1y2 . . . yn We have numbered the bits from left to right, starting with x1 as the most significant bit because we plan to do the comparison from left to right.
FIGURE 16-5 Unilateral Iterative Circuit © Cengage Learning 2014 a1 a2 Z1 X1 Cell 1 a3 Z2 X2 Cell 2 a4 Z3 X3 Cell 3 ai ai + 1 Zi Xi Cell i an an + 1 Zn Xn Cell n ...
...
554 Unit 16 Figure 16-6 shows the form of the iterative circuit, although the number of leads between each pair of cells is not yet known. Comparison proceeds from left to right. The first cell compares x1 and y1 and passes on the result of the comparison to the next cell, the second cell compares x2 and y2, etc. Finally, xn and yn are compared by the last cell, and the output circuit produces signals to indicate if X = Y, X > Y, or X < Y.
We will now design a typical cell for the comparator. To the left of cell i, three conditions are possible: X = Y so far (x1 x2 . . . xi–1 = y1y2 . . . yi–1), X > Y so far, and X < Y so far. We designate these three input conditions as states S0, S1, and S2, respec-tively. Table 16-4 shows the output state at the right of the cell (Si+1) in terms of the xiyi inputs and the input state at the left of the cell (Si). If the numbers are equal to the left of cell i and xi = yi, the numbers are still equal including cell i, so Si+1 = S0. However, if Si = S0 and xiyi = 10, then x1x2 . . . xi > y1y2 . . . yi and Si+1 = S1. If X > Y to the left of cell i, then regardless of the values of xi and yi, x1x2 . . . xi > y1y2 . . . yi and Si+1 = S1. Similarly, if X < Y to the left of cell i, then X < Y including the inputs to cell i, and Si+1 = S2.
FIGURE 16-6 Form of Iterative Circuit for Comparing Binary Numbers © Cengage Learning 2014 a1 a2 x1 Cell 1 a3 x2 Cell 2 y1 y2 ai ai + 1 Z1(X < Y) Z2(X = Y) Z3(X > Y) xi yi Cell i xn yn Cell n an an + 1 Output Cir-cuit ...
b1 b2 b3 bi ...
...
bi + 1 bn bn + 1 ...
The logic for a typical cell is easily derived from the state table. Because there are three states, two intercell signals are required. Using the guidelines from Section 15.8 leads to the state assignment aibi = 00 for S0, 01 for S1, and 10 for S2. Substituting this assignment into the state table yields Table 16-5. Figure 16-7 shows the Karnaugh maps, next-state equations, and the realization of a typical cell using NAND gates. Inverters must be included in the cell because only ai and bi and not their comple-ments are transmitted between cells.
The a1b1 inputs to the left end cell must be 00 because we must assume that the numbers are equal (all 0) to the left of the most significant bit. The equations for the first cell can then be simplified if desired: a2 = a1 + x1 ′y1b1 ′ = x1 ′y1 b2 = b1 + x1y1 ′a1 ′ = x1y1 ′ Si+1 Si xiyi = 00 01 11 10 Z1 Z2 Z3 X = Y S0 S0 S2 S0 S1 0 1 0 X > Y S1 S1 S1 S1 S1 0 0 1 X < Y S2 S2 S2 S2 S2 1 0 0 TABLE 16-4 State Table for Comparator ai+1bi+1 aibi xiyi = 00 01 11 10 Z1 Z2 Z3 0 0 00 10 00 01 0 1 0 0 1 01 01 01 01 0 0 1 1 0 10 10 10 10 1 0 0 TABLE 16-5 Transition Table for Comparator © Cengage Learning 2014 © Cengage Learning 2014 Sequential Circuit Design 555 For the output circuit, let Z1 = 1 if X < Y, Z2 = 1 if X = Y, Z3 = 1 if X > Y. Figure 16-8 shows the output maps, equations, and circuit.
Conversion to a sequential circuit is straightforward. If xi and yi inputs are received serially instead of in parallel, Table 16-4 is interpreted as a state table for a sequen-tial circuit, and the next-state equations are the same as in Figure 16-7 . If D flip-flops are used, the typical cell of Figure 16-7 can be used as the combinational part of the sequential circuit, and Figure 16-9 shows the resulting circuit. After all of the inputs have been read in, the output is determined from the state of the two flip-flops.
FIGURE 16-7 Typical Cell for Comparator © Cengage Learning 2014 xi yi ai bi ai bi′ ′ ai + 1 bi + 1 0 1 0 0 00 01 11 10 0 0 0 0 X X X X 1 00 aibi ai + 1 = ai + xiyibi ′ ′ bi + 1 = bi + xiyiai ′ ′ xiyi 01 11 10 1 1 1 0 0 0 1 00 01 11 10 1 1 1 1 X X X X 0 00 aibi xiyi 01 11 10 0 0 0 FIGURE 16-8 Output Circuit for Comparator © Cengage Learning 2014 (X < Y) Z2 Z3 Z1 (X = Y) (X > Y) Z1= an + 1 Z2=a′ n + 1b′ n + 1 Z3=bn + 1 0 1 1 X 0 bn + 1 bn + 1 an + 1 an + 1 1 0 1 1 X 0 bn + 1 an + 1 1 0 1 1 X 0 bn + 1 an + 1 1 556 Unit 16 This example indicates that the design of a unilateral iterative circuit is very similar to the design of a sequential circuit. The principal difference is that for the iterative circuit the inputs are received in parallel as a sequence in space, while for the sequential circuit the inputs are received serially as a sequence in time. For the iterative circuit, the state table specifies the output state of a typical cell in terms of its input state and primary inputs, while for the corresponding sequential circuit, the same table specifies the next state (in time) in terms of the present state and inputs. If D flip-flops are used, the typical cell for the iterative circuit can serve as the com-binational logic for the corresponding sequential circuit. If other flip-flop types are used, the input equations can be derived in the usual manner.
16.4 Design of Sequential Circuits Using ROMs and PLAs A sequential circuit can easily be designed using a ROM (read-only memory) and flip-flops. Referring to the general model of a Mealy sequential circuit given in Figure 13-17 , the combinational part of the sequential circuit can be realized using a ROM. The ROM can be used to realize the output functions (Z1, Z2, . . . , Zn) and the next-state functions (Q+ 1 , Q+ 2 , . . . , Q+ k ). The state of the circuit can then be stored in a register of D flip-flops and fed back to the input of the ROM. Thus, a Mealy sequential circuit with m inputs, n outputs, and k state variables can be realized using k D flip-flops and a ROM with m + k inputs (2m+k words) and n + k outputs. The Moore sequential circuit of Figure 13-19 can be realized in a similar manner. The next-state and output combinational subcircuits of the Moore circuit can be realized using two ROMs. Alternatively, a single ROM can be used to realize both the next-state and output functions.
Use of D flip-flops is preferable to J-K flip-flops because use of two-input flip-flops would require increasing the number of outputs from the ROM. The fact that the D flip-flop input equations would generally require more gates than the J-K equations is of no consequence because the size of the ROM depends only on the number of FIGURE 16-9 Sequential Comparator for Binary Numbers © Cengage Learning 2014 Clock Clock Da CK ai ai + 1 Z1(X < Y) Z2(X = Y) Z3(X > Y) xi yi Typical Cell (see Fig. 16-7) bi ai bi bi + 1 Db CK Sequential Circuit Design 557 inputs and outputs and not on the complexity of the equations being realized. For this reason, the state assignment which is used is also of little importance, and, gener-ally, a state assignment in straight binary order is as good as any.
In Section 16.2, we realized a code converter using gates and D flip-flops. We will now realize this converter using a ROM and D flip-flops. The state table for the converter is reproduced in Table 16-6(a). Because there are seven states, three D flip-flops are required. Thus, a ROM with four inputs (24 words) and four outputs is required, as shown in Figure 16-10. Using a straight binary state assignment, we can construct the transition table, seen in Table 16-6(b), which gives the next state of the flip-flops as a function of the present state and input. Because we are using D flip-flops, D1 = Q+ 1 , D2 = Q+ 2 , and D3 = Q+ 3 . The truth table for the ROM, shown in Table 16-6(c), is easily constructed from the transition table. This table gives the ROM outputs (Z, D1, D2, and D3) as functions of the ROM inputs (X, Q1, Q2, and Q3).
Sequential circuits can also be realized using PLAs (programmable logic arrays) and flip-flops in a manner similar to using ROMs and flip-flops. However, in the case of PLAs, the state assignment may be important because the use of a good state (c) Truth Table X Q1 Q2 Q3 Z D1 D2 D3 0 0 0 0 1 0 0 1 0 0 0 1 1 0 1 1 0 0 1 0 0 1 0 0 0 0 1 1 0 1 0 1 0 1 0 0 1 1 0 1 0 1 0 1 0 0 0 0 0 1 1 0 1 0 0 0 0 1 1 1 x x x x 1 0 0 0 0 0 1 0 1 0 0 1 0 1 0 0 1 0 1 0 1 1 0 0 1 0 1 1 1 1 0 1 1 1 0 0 0 1 1 0 1 1 0 1 1 0 0 0 1 1 1 0 x x x x 1 1 1 1 x x x x TABLE 16-6 (b) Transition table Q+ 1 Q+ 2 Q+ 3 Z Q1Q2Q3 X = 0 X = 1 X = 0 X = 1 A 0 0 0 001 010 1 0 B 0 0 1 011 100 1 0 C 0 1 0 100 100 0 1 D 0 1 1 101 101 0 1 E 1 0 0 101 110 1 0 H 1 0 1 000 000 0 1 M 1 1 0 000 – 1 – (a) State table Present State Next State Present Output (Z ) X = 0 1 X = 0 1 A B C 1 0 B D E 1 0 C E E 0 1 D H H 0 1 E H M 1 0 H A A 0 1 M A – 1 – © Cengage Learning 2014 558 Unit 16 assignment can reduce the required number of product terms and, hence, reduce the required size of the PLA.
As an example, we will consider realizing the state table of Table 16-6(a) using a PLA and three D flip-flops. The circuit configuration is the same as Figure 16-10, except that the ROM is replaced with a PLA of appropriate size. Using a straight binary assignment leads to the truth table given in Table 16-6(c). This table could be stored in a PLA with four inputs, 13 product terms, and four outputs, but this would offer little reduction in size compared with the 16-word ROM solution discussed earlier.
If the state assignment of Figure 16-2 is used, the resulting output equation and D flip-flop input equations, derived from the maps in Figure 16-3, are D1 = Q+ 1 = Q2 ′ D2 = Q+ 2 = Q1 D3 = Q+ 3 = Q1Q2Q3 + X′Q1Q3 ′ + XQ1 ′Q2 ′ Z = X′Q3 ′ + XQ3 (16-1) The PLA table which corresponds to these equations is in Table 16-7 . Realization of this table requires a PLA with four inputs, seven product terms, and four outputs.
X Q1 Q2 Q3 Z D1 D2 D3 – – 0 – 0 1 0 0 – 1 – – 0 0 1 0 – 1 1 1 0 0 0 1 0 1 – 0 0 0 0 1 1 0 0 – 0 0 0 1 0 – – 0 1 0 0 0 1 – – 1 1 0 0 0 FIGURE 16-10 Realization of Table 16-6(a) Using a ROM © Cengage Learning 2014 Clock D1 CK Q1 Q1 Z Q2 Q2 Q3 Q3 + + + ROM 16 Words × 4Bits D2 CK X D3 CK TABLE 16-7 © Cengage Learning 2014 Sequential Circuit Design 559 Next, we will verify the operation of the circuit of Figure 16-4 using a PLA which corresponds to Table 16-7 . Initially, assume that X = 0 and Q1Q2Q3 = 000. This selects rows --0- and 0--0 in the table, so Z = 1 and D1D2D3 = 100. After the active clock edge, Q1Q2Q3 = 100. If the next input is X = 1, then rows --0- and -1-- are selected, so Z = 0 and D1D2D3 = 110. After the active clock edge, Q1Q2Q3 = 110. Continuing in this manner, we can verify the transition table of Figure 16-2.
PALs also provide a convenient way of realizing sequential circuits. PALs are available which contain D flip-flops that have their inputs driven from programma-ble array logic. Figure 16-11 shows a segment of a sequential PAL. The D flip-flop is driven from an OR gate which is fed by two AND gates. The flip-flop output is fed back to the programmable AND array through a buffer. Thus, the AND gate inputs can be connected to A, A′, B, B′, Q, or Q′. The X’s on the diagram show the connec-tions required to realize the next-state equation Q+ = D = A′BQ′ + AB′Q The flip-flop output is connected to an inverting tri-state buffer, which is enabled when En = 1.
FIGURE 16-11 Segment of a Sequential PAL © Cengage Learning 2014 Clock En D Q Q′ Q′ Q′ Q Q′ A A A′ B B B′ Q Inverting Tri-State Output Buffer Programmable AND Array 16.5 Sequential Circuit Design Using CPLDs As discussed in Section 9.7 , a typical CPLD contains a number of macrocells that are grouped into function blocks. Connections between the function blocks are made through an interconnection array. Each macrocell contains a flip-flop and an OR gate, which has its inputs connected to an AND gate array. Some CPLDs are based on PALs, in which case each OR gate has a fixed set of AND gates associated with it. Other CPLDs are based on PLAs, in which case any AND gate output within a function block can be connected to any OR gate input in that block.
Figure 16-12 shows the structure of a Xilinx CoolRunner II CPLD, which uses a PLA in each function block. This CPLD family is available in sizes from two to 32 function blocks (32 to 512 macrocells). Each function block has 16 inputs from the AIM (advanced interconnection matrix) and up to 40 outputs to the AIM. Each function block PLA contains the equivalent of 56 AND gates.
560 Unit 16 FIGURE 16-12 CoolRunner-II Architecture1 (Figure based on figures and text owned by Xilinx, Inc., Courtesy of Xilinx, Inc. © Xilinx, Inc. 1999–2003. All rights reserved.) 1Additional data on Xilinx CPLDs and FPGAs is available from www.Xilinx.com.
Function Block 1 Function Block n PLA PLA I/O Blocks I/O Blocks 16 16 40 40 16 FB 16 FB 16 16 I/O Pin MC1 MC2 MC16 MC1 MC2 MC16 AIM I/O Pin I/O Pin Fast Inputs BSC and ISP Clock and Control Signals BSC Path Fast Inputs I/O Pin I/O Pin I/O Pin JTAG The basic CoolRunner II architecture is similar to that shown in Figure 9-33. Figure 16-13 represents a CoolRunner-II macrocell and the associated AND array. Box (1) represents the AND array which is driven by signals from the AIM. Each of the 56 product terms (P-terms) generated by the AND array (2) can have up to 40 variables. Box (3) represents the OR array which selects the AND gates for each macrocell. The OR gate (4) in a specific macrocell can have any subset of the P-terms as inputs. The MUXes on the diagram do not have control inputs shown because each MUX is programmed to select one of its inputs. For example, MUX (5) can be programmed to select a product term, the complement of a product term, a logic 1, or a logic 0 for the MUX output. If logic 1 is selected, the XOR gate complements the OR gate output; if logic 0 is selected, the XOR gate passes the OR gate output without change. By complementing or not complementing the OR gate output, a function can be implemented as either a product of sums or as a sum of products.
The XOR gate output can be routed directly to an I/O block or to the macrocell flip-flop input. The flip-flop can be programmed as a D-CE flip-flop or as a T flip-flop. The flip-flop can be programmed as an ordinary flip-flop (F/F), a latch, or a dual-edge triggered flip-flop, which can change state on either clock edge. The CK input and the asynchronous S and R inputs can each be programmed to come from several different sources. MUX (6) can invert the clock input or not, so that the flip-flop can trigger on either clock edge. MUX (7) selects either the flip-flop output or the XOR gate output and passes it to an I/O block.
Figure 16-14 shows how a Mealy sequential machine with two inputs, two outputs, and two flip-flops can be implemented by a CPLD. Four macrocells are required, two Sequential Circuit Design 561 to generate the D inputs to the flip-flops and two to generate the Z outputs. The flip-flop outputs are fed back to the AND array inputs via the interconnection matrix (not shown). The number of product terms required depends on the complexity of the equations for the D’s and the Z’s.
Figure 16-15 shows how the 4-bit loadable right-shift register of Figure 12-16 can be implemented using four macrocells of a CPLD. The four OR-gate outputs implement the D inputs specified by Equations (12-1). A total of 12 product terms are required. The Q outputs are fed back to the AND array via the interconnection matrix (not shown).
FIGURE 16-14 CPLD Implementation of a Mealy Machine © Cengage Learning 2014 FF FF AND Array X1 X2 Q1 Macrocells Q2 Z1 Z2 D1 D2 FIGURE 16-13 CoolRunner-II Macrocell (Figure based on figures and text owned by Xilinx, Inc., Courtesy of Xilinx, Inc. © Xilinx, Inc. 1999–2003. All rights reserved.) GCK0 GCK1 GCK2 CTC PTC PTC 49 P-terms To PTA, PTB, PTC of other macrocells CTC, CTR, CTS, CTE From AIM 4 P-terms PTA Fast Input from I/O Block Feedback to AIM PTB PTC PLA OR Term PTA CTS GSR GND GND VCC R D/T CE CK F/F Latch DualEDGE Q S 40 To I/O Block PTA CTR GSR GND (1) 2 2 2 2 2 (3) 4 5 6 7 562 Unit 16 Figure 16-16 shows how three bits of the parallel adder with accumulator of Figure 12-5 can be implemented using a CPLD. Each bit of the adder requires two macrocells. One of the macrocells implements the sum function and an accumulator flip-flop. The other macrocell implements the carry, which is fed back into the AND array. The Ad signal can be connected to the CE input of each flip-flop via an AND gate (not shown). Each bit of the adder requires eight product terms (four for the sum, three for the carry, and one for CE). If the flip-flops are programmed as T flip-flops, then the logic for the sum can be simplified. For each accumulator flip-flop X+ i = Xi ⊕ Yi ⊕ Ci Then, the T input is Ti = X+ i ⊕ Xi = Yi ⊕ Ci which requires only two product terms.
FIGURE 16-15 CPLD Implementation of a Shift Register © Cengage Learning 2014 FF FF FF FF AND Array SI D3 D2 D1 D0 Sh Ld Q3 Q1 Q0 Macrocells Q2 FIGURE 16-16 CPLD Implementation of a Parallel Adder with Accumulator © Cengage Learning 2014 S0 S1 S2 FF FF FF AND Array C0 C1 X0 C2 X1 C3 X2 Y0 Y1 Y2 Sequential Circuit Design 563 The add signal can be ANDed with the Ti input so that the flip-flop state can change only when Ad = 1: Ti = Ad (Yi ⊕ Ci) = Ad Yi Ci ′ + Ad Yi ′ Ci 16.6 Sequential Circuit Design Using FPGAs As discussed in Section 9.8, an FPGA usually consists of an array of configurable logic blocks (CLBs) surrounded by a ring of I/O blocks. The FPGA may also contain other components such as memory blocks, clock generators, tri-state buffers, etc. A typical CLB contains two or more function generators, often referred to as look-up tables or LUTs, programmable multiplexers, and D-CE flip-flops (see Figure 9-37). The I/O blocks usually contain additional flip-flops for storing inputs or outputs and tri-state buffers for driving the I/O pins.
Figure 16-17 shows a simplified block diagram for a Xilinx Virtex or Spartan II CLB. This CLB is divided into two nearly identical slices. Each slice contains two 4-variable function generators (LUTs), two D-CE flip-flops, and additional logic for carry and control. This additional logic includes MUXes for selecting the flip-flop inputs and for multiplexing the LUT outputs to form functions of five or more variables.
Figure 16-18 shows how a Mealy sequential machine with two inputs, two out-puts, and two flip-flops can be implemented by a FPGA. Four LUTs (FGs or func-tion generators) are required, two to generate the D inputs to the flip-flops and two to generate the Z outputs. The flip-flop outputs are fed back to the CLB inputs via interconnections external to the CLB. The entire circuit fits into one Virtex CLB. This implementation works because each D and Z is a function of only four variables FIGURE 16-17 Xilinx Virtex/ Spartan II CLB (Figure based on figures and text owned by Xilinx, Inc., Courtesy of Xilinx, Inc. © Xilinx, Inc. 1999–2003. All rights reserved.) F1 F2 F3 F4 G1 G2 G3 G4 Carry & Control Carry & Control Carry & Control Carry & Control LUT CIN CIN COUT COUT YQ XQ XQ YQ X XB Y YB YB Y BX BY BX BY G1 G2 G3 G4 F1 F2 F3 F4 Slice 1 Slice 0 XB X LUT LUT LUT D CE Q RC SP D CE Q RC SP D CE Q RC SP D CE Q RC SP 564 Unit 16 (X1, X2, Q1, and Q2). If more flip-flops or inputs are needed, the D or Z functions may have to be decomposed to use additional function generators as in Figure 9-40.
Figure 16-19 shows how the 4-bit loadable right-shift register of Figure 12-16 can be implemented using an FPGA. Four LUTs are used to generate the D inputs to the flip-flops, and a fifth LUT generates the CE input. If we had implemented Equa-tions (12-1) directly without using the CE input, we would need to implement four 5-variable functions. This would require eight LUTs because each 5-variable func-tion requires two 4-variable function generators (see Figure 9-40(a)). However, if we set CE = Ld + Sh, then CE = 0 when Ld = Sh = 0 and the flip-flops hold their current values. Therefore, we do not need the first term in each of Equations (12-1), and the flip-flop D input equations fit into 4-variable function generators. We can rewrite Equation (12-1(a)) in terms of CE as follows: Q+ 3 = CE′Q3 + CE D3f = Ld′Sh′Q3 + (Ld + Sh)(Sh′D3 + Sh SI) (16-2) where D3f is the D input to flip-flop 3. The D input to the Q3 flip-flop is therefore D3f = Sh′D3 + Sh SI FIGURE 16-19 FPGA Implementation of a Shift Register © Cengage Learning 2014 CE CE D D D D CE CE FG4 D3 Sh SI D2 Q3 Q2 Q1 Q0 D1 D0 CK FF FF FF FF CK CK CK FG3 FG2 FG1 FG0 Ld FIGURE 16-18 FPGA Implementation of a Mealy Machine © Cengage Learning 2014 X1 Q1 D1 CK FF CE CE 1 1 FG1 Q2 Z1 X2 Z2 D2 CK FF FG2 FG3 FG4 Sequential Circuit Design 565 which is a 3-variable function. We can determine the other three flip-flop D inputs in a similar way.
Figure 16-20 shows how three bits of the parallel adder with accumulator of Figure 12-5 can be implemented using an FPGA. Each bit of the adder can be imple-mented with two 3-variable function generators, one for the sum and one for the carry. The Ad signal can be connected to the CE input of each flip-flop so that the sum is loaded by the rising clock edge when Ad = 1. The arrangement for generating the carries, shown in Figure 16-20, is rather slow because the carry signal must propa-gate through a function generator and its external interconnections for each bit. Because adders are frequently used in FPGAs, most FPGAs have built-in fast carry logic in addition to the function generators. If the fast carry logic is used, the bottom row of function generators in Figure 16-20 is not needed, and a parallel adder with an accumulator can be implemented using only one function generator for each bit.
16.7 Simulation and Testing of Sequential Circuits Simulation of a digital system can take place at several levels of detail. At the func-tional level, system operation is described in terms of a sequence of transfers between registers, adders, memories, and other functional units. Simulation at this level may be used to verify the high-level system design. At the logic level, the system is described in terms of logic elements such as gates and flip-flops and their interconnections. Logic level simulation may be used to verify the correctness of the logic design and to ana-lyze the timing. At the circuit level, each gate is described in terms of its circuit com-ponents such as transistors, resistances, and capacitances. Circuit level simulation gives detailed information about voltage levels and switching speeds. In this text, we will consider simulation at the logic level as well as system level simulation using VHDL.
Simulation of sequential circuits is similar to the simulation of combinational circuits described in Section 8.5. However, for sequential circuits, the propagation delays associated with the individual logic elements must be taken into account, FIGURE 16-20 FPGA Implementation of a Parallel Adder with Accumulator © Cengage Learning 2014 CE CE D D D CE C1 C2 S2 S1 S0 C3 Y0 Y1 Y2 X2 X1 X0 C0(Cin) CK FF FF FF CK CK Ad FG3a FG2b FG3b FG1b FG2a FG1a 566 Unit 16 and the presence of feedback may cause complications. The simulator output usu-ally includes timing diagrams which show the times at which different signals in the circuit change. The delays in the gates and flip-flops may be modeled in several ways. The simplest method is to assume that each element has one unit of delay. The use of this unit delay model is generally sufficient to verify that the design is logically correct. If a more detailed timing analysis is required, each logic element may be assigned a nominal delay value. The nominal or typical delays for a device are usu-ally provided by the device manufacturer on the specification sheets.
In practice, no two gates of a given type will have exactly the same delay, and the value of the delay may change depending on temperature and voltage levels. For these reasons, manufacturers often specify a minimum and maximum delay value for each type of logic element. Some simulators can take the minimum and maximum delay values into account. Instead of showing the exact time at which a signal changes, the simulator output indicates a time interval in which the signal may change. Figure 16-21 shows the output from an inverter which has a nominal delay of 10 ns, a minimum delay of 5 ns, and a maximum delay of 15 ns. The shaded region indicates that the inverter output may change at any time during the interval. Min-max delay simulators can be used to verify that a digital system will operate correctly as long as the delay in each element is within its specified range.
Testing of sequential circuits is generally more difficult than testing combina-tional circuits. If the flip-flop outputs can be observed, then the state table can be verified directly on a row-by-row basis. The state table can be checked out with a simulator or in lab as follows: 1. Using the direct set and clear inputs, set the flip-flop states to correspond to one of the present states in the table.
2. For a Moore machine, check to see that the output is correct. For a Mealy machine, check to see that the output is correct for each input combination.
3. For each input combination, clock the circuit and check to see that the next state of the flip-flops is correct. (Reset the circuit to the proper state before each input combination is applied.) 4. Repeat steps 1, 2, and 3 for each of the present states in the table.
In many cases when a sequential circuit is implemented as part of an integrated circuit, only the inputs and outputs are available at the IC pins, and observing the state of the internal flip-flops is impossible. In this case, testing must be done by apply-ing input sequences to the circuit and observing the output sequences. Determining a small set of input sequences which will completely test the circuit is generally a FIGURE 16-21 Simulator Output for an Inverter © Cengage Learning 2014 A A B Nominal Delay B Min-Max Delay B 0 10 20 30 40 50 60 t (ns) Sequential Circuit Design 567 difficult problem that is beyond the scope of this text. The set of test sequences must traverse all arcs on the state graph, but this is generally not a sufficient test.
Figure 16-22 shows a simulator screen for testing the Mealy sequential circuit of Figure 13-7 . To step through the circuit one input at a time, switches are used for the Clock and X inputs. Another switch is used to reset both flip-flops, and two switches are used to set flip-flops A and B. Probes are used to observe the Z output and the state of the flip-flops. After X has been set to the desired value, the clock cycle is simulated by flipping the Clock switch to 1 and back to 0. For a Mealy machine, the output should be read just before the active edge of the clock.
If an incorrect Z output is found in the process of verifying the state table, the out-put circuit can be checked using the techniques discussed in Section 8.5. If one of the next states is wrong, this may be due to an incorrect flip-flop input. After determining which flip-flop goes to the wrong state, the circuit should be reset to the proper present state, and the flip-flop inputs should be checked before applying another clock pulse.
Assume that you have built the circuit of Figure 16-4 to implement the state table of Figure 16-2. Suppose that when you set the flip-flop states to 100, set X = 1, and pulse the clock, the circuit goes to state 111 instead of 110. This indicates that flip-flop Q3 went to the wrong state. You should then reset the flip-flops to state 100 and observe the inputs to flip-flop Q3. Because the flip-flop is supposed to remain in state 0, D3 should be 0. If D3 = 1, this indicates that either D3 was derived wrong or that the D3 circuit has a problem. Check the D3 map and equation to make sure that D3 = 0 when X = 1 and Q1Q2Q3 = 100. If the map and equation are correct, then the D3 circuit should be checked using the procedure in Section 8.5.
FIGURE 16-22 Simulation Screen for Figure 13-7 © Cengage Learning 2014 Clock Example 568 Unit 16 After you have verified that the circuit works according to your state table, you must then check the circuit to verify that it works according to the problem statement. To do this, you must apply appropriate input sequences and observe the resulting out-put sequence. When testing a Mealy circuit, you must be careful to read the outputs at the proper time to avoid reading false outputs (see Section 13.2). The output should be read just before the active edge of the clock. If the output is read immediately follow-ing the active clock edge, a false output may be read. See Figure 13-8 for an example.
Instead of manually stepping through the input sequence, simulated input wave-forms may be defined for X and Clock. Figure 16-23 shows the simulator input wave-form for the example of Figure 16-22, using the test sequence X = 10101. When the simulator is run, the timing chart for A, B, and Z will be generated as shown. Note that the simulator output is very similar to the timing chart of Figure 13-8. The simu-lator output in Figure 16-23(a) assumes the unit delay model, that is, each gate or flip-flop has one unit of delay. Figure 16-23(b) shows the same simulation using a nominal delay of 10 ns for each gate and flip-flop.
So far in our discussion of sequential circuits, we have assumed that the inputs are properly synchronized with the clock. This means that one input in the sequence occurs for each clock cycle, and all input changes satisfy setup and hold time speci-fications. Synchronization is no problem in the laboratory if we use a manual clock because we can easily change the inputs between active clock edges. However, if we operate our circuits at a high clock rate, then synchronization becomes a problem. We must either generate our input sequences in synchronization with the clock, or we must use a special circuit to synchronize the inputs with the clock. The former can X Clock A B Z 200 400 (a) Simulator output with a unit delay model X Clock A B Z 200 400 (b) Simulator output with a nominal delay of 10 ns FIGURE 16-23 © Cengage Learning 2014 Sequential Circuit Design 569 be accomplished by loading the inputs into a shift register, and then using the circuit clock to shift them into the circuit one at a time, as shown in Figure 16-24.
If the input changes are not synchronized with the clock, edge-triggered D flip-flops can be used to synchronize them, as shown in Figure 16-25(a). In this figure, although X1 and X2 change at arbitrary times with respect to the clock, X1S and X2S change after the rising clock edge, and the inputs to the sequential circuit should be properly synchronized, as shown in Figure 16-25(b). However, this design has an inherent problem and may occasionally fail to operate properly. If a D input changes very close to the rising clock edge so that setup and hold times are not satisfied (see Figure 11-20), one of the flip-flops may malfunction.
Figure 16-26 shows a more reliable synchronizer2 that uses two D flip-flops to syn-chronize a single asynchronous input, X. If X changes from 0 to 1 in the critical region where the setup or hold time is not satisfied, several outcomes could occur: the flip-flop Q1 output might change to 1; it might remain 0; it might start to change to 1 and then change back or it might oscillate between 0 and 1 for a short time and then settle down to 0 or 1. This region of uncertainty is indicated by the shading on the Q1 waveform. We will assume that the clock period is chosen so that Q1 will be settled in either the 0 or 1 state by t2. If Q1 = 1, Q2 will change to 1 shortly after t2. If Q1 = 0, Q1 will change to 1 shortly after t2, and Q2 will change to 1 shortly after t3. Because X is an asynchronous input, normally it will not matter whether X1S is delayed by one or two clock periods. The important thing is that X1S is a clean signal that is synchronized with the clock.
2For more detailed discussion of synchronizer design, see John F. Wakerly. Digital Design Design Principles and Practices, 4th ed. Upper Saddle River, NJ (Prentice Hall, 2006).
FIGURE 16-24 Using a Shift Register to Generate Synchronized Inputs © Cengage Learning 2014 0 1 1 0 0 1 0 1 1 1 Synchronous Sequential Circuit Clock Input Shift Clock Clock X X1 X2 X1S X2S D Synchronous Sequential Circuit Clock Input Clock Clock X1 X1S X2S X2 D (a) Synchronizer circuit (b) Synchronizer inputs and outputs FIGURE 16-25 © Cengage Learning 2014 570 Unit 16 16.8 Overview of Computer-Aided Design A wide variety of computer-aided design (CAD) software tools are available to assist in the design of digital systems. Many of these CAD programs will run on a personal computer, but others require a more powerful workstation for execution. Several functions performed by these CAD tools are discussed below.
Generation and minimization of logic equations. Programs of this type accept truth tables, state tables, or state graphs as input and generate minimized logic equations. LogicAid is an example of this type of program.
Generation of bit patterns for programming PLDs. These programs generate a file which can be downloaded to a PLD programmer to program PALs and other pro-grammable logic devices.
Schematic capture. This type of program allows the designer to interactively enter and edit a logic diagram for a digital design. The program provides libraries of stand-ard logic components such as gates, flip-flops, registers, adders, counters, etc., which can be selected for inclusion in the diagram. In addition to a plot of the logic dia-gram, the output from a schematic capture program may include a parts list, a list of interconnections between the ICs, and a circuit description file. This file may be used as input to a simulator, PC board layout program, or other CAD programs.
Simulation. We have already discussed several types of simulators in Sections 10.3 and 16.5. By using such simulators at various points in the design process, designers can correct many errors and resolve critical timing problems before any hardware is actu-ally built. Use of a simulator is essential when an IC is being designed, because the correction of design errors after the IC has been fabricated is very time-consuming and costly.
FIGURE 16-26 Synchronizer with Two D Flip-Flops © Cengage Learning 2014 Q1 t1 t2 t3 X1S = Q2 X1S X X D1 Q1 Synchronous Sequential Circuit Clock Input Clock 0 1 0 Clock CK D2 Q2 CK Sequential Circuit Design 571 SimUaid performs the schematic capture and simulation functions for small digi-tal systems. It also automatically generates a structural VHDL description from the schematic.
Synthesis tools. Synthesis software accepts as input a description of a desired digital system written in VHDL, Verilog, or another hardware description language. The HDL code is analyzed and translated into a circuit description that specifies the needed logic components and the connections between these components. The syn-thesizer output is then fed into software that implements the circuit for a specific target device such as an FPGA, CPLD, or ASIC (application-specific integrated circuit). More details of synthesis and implementation of VHDL code are given in Section 17 .5.
IC design and layout. A digital integrated circuit is typically composed of intercon-nected transistors which are fabricated on a chip of silicon. Such ICs are usually made of several layers of conducting material separated by layers of insulating mate-rial with appropriate connections between layers. The patterns for paths on each layer are transferred into the layers during the fabrication process using masks which are similar to photographic negatives. CAD tools for IC design facilitate the process of specifying the geometries of the transistors, placing the transistors on the chip, and routing the interconnections between them. Libraries of standard modules are available for inclusion in the chip designs. Automatic checking of the designs is provided to verify consistency with design rules. The output from the IC design pro-gram includes the mask patterns necessary for fabricating the IC.
Test generation. As digital systems become more complex, testing the finished prod-uct becomes increasingly difficult. It is not practical to test the system using all pos-sible combinations or sequences of inputs. Automatic test generation programs are available which attempt to generate a relatively small set of input patterns that will adequately test the system in a reasonable length of time.
PC board layout. Most digital systems are built by mounting the integrated circuit components on a printed circuit board. The wiring on such PC boards is made up of thin metallic strips which interconnect the ICs. In order to make all of the required connections, these boards typically have two, three, or more layers of interconnect wiring. PC board layout programs perform two main functions—they determine the placement of the ICs on the board, and they route the connections between the ICs. The output of the layout program includes a set of plots which show the wiring on each layer of the PC board.
Many CAD systems integrate several of these CAD tools into a single package so that you can, for example, input a logic diagram, simulate its operation, and then lay out a PC board or IC. The design of large, complex integrated circuits and digital systems would not be feasible without the use of appropriate CAD tools.
One method of designing a small digital system with an FPGA uses the following steps: 1. Draw a block diagram of the digital system. Define the required control signals and construct a state graph that describes the required sequence of operations.
2. Work out a detailed logic design of the system using gates, flip-flops, registers, counters, adders, etc.
572 Unit 16 3. Construct a logic diagram of the system, using a schematic capture program.
4. Simulate and debug the logic diagram and make any necessary corrections to the design.
5. Run an implementation program that fits the design into the target FPGA. This program carries out the following steps: (a) Partition the logic diagram into pieces that will fit into CLBs of the target FPGA.
(b) Place the CLBs within the logic cell array of the FPGA and route the con-nections between the logic cells.
(c) Generate the bit pattern necessary to program the FPGA.
6. Run a timing simulation of the completed design to verify that it meets specifica-tions. Make any necessary corrections and repeat the process as necessary.
7. Download the bit pattern into the internal configuration memory cells in the FPGA and test the operation of the FPGA.
When a hardware description language is used, steps 2 and 3 are replaced with writ-ing HDL code. The HDL code is then simulated and debugged in step 4.
Design Problems The following problems require the design of a Mealy sequential circuit of the form shown in Figure 16-27 . For purposes of testing, the input X will come from a toggle switch, and the clock pulse will be supplied manually from a push button or switch.
X (From Toggle Switch) Manual Clock Circuit to Be Designed Z FIGURE 16-27 16.1 Design a Mealy sequential circuit (Figure 16-27) which investigates an input sequence X and will produce an output of Z = 1 for any input sequence ending in 0010 or 100.
Example: X = 1 1 0 0 1 0 0 1 0 1 0 0 1 0 1 Z = 0 0 0 1 0 1 1 0 1 0 0 1 0 1 0 Notice that the circuit does not reset to the start state when an output of Z = 1 occurs. However, your circuit should have a start state and should be provided with a method for manually resetting the flip-flops to the start state. A minimum solution requires six states. Design your circuit using NAND gates, NOR gates, and three D flip-flops. Any solution which is minimal for your state assignment and uses 10 or fewer gates and inverters is acceptable. (Assign 000 to the start state.) Test Procedure: First, check out your state table by starting in each state and making sure that the present output and next state are correct for each input. Then, © Cengage Learning 2014 Sequential Circuit Design 573 starting in the proper initial state, determine the output sequence for each of the following input sequences: (1) 0 0 1 1 0 1 0 0 1 0 1 0 1 0 0 0 1 0 0 1 0 0 1 0 (2) 1 1 0 0 1 1 0 0 1 0 1 0 1 0 0 1 0 1 0 1 0 0 1 0 16.2 Design a Mealy sequential circuit (Figure 16-27) which investigates an input sequence X and will produce an output of Z = 1 for any input sequence ending in 1101 or 011.
Example: X = 0 0 1 1 0 1 1 0 1 0 1 1 0 1 0 Z = 0 0 0 1 0 1 1 0 1 0 0 1 0 1 0 Notice that the circuit does not reset to the start state when an output of Z = 1 occurs. However, your circuit should have a start state and should be provided with a method for manually resetting the flip-flops to the start state. A minimum solution requires six states. Design your circuit using NAND gates, NOR gates, and three D flip-flops. Any solution which is minimal for your state assignment and uses nine or fewer gates and inverters is acceptable. (Assign 000 to the start state.) Test Procedure: First, check out your state table by starting in each state and making sure that the present output and next state are correct for each input. Then, starting in the proper initial state, determine the output sequence for each of the following input sequences: (1) 1 1 0 0 1 0 1 1 0 1 0 1 0 1 1 1 0 1 1 0 1 1 0 1 (2) 0 0 1 1 0 0 1 1 0 1 0 1 0 1 1 0 1 0 1 0 1 1 0 1 16.3 Design a sequential circuit (Figure 16-27) to convert excess-3 code to BCD code. The input and output should be serial with the least significant bit first. The input X represents an excess-3 coded decimal digit, and the output Z represents the corre-sponding BCD code. Design your circuit using three D flip-flops, NAND gates, and NOR gates. Any solution which is minimal for your state assignment and uses eight or fewer gates and inverters is acceptable. (Assign 000 to the reset state.) Test Procedure: First, check out your state table by starting in each state and making sure that the present output and next state are correct for each input. Then, starting in the reset state, determine the output sequence for each of the ten possible input sequences and make a table.
16.4 Design a sequential circuit (Figure 16-27) which adds six to a binary number in the range 0000 through 1001. The input and output should be serial with the least signifi-cant bit first. Find a state table with a minimum number of states. Design the circuit using NAND gates, NOR gates, and three D flip-flops. Any solution which is mini-mal for your state assignment and uses 10 or fewer gates and inverters is acceptable. (Assign 000 to the reset state.) Test Procedure: First, check out your state table by starting in each state and making sure that the present output and next state are correct for each input. Then, 574 Unit 16 starting in the reset state, determine the output sequence for each of the ten possible input sequences and make a table.
16.5 Design a Mealy sequential circuit (Figure 16-27) which investigates an input sequence X and will produce an output of Z = 1 for any input sequence ending in 0110 or 101.
Example: X = 0 1 0 1 1 0 1 Z = 0 0 0 1 0 1 1 Notice that the circuit does not reset to the start state when an output of Z = 1 occurs. However, your circuit should have a start state and should be provided with a method for manually resetting the flip-flops to the start state. A minimum solution requires six states. Design your circuit using NAND gates, NOR gates, and three D flip-flops. Any solution which is minimal for your state assignment and uses eight or fewer gates and inverters is acceptable. (Assign 000 to the start state.) Test Procedure: First, check out your state table by starting in each state and making sure that the present output and next state are correct for each input. Then, starting in the proper initial state, determine the output sequence for each of the following input sequences: (1) 0 0 1 1 0 1 1 1 1 0 0 1 0 1 0 0 (2) 1 0 1 0 0 0 1 1 1 1 0 1 1 0 0 0 16.6 Design a Mealy sequential circuit which investigates an input sequence X and which will produce an output of Z = 1 for any input sequence ending in 0101 provided that the sequence 110 has never occurred.
Example: X = 0 1 0 1 0 1 1 0 1 0 1 Z = 0 0 0 1 0 1 0 0 0 0 0 Notice that the circuit does not reset to the start state when an output of Z = 1 occurs. However, your circuit should have a start state and should be provided with a method for manually resetting the flip-flops to the start state. A minimum solution requires six states. Design your circuit using NAND gates, NOR gates, and three D flip-flops. Any solution which is minimal for your state assignment and uses eight or fewer gates and inverters is acceptable. (Assign 000 to the start state.) Test Procedure: First, check out your state table by starting in each state and making sure that the present output and next state are correct for each input. Then, starting in the proper initial state, determine the output sequence for the following input sequences: (1) X = 0 1 0 1 0 0 0 1 0 1 1 0 (2) X = 1 0 1 0 1 0 1 1 0 1 0 1 16.7 Design a Mealy sequential circuit which investigates an input sequence X and which will produce an output of Z = 1 if the total number of 1’s received is even (consider Sequential Circuit Design 575 zero 1’s to be an even number of 1’s) and the sequence 00 has occurred at least once. Note: The total number of 1’s received includes those received before and after 00.
Example: X = 1 0 1 0 1 0 0 1 1 0 1 Z = 0 0 0 0 0 0 0 1 0 0 1 Notice that the circuit does not reset to the start state when an output of Z = 1 occurs. However, your circuit should have a start state and should be provided with a method of manually resetting the flip-flops to the start state. A minimum solution requires six states. Design your circuit using NAND gates, NOR gates, and three D flip-flops. Any solution which is minimal for your state assignment and uses 12 or fewer gates and inverters is acceptable; the best known solution uses seven. (Assign 000 to the start state.) Test Procedure: First, check out your state table by starting in each state and making sure that the present output and next state are correct for each input. Then, starting in the proper initial state, determine the output sequence for each of the following input sequences: (1) X = 0 1 1 0 0 1 0 1 0 0 (2) X = 1 0 1 1 1 1 0 0 1 1 1 0 16.8 Design a Mealy sequential circuit (Figure 16-27) which investigates an input sequence X and will produce an output of Z = 1 for any input sequence ending in 0011 or 110.
Example: X = 1 0 1 0 0 1 1 0 0 1 1 Z = 0 0 0 0 0 0 1 1 0 0 1 Notice that the circuit does not reset to the start state when an output of Z = 1 occurs. However, your circuit should have a start state and should be provided with a method for manually resetting the flip-flops to the start state. Design your circuit using NAND gates, NOR gates, and three D flip-flops. Any solution which is minimal for your state assignment and uses 10 or fewer gates and inverters is acceptable; the best known solution uses six. (Assign 000 to the start state.) Test Procedure: First, check out your state table by starting in each state and making sure that the present output and next state are correct for each input. Then, starting in the reset state, determine the output sequence for each of the following input sequences: (1) X = 0 0 0 1 0 0 0 1 1 0 1 0 (2) X = 1 1 1 0 0 1 0 0 0 1 1 0 16.9 Design a Mealy sequential circuit which investigates an input sequence X and pro-duces an output Z which is determined by two rules. The initial output from the circuit is Z = 0. Thereafter, the output Z will equal the preceding value of X (rule 1) until the input sequence 001 occurs. Starting with the next input after 001, the out-put Z will equal the complement of the present value of X (rule 2) until the sequence 576 Unit 16 100 occurs. Starting with the next input after 100, the circuit output is again deter-mined by rule 1, etc. Note that overlapping 001 and 100 sequences may occur.
Example: Rule: 1 1 1 1 2 2 2 2 2 1 1 2 X = 1 0 0 1 1 0 1 0 0 0 1 1 Z = 0 1 0 0 0 1 0 1 1 0 0 0 Design your circuit using NAND gates, NOR gates, and three D flip-flops. Your circuit should be provided with a method for manually resetting the flip-flops to the start state. A minimum solution requires six states. Any solution which is minimal for your state assignment and uses 12 or fewer gates and inverters is acceptable. (Assign 000 to the start state.) Test Procedure: First, check out your state table by starting in each state and making sure that the present output and next state are correct for each input. Then, starting in the reset state, determine the output sequence for each of the following input sequences: (1) X = 1 0 0 1 0 0 1 0 0 0 1 1 (2) X = 0 1 1 0 0 0 0 1 1 0 1 1 16.10 The 8, 4, –2, –1 BCD code is similar to the 8-4-2-1 BCD code, except that the weights are negative for the two least significant bit positions. For example, 0111 in 8, 4, −2, −1 code represents 8 × 0 + 4 × 1 + (−2) × 1 + (−1) × 1 = 1 Design a Mealy sequential circuit to convert 8, 4, –2, –1 code to 8-4-2-1 code. The input and output should be serial with the least significant bit first. The input X repre-sents an 8, 4, –2, –1 coded decimal digit and the output Z represents the corresponding 8-4-2-1 BCD code. After four time steps the circuit should reset to the starting state regardless of the input sequence. Design your circuit using three D flip-flops, NAND gates, and NOR gates. Any solution which is minimal for your state assignment and uses eight or fewer gates is acceptable. (Assign 000 to the reset state.) Test Procedure: First, check out your state table by starting in each state and making sure that the present output and next state are correct for each input. Then, starting in the reset state, determine the output sequence for each of the 10 possible input sequences and make a table.
16.11 Design a Mealy sequential circuit (Figure 16-27) which adds five to a binary number in the range 0000 through 1010. The input and output should be serial with the least significant bit first. Find a state table with a minimum number of states. Design the circuit using NAND gates, NOR gates, and three D flip-flops. Any solution which is minimal for your state assignment and uses nine or fewer gates and inverters is acceptable. (Assign 000 to the reset state.) Test Procedure: First, check out your state table by starting in each state and making sure that the present output and the next state are correct for each input. Sequential Circuit Design 577 Then, starting in the reset state, determine the output sequence for each of the 11 possible input sequences and make a table.
16.12 Design a Mealy sequential circuit (Figure 16-27) to convert a 4-bit binary number in the range 0000 through 1010 to its 10’s complement. (The 10’s complement of a number N is defined as 10 −N.) The input and output should be serial with the least significant bit first. The input X represents the 4-bit binary number, and the output Z represents the corresponding 10’s complement. After four time steps, the circuit should reset to the starting state regardless of the input sequence. Find a state table with a minimum number of states. Design the circuit using NAND gates, NOR gates, and three D flip-flops. Any solution which is minimal for your state assignment and uses nine or fewer gates and inverters is acceptable. (Assign 000 to the reset state.) Test Procedure: First, check out your state table by starting in each state and making sure that the present output and the next state are correct for each input. Then, starting in the reset state, determine the output sequence for each of the 11 possible input sequences and make a table.
16.13 Design a Mealy sequential circuit which investigates an input sequence X and which will produce an output of Z = 1 for any input sequence ending in 1010, provided that the sequence 001 has occurred at least once.
Example: X = 1 0 1 0 0 1 0 1 0 1 0 Z = 0 0 0 0 0 0 0 0 1 0 1 Notice that the circuit does not reset to the start state when an output of Z = 1 occurs. However, your circuit should have a start state and should be provided with a method of manually resetting the flip-flops to the start state. A minimum solution requires six states. Design your circuit using NAND gates, NOR gates, and three D flip-flops. Any solution which is minimal for your state assignment and uses nine or fewer gates and inverters is acceptable. (Assign 000 to the start state.) Test Procedure: First, check out your state table by starting in each state and making sure that the present output and the next state are correct for each input. Then, starting in the proper initial state, determine the output sequence for the fol-lowing input sequences: (1) X = 1 0 0 1 0 0 1 1 0 1 0 1 (2) X = 1 0 1 0 0 0 1 0 1 0 1 0 16.14 Design a Mealy sequential circuit which investigates an input sequence X and will produce an output of Z = 1 whenever the total number of 0’s in the sequence is odd, provided that the sequence 01 has occurred at least once.
Example: X = 1 1 0 0 0 1 1 0 1 0 Z = 0 0 0 0 0 1 1 0 0 1 578 Unit 16 A minimum solution requires five states. Design your circuit using NAND gates, NOR gates, and three D flip-flops. Your circuit should have a start state and should be provided with a method of manually resetting the flip-flops to the start state. Any solution which is minimal for your state assignment and which uses 11 or fewer gates and inverters is acceptable. (Assign 000 to the start state.) Test Procedure: First, check out your state table by starting in each state and making sure that the present output and the next state are correct for each input. Then, starting in the proper initial state, determine the output sequence for the fol-lowing input sequences: (1) X = 1 0 0 0 1 1 0 1 0 0 1 (2) X = 0 0 0 0 1 0 1 0 0 0 1 Additional Problems 16.15 Draw a block diagram that shows how a ROM and D flip-flops could be connected to realize Table 13-4 (p. 430). Specify the truth table for the ROM using a straight binary state assignment. (Note that a truth table, not a transition table, is to be specified.) 16.16 The state table of Figure 15-15(a) is to be realized using a PLA and D flip-flops.
(a) Draw a block diagram.
(b) Specify the contents of the PLA in tabular form using the state assignment of Figure 15-15(a). (See Figure 15-16(b) for the D equations.) 16.17 An iterative circuit has a form similar to Figure 16-6. The output Z is to be 1 if the total number of X inputs that are 1 is an odd number greater than 2.
(a) Draw a state graph for a typical cell.
(b) Derive the equations and a NAND-gate circuit for a typical cell and for the output circuit.
(c) Specify a1 and b1, and simplify the first cell.
(d) Show how a sequential circuit can be constructed using the typical cell and output circuit.
16.18 In the iterative circuit below the input X is a 2’s complement number and the output Y is the 2’s complement of X. (x0 and y0 are the least significant bits.) (a) Construct a transition table for typical cell. (Note that a0 is 0.) (b) Derive expressions for ai +1 and yi.
(c) Construct a sequential circuit that will compute the 2’s complement of its input. (Use D flip-flops. Assume the flip-flops are reset at the beginning of an input sequence.) Sequential Circuit Design 579 16.19 The iterative circuit below compares two positive, unsigned binary numbers X = xn–1 . . . x1x0 and Y = yn–1 . . . y1y0. The numbers are compared from right to left (i.e., least significant bits to most significant bits).
(a) Derive the transition table for a typical cell, cell i, so that anbn = 00 if X = Y, anbn = 01 if X > Y, and anbn = 10 if X < Y.
(b) Derive minimum sum-of-product expressions for ai+1 and bi+1.
Cell n−1 xn−1 yn−1 an an−1 Cell n−2 xn−2 yn−2 an−2 ...
...
ai+1 Cell i xi yi ai a1 Cell 0 x0 y0 a0=0 16.20 Modify the binary comparator of Figure 16-6 so it will compare 2’s complement num-bers. Let a1 = x1 and b1 = y1. Note that all four combinations of ai and bi are used; 00 indicates that X and Y are positive and equal, 11 indicates that X and Y are negative and equal, 01 indicates X > Y, and 10 indicates X < Y. (For negative numbers, –2 > –3.) (a) Derive the transition table for this comparator similar to Table 16-5.
(b) Derive minimal sum-of-product expressions for ai+1 and bi+1.
(c) Derive a circuit for Z1, Z2, and Z3.
(d) Derive a state table for a sequential circuit that compares 2’s complement num-bers and produces the outputs Z1, Z2, and Z3 using the transition table of part (a) as a guideline. Note that the circuit will require a distinct initial state since a1 and b1 depend upon x1 and y1.
16.21 Design a sequential circuit having one input and one output that will produce an output of 1 for every second 0 it receives and for every second 1 it receives.
Example: X(input) = 0 1 1 0 1 1 1 0 0 0 0 1 0 1 1 0 0 1 0 1 1 0 1 0 Z(output) = 0 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1 (a) Design a Mealy sequential circuit using D flip-flops, showing a reduced state graph, and equations for the output and D inputs. It should be a reasonably economical design.
(b) Repeat part (a) for J-K flip-flops.
Cell n−1 xn−1 yn−1 bn an Cell n−2 xn−2 yn−2 bn−1 an−1 Cell i xi yi bi+1 ai+1 bn−2 an−2 Cell 0 x0 y0 b1 a1 bi ai b0 a0 ...
...
...
...
580 Unit 16 (c) Design a Moore sequential circuit using T flip-flops to do the same task, showing a state graph and input equations for a reasonably economical design.
16.22 Design a sequential circuit to multiply an 8-4-2-1 binary-coded decimal digit by 3 to give a 5-bit binary number. For example, if the input is 0111, the output should be 10101. The input and output to the circuit should be serial with the least significant bit first. Assume that the input will be 0 at the fifth clock time and reset the circuit after the fifth output bit. (Hint: As each bit is received, multiply it by 3, giving a product of either 00 or 11. Thus we either output 0 and carry 0 to the next column, or output 1 and carry 1 to the next column. If we carry a 1 to the next column, then the sum of the carry and the next product is either 01 or 100. In this case, we either output 1 and carry 0 or output 0 and carry 10 (2) to the next column. What happens if we carry 10 (2) to the next column?) (a) Derive a state table with a minimum number of states (3 states).
(b) Design the circuit using J-K flip-flops and NAND and NOR gates.
(c) Design the circuit using a PLA and D flip-flops. Give the PLA table.
16.23 A Moore sequential circuit has three inputs (X2, X1, and X0) that specify a tempera-ture range in a room. The circuit has two outputs (I and D) that control a heater for the room; I = 1 causes the heater to increase its heat output, and D = 1 causes the heater to decrease its heat output. If the temperature range is 0, 1 or 2, for three successive clock cycles, the circuit generates I = 1, and conversely if the tempera-ture range is 5, 6, or 7 , for three successive clock cycles, the circuit generates D = 1; otherwise, I = 0 and D = 0.
(a) Construct a state diagram for the circuit.
(b) Encode the states using a one-hot state assignment and derive the D flip-flop input equations and the output equations.
(c) Use a minimum number of D flip-flops and derive the D flip-flop input equa-tions and the output equations.
16.24 Repeat Problem 16.23 using a Mealy circuit.
16.25 A Moore sequential circuit has two inputs (X and Y) and three outputs (Z2, Z1, and Z0). The outputs are a 1’s complement number specifying the number of successive times X and Y have been equal or not equal as follows: In decimal, the outputs are 1, 2 and 3, if X and Y have been equal for one time, two successive times, and three or more suc-cessive times, and the outputs are, –1, –2, and −3 if X and Y have been not equal for one time, two successive times, and three or more successive times. Initially, the outputs are all 0.
(a) Construct a state diagram for the circuit.
(b) Encode the states using a one-hot state assignment and derive the D flip-flop input equations and the output equations.
(c) Use a minimum number of D flip-flops and derive the D flip-flop input equa-tions and the output equations.
16.26 Repeat Problem 16.25 using a Mealy sequential circuit.
Sequential Circuit Design 581 16.27 A Moore sequential circuit has two inputs (X and Y)and three outputs (Z2, Z1, and Z0). The outputs are a 2’s complement number specifying the number of successive times X and Y have been equal or not equal as follows: In decimal, the outputs are 1, 2, and 3 if X and Y have been equal for one time, two successive times, and three or more successive times, and the outputs are –1, –2, –3, and –4 if X and Y have been not equal for one time, two successive times, three successive times, and four or more successive times. Initially, the outputs are all 0.
(a) Construct a state diagram for the circuit.
(b) Encode the states using a one-hot state assignment and derive the D flip-flop input equations and the output equations.
(c) Use a minimum number of D flip-flops and derive the D flip-flop input equa-tions and the output equations.
16.28 Repeat Problem 16.27 using a Mealy sequential circuit.
16.29 The block diagram for an elevator controller for a two-floor elevator follows. The inputs FB1 and FB2 are 1 when someone in the elevator presses the first or second floor buttons, respectively. The inputs CALL1 and CALL2 are 1 when someone on the first or second floor presses the elevator call button. The inputs FS1 and FS2 are 1 when the elevator is at the first or second floor landing. The output UP turns on the motor to raise the elevator car; DOWN turns on the motor to lower the elevator. If neither UP nor DOWN is 1, then the elevator will not move. R1 and R2 reset the latches (described below); and when DO goes to 1, the elevator door opens. After the door opens and remains open for a reasonable length of time (as determined by the door controller mechanism), the door controller mechanism closes the door and sets DC = 1. Assume that all input signals are properly synchronized with the system clock.
(a) If we were to realize a control circuit that responded to all of the inputs FB1, FB2, CALL1, CALL2, FS1, FS2, and DC, we would need to implement logic equations with nine or more variables (seven inputs plus at least two state variables). However, if we combine the signals FBi and CALLi into a signal Ni (i = 1 or 2) that indicates that the elevator is needed on the specified floor, we can reduce the number of inputs into the control circuit. In addition, if the FB1 N1 R1 R2 UP DOWN DO N2 FB2 DC FS1 FS2 CALL1 CALL2 Storage Circuit Control Circuit Storage Circuit Door Mechanism 582 Unit 16 signal Ni is stored so that a single pulse on FBi or CALLi will set Ni to 1 until the control circuit clears it, then the control circuit will be simplified further. Using a D flip-flop and a minimum number of added gates, design a storage circuit that will have an output 1 when either input (FBi or CALLi) becomes 1 and will stay 1 until reset with a signal Ri.
(b) Using the signals N1 and N2 that indicate that the elevator is needed on the first or second floor (to deliver a passenger or pick one up or both), derive a state graph for the elevator controller. (Only four states are needed.) (c) Realize the storage circuits for N1 and N2 and the state graph.
16.30 An older model Thunderbird car has three left and three right taillights which flash in unique patterns to indicate left and right turns.
Design a Moore sequential circuit to control these lights. The circuit has three inputs LEFT, RIGHT, and HAZ. LEFT and RIGHT come from the driver’s turn signal switch and cannot be 1 at the same time. As indicated above, when LEFT = 1 the lights flash in a pattern LA on; LA and LB on; LA, LB, and LC on; all off; and then the sequence repeats. When RIGHT = 1, the light sequence is similar. If a switch from LEFT to RIGHT (or vice versa) occurs in the middle of a flashing sequence, the circuit should immediately go to the IDLE (lights off) state and, then, start the new sequence. HAZ comes from the hazard switch, and when HAZ = 1, all six lights flash on and off in unison. HAZ takes precedence if LEFT or RIGHT is also on. Assume that a clock signal is available with a frequency equal to the desired flashing rate.
(a) Draw the state graph (eight states).
(b) Realize the circuit using six D flip-flops and make a state assignment such that each flip-flop output drives one of the six lights directly. (Use LogicAid.) (c) Realize the circuit using three D flip-flops, using the guidelines to determine a suitable state assignment. Note the trade-off between more flip-flops and more gates in (b) and (c).
16.31 Design a sequential circuit to control the motor of a tape player. The logic circuit, shown as follows, has five inputs and three outputs. Four of the inputs are the control buttons on the tape player. The input PL is 1 if the play button is pressed, the input RE is 1 if the rewind button is pressed, the input FF is 1 if the fast forward button is pressed, and the input ST is 1 if the stop button is pressed. The fifth input to the con-trol circuit is M, which is 1 if the special music sensor detects music at the current tape position. The three outputs of the control circuit are P, R, and F, which make the tape LC LB LA RA RB RC LEFT turn pattern: LC LB LA RA RB RC RIGHT turn pattern: Sequential Circuit Design 583 play, rewind, and fast forward, respectively, when 1. No more than one output should ever be on at a time; all outputs off cause the motor to stop. The buttons control the tape as follows: If the play button is pressed, the tape player will start playing the tape (output P = 1). If the play button is held down and the rewind button is pressed and released, the tape player will rewind to the beginning of the current song (output R = 1 until M = 0) and then start playing. If the play button is held down and the fast forward button is pressed and released, the tape player will fast forward to the end of the current song (output F = 1 until M = 0) and then start playing. If rewind or fast forward is pressed while play is released, the tape player will rewind or fast forward the tape. Pressing the stop button at any time should stop the tape player motor.
4-bit Register BCD X2 3 3 4-bit Register BCD X2 3 3 Serial In 4-bit Register BCD X2 3 3 (a) Construct a state graph chart for the tape player control circuit.
(b) Realize the control circuit using a PLA and D flip-flops.
16.32 The circuit below converts a positive, unsigned binary number into a BCD decimal number. The binary number is entered bit serially with the most significant bit first. As each input bit is entered, the BCD number in the registers is multiplied by 2 and the input bit added to it.
(a) Show the contents of the registers after each input bit for the binary number 110110111.
(b) What is the largest binary number that this circuit can correctly convert to BCD?
(c) Derive the minimum sum-of-product equations for the outputs of the BCD mul-tiply by 2 circuit. Let x3, x2, x1, x0 be the inputs and y3, y2, y1, y0 be the outputs.
16.33 An iterative circuit has an output of 1 from the last cell if and only if the input pat-tern 1011 or 1101 has occurred as inputs to any four adjacent cells in the circuit.
(a) Find a Moore state graph or table with a minimum number of states.
(b) Make a suitable state assignment, and derive one of the equations for a typical cell.
(c) Derive the output equation.
PL RE FF ST M F R P 584 Unit 16 16.34 An iterative circuit has a form similar to Figure 16-6. The output Z is to be 1 iff at least one of the X inputs is 1, and no group of two or more consecutive 1 inputs occurs.
Example: 0 0 1 0 1 0 0 0 1 0 0 gives an output Z = 1 0 0 1 0 1 1 0 0 0 0 0 gives an output Z = 0 (a) Draw a state graph for a typical cell.
(b) Derive the equations and a NOR-gate circuit for a typical cell and for the output circuit.
(c) Specify a1 and b1, and simplify the first cell.
(d) Show how a sequential circuit can be constructed using the typical cell and output circuit.
585 VHDL for Sequential Logic U N I T 1 7 Objectives 1. Represent flip-flops, shift registers, and counters using VHDL processes.
2. Write sequential VHDL statements, including if-then-else, case, and wait statements.
3. Explain the sequence of execution for sequential statements and the order in which signals are updated when a process executes.
4. Represent combinational logic using a process.
5. Represent a sequential logic circuit with VHDL code.
a. Use two processes.
b. Use logic equations and a process that updates the flip-flops.
c. Use a ROM and flip-flops.
6. Given VHDL code for sequential logic, draw the corresponding logic circuit.
7. Compile, simulate, and synthesize a sequential logic module.
586 Unit 17 Study Guide 1. Study Section 17.1, Modeling Flip-Flops Using VHDL Processes.
(a) Under what condition is the expression CLK'event and CLK = '0' true?
(b) If the first line of a process is Process (St, Q1, V), under what condition will the process execute?
(c) In Figure 17-4, if C1 and C3 are false and C2 is true, which statements will execute?
(d) What device does the following VHDL code represent? What happens if ClrN = SetN = '0'?
process (CLK, ClrN, SetN) if ClrN = '0' then Q <= '0'; elsif SetN = '0' then Q <= '1'; elsif CLK'event and CLK = '1' then Q <= D; end if; end process; (e) In Figure 17-6, why are RN and SN tested before CLK? If J = '1', K = '0', and RN changes to '0', and then CLK changes to '0' 10 ns later, what will be the Q output?
(f ) In Figure 17-6, if the statements Q < = Qint; and QN < = not Qint; are moved inside the process just before the end-process statement, why will Q and QN have the wrong values?
(g) Modify the VHDL code in Figure 17-3 to add a clock enable (CE) to the flip-flop. (Hint: if CLK'event and CLK = '1' and __ .) (h) Work Problem 17.1.
2. Study Section 17.2, Modeling Registers and Counters Using VHDL Processes.
(a) Add the necessary VHDL code to Figure 17-9 to make a complete VHDL module.
(b) In Figure 17-10, if CLK changes to '1' at time 10 ns, at what time will Q change? (Remember that it takes Δ time to update a signal).
(c) What change should be made to Figure 17-10 to cause the register to rotate left one place instead of shifting left? (Do not use shift operators.) (d) In Figure 17-11, what changes would be needed to make the clear asyn-chronous?
VHDL for Sequential Logic 587 (e) In Figure 17-12, under what conditions does Carry2 = 1?
(f ) In Figure 17-11, note that Q is a std_logic vector. Why would the code fail to compile if Q is a bit_vector?
(g) In Figure 17-14, if Qout1 = "1111", Qout2 = "1001", P = T1 = LdN = ClrN = '1', what will Qout1 and Qout2 be after the rising edge of CLK?
(h) If the process in Figure 17-13 is replaced with process (CLK) begin if CLK'event and CLK = '1' then if Ld = '1' then Q <= D; elsif (P and T) = '1' then Q <= Q + 1; elsif Clr = '1' then Q <= "0000"; end if; end if; end process; modify Table 17-1 to properly represent the corresponding counter operation.
Control Signals Next State Clr Ld PT Q+ 3 Q+ 2 Q+ 1 Q+ 0 (i) Work Problems 17.2, and 17.3.
3. Study Section 17.3, Modeling Combinational Logic Using VHDL Processes.
(a) For Figure 17-15, if the circuit is represented by a single sequential state-ment, make the necessary changes in the VHDL code. Assume that the AND gate delay is negligible and the OR gate delay is 5 ns. (Hint: The process sensitivity list should only have three signals on it.) (b) Work Problem 17.4.
4. Study Section 17.4, Modeling a Sequential Machine.
(a) If Figure 17-16 implements the state table of Table 17-2, what will NextState and Z be if State = S2 and X = '1'?
588 Unit 17 (b) For the VHDL code of Figure 17-17: (1) Why is the integer range 0 to 6?
(2) Assume that initially CLK = '0', State = 0, and X = '0'. Trace the code to answer the following: If X changes to '1', what happens?
If CLK then changes to '1', what happens? (Hint: Both processes execute.) Work Problem 17.5.
(c) Explain how the waveform of Figure 17-18 relates to Table 17-2.
Why is there a glitch in the nextstate waveform between next states 0 and 2?
Why does this glitch not cause the state to go to the wrong value?
(d) For the VHDL code of Figure 17-19: Why do Q1, Q2, and Q3 not appear on the sensitivity list?
If CLK changes from 0 to 1 at time 5 ns, at what time are the new values of Q1, Q2, and Q3 computed? At what time do Q1, Q2, and Q3 change to these new values?
(e) Recall that component instantiation statements are concurrent state-ments. For the VHDL code of Figure 17-20, if Q1 changes, which of these statements will execute immediately? Relate your answer to the circuit of Figure 16-4.
(f ) For Figure 17-22, what value will be read from the ROM array when X = '1' and Q = "010"?
(g) Work Problem 17.6.
5. Study Section 17.5, Synthesis of VHDL Code.
(a) Implement the following process using only a D-CE flip-flop: VHDL for Sequential Logic 589 process (CLK) begin if CLK'event and CLK = '1' then if En = '1' then Q <= A; end if; end if; end process; (b) Implement the same code using a D flip-flop without a clock enable and a MUX.
(c) Implement the following VHDL code using only D-CE flip-flops: signal A: bit_vector(3 downto 0) ----------------------------------------process (CLK) begin if CLK'event and CLK = '1' then if ASR = '1' then A <= A(3) & A(3 downto 1); end if; end if; end process; (d) Work Problem 17.7.
6. Study Section 17.6, More About Processes and Sequential Statements.
(a) Write an equivalent process that has no sensitivity list on the first line. Use a wait statement instead.
process (B, C) begin A <= B or C; end process; (b) For the following process, if B changes at time 2 ns, at what time does state-ment (2) execute? (The answer is not 7 ns.) process (B, D); A <= B after 5 ns; --(1) C <= D; --(2) end process; (c) Work Problem 17.8.
7. Complete the assigned lab exercises before you take the test on Unit 17.
590 In Unit 10 we learned how to represent combinational logic in VHDL by using con-current signal assignment statements. In this unit, we will learn how to represent sequential logic by using VHDL processes.
17.1 Modeling Flip-Flops Using VHDL Processes A flip-flop can change state either on the rising or on the falling edge of the clock input. This type of behavior is modeled in VHDL by a process. For a simple D flip-flop with a Q output that changes on the rising edge of CLK, the corresponding process is given in Figure 17-1.
The expression in parentheses after the word process is called a sensitivity list, and the process executes whenever any signal in the sensitivity list changes. For example, if the process begins with process(A, B, C), then the process executes when-ever any one of A, B, or C changes. When a process finishes executing, it goes back to the beginning and waits for a signal on the sensitivity list to change again.
In Figure 17-1, whenever CLK changes, the process executes once through and, then, waits at the start of the process until CLK changes again. The if statement tests for a rising edge of the clock, and Q is set equal to D when a rising edge occurs. The expression CLK'event (read as clock tick event) is TRUE whenever the signal CLK changes. If CLK = '1' is also TRUE, this means that the change was from '0' to '1', which is a rising edge. If the flip-flop has a delay of 5 ns between the rising edge of the clock and the change in the Q output, we would replace the statement Q <= D; with Q <= D after 5 ns; in the process in Figure 17-1.
The statements between begin and end in a process are called sequential statements. In the process in Figure 17-1, Q <= D; is a sequential statement that only VHDL for Sequential Logic FIGURE 17-1 VHDL Code for a Simple D Flip-Flop © Cengage Learning 2014 process (CLK) begin if CLK'event and CLK = '1' -- rising edge of CLK then Q <= D; end if; end process; DFF CLK D Q VHDL for Sequential Logic 591 executes following the rising edge of CLK. In contrast, the concurrent statement Q <= D; executes whenever D changes. If we synthesize the process, the synthesizer infers that Q must be a flip-flop because it only changes on the rising edge of CLK. If we synthesize the concurrent statement Q <= D; the synthesizer will simply connect D to Q with a wire or with a buffer.
In Figure 17-1 note that D is not on the sensitivity list because changing D will not cause the flip-flop to change state. Figure 17-2 shows a transparent latch and its VHDL representation. Both G and D are on the sensitivity list because if G = '1', a change in D causes Q to change. If G changes to '0', the process executes, but Q does not change.
FIGURE 17-2 VHDL Code for a Transparent Latch © Cengage Learning 2014 process (G,D) begin if G = '1' then Q <= D; end if; end process; Q D G FIGURE 17-3 VHDL Code for a D Flip-Flop with Asynchronous Clear © Cengage Learning 2014 ClrN process (CLK, ClrN) begin if ClrN = '0' then Q <= '0'; else if CLK'event and CLK = '1' then Q <= D; end if; end if; end process; DFF CLK D Q If a flip-flop has an active-low asynchronous clear input (ClrN) that resets the flip-flop independently of the clock, then we must modify the process of Figure 17-1 so that it executes when either CLK or ClrN changes. To do this, we add ClrN to the sensitivity list. The VHDL code for a D flip-flop with asynchronous clear is given in Figure 17-3. Because the asynchronous ClrN signal overrides CLK, ClrN is tested first, and the flip-flop is cleared if ClrN is '0'. Otherwise, CLK is tested, and Q is updated if a rising edge has occurred.
A basic process has the following form: process(sensitivity-list) begin sequential-statements end process; Whenever one of the signals in the sensitivity list changes, the sequential statements in the process body are executed in sequence one time. The process then goes back to the beginning and waits for a signal in the sensitivity list to change.
In the previous examples, we have used two types of sequential statements— signal assignment statements and if statements. The basic if statement has the form if condition then sequential statements1 else sequential statements2 end if; 592 Unit 17 The condition is a Boolean expression which evaluates to TRUE or FALSE. If it is TRUE, sequential statements1 are executed; otherwise, sequential statements2 are executed. VHDL if statements are sequential statements that can be used within a process, but they cannot be used as concurrent statements outside of a process. On the other hand, conditional signal assignment statements are concurrent statements that cannot be used within a process.
The most general form of the if statement is if condition then sequential statements {elsif condition then sequential statements} -- 0 or more elsif clauses may be included [else sequential statements] end if; The curly brackets indicate that any number of elsif clauses may be included, and the square brackets indicate that the else clause is optional. The example of Figure 17-4 shows how a flow chart can be represented using nested ifs or the equivalent using elsifs. In this example, C1, C2, and C3 represent conditions that can be TRUE or FALSE, and S1, S2, . . . S8 represent sequential statements. Each if requires a cor-responding end if, but an elsif does not.
Next, we will write a VHDL module for a J-K flip-flop (Figure 17-5). This flip-flop has active-low asynchronous preset (SN) and clear (RN) inputs. State changes related to J and K occur on the falling edge of the clock. In this chapter, we use a suf-fix N to indicate an active-low (negative-logic) signal. For simplicity, we will assume that the condition SN = RN = 0 does not occur.
FIGURE 17-4 Equivalent Representations of a Flow Chart Using Nested Ifs and Elsifs © Cengage Learning 2014 C1 T S1; S2; C2 T S3; S4; C3 T F F F S5; S6; S7; S8; if (C1) then S1; S2; else if (C2) then S3; S4; else if (C3) then S5; S6; else S7; S8; end if; end if; end if; if (C1) then S1; S2; elsif (C2) then S3; S4; elsif (C3) then S5; S6; else S7; S8; end if; VHDL for Sequential Logic 593 The VHDL code for the J-K flip-flop is given in Figure 17-6. The port declaration in the entity defines the input and output signals. Within the architecture we define a signal Qint that represents the state of the flip-flop internal to the module. The two concurrent statements after begin transmit this internal signal to the Q and QN outputs of the flip-flop. We do it this way because an output signal in a port cannot appear on the right side of an assignment statement within the architecture. The flip-flop can change state in response to changes in SN, RN, and CLK, so these three signals are in the sensitivity list of the process. Because RN and SN reset and set the flip-flop independently of the clock, they are tested first. If RN and SN are both '1', then we test for the falling edge of the clock. The condition (CLK'event and CLK = '0') is TRUE only if CLK has just changed from '1' to '0'. The next state of the flip-flop is determined by its characteristic equation: Q+ = JQ′ + K′Q The 8-ns delay represents the time it takes to set or clear the flip-flop output after SN or RN changes to 0. The 10-ns delay represents the time it takes for Q to change after the falling edge of the clock.
FIGURE 17-6 J-K Flip-Flop Model © Cengage Learning 2014 1 entity JKFF is 2 port (SN, RN, J, K, CLK: in bit; -- inputs 3 Q, QN: out bit); 4 end JKFF; 5 architecture JKFF1 of JKFF is 6 signal Q f o e u l a v l a n r e t n i --; t i b : t n i Q 7 begin 8 Q t r o p o t N Q d n a Q t u p t u o --; t n i Q 9 QN not Qint; 10 process (SN, RN, CLK) 11 begin 12 if RN '0' then Qint '0' after 8 ns; -- RN '0' will clear the FF 13 elsif SN '0' then Qint '1' after 8 ns; -- SN '0' will set the FF 14 elsif CLK'event and CLK '0' then -- falling edge of CLK 15 Qint (J and not Qint) or (not K and Qint) after 10 ns; 16 end if; 17 end process; 18 end JKFF1; <= <= <= <= <= = = = = = FIGURE 17-5 J-K Flip-Flop © Cengage Learning 2014 JKFF CLK RN SN J K Q QN 594 Unit 17 17.2 Modeling Registers and Counters Using VHDL Processes When several flip-flops change state on the same clock edge, the statements repre-senting these flip-flops can be placed in the same clocked process. Figure 17-7 shows three flip-flops connected as a cyclic shift register. These flip-flops all change state following the rising edge of the clock. We have assumed a 5-ns propagation delay between the clock edge and the output change. Immediately following the clock edge, the three statements in the process execute in sequence with no delay. The new values of the Q’s are then scheduled to change after 5 ns. If we omit the delay and replace the sequential statements with Q1 <= Q3; Q2 <= Q1; Q3 <= Q2; the operation is basically the same. The three statements execute in sequence in zero time, and, then, the Q’s change value after Δ delay. In both cases the old values of Q1, Q2, and Q3 are used to compute the new values. This may seem strange at first, but that is the way the hardware works. At the rising edge of the clock, all of the D inputs are loaded into the flip-flops, but the state change does not occur until after a propagation delay.
Next we will write structural VHDL code for the cyclic shift register using a D flip-flop as a component. In the writing of structural VHDL code, instantiation statements are used to specify how components are connected together. Components may be declared and defined either in a library or within the architecture part of the VHDL code. Each copy of a component requires a separate instantiation statement to specify how it is connected to other components and to the port inputs and out-puts. Instantiation statements are concurrent statements, not sequential statements, and therefore they cannot be used within a process. A component can be as simple as a single gate or as complex as a digital system that contains many internal signals, registers, control circuits, and other components. Each instantiation statement rep-resents a copy of a hardware component. The instantiation statement connects the component inputs and outputs, and the component computes new outputs when-ever one of its inputs changes. This is exactly how the real hardware component FIGURE 17-7 Cyclic Shift Register © Cengage Learning 2014 Q1 D Q2 D Q3 D CLK process (CLK) begin if CLK'event and CLK = '1' then Q1 <= Q3 after 5 ns; Q2 <= Q1 after 5 ns; Q3 <= Q2 after 5 ns; end if; end process; VHDL for Sequential Logic 595 works. Instantiating a component is different from calling a function in a computer program. A function returns a new value whenever it is called, but an instantiated component computes a new output value whenever its input changes.
The VHDL code of Figure 17-8 has two modules. The first one models a simple D flip-flop. The second module instantiates three copies of the D flip-flop compo-nent to model the cyclic shift register of Figure 17-7. Qout represents a 3-bit output from the register. The internal signals (Q1, Q2, and Q3) that are declared within the architecture are used to connect the flip-flop inputs and outputs. Lines 21, 22, and 23 instantiate three copies of the D flip-flop component. Even though the DFF module has a clock input and internal sequential statements, each instantiation statement is still a concurrent statement and must not be placed in a process. If CLK changes, this change is passed to the D flip-flop components, and the effect of the clock change is handled within the components.
Figure 17-9 shows a simple register that can be loaded or cleared on the rising edge of the clock. If CLR = 1, the register is cleared, and if Ld = 1, the D inputs are loaded into the register. This register is fully synchronous so that the Q outputs only change in response to the clock edge and not in response to a change in Ld or CLR. In the VHDL code for the register, Q and D are bit vectors dimensioned 3 downto 0. Because the register outputs can only change on the rising edge of the clock, CLR is not on the FIGURE 17-8 Structural VHDL Code for Cyclic Shift Register © Cengage Learning 2014 1 entity DFF is --simple DFF 2 port (D, CLK: in bit, q: out bit); 3 end DFF; 4 architecture DFF_simple of DFF is 5 begin 6 process (CLK) 7 begin 8 if CLK'event and CLK = '1' then 9 Q <= D after 5 ns; end if; 10 end process; 11 end DFF_simple; 12 entity cyclicSR is -- 3-bit cyclic shift register 13 port (CLK: in bit; Qout: out bit_vector(1 to 3) ) ; 14 end cyclicSR; 15 architecture cyclicSR3 of cyclicSR is 16 component DFF 17 port (D, CLK: in bit; Q: out bit); 18 end component; 19 signal Q1, Q2, Q3: bit; 20 begin 21 FF1: DFF port map (Q3, CLK, Q1); 22 FF2: DFF port map (Q1, CLK, Q2); 23 FF3: DFF port map (Q2, CLK, Q3); 24 Qout <= Q1&Q2&Q3 25 end cyclicSR3; 596 Unit 17 sensitivity list. It is tested after the rising edge of the clock instead of being tested first as in Figure 17-3. If CLR = Ld = '0', Q does not change. Because CLR is tested before Ld, if CLR = '1', the elsif prevents Ld from being tested and CLR overrides Ld.
Next, we will model a left-shift register using a VHDL process. The register in Figure 17-10 is similar to that in Figure 17-9, except we have added a left-shift con-trol input (LS). When LS is '1', the contents of the register are shifted left and the rightmost bit is set equal to Rin. The shifting is accomplished by taking the rightmost three bits of Q, Q(2 downto 0) and concatenating them with Rin. For example, if Q = "1101" and Rin = '0', then Q(2 downto 0) & Rin = "1010", and this value is loaded back into the Q register on the rising edge of CLK. The code implies that if CLR = Ld = LS = '0', then Q remains unchanged.
Figure 17-11 shows a simple synchronous counter. On the rising edge of the clock, the counter is cleared when ClrN = '0', and it is incremented when ClrN = En = '1' . In this example, the signal Q represents the 4-bit value stored in the counter. Because addition is not defined for bit_vectors, we have declared Q to be of type std logic_ vector. Then, we can increment the counter using the overloaded “+ ” operator that is defined in the ieee.std_logic_unsigned package. The statement Q < = Q + 1; increments the counter. When the counter is in state "1111", the next increment takes it back to state "0000".
FIGURE 17-9 Register with Synchronous Clear and Load © Cengage Learning 2014 Q3 Q2 Q1 Register Q0 Ld D3 D2 D1 D0 CLK CLR process (CLK) begin if CLK'event and CLK = '1' then if CLR = '1' then Q <= "0000"; elsif Ld = '1' then Q <= D; end if; end if; end process; FIGURE 17-10 Left-Shift Register with Synchronous Clear and Load © Cengage Learning 2014 Q3 Q2 Q1 Left SR Rin Q0 Ld D3 D2 D1 D0 CLK LS CLR process (CLK) begin if CLK'event and CLK = '1' then if CLR = '1' then Q <= "0000"; elsif Ld = '1' then Q <= D; elsif LS = '1' then Q <= Q(2 downto 0) & Rin; end if; end if; end process; FIGURE 17-11 VHDL Code for a Simple Synchronous Counter © Cengage Learning 2014 Q3 Q2 Q1 Counter Q Q0 En CLK Clr ClrN signal Q: std_logic_vector(3 downto 0); ------------process (CLK) begin if CLK'event and CLK = '1' then if ClrN = '0' then Q <= "0000"; elsif En = '1' then Q <= Q + 1; end if; end if; end process; VHDL for Sequential Logic 597 The 74163 (see Figure 17-12) is a 4-bit fully synchronous binary counter which is available in both TTL and CMOS logic families. Although rarely used in new designs at present, it represents a general type of counter that is found in many CAD design libraries. In addition to performing the counting function, it can be cleared or loaded in parallel. All operations are synchronized by the clock, and all state changes take place following the rising edge of the clock input.
This counter has four control inputs: ClrN, LdN, P , and T. Inputs P and T are used to enable the counting function. Operation of the counter is as follows: 1. If ClrN = 0, all flip-flops are set to 0 following the rising clock edge.
2. If ClrN = 1 and LdN = 0, the D inputs are transferred in parallel to the flip-flops following the rising clock edge.
3. If ClrN = LdN = 1 and P = T = 1, the count is enabled and the counter state will be incremented by 1 following the rising clock edge.
If T = 1, the counter generates a carry (Cout) in state 15, so Cout = Q3 Q2 Q1 Q0 T Table 17-1 summarizes the operation of the counter. Note that ClrN overrides the load and count functions in the sense that when ClrN = 0, clearing occurs regardless of the values of LdN, P , and T. Similarly, LdN overrides the count function. The ClrN input on the 74163 is referred to as a synchronous clear input because it clears the counter in synchronization with the clock, and no clearing can occur if a clock pulse is not present.
The VHDL description of the counter is shown in Figure 17-13. Q represents the four flip-flops that make up the counter. The counter output, Qout, changes whenever Q changes. The carry output is computed whenever Q or T changes. The first if statement in the process tests for a rising edge of CLK. Because clear overrides load and count, the next if statement tests ClrN first. Because load overrides count, LdN is tested next. TABLE 17-1 74163 Counter Operation © Cengage Learning 2014 FIGURE 17-12 Two 74163 Counters Cascaded to Form an 8-Bit Counter © Cengage Learning 2014 Q3 Q2 Q1 Qout2 Din2 Q0 D3 D2 D1 74163 D0 P P Clr ClrN Ld LdN T Cout Carry2 Q3 Q2 Q1 Qout1 Din1 Q0 D3 D2 D1 74163 D0 P Clr ClrN CLK Ld LdN T P T1 Cout Carry1 Control Signals Next State ClrN LdN PT Q+ 3 Q+ 2 Q+ 1 Q+ 0 0 X X 0 0 0 0 (Clear) 1 0 X D3 D2 D1 D0 (Parallel load) 1 1 0 Q3 Q2 Q1 Q0 (No change) 1 1 1 Present state + 1 (Increment count) 598 Unit 17 Finally, the counter is incremented if both P and T are 1. Because Q is type std_logic_ vector, we can use the overloaded “+” operator from the ieee.std_ logic_unsigned library to add 1 to increment the counter. The expression Q + 1 would not be legal if Q were a bit_vector because addition is not defined for bit_vectors.
To test the counter, we have cascaded two 74163’s to form an 8-bit counter (Figure 17-12). When the counter on the right is in state 1111 and T1 = 1, the T input to the left counter is Carry1 = 1. Then, if P = 1, on the next clock the right counter is incremented to 0000 at the same time the left counter is incremented. Figure 17-14 shows the VHDL code for the 8-bit counter. In this code we have used the c74163 model as a component and instantiated two copies of it. For convenience in reading the output, we have defined a signal Count which is the integer equivalent of the 8-bit counter value. The function Conv_integer converts a std_logic_vector to an integer.
The two instantiation statements (lines 21 and 22) connect the inputs and outputs of two copies of the 4-bit counter component. Each of these concurrent statements will execute when one of the counter inputs changes, and then the corresponding counter module computes new values of the counter outputs. Although the 4-bit FIGURE 17-13 74163 Counter Model © Cengage Learning 2014 -- 74163 FULLY SYNCHRONOUS COUNTER 1 library IEEE; 2 use IEEE.STD_LOGIC_1164.ALL; 3 use IEEE.STD_LOGIC_ARITH.ALL; 4 use IEEE.STD_LOGIC_UNSIGNED.ALL; 5 entity c74163 is 6 port(LdN, ClrN, P, T, CLK: in std_logic; 7 D: in std_logic_vector(3 downto 0); 8 Cout: out std_logic; Qout: out std_logic_vector(3 downto 0) ); 9 end c74163; 10 architecture b74163 of c74163 is 11 signal Q: std_logic_vector(3 downto 0); -- Q is the counter register 12 begin 13 Qout Q; 14 Cout Q(3) and Q(2) and Q(1) and Q(0) and T; 15 process (CLK) 16 begin 17 if CLK'event and CLK ='1' then -- change state on rising edge 18 if ClrN '0' then Q "0000"; 19 elsif LdN '0' then Q D; 20 elsif (P and T) = '1' then Q <= Q + 1; 21 end if; 22 end if; 23 end process; 24 end b74163; <= <= <= = = <= VHDL for Sequential Logic 599 counter module (Figure 17-13) contains a process and sequential statements, each statement that instantiates a counter module is nevertheless a concurrent statement and cannot be placed within a process.
17.3 Modeling Combinational Logic Using VHDL Processes Although processes are most useful for modeling sequential logic, they can also be used to model combinational logic. The circuit of Figure 10-1 can be modeled by the process shown in Figure 17-15.
For a combinational process, every signal that appears on the right side of a signal assignment must appear on the sensitivity list. Suppose that initially A = 1, and B = C = D = E = 0. If B changes to 1 at time = 4 ns, the process executes, and the two sequential assignment statements execute in sequence. The new value of FIGURE 17-14 VHDL for 8-Bit Counter © Cengage Learning 2014 -- Test module for 74163 counter 1 library IEEE; 2 use IEEE.STD_LOGIC_1164.ALL; 3 use IEEE.STD_LOGIC_ARITH.ALL; 4 use IEEE.STD_LOGIC_UNSIGNED.ALL; 5 entity c74163test is 6 port(ClrN, LdN, P, T1, CLK: in std_logic; 7 Din1, Din2: in std_logic_vector (3 downto 0); 8 Count: out integer range 0 to 255; 9 Carry2: out std_logic); 10 end c74163test; 11 architecture tester of c74163test is 12 component c74163 13 port(LdN, ClrN, P, T, CLK: in std_logic; 14 D: in std_logic_vector(3 downto 0); 15 Cout: out std_logic; Qout: out std_logic_vector (3 downto 0) ); 16 end component; 17 signal Carry1: std_logic; 18 signal Qout1, Qout2: std_logic_vector (3 downto 0); 19 begin 20 ct1: c74163 port map (LdN, ClrN, P, T1, CLK, Din1, Carry1, Qout1); 21 ct2: c74163 port map (LdN, ClrN, P, Carry1, CLK, Din2, Carry2, Qout2); 22 Count Conv_integer(Qout2 & Qout1); 23 end tester; <= 600 Unit 17 C is computed to be '1', and C is scheduled to change 5 ns later. Meanwhile, E is immediately computed using the old value of C, but it does not change because C has not yet changed. After 5 ns, C changes, and because it is on the sensitivity list, the process executes again, and the sequential statements again execute in sequence. This time C does not change, but E is scheduled to change after 5 ns. Because E is not on the sensitivity list, no further execution of the process occurs. The following listing summarizes the operation: time A B C D E 0 1 0 0 0 0 4 1 1 0 0 0 process executes (C ←1 after 5 ns; E ←0, no change) 9 1 1 1 0 0 process executes (C ←1, no change; E ←1 after 5 ns) 14 1 1 1 0 1 no further execution until A, B, C, or D changes In Section 10.2, we modeled a MUX using a conditional signal assignment statement and a selected signal assignment statement. Because these are concurrent statements, they cannot be used inside a process. However, the case statement is a sequential statement that can be used to model a MUX within a process. The 4-to-1 MUX of Figure 10-7 can be modeled as follows: FIGURE 17-15 VHDL Code for Gate Circuit © Cengage Learning 2014 process (A, B, C, D) begin C <= A and B after 5 ns; E <= C or D after 5 ns; end process; A B D C E signal sel: bit_vector(0 to 1); ----------------------------------------------------sel < = A&B -- a concurrent statement, outside of the process process (sel, I0, I1, I2, I3) begin case sel is -- a sequential statement in the process when "00" = > F < = I0; when "01" = > F < = I1; when "10" = > F < = I2; when "11" = > F < = I3; when others = > null; -- required if sel is a std_logic_vector; -- omit if sel is a bit_vector end case; end process; VHDL for Sequential Logic 601 The case statement has the general form: case expression is when choice1 => sequential statements1 when choice2 => sequential statements2 . . . [when others => sequential statements] end case; The “expression” is evaluated first. If it is equal to “choice1” , then “sequen-tial statements1” are executed; if it is equal to “choice2” , then “sequential state-ments2” are executed, etc. All possible values of the expression must be included in the choices. If all values are not explicitly given, a “when others” clause is required in the case statement. If no action is specified for the other choices, the clause should be when others = > null; 17.4 Modeling a Sequential Machine In this section we will discuss several ways of writing VHDL descriptions for sequen-tial machines. First, we will write a behavioral model for a Mealy sequential circuit based on the state table of Table 17-2. This table is the same as Table 16-3 with the states renamed. It represents a BCD to excess-3 code converter with inputs and outputs LSB first.
As shown in Figure 17-16, a Mealy machine consists of a combinational cir-cuit and a state register. The VHDL model of Figure 17-17 uses two processes to represent these two parts of the circuit. Because X and Z are external signals, they are declared in the port. State and Nextstate are internal signals that represent the state and next state of the sequential circuit, so they are declared at the start of the architecture. At the behavioral level, we represent the state and next state of the cir-cuit by integer signals with a range of 0 to 6.
TABLE 17-2 State Table for Code Converter © Cengage Learning 2014 NS Z PS X = 0 X = 1 X = 0 X = 1 S0 S1 S2 1 0 S1 S3 S4 1 0 S2 S4 S4 0 1 S3 S5 S5 0 1 S4 S5 S6 1 0 S5 S0 S0 0 1 S6 S0 – 1 – 602 Unit 17 The first process represents the combinational circuit of Figure 17-16. Because the circuit outputs, Z and Nextstate, can change when either the State or X changes, the sensitivity list includes both State and X. The case statement tests the value of State, and then for each state, the if statement tests X to determine the new values of Z and Nextstate. For state S6, we assigned values to the don’t-cares so that Z and Nextstate are independent of X. The second process represents the state register. Whenever the rising edge of the clock occurs, the State is updated to the Nextstate value, so CLK appears in the sensitivity list. A typical sequence of execution for the two processes is as follows: 1. X changes and the first process executes. New values of Z and NextState are computed.
2. The clock falls, and the second process executes. Because CLK = '0', nothing happens.
3. The clock rises, and the second process executes again. Because CLK = '1', State is set equal to the Nextstate value.
4. If State changes, the first process executes again. New values of Z and Nextstate are computed.
A simulator command file which can be used to test Figure 17-17 follows: add wave CLK X State Nextstate Z force CLK 0 0, 1 100 -repeat 200 force X 0 0, 1 350, 0 550, 1 750, 0 950, 1 1350 run 1600 The first command specifies the signals which are to be included in the waveform output. The next command defines a clock with period of 200 ns. CLK is '0' at time 0 ns, '1' at time 100 ns, and repeats every 200 ns. In a command of the form force signal_name v1 t1, v2 t2, . . .
signal_name gets the value v1 at time t1, the value v2 at time t2, etc. X is '0' at time 0 ns, changes to '1' at time 350 ns, changes to '0' at time 550 ns, etc. The X input corresponds to the sequence 0010 1001, and only the times at which X changes are FIGURE 17-16 General Model of Mealy Sequential Machine © Cengage Learning 2014 Combinational Circuit State Reg Inputs (X) Outputs (Z) Nextstate State CLK VHDL for Sequential Logic 603 FIGURE 17-17 Behavioral Model for Table 17-2 © Cengage Learning 2014 -- This is a behavioral model of a Mealy state machine (Table 17-2) based on its state -- table. The output (Z) and next state are computed before the active edge of the clock.
-- The state change occurs on the rising edge of the clock.
1 entity SM17_2 is 2 port (X, CLK: in bit; 3 Z: out bit); 4 end SM17_2; 5 architecture Table of SM17_2 is 6 signal State, Nextstate: integer range 0 to 6 : 0; 7 begin 8 process(State, X) -- Combinational Circuit 9 begin 10 case State is 11 when 0 = > 12 if X = '0' then Z <= '1'; Nextstate <= 1; 13 else Z '0'; Nextstate 14 when 1 => 15 if X '0' then Z <= '1'; Nextstate <= 3; 16 else Z 17 when 2 => 18 if X = '0' then Z <= '0'; Nextstate <= 4; 19 else Z 20 when 3 => 21 if X = '0' then Z <= '0'; Nextstate <= 5; 22 else Z 23 when 4 => 24 if X = '0' then Z <= '1'; Nextstate <= 5; 25 else Z <= '0'; Nextstate <= 6; end if; 26 when 5 => 27 if X = '0' then Z <= '0'; Nextstate <= 0; 28 else Z <= '1'; Nextstate <= 0; end if; 29 when 6 => 30 Z <= '1'; Nextstate <= 0; 31 end case; 32 end process; 33 process (CLK) -- State Register 34 begin 35 if CLK’event and CLK = '1' then -- rising edge of clock 36 State 37 end if; 38 end process; 39 end Table; = <= 2; end if; <= '1'; Nextstate <= 5; end if; <= '1'; Nextstate <= 4; end if; <= '0'; Nextstate <= 4; end if; = <= <= Nextstate; 604 Unit 17 specified. Execution of the preceding command file produces the waveforms shown in Figure 17-18.
The behavioral VHDL model of Figure 17-17 is based on the state table. After we have derived the next-state and output equations from the state table, we can write a data flow VHDL model based on these equations. The VHDL model of Figure 17-19 is based on the next-state and output equations that are derived in Figure 16-3 using the state assignment of Figure 16-2. The flip-flops are updated in a process which is FIGURE 17-18 Waveforms for Figure 17-17 0 500 1000 1500 /clk /x /z /state /nextstate 0 1 1 3 5 0 2 4 5 0 3 5 0 1 2 4 5 0 2 FIGURE 17-19 Sequential Machine Model Using Equations © Cengage Learning 2014 -- The following is a description of the sequential machine of Table 17-2 in terms -- of its next-state equations. The following state assignment was used: -- S0--0; S1--4; S2--5; S3--7; S4--6; S5--3; S6--2 1 entity SM17_2 is 2 port (X, CLK: in bit; 3 Z: out bit); 4 end SM17_2; 5 architecture Equations1_4 of SM17_2 is 6 signal Q1, Q2, Q3: bit; 7 begin 8 process(CLK) 9 begin 10 if CLK'event and CLK = '1' then -- rising edge of clock 11 Q1 not Q2 after 10 ns; 12 Q2 Q1 after 10 ns; 13 Q3 (Q1 and Q2 and Q3) or (not X and Q1 and not Q3) or 14 (X and not Q1 and not Q2) after 10 ns; 15 end if; 16 end process; 17 Z (not X and not Q3) or (X and Q3) after 20 ns; 18 end Equations1_4; <= > > > > > > > <= <= <= © Cengage Learning 2014 VHDL for Sequential Logic 605 sensitive to CLK. When the rising edge of the clock occurs, Q1, Q2, and Q3 are all assigned new values. A 10-ns delay is included to represent the propagation delay between the active edge of the clock and the change of the flip-flop outputs. Even though the assignment statements in the process are executed sequentially, Q1, Q2, and Q3 are all scheduled to be updated at the same time, T + 10 ns, where T is the time at which the rising edge of the clock occurred. Thus, the old value of Q1 is used to compute Q2+, and the old values of Q1, Q2, and Q3 are used to compute Q3+. The concurrent assignment statement for Z causes Z to be updated whenever a change in X or Q3 occurs. The 20-ns delay represents two gate delays.
After we have designed a sequential circuit using components such as gates and flip-flops, we can write a structural VHDL model based on the actual inter-connection of these components. Figure 17-20 shows a structural VHDL represen-tation of the circuit of Figure 16-4. Seven NAND gates, three D flip-flops, and one inverter are used. All of these components are defined in a library named BITLIB. FIGURE 17-20 Structural Model of Sequential Machine © Cengage Learning 2014 -- The following is a STRUCTURAL VHDL description of the circuit of Figure 16-4.
1 library BITLIB; 2 use BITLIB.bit_pack.all; 3 entity SM16_4 is 4 port (X, CLK: in bit; 5 Z: out bit); 6 end SM16_4; 7 architecture Structure of SM16_4 is 8 signal A1, A2, A3, A5, A6, D3: bit: '0'; 9 signal Q1, Q2, Q3: bit: '0'; 10 signal Q1N, Q2N, Q3N, XN: bit: '1'; 11 begin 12 I1: Inverter port map (X, XN); 13 G1: Nand3 port map (Q1, Q2, Q3, A1); 14 G2: Nand3 port map (Q1, Q3N, XN, A2); 15 G3: Nand3 port map (X, Q1N, Q2N, A3); 16 G4: Nand3 port map (A1, A2, A3, D3); 17 FF1: DFF port map (Q2N, CLK, Q1, Q1N); 18 FF2: DFF port map (Q1, CLK, Q2, Q2N); 19 FF3: DFF port map (D3, CLK, Q3, Q3N); 20 G5: Nand2 port map (X, Q3, A5); 21 G6: Nand2 port map (XN, Q3N, A6); 22 G7: Nand2 port map (A5, A6, Z); 23 end Structure; = = = 606 Unit 17 The component declarations and definitions are contained in a package called bit_pack. The library and use statements are explained in Section 10.7. Because the NAND gates and D flip-flops are declared as components in bit_pack, they are not explicitly declared in the VHDL code. Because Q1, Q2, and Q3 are initialized to '0', the complementary flip-flop outputs (Q1N, Q2N, and Q3N) are initialized to '1'. G1 is a 3-input NAND gate with inputs Q1, Q2, Q3, and output A1. FF1 is a D flip-flop (see Figure 17-1) with the D input connected to Q2N. All of the gates and flip-flops in the bit_pack have a default delay of 10 ns. Executing the following simulator command file produces the waveforms of Figure 17-21.
add wave CLK X Q1 Q2 Q3 Z force CLK 0 0, 1 100 –repeat 200 force X 0 0, 1 350, 0 550, 1 750, 0 950, 1 1350 run 1600 Next, we will implement the state machine of Table 16-6(a) using a ROM, as shown in Figure 16-10. In the VHDL code (Figure 17-22), we have used packages from the IEEE library and IEEE Standard Logic because synthesis tools often use std_logic and std_logic_vector as default types. The constant array ROM1 represents the truth table of Table 16-6(c), which is stored in the ROM. Reading data from the ROM is accomplished by four concurrent statements. First, the ROM address, which is the index into the array, is formed by concatenating X and Q to form a 4-bit vector. The index is converted from a std_logic_vector to an integer by calling the conv_integer function. The ROM1 output is split into the D vector that represents the next state and the Z output. The process updates the state register on the rising edge of the clock.
Next, we will write behavioral VHDL code for the state table given in Table 13-4. We will use a two-process model as we did in Figure 17-17. We will use nested case statements instead of using if-then-else because the state table has more columns. Figure 17-23 shows a portion of the VHDL code for the combinational part of the circuit. The first case statement branches on the state, and the nested case statement for each state defines the Nextstate and outputs by branching on X12 (= X1&X2). The second process (not shown) that updates the state register is identical to the one in Figure 17-17.
FIGURE 17-21 Waveforms for Figure 16-4 0 500 1000 1500 /clk /x /q1 /q2 /q3 /z © Cengage Learning 2014 VHDL for Sequential Logic 607 A Moore machine can be modeled using two processes just like a Mealy machine. For example, the first row of the Moore table of Table 14-3 could be modeled within the combinational process as follows: case state is when 0 => Z <= '0'; if X = '0' then Nextstate <= 0; else Nextstate <= 1; end if; . . .
Note that the Z output is specified before X is tested because the Moore output only depends on the state and not on the input.
FIGURE 17-22 Sequential Machine Using a ROM © Cengage Learning 2014 1 library IEEE; 2 use IEEE.STD_LOGIC_1164.ALL; 3 use IEEE.STD_LOGIC_ARITH.ALL; 4 use IEEE.STD_LOGIC_UNSIGNED.ALL; 5 entity SM16_6 is 6 Port ( X : in std_logic; 7 CLK : in std_logic; 8 Z : out std_logic); 9 end SM16_6; 10 architecture ROM of SM16_6 is 11 type ROM16X4 is array (0 to 15) of std_logic_vector (0 to 3); 12 constant ROM1: ROM16X4 : ("1001", "1011", "0100", "0101", , " 0 0 0 0 " , " 0 0 0 1 " , " 0 0 0 0 " , " 1 0 1 1 " 3 1 , " 1 0 1 1 " , " 0 0 1 1 " , " 0 0 1 0 " , " 0 1 0 0 " 4 1 ; ) " 0 0 0 0 " , " 0 0 0 0 " , " 0 0 0 1 " , " 0 1 1 0 " 5 1 16 signal Q, D: std_logic_vector (1 to 3) : "000"; 17 signal Index, Romout: std_logic_vector (0 to 3); 18 begin 19 Index X&Q -- X&Q is a 4-bit vector: X Q1 Q2 Q3 20 Romout ROM1 (conv_integer(Index)); -- this statement reads the output from the ROM -- conv_integer converts Index to an Integer 21 Z Romout(0); 22 D Romout(1 to 3); 23 process (CLK) 24 begin 25 if CLK'event and CLK '1' then Q D; end if; 26 end process; 27 end ROM; = = <= <= <= <= <= = 608 Unit 17 17.5 Synthesis of VHDL Code The synthesis software for VHDL translates the VHDL code to a circuit description that specifies the needed components and the connections between the components. When writing VHDL code, you should always keep in mind that you are designing hardware, not simply writing a computer program. Each VHDL statement implies certain hardware requirements. So poorly written VHDL code may result in poorly designed hardware. Even if VHDL code gives the correct result when simulated, it may not result in hardware that works correctly when synthesized. Timing prob-lems may prevent the hardware from working properly even though the simulation results are correct.
The synthesis software tries to infer the components needed by “looking” at the VHDL code. In order for code to synthesize correctly, certain conventions must be followed. In order to infer flip-flops or registers that change state on the rising edge of a clock signal, an if clause of the form if clock'event and clock = '1' then . . . end if; is required by most synthesizers. For every assignment statement between then and end if in the preceding statement, a signal on the left side of the assignment will cause FIGURE 17-23 Partial VHDL Code for the Table of Figure 13-4 © Cengage Learning 2014 1 entity Table_13_4 is 2 port(X1, X2, CLK: in bit; Z1, Z2: out bit); 3 end Table_13_4; 4 architecture T1 of Table_13_4 is 5 signal State, Nextstate: integer range 0 to 3: 0; 6 signal X12: bit_vector(0 to 1); 7 begin 8 X12 9 process(State, X12) 10 begin 11 case State is 12 when 0 => 13 case X12 is 14 when "00" Nextstate 3; Z1 '0'; Z2 '0'; 15 when "01" Nextstate 2; Z1 '1'; Z2 '0'; 16 when "10" Nextstate 1; Z1 '1'; Z2 '1'; 17 when "11" Nextstate 0; Z1 '0'; Z2 '1'; 18 when others null; -- not required since X is a bit_vector 19 end case; 20 when 1 -- code for state 1 goes here, etc.
= < = X1&X2 <= <= <= <= <= <= <= <= <= <= <= <= => => => => => = > VHDL for Sequential Logic 609 creation of a register or flip-flop. The moral to this story is: If you do not want to cre-ate unnecessary flip-flops, do not put the signal assignments in a clocked process. If clock' event is omitted, the synthesizer may produce latches instead of flip-flops.
Before synthesis is started, we must specify a target device so that the synthesizer knows what components are available. We will assume that the target is a CPLD or FPGA that has D flip-flops with clock enable (D-CE flip-flops). We will synthesize the VHDL code for a left-shift register (Figure 17-10). Q and D are 4-bit vectors. Because updates to Q follow “CLK'event and CLK = '1' then”, this infers that Q must be a register composed of four flip-flops, which we will label Q3, Q2, Q1, and Q0. Because the flip-flops can change state when Clr, Ld, or Ls is '1', we connect the clock enables to an OR gate whose output is Clr + Ld + Ls. Then, we connect gates to the D inputs to select the data to be loaded into the flip-flops. If Clr = 0 and Ld = 1, D is loaded into the register on the rising clock edge. If Clr = Ld = 0 and Ls = 1, then Q2 is loaded into Q3, Q1 is loaded into Q2, etc. Figure 17-24 shows the logic circuit for the first two flip-flops. If Clr = 1, the D flip-flop inputs are 0, and the register is cleared.
A VHDL synthesizer cannot synthesize delays. Clauses of the form “after time-expression” will be ignored by most synthesizers, but some synthesizers require that after clauses be removed. Although the initial values for signals may be specified in port and signal declarations, these initial values are ignored by the synthesizer. A reset signal should be provided if the hardware must be set to a specific initial state. Otherwise, the initial state of the hardware may be unknown, and the hardware may malfunction. When an integer signal is synthesized, the integer is represented in hardware by its binary equivalent. If the range of an integer is not specified, the synthesizer will assume the maximum number of bits, usually 32. Thus, signal count: integer range 0 to 7; would result in a 3-bit counter, but signal count: integer; could result in a 32-bit counter.
FIGURE 17-24 Synthesis of VHDL Code From Figure 17-10 © Cengage Learning 2014 CE D Q3 Q2 CLK Clr′ Ld Ld Clr Ls Ld′ Ls D3 Clr′ Q2 CE D CLK Clr′ Ld Ld′ Ls D2 Clr′ Q1 ...
610 Unit 17 VHDL signals retain their current values until they are changed. This can result in the creation of unwanted latches when the code is synthesized. For example, in a combinational process, the statement if X = '1' then B < = 1; end if; would create latches to hold the value of B when X changed to '0'. To avoid the crea-tion of unwanted latches in a combinational process, always include an else clause in every if statement. For example, if X = '1' then B < = 1 else B < = 2; end if; would create a MUX to switch the value of B from 1 to 2.
Figure 17-25 shows the VHDL code for a 4-bit adder with accumulator. When the synthesizer analyses this code, it infers the presence of a 4-bit adder with carry in and carry out from line 14. When it analyses the clocked process, it infers from 1 library IEEE; 2 use IEEE.STD_LOGIC_1164.ALL; 3 use IEEE.STD_LOGIC_UNSIGNED.ALL; 4 entity adder is 5 Port (B: in std_logic_vector(3 downto 0); 6 Ld, Ad, Cin, CLK : in std_logic; 7 Aout : out std_logic_vector(3 downto 0); 8 Cout : out std_logic); 9 end adder; 10 architecture Behavioral of adder is 11 signal A : std_logic_vector(3 downto 0); 12 signal Addout : std_logic_vector(4 downto 0); 13 begin 14 Addout ('0' & A) B Cin; 15 Cout Addout(4); 16 Aout A; 17 process(CLK) 18 begin 19 if CLK'event and CLK '1' then 20 if Ld 21 elsif Ad 22 then A 23 end if; 24 end if; 25 end process; 26 end Behavioral; A (3:0) 0 1 4-bit Adder CE CLK 4 4 4 4 B 4 4 0 Cin Cout Aout Ld Ld Ad = = '1' then A <= B; = '1' <= Addout(3 downto 0); <= <= <= + + FIGURE 17-25 VHDL Code and Synthesis Results for 4-Bit Adder with Accumulator © Cengage Learning 2014 VHDL for Sequential Logic 611 lines 11, 19, and 20 that A is a 4-bit register that changes state on the rising clock edge. It also infers the presence of a 4-wide 2-to-1 multiplexer to select either B or the adder output to load into A. Because A is loaded when Ld = 1 or Ad = 1, the CE input to the register is Ld + Ad. At this point, a block diagram of the syn-thesized code resembles that shown in Figure 17-25. The synthesizer output is then optimized and fit into a specific target device.
17.6 More About Processes and Sequential Statements An alternative form for a process uses wait statements instead of a sensitivity list. A process cannot have both a wait statement and a sensitivity list. A process with wait statements may have the form process begin sequential-statements wait-statement sequential-statements wait-statement . . .
end process; This process will execute the sequential-statements until a wait statement is encountered. Then, it will wait until the specified wait condition is satisfied. It will then execute the next set of sequential-statements until another wait is encountered. It will continue in this manner until the end of the process is reached. Then, it will start over again at the beginning of the process.
Wait statements can be of three different forms: wait on sensitivity-list; wait for time-expression; wait until Boolean-expression; The first form waits until one of the signals on the sensitivity list changes. For example, wait on A,B,C; waits until A, B, or C changes and, then, execution pro-ceeds. The second form waits until the time specified by time expression has lapsed. If wait for 5 ns is used, the process waits for 5 ns before continuing. If wait for 0 ns is used, the wait is for one Δ time. Wait statements of the form wait for xx ns are use-ful for writing VHDL code for simulation; however, they should not be used when writing VHDL code for synthesis because they are not synthesizable. For the third form of wait statement, the Boolean expression is evaluated whenever one of the signals in the expression changes, and the process continues execution when the expression evaluates to TRUE. For example, wait until A = B; 612 Unit 17 will wait until either A or B changes. Then, A = B is evaluated, and if the result is TRUE, the process will continue, or else the process will continue to wait until A or B changes again and A = B is TRUE.
After a VHDL simulator is initialized, it executes each process with a sensitivity list one time through, and then waits at the beginning of the process for a change in one of the signals on the sensitivity list. If a process has a wait statement, it will ini-tially execute until a wait statement is encountered. Therefore, the following process is equivalent to the one in Figure 17-15: process begin C < = A and B after 5 ns; E < = C or D after 5 ns; wait on A, B, C, D; end process; The wait statement at the end of the process replaces the sensitivity list at the begin-ning. In this way both processes will initially execute the sequential statements one time and, then, wait until A, B, C, or D changes.
The order in which sequential statements are executed in a process is not neces-sarily the order in which the signals are updated. Consider the following example: process begin wait until CLK'event and CLK = '1'; A <= E after 10 ns; -- (1) B <= F after 5 ns; -- (2) C <= G; -- (3) D <= H after 5 ns; -- (4) end process; This process waits for a rising clock edge. Suppose the clock rises at time = 20 ns. Statements (1), (2), (3), (4) immediately execute in sequence. A is scheduled to change to E at time = 30 ns; B is scheduled to change to F at time = 25 ns; C is scheduled to change to G at time = 20 + Δ ns; and D is scheduled to change to H at time 25 ns. As simulated time advances, first, C changes. Then, B and D change at time = 25 ns, and finally A changes at time 30 ns. When clk changes to '0', the wait statement is re-evaluated, but it keeps waiting until clk changes to '1', and then the remaining statements execute again.
If several VHDL statements in a process update the same signal at a given time, the last value overrides. For example, process (CLK) begin if CLK'event and CLK = '0' then Q <= A; Q <= B; Q <= C; end if; end process; Every time CLK changes from '1' to '0', after Δ time, Q will change to C.
VHDL for Sequential Logic 613 In this unit, we have introduced processes with sensitivity lists and processes with wait statements. The statements within a process are called sequential statements because they execute in sequence, in contrast with concurrent statements that exe-cute only when a signal on the right-hand side changes. Signal assignment statements can be either concurrent or sequential. However, if and case statements are always sequential, yet conditional signal assignment statements and selected signal assign-ment statements can only be concurrent.
Problems 17.1 Write VHDL code for a T flip-flop with an active-low asynchronous clear.
17.2 Write VHDL code for the following right-shift register with synchronous clear.
Q3 Q2 Q1 Right SR Q0 Ld D3 D2 D1 D0 CLK RS CLR Lin 17.3 A 4-bit up/down binary counter with output Q works as follows: All state changes occur on the rising edge of the CLK input, except the asynchronous clear (ClrN). When ClrN = 0, the counter is reset regardless of the values of the other inputs.
If the LOAD input is 0, the data input D is loaded into the counter.
If LOAD = ENT = ENP = UP = 1, the counter is incremented.
If LOAD = ENT = ENP = 1 and UP = 0, the counter is decremented.
If ENT = UP = 1, the carry output (CO) = 1 when the counter is in state 15.
If ENT = 1 and UP = 0, the carry output (CO) = 1 when the counter is in state 0.
(a) Write a VHDL description of the counter.
(b) Draw a block diagram and write a VHDL description of an 8-bit binary up/ down counter that uses two of these 4-bit counters.
17.4 Represent the given circuit using a process with a case statement.
I0 I1 C C′ D C′ D D′ A B Z I2 I3 614 Unit 17 17.5 Write a VHDL module for the sequential machine of Table 14-1. Use two processes as in Figure 17-17.
17.6 (a) Draw a block diagram showing how Table 13-4 can be realized using a ROM and D flip-flops (rising-edge trigger).
(b) Write VHDL code for the circuit of part (a). Use a straight binary state assign-ment and form the ROM address as X1&X2&Q1&Q2.
17.7 (a) Draw a circuit that implements the following VHDL code using gates and D-CE flip-flops.
signal A,B,Q: bit_vector(1 to 2); -------------------------------process(CLK) if CLK'event and CLK = '0' then if LdA = '1' then Q < = A; elsif LdB = '1' then Q < = B; end if; end if; end process; (b) Show how your circuit can be simplified if LdA = LdB = '1' can never occur. Use MUXes and D-CE flip-flops in your simplified circuit.
17.8 In the following VHDL process, A, B, C, and D are all integers that have a value of 0 at time = 10 ns. If E changes from '0' to '1' at time 20 ns, specify the time at which each signal will change and the value to which it will change.
p1: process wait on E; A <= 1 after 15 ns; B <= A + 1; C <= B + 1 after 10 ns; D <= B + 2 after 3 ns; A <= A + 5 after 15 ns; B <= B + 7; end process p1; 17.9 Write the VHDL code for an S-R flip-flop with a rising-edge clock. Use standard logic, and output 'X' if S = R = '1' at a rising clock edge.
17.10 Write a VHDL module for a D-G latch, using the code of Figure 17-2. Then, write a VHDL module to implement the D flip-flop shown in Figure 11-19, using two instances of the D-G latch module you wrote.
17.11 What device is described by the following VHDL code?
VHDL for Sequential Logic 615 process(CLK, CLR, PRE) if CLR = '1' then Q <= '0'; elsif PRE = '1' then Q <= '1'; elsif CLK'event and CLK = '1' and CE = '1' then Q <= D; end if; end process; 17.12 Write the VHDL code for an 8-bit register with data inputs and tri-state outputs. Use control inputs Ld (Load) and En (tri-state output enable).
17.13 Implement a 4-to-2 priority encoder using if and elsif statements.
17.14 Write a VHDL module for a 4-bit comparator. The comparator has two inputs, A and B, which are 4-bit std_logic vectors; and three std_logic outputs, AGB, ALB, and AEB. AGB = '1' if A is greater than B, ALB = '1' if A is less than B, ALB = '1' if A and B are equal.
17.15 Write the VHDL code for a 6-bit Super-Register with a 3-bit control input A. The register operates according to the following table: A Action 000 Hold State 001 Shift Left 010 Shift Right 011 Synchronous Clear 100 Synchronous Preset 101 Count Up 110 Count Down 111 Load The register also has a 6-bit output (Q), a 6-bit input (D), a Right-Shift-In input (RSI), and a Left-Shift-In input (LSI). Use a case statement.
17.16 Write VHDL code that will display the value of a BCD input on a seven-segment display. Use a single process with a case statement to model this combinational cir-cuit. Refer to Figure 8-15 for a diagram of the seven-segment display.
17.17 The Mealy and Moore circuits shown both produce an output that is the exclusive-OR of two consecutive inputs. Assume each of the flip-flops has a propagation delay of 10 ns both from the clock edge and from ClrN, and the exclusive-OR gate has a 10 ns propagation delay. ClrN is an asynchronous clear.
(a) Create a VHDL dataflow model for the Mealy circuit. Assign type std_logic to all signals.
(b) Simulate your code for 400 ns, and record the waveforms for the following input patterns: ClrN 0 at 0 ns, 1 at 20 ns x 1 at 0 ns, 0 at 60 ns, 1 at 140 ns, 0 at 220 ns CLK symmetrical 80 ns period starting at 0 616 Unit 17 (c) Repeat part (a) for the Moore circuit.
(d) Repeat part (b) for the Moore circuit.
(e) Explain the differences in the outputs from the two circuits. On the waveforms, show the input and output sequences for the two circuits.
CLK x Ck D Q Q′ clr q z ClrN Ck D Q Q′ clr Q2 Z CLK X Ck D Q Q′ clr ClrN Q1 17.18 A modulo 8 counter cycles through the states Q0Q1Q2Q3 = 1000, 1100, 0100, 0110, 0010, 0011, 0001, 1001. The counter has eight outputs: Z0 = 1 when the counter is in state 1000 and the CLK is 0 and Z0 = 0 otherwise; Z1 = 1 when the counter is in state 1100 and the CLK is 0 and Z1 = 0 otherwise, . . .; Z7 = 1 when the counter is in state 1001 and the CLK is 0 and Z7 = 0 otherwise. The counter has an asynchro-nous, active-low reset input ClrN.
(a) Derive minimum equations for the counter outputs.
(b) Assume the counter is implemented using D flip-flops. Find minimum input equations for the flip-flops.
(c) Assume the counter is implemented using D-CE flip-flops. Find minimum input equations for the flip-flops.
(d) Write a VHDL behavioral description of the counter. Assume the flip-flops are positive edge triggered.
(e) Write a VHDL dataflow description of the counter using the equations from part (b). Simulate the counter for a cycle to verify your code.
(f ) Write a VHDL dataflow description of the counter using the equations from part (c). Simulate the counter for a cycle to verify your code.
17.19 Repeat Problem 17 . 18 for a modulo 8 counter that cycles through the states Q0Q1Q2Q3 = 1000, 1100, 1110, 0110, 0010, 0011, 1011, 1001.
17.20 Shown is an iterative circuit for comparing two 4-bit positive numbers. All of the Cmp modules in the circuit are the same. With the proper inputs for ig and ie, the outputs are og = 1 and oe = 0 if the x is larger than y, og = 0 and oe = 1 if x and y are equal, and og = 0 and oe = 0 if y is larger than x.
(a) Derive the logic equations that describe the Cmp module.
(b) Using your equations from part (a), write VHDL code that gives a dataflow description of a Cmp module.
(c) Using the VHDL module defined in part (b), write structural VHDL code that specifies the 4-bit comparator.
VHDL for Sequential Logic 617 (d) Use the Direct VHDL simulator to obtain the signal values for the three input combinations: x = 0100 y = 0011, x = 0011 y = 0100, and x = 0001 y = 0001. Record the waveform report from the simulator.
x3 y3 x2 y2 x1 y1 x0 y0 Cmp3 ig ie Cmp2 og oe Cmp1 Cmp0 17.21 The following iterative circuit is a priority selection circuit. When one or more of the inputs is 1, osel = 0 and yi = 1 where i is the largest index such that xi = 1. If none of the inputs is 1, then all outputs are 0 and osel = 1. The four modules in the circuit are identical.
(a) Derive the logic equations that describe the Pr module.
(b) Using your equations from part (a), write VHDL code that gives a dataflow description of the Pr module.
(c) Using the VHDL module defined in part (b), write structural VHDL code that specifies the 4-bit priority selector.
(d) Use the Direct VHDL simulator to obtain the signal values for the three input combinations: x = 1000, x = 0111, and x = 0000. Record the waveform report from the simulator.
17.22 A Mealy sequential machine with one input (X) and one output (Z) has the follow-ing state table.
Pr3 isel Pr2 osel Pr1 Pr0 x3 x2 x1 x0 y3 y2 y1 y0 Present State Next State Z X = 0 X = 1 X = 0 X = 1 S0 S1 S0 0 0 S1 S0 S2 1 0 S2 S3 S2 1 1 S3 S0 S1 0 1 618 Unit 17 Write a VHDL module for the sequential machine using a ROM (as in Figure 17-22) and a straight binary assignment.
17.23 Repeat Problem 17 . 22 using equations as in Figure 17-19 and using a one-hot state assignment. (Hint: It may be easier to do the one-hot state assignment properly if you draw the state graph first.) 17.24 The following VHDL code is for a 2-to-1 MUX, but it contains mistakes. What are the mistakes?
library IEEE; use IEEE.STD_LOGIC_1164.ALL; entity mux2 is port (d0, d1 : in bit; sel : in Boolean; z : out bit); end mux2; architecture bvhr of mux2 is signal muxsel : integer range 0 to 1; begin process(d0, d1, select) begin muxsel <= 0; if sel then muxsel <= muxsel + 1; end if; case muxsel is when 0 => z < = d0 after 2ns; when 1 => z < = d1 after 2ns; end case; end process; end bvhr; 17.25 Give the state table implemented by the following VHDL code.
entity Problem17_25 is port(X, CLK: in bit; Z1, Z2: out bit); end Problem17_25; architecture Table of Problem17_25 is signal State, Nextstate: integer range 0 to 3 : = 0; begin process(State, X) --Combinational Circuit begin case State is when 0 => VHDL for Sequential Logic 619 if X = '0' then Z1 <= '1'; Z2 <= '0'; Nextstate <= 0; else Z1 <= '0'; Z2 <= '0'; Nextstate <= 1; end if; when 1 = > if X = '0' then Z1 <= '0'; Z2 <= '1'; Nextstate <= 1; else Z1 <= '0'; Z2 <= '1'; Nextstate <= 2; end if; when 2 = > if X = '0' then Z1 <= '0'; Z2 <= '1'; Nextstate <= 2; else Z1 <= '0'; Z2 <= '1'; Nextstate <= 3; end if; when 3 = > if X = '0' then Z1 <= '0'; Z2 <= '0'; Nextstate <= 0; else Z1 <= '1'; Z2 <= '0'; Nextstate <= 0; end if; end case; end process; process(CLK) -- State Register begin if CLK'event and CLK = '1' then -- rising edge of clock State <= Nextstate; end if; end process; end Table; 17.26 Give the state table implemented by the following VHDL code.
entity Problem17_26 is port(X, CLK: in bit; Z: out bit); end Problem17_26; architecture Table of Problem17_26 is signal State, Nextstate: integer range 0 to 3 : = 0; begin process(State, X) --Combinational Circuit begin case State is when 0 => Z <= '1'; if X = '0' then Nextstate <= 1; else Nextstate <= 2; end if; when 1 => Z <= '0' if X = '0' then Nextstate <= 3; else Nextstate <= 2; end if; when 2 => Z <= '0'; if X = '0' then Nextstate <= 1; else Nextstate <= 0; end if; when 3 => Z <= '0'; if X = '0' then Nextstate <= 0; else Nextstate <= 1; end if; 620 Unit 17 end case; end process; -- the clocked process goes here, same as in Problem 17.25 end Table; 17.27 Give the state table implemented by the following VHDL code.
entity Problem17_27 is port(X1, X2, CLK: in bit; Z: out bit); end Problem17_27; architecture Table of Problem17_27 is signal State, Nextstate: integer range 0 to 2 : = 0; signal X12: bit_vector(0 to 1); begin X12 <= X1&X2 process(State, X12) --Combinational Circuit begin case State is when 0 => Z <= '0'; case X12 is when "00" => Nextstate <= 0; when "01" => Nextstate <= 1; when "10" => Nextstate <= 2; when "11" => Nextstate <= 0; end case; when 1 => Z <= '0'; case X12 is when "00" => Nextstate <= 0; when "01" => Nextstate <= 1; when "10" => Nextstate <= 2; when "11" => Nextstate <= 1; endcase; when 2 => Z <= '1'; caseX12is when "00" => Nextstate <= 0; when "01" => Nextstate <= 1; when "10" => Nextstate <= 2; when "11" => Nextstate <= 2; end case; end case; end process; -- the clocked process goes here, same as in Problem 17.25.
end Table; VHDL for Sequential Logic 621 17.28 The VHDL specification for a state machine follows. It has one binary input (plus a clock and reset) and one binary output.
(a) Construct a state table for this state machine.
(b) Simulate the circuit for the input sequence xin = 0101110111, record the wave-form and list the output sequence produced. Assume that changes in xin occur 1/4 clock period after the rising edge of CLK.
(c) Find a minimum row state table that describes this state machine.
(d) What input sequences cause the output to become 1? (Hint: The machine recog-nizes sequences ending in two different patterns.) library IEEE; use IEEE.STD_LOGIC_1164.ALL; entity pttrnrcg is port (CLK, rst, xin : in std_logic; zout : out std_logic); end pttrnrcg; architecture sttmchn of pttrnrcg is type mchnstate is (s1, s2, s3, s4, s5, s6, s7, s8, s9, s10); signal state, nextstate: mchnstate; begin cmb_lgc: process(state, xin) begin case state is when s1 => zout <= '0'; if xin = '0' then nextstate <= s2; else nextstate <= s10; end if; when s2 => zout <= '0'; if xin = '0' then nextstate <= s2; else nextstate <= s3; end if; when s3 => zout <= '1'; if xin = '0' then nextstate <= s4; else nextstate <= s6; end if; when s4 => zout <= '0'; if xin = '0' then nextstate <= s7; else nextstate <= s8; end if; when s5 => zout <= '1'; if xin = '0' then nextstate <= s9; else nextstate <= s10; end if; when s6 => zout <= '0'; if xin = '0' then nextstate <= s9; else nextstate <= s10; end if; when s7 => zout <= '0'; if xin = '0' then nextstate <= s2; else nextstate <= s3; end if; when s8 => 622 Unit 17 zout <= '1'; if xin = '0' then nextstate <= s4; else nextstate <= s5; end if; when s9 => zout <= '0'; if xin = '0' then nextstate <= s7; else nextstate <= s8; end if; when s10 => zout <= '0'; if xin = '0' then nextstate <= s9; else nextstate <= s10; end if; end case; end process cmb_lgc; stt_trnstn: process(CLK,rst) begin if rst = '1' then state <= s1; elsif Rising_Edge (CLK) then state <= nextstate; end if; end process stt_trnstn; end sttmchn; 17.29 The VHDL specification for a sequential circuit follows. It has one binary input (plus a clock and reset) and one binary output. Four architectures are given for the sequential circuit.
(a) For each of these architectures, draw the schematic described by the architec-ture. Use D flip-flops and AND, OR, and NOT gates.
(b) What differences exist in the outputs produced by these architectures? library IEEE; use IEEE.STD_LOGIC_1164.ALL; entity diff1 is port (CLK, rst, xin : in std_logic; zout : out std_logic); end diff1; architecture df1 of diff1 is signal y0,y1,nxty0,nxty1 : std_logic; begin process(y0,y1,xin) begin zout < = y0 AND (xin XOR y1); nxty0 < = NOT y0; nxty1 < = xin; end process; process(CLK,rst) begin if rst = '1' then y0 < = '0'; y1 < = '0'; elsif Rising_Edge (CLK) then VHDL for Sequential Logic 623 y0 < = nxty0; y1 < = nxty1; end if; end process; end df1; architecture df2 of diff1 is signal y0,y1,nxty0,nxty1 : std_logic; begin zout < = y0 AND (xin XOR y1); nxty0 < = NOT y0; nxty1 < = xin; process(CLK,rst) begin if rst = '1' then y0 < = '0'; y1 < = '0'; elsif Rising_Edge (CLK) then y0 < = nxty0; y1 < = nxty1; end if; end process; end df2; architecture df3 of diff1 is signal y0,y1 : std_logic; begin zout < = y0 AND (xin XOR y1); process(CLK,rst) begin if rst = '1' then y0 < = '0'; y1 < = '0'; elsif Rising_Edge (CLK) then y0 < = NOT y0; y1 < = xin; end if; end process; end df3; architecture df4 of diff1 is signal y0,y1 : std_logic; begin process(CLK,rst) begin if rst = '1' then y0 < = '0'; y1 < = '0'; zout < = '0'; elsif Rising_Edge (CLK) then y0 < = NOT y0; y1 < = xin; zout < = y0 AND (xin XOR y1); end if; end process; end df4; 624 Unit 17 17.30 Write a VHDL module for an 8-bit mask circuit. When the signal Store = 1, the 8-bit input X is stored in an 8-bit mask register M. The 8-bit output Z of the mask circuit is always the AND of the bits of M with the corresponding bits of X. The circuit should also have an asynchronous active-high signal Set, which will set all the bits of M to 1.
17.31 Write a VHDL module for the sequential machine of Table 14-3. Use two processes as in Figure 17-17.
Simulation Problems 17.A Write a behavioral VHDL module that implements the 8-bit shift register of Figure 12-8. Do not use individual flip-flops in your code. Add an active-low asyn-chronous reset input, ClrN. Simulate the module to obtain a timing diagram similar to Figure. 12-9. Then, write VHDL code for a 16-bit serial-in, serial-out shift register using two of these modules.
17.B Write a VHDL module for a 4-bit counter with enable that increments by different amounts, depending on the control input C. If En = 0, the counter holds its state. Otherwise, if C = 0, the counter increments by 1 every rising clock edge, and if C = 1, the counter increments by 3 every rising clock edge. The counter also has an active-low asynchronous preset signal, PreN.
17.C Write a VHDL module to implement a counter that counts in the following sequence: 000, 010, 100, 110, 001, 011, 101, 111, (repeat) 000, etc. Use a ROM and D flip-flops.
17.D Write a VHDL module to implement a circuit that can generate a clock signal whose time period is a multiple of the input clock. A control signal F determines the multiplying factor. If F = 0, the output signal has a time period twice that of the input clock. If F = 1, the output signal has a time period three times that of the input clock. The portion of the clock cycle when the clock is 1 may be longer than the portion when it is 0, or vice versa. Use a counter with an active-high synchronous clear input.
17.E Write a VHDL module to implement an 8-bit serial-in, serial-out right-left shift register with inputs RSI, LSI, En, R, and CLK. RSO and LSO are the serial outputs, so they should be the rightmost and leftmost bits of the register. However, the val-ues of the other flip-flops inside the register should not appear on the outputs. When En = 1, at the rising edge of the clock, the register shifts right if R = 1 or left if R = 0. RSI should be the shift-in input if R = 1, and LSI should be the shift-in input if R = 0. When En = 0, the register holds its state. There should also be an asynchronous active-low clear input ClrN.
VHDL for Sequential Logic 625 17.F Work Problem 17.E, but change the register to 6 bits, remove the input En, and add an input L. At the rising edge of the clock, if R = 1 and L = 0, the register shifts right. If R = 0 and L = 1, the register shifts left. If R = L = 0 or R = L = 1, the register holds its state.
17.G Write a VHDL module for a 6-bit accumulator with carry-in (CI) and carry-out (CO). When Ad = 0, the accumulator should hold its state. When Ad = 1, the accu-mulator should add the value of the data inputs D (plus CI) to the value already in the accumulator. The accumulator should also have an active-low asynchronous clear signal ClrN.
17.H Write a VHDL module for a 4-bit up-down counter. If En = 0, the counter will hold its state. If En = 1, the counter will count up if U = 1 or down if U = 0. The counter should also have an asynchronous active-low clear signal ClrN.
17.I Write a VHDL module for a 6-bit up-down counter. If U = 1 and D = 0, the counter will count up, and if U = 0 and D = 1, the counter will count down. If U = D = 0 or U = D = 1, the counter will hold its state. The counter should also have an asynchro-nous active-low preset signal PreN that sets all flip-flops to 1.
17.J Write a VHDL module for a memory circuit. The memory stores four 6-bit words in registers. The output Memout is always the value of the memory register selected by the 2-bit select signal Sel. Use tri-state buffers to connect the register outputs. If Ld = 1, the register specified by Sel will load the value of the 6-bit input signal Memin at the next rising clock edge.
17.K Write a VHDL module for the Parallel-in, Parallel-out right-shift register of Figure 12-10, but add an active-low asynchronous clear signal ClrN. Do not use indi-vidual flip-flops in your code. Simulate the module to obtain a timing diagram simi-lar to Figure 12-11.
17.L Write a VHDL module for an 8-bit accumulator which can also shift the bits in the accumulator register to the left. If Ad = 1, the accumulator should add the value of the data inputs D to the value already in the accumulator. If Ad = 0 and Sh = 1, the bits in the accumulator should shift left (i.e., multiply by 2). If Ad = Sh = 0, the accumulator should hold its state. The accumulator should also have an active-low asynchronous clear signal ClrN. Assume that carry-in and carry-out signals are unnecessary for this application. Use an overloaded “+” operator for addition.
17.M Write a VHDL module for an 8-bit accumulator for subtraction, which can also shift the accumulator bits to the right. There are two control inputs, A and B. If A = B = 1, the value of the data inputs D are subtracted from the accumulator. If A = 1 and B = 0, the value of the data inputs D are loaded directly into the register. If A = 0 and B = 1, the accumulator should shift right with zero fill. If A = B = 0, the accu-mulator should hold its state. Use an overloaded “−” operator for subtraction.
626 Circuits for Arithmetic Operations U N I T 18 Objectives 1. Analyze and explain the operation of various circuits for adding, subtracting, multiplying, and dividing binary numbers and for similar operations.
2. Draw a block diagram and design the control circuit for various circuits for adding, subtracting, multiplying, and dividing binary numbers and for similar operations.
Circuits for Arithmetic Operations 627 Study Guide 1. Study Section 18.1, Serial Adder with Accumulator.
(a) Study Figure 18-2 carefully to make sure you understand the operation of this type of adder. Work out a table similar to Table 18-1 starting with X = 6 and Y = 3: X Y ci si c+ i t0 0110 0011 t1 t2 t3 t4 (b) What changes would be made in this table if the SI input to the addend register (Figure 18-1) was connected to a logic 0 instead of to y0?
(c) Note in Table 18-1 that when the adding has finished, the full adder still gener-ates a sum and a carry output. The full adder consists of combinational logic, so it will still automatically do the work of calculating its outputs even when they are not needed. What bits are added to generate the last values of si and c+ i ? (See Figure 18-2(e).) Are the last values of si and c+ i useful for anything?
(d) Work Problem 18.3.
2. Study Section 18.2, Design of a Binary Multiplier.
(a) For the binary multiplier of Figure 18-7 , if the initial contents of the accu-mulator is 000001101 and the multiplicand is 1111, show the sequence of add and shift signals and the contents of the accumulator at each time step.
(b) For the state graph of Figure 18-8, what is the maximum number of clock cycles required to carry out the multiplication? The minimum number?
628 Unit 18 (c) For the state graph of Figure 18-9(c), assuming the counter sets K = 1 when the counter is in state 3 (112), what is the maximum number of clock cycles required to carry out the multiplication? The minimum number?
(d) For Figure 18-7 , how many bits would be required for the product register if the multiplier was 6 bits and the multiplicand was 8 bits?
(e) Work Problems 18.4 and 18.5.
(f ) Consider the design of a binary multiplier which multiplies 8 bits by 8 bits to give a 16-bit product. What changes would need to be made in Figure 18-7?
If a multiplier control of the type shown in Figure 18-8 were used, how many states would be required?
If a control of the type shown in Figure 18-9 is used, how many bits should the counter have? K should equal 1 in what state of the counter? How many states will the control state graph have?
(g) Work Programmed Exercise 18.1.
3. Study Section 18.3, Design of a Binary Divider.
(a) Using the state graph of Figure 18-11 to determine when to shift or sub-tract, work through the division example given at the start of this section.
(b) What changes would have to be made in Figure 18-12 if the subtraction was done using full adders rather than full subtracters?
(c) For the block diagram of Figure 18-10, under what conditions will an overflow occur and why?
(d) Work Programmed Exercise 18.2.
(e) Derive the control circuit equations, Equations (18-1).
(f ) In Figure 18-13, why is one of the inputs to the bus merger at the 0 input of the MUX set to 1?
(g) For a binary multiplier of the type described in Section 18.2, addition is done before shifting. Division requires a series of shift and subtract opera-tions. Since division is the inverse of multiplication, which operation should be done first, subtract or shift?
(h) Work Problems 18.6, 18.7 , and 18.8.
Circuits for Arithmetic Operations 629 4. Optional simulation exercises: (a) Simulate the serial adder of Figure 13-12 and test it.
(b) Connect two 4-bit shift registers to the inputs of the adder that you simu-lated in (a) to form a serial adder with accumulator (as in Figure 18-1). Supply the shift signal and clock signal from switches so that a control circuit is unnecessary. Test your adder using the following pairs of binary numbers: 0101 + 0110, 1011 + 1101 (c) Input the control circuit from the equations of Figure 18-4, connect it to the circuit which you built in (b), and test it.
5. When you are satisfied that you can meet all of the objectives, take the readi-ness test.
This unit introduces the concept of using a sequential circuit to control a sequence of operations in a digital system. Such a control circuit outputs a sequence of control signals that cause operations such as addition or shifting to take place at the appro-priate times. We will illustrate the use of control circuits by designing a serial adder, a multiplier, and a divider.
18.1 Serial Adder with Accumulator In this section we will design a control circuit for a serial adder with an accumulator. Figure 18-1 shows a block diagram for the adder. Two shift registers are used to hold the 4-bit numbers to be added, X and Y. The X register serves as an accumulator Circuits for Arithmetic Operations 630 Unit 18 and the Y register serves as an addend register. When the addition is completed, the contents of the X register are replaced with the sum of X and Y. The addend regis-ter is connected as a cyclic shift register so that after shifting four times it is back in its original state, and the number Y is not lost. The box at the left end of each shift register shows the inputs: Sh (shift signal), SI (serial input), and Clock. When Sh = 1 and an active clock edge occurs, SI is entered into x3 (or y3) at the same time as the contents of the register are shifted one place to the right. The additional connections required for initially loading the X and Y registers and clearing the carry flip-flop are not shown in the block diagram.
The serial adder, highlighted in blue in the diagram, is the same as the one in Figure 13-12, except the D flip-flop has been replaced with a D flip-flop with clock enable. At each clock time, one pair of bits is added. Because the full adder is a combinational circuit, the sum and carry appear at the full adder output after the propagation delay. When Sh = 1, the falling clock edge shifts the sum bit into the accumulator, stores the carry bit in the carry flip-flop, and rotates the addend register one place to the right. Because Sh is connected to CE on the flip-flop, the carry is only updated when shifting occurs.
Figure 18-2 illustrates the operation of the adder. Shifting occurs on the falling clock edge when Sh = 1. In this figure, t0 is the time before the first shift, t1 is the time after the first shift, t2 is the time after the second shift, etc. Initially, at time t0, the accumulator contains X and the addend register contains Y. Because the full adder is a combinational circuit, x0, y0, and c0 are added independently of the clock to form the sum s0 and carry c1. When the first falling clock edge occurs, s0 is shifted into the accumulator and the remaining accumulator digits are shifted one posi-tion to the right. The same clock edge stores c1 in the carry flip-flop and rotates the addend register right. The next pair of bits, x1 and y1, are now at the full adder input, and the adder generates the sum and carry, s1 and c2, as seen in Figure 18-2(b). The second falling edge shifts s1 into the accumulator, stores c2 in the carry flip-flop, and FIGURE 18-1 Block Diagram for Serial Adder with Accumulator © Cengage Learning 2014 Control Circuit SI Accumulator Full Adder Addend Register Serial Adder Sh x3 St (Start Signal) Clock x2 x1 x0 SI CK Sh D CE Q Q′ Sh y3 ci yi si ci + 1 xi y2 y1 y0 Circuits for Arithmetic Operations 631 cycles the addend register right. Bits x2 and y2 are now at the adder input, as seen in Figure 18-2(c), and the process continues until all bit pairs have been added, as shown in Figure 18-2(e).
Table 18-1 shows a numerical example of the serial adder operation. Initially, the accumulator contains 0101 and the addend register contains 0111. At t0, the full adder computes 1 + 1 + 0 = 10, so si = 0 and c+ i = 1. After the first falling clock FIGURE 18-2 Operation of Serial Adder © Cengage Learning 2014 Full Adder (a) At time t0 x3 x2 x1 x0 y3 y2 y1 y0 D c0 = 0 c1 s0 Full Adder unused unused (c) At time t2 s1 s0 x3 x2 y1 y0 y3 y2 D c2 c3 s2 Full Adder (b) At time t1 s0 x3 x2 x1 y0 y3 y2 y1 D c1 c2 s1 Full Adder (d) At time t3 s2 s1 s0 x3 y2 y1 y0 y3 D c3 c4 s3 Full Adder (e) At time t4 s3 s2 s1 s0 y3 y2 y1 y0 D c4 TABLE 18-1 Operation of Serial Adder © Cengage Learning 2014 X Y Ci Si C+ i t0 0101 0111 0 0 1 t1 0010 1011 1 0 1 t2 0001 1101 1 1 1 t3 1000 1110 1 1 0 t4 1100 0111 0 (1) (0) 632 Unit 18 edge (time t1) the first sum bit has been entered into the accumulator, the carry has been stored in the carry flip-flop, and the addend has been cycled right. After four falling clock edges (time t4), the sum of X and Y is in the accumulator, and the addend register is back to its original state.
The control circuit for the adder must now be designed so that after receiving a start signal, the control circuit will put out four shift signals and then stop. Figure 18-3 shows the state graph and table for the control circuit. The circuit remains in S0 until a start signal is received, at which time the circuit outputs Sh = 1 and goes to S1. Then, at successive clock times, three more shift signals are put out. It will be assumed that the start signal is terminated before the circuit returns to state S0 so that no further output occurs until another start signal is received. Dashes appear on the graph because once S1 is reached, the circuit operation continues regardless of the value of St. Starting with the state table of Figure 18-3 and using a straight binary state assignment, the control circuit equations are derived in Figure 18-4.
A serial processing unit, such as a serial adder with an accumulator, processes data one bit at a time. A typical serial processing unit (Figure 18-5) has two shift registers. The output bits from the shift registers are inputs to a combinational circuit. The com-binational circuit generates at least one output bit. This output bit is fed into the input of a shift register. When the active clock edge occurs, this bit is stored in the first bit of the shift register at the same time the registers bits are shifted to the right.
The control for the serial processing unit generates a series of shift signals. When the start signal (St) is 1, the first shift signal (Sh) is generated. If the shift registers FIGURE 18-4 Derivation of Control Circuit Equations © Cengage Learning 2014 A+B+ AB 0 1 S0 00 00 01 S1 01 10 10 S2 10 11 11 S3 11 00 00 A+ DA = A′B + AB′ = A ⊕ B 0 0 0 1 1 1 0 0 1 00 AB St 01 11 10 1 B+ DB = St B′ + AB′ 0 1 0 1 0 0 0 0 1 00 AB St 01 11 10 1 Sh Sh = St + A + B 0 1 0 1 1 1 1 1 1 00 AB St 01 11 10 1 FIGURE 18-3 State Graph for Serial Adder Control © Cengage Learning 2014 –/Sh –/Sh –/Sh St/Sh St′/0 S1 S0 S3 S2 Next State Sh St 0 1 0 1 S0 S0 S1 0 1 S1 S2 S2 1 1 S2 S3 S3 1 1 S3 S0 S0 1 1 Circuits for Arithmetic Operations 633 have n bits, then a total of n shift signals must be generated. If St is 1 for only one clock time, then the control state graph (Figure 18-6(a)) stops when it returns to state S0. However, if St can remain 1 until after the shifting is completed, then a separate stop state is required, as shown in Figure 18-6(b). The control remains in the stop state until St returns to 0.
18.2 Design of a Binary Multiplier Next, we will design a multiplier for positive binary numbers. As illustrated in the example in Section 1.3, binary multiplication requires only shifting and adding. The following example shows how each partial product is added in as soon as it is formed. This eliminates the need for adding more than two binary numbers at a time.
Multiplicand 1101 (13) Multiplier 1011 (11) 1101 1101 Partial 100111 Products 0000 100111 1101 Product 10001111 (143) The multiplication of two 4-bit numbers requires a 4-bit multiplicand register, a 4-bit multiplier register, and an 8-bit register for the product. The product register FIGURE 18-5 Typical Serial Processing Unit © Cengage Learning 2014 Control St Sh Combinational Circuit Shift Register Shift Register FIGURE 18-6 State Graphs for Serial Processing Unit © Cengage Learning 2014 Sn–1 S0 S2 S1 –/Sh –/Sh –/Sh –/Sh –/Sh –/Sh St/Sh St/Sh St′/0 (a) Sn–1 Stop S0 S2 S1 St′/0 St/0 St′/0 (b) b b b b 634 Unit 18 serves as an accumulator to accumulate the sum of the partial products. Instead of shifting the multiplicand left each time before it is added, as was done in the previ-ous example, it is more convenient to shift the product register to the right each time. Figure 18-7 shows a block diagram for such a multiplier. As indicated by the arrows on the diagram, 4 bits from the accumulator and 4 bits from the multiplicand register are connected to the adder inputs; the 4 sum bits and the carry output from the adder are connected back to the accumulator. (The actual connections are similar to the parallel adder with accumulator shown in Figure 12-5.) The adder calculates the sum of its inputs, and when an add signal (Ad) occurs, the adder outputs are stored in the accumulator by the next rising clock edge, thus causing the multiplicand to be added to the accumulator. An extra bit at the left end of the product register temporarily stores any carry (C4) which is generated when the multiplicand is added to the accu-mulator. Note that when ACC is shifted right, the input to bit 8 of ACC must be 0. Then, a following shift will shift the correct value into bit 7 of ACC. The shift input to ACC is not explicitly shown in Figure 18-7 .
Because the lower four bits of the product register are initially unused, we will store the multiplier in this location instead of in a separate register. As each multi-plier bit is used, it is shifted out the right end of the register to make room for addi-tional product bits.
The Load signal loads the multiplier into the lower four bits of ACC and at the same time clears the upper 5 bits. The shift signal (Sh) causes the contents of the product register (including the multiplier) to be shifted one place to the right when the next rising clock edge occurs. The control circuit puts out the proper sequence of add and shift signals after a start signal (St = 1) has been received. If the current multiplier bit (M) is 1, the multiplicand is added to the accumulator followed by a right shift; if the multiplier bit is 0, the addition is skipped and only the right shift occurs. The multiplication example at the beginning of this section (13 × 11) is reworked below showing the location of the bits in the registers at each clock time.
FIGURE 18-7 Block Diagram for Binary Multiplier © Cengage Learning 2014 ACC Product C o n t r o l Load Sh Done St M Ad 8 7 6 5 4 3 2 1 0 Clk 4-Bit Adder Multiplicand Multiplier C4 Circuits for Arithmetic Operations 635 The control circuit must be designed to output the proper sequence of add and shift signals. Figure 18-8 shows a state graph for the control circuit. The notation used on this graph is defined in Section 14.5. M/Ad means if M = 1, then the output Ad is 1 (and the other outputs are 0). M′/Sh means if M′ = 1 (M = 0), then the output Sh is 1 (and the other outputs are 0). In Figure 18-8, S0 is the reset state, and the circuit stays in S0 until a start signal (St = 1) is received. This generates a Load signal, which causes the multiplier to be loaded into the lower 4 bits of the accumulator (ACC) and the upper 5 bits of ACC to be cleared on the next rising clock edge. In state S1, the low order bit of the multiplier (M) is tested. If M = 1, an add signal is generated and, then, a shift signal is generated in S2. If M = 0 in S1, a shift signal is generated because adding 0 can be omitted. Similarly, in states S3, S5, and S7, M is tested to determine whether to generate an add signal followed by shift or just a shift signal. A shift signal is always generated at the next clock time following an add signal (states S2, S4, S6, and S8). After four shifts have been generated, all four multiplier bits have been processed, and the control circuit goes to a Done state and terminates the multiplication process.
initial contents of product register 0 0 0 0 0 1 0 1 1 ←M (11) (add multiplicand because M = 1) 1 1 0 1 (13) after addition 0 1 1 0 1 1 0 1 1 after shift 0 0 1 1 0 1 1 0 1 ←M (add multiplicand because M = 1) 1 1 0 1 after addition 1 0 0 1 1 1 1 0 1 after shift 0 1 0 0 1 1 1 1 0 ←M (skip addition because M = 0) after shift 0 0 1 0 0 1 1 1 1 ←M (add multiplicand because M = 1) 1 1 0 1 after addition 1 0 0 0 1 1 1 1 1 after shift (final answer) 0 1 0 0 0 1 1 1 1 (143) dividing line between product and multiplier FIGURE 18-8 State Graph for Multiplier Control © Cengage Learning 2014 S5 S4 S3 S2 S1 S0 S9 S8 S7 S6 –/Sh –/Done –/Sh –/Sh –/Sh M/Ad M′/Sh M′/Sh M′/Sh M′/Sh M/Ad M/Ad M/Ad St/Load St′/0 636 Unit 18 Note that the Done signal cannot be turned on in state S7 or S8 because the last shift does not occur until the next active clock edge. The last shift occurs at the same time the transition to state S9 occurs. The control signal Sh enables the shifting to occur at the next rising clock edge, but, by itself, it does not cause the shifting to occur. In general, if a control signal is turned on in state Sn, the resulting action does not occur until the next active clock edge takes the circuit to the next state. State S9 could be eliminated if it was acceptable to turn on the Done signal in state S0 when St = 0.
As the state graph indicates, the control performs two functions—generating add or shift signals as needed and counting the number of shifts. If the number of bits is large, it is convenient to divide the control circuit into a counter and an add-shift control, as shown in Figure 18-9(a). First, we will derive a state graph for the add- shift control which tests M and St and outputs the proper sequence of add and shift signals (Figure 18-9(b)). Then, we will add a completion signal (K) from the counter which stops the multiplier after the proper number of shifts have been completed. Starting in S0 in Figure 18-9(b), when a start signal (St = 1) is received, a Load signal is generated. In state S1, if M = 0, a shift signal is generated and the circuit stays in S1. If M = 1, an add signal is generated and the circuit goes to state S2. In S2 a shift signal is generated because a shift always follows an add. Back in S1, the next multiplier bit (M) is tested to determine whether to shift, or add and then shift. The graph of Figure 18-9(b) will generate the proper sequence of add and shift signals, but it has no provision for stopping the multiplier.
In order to determine when the multiplication is completed, the counter is incre-mented on the active clock edge each time a shift signal is generated. If the multi-plier is n bits, a total of n shifts are required. We will design the counter so that a completion signal (K) is generated after n – 1 shifts have occurred. When K = 1, the circuit should perform one more addition if necessary and then do the final shift. The control operation in Figure 18-9(c) is the same as Figure 18-9(b) as long as K = 0. In state S1, if K = 1, we test M as usual. If M = 0, we output the final shift signal and stop; however, if M = 1, we add before shifting and go to state S2. In state S2, if K = 1, we output one more shift signal and then go to S3. The last shift signal will reset the counter to 0 at the same time the add-shift control goes to the Done state.
As an example, consider the multiplier of Figure 18-7 , but replace the control cir-cuit with Figure 18-9(a). Because n = 4, a 2-bit counter is needed, and K = 1 when the counter is in state 3 (112). Table 18-2 shows the operation of the multiplier when 1101 is multiplied by 1011. S0, S1, and S2 represent states of the control circuit (Figure 18-9(c)). The contents of the product register at each step is the same as given on p. 635.
FIGURE 18-9 © Cengage Learning 2014 Counter (a) Multiplier control (b) State graph for add-shift control –/Sh St M K M/Ad Add-Shift Control Done Clk Load Ad Sh S0 S1 S2 St′/0 M′/Sh St/Load (c) Final state graph for add-shift control K′/Sh K/Sh M/Ad KM′/Sh S0 S1 S2 St′/0 K′M′/Sh St/Load –/Done S3 Circuits for Arithmetic Operations 637 At time t0 the control is reset and waiting for a start signal. At time tl, the start signal St = 1, and a Load signal is generated. At time t2, M = 1, so an Ad signal is generated. When the next clock occurs, the output of the adder is loaded into the accumulator and the control goes to S2. At t3, an Sh signal is generated, so, shifting occurs and the counter is incremented at the next clock. At t4, M = 1, so Ad = 1, and the adder output is loaded into the accumulator at the next clock. At t5 and t6, shifting and counting occurs. At t7, three shifts have occurred and the counter state is 11, so K = 1. Because M = 1, addition occurs, and the control goes to S2. At t8, Sh = K = 1, so at the next clock the final shift occurs, and the counter is incremented back to state 00. At t9, a Done signal is generated.
The multiplier design given here can easily be expanded to 8, 16, or more bits simply by increasing the register size and the number of bits in the counter. The add- shift control would remain unchanged.
18.3 Design of a Binary Divider We will consider the design of a divider for positive binary numbers. As an example, we will design a circuit to divide an 8-bit dividend by a 4-bit divisor to obtain a 4-bit quotient. The following example illustrates the division process: 1010 quotient divisor 1101 10000111 dividend 1101 0111 0000 1111 (135 ÷ 13 = 10 with 1101 a remainder of 5) 0101 0000 0101 remainder TABLE 18-2 Operation of a Multiplier Using a Counter © Cengage Learning 2014 Time State Counter Product Register St M K Load Ad Sh Done t0 S0 00 000000000 0 0 0 0 0 0 0 t1 S0 00 000000000 1 0 0 1 0 0 0 t2 S1 00 000001011 0 1 0 0 1 0 0 t3 S2 00 011011011 0 1 0 0 0 1 0 t4 S1 01 001101101 0 1 0 0 1 0 0 t5 S2 01 100111101 0 1 0 0 0 1 0 t6 S1 10 010011110 0 0 0 0 0 1 0 t7 S1 11 001001111 0 1 1 0 1 0 0 t8 S2 11 100011111 0 1 1 0 0 1 0 t9 S3 00 010001111 0 1 0 0 0 0 1 638 Unit 18 Just as binary multiplication can be carried out as a series of add and shift opera-tions, division can be carried out by a series of subtraction and shift operations. To construct the divider, we will use a 9-bit dividend register and a 4-bit divisor register, as shown in Figure 18-10. During the division process, instead of shifting the divi-sor to the right before each subtraction as shown in the preceding example, we will shift the dividend to the left. Note that an extra bit is required on the left end of the dividend register so that a bit is not lost when the dividend is shifted left. Instead of using a separate register to store the quotient, we will enter the quotient bit-by-bit into the right end of the dividend register as the dividend is shifted left. Circuits for initially loading the dividend into the register will be added later.
The preceding division example (135 divided by 13) is now reworked, showing the location of the bits in the registers at each clock time. Initially, the dividend and divisor are entered as follows: 0 0 0 1 1 1 1 1 1 first quotient digit 0 0 1 1 1 1 1 1 0 1 1 0 1 FIGURE 18-10 Block Diagram for Binary Divider © Cengage Learning 2014 Sh Ld X8 X7 X6 X5 X4 Y3 Y2 Y1 Y0 C Su Sh St (Start Signal) V (Overflow Indicator) X3 X2 X1 X0 Subtractor and Comparator Dividend Register Control Clock 0 0 1 0 0 0 0 1 1 1 1 1 0 1 Subtraction cannot be carried out without a negative result, so we will shift before we subtract. Instead of shifting the divisor one place to the right, we will shift the dividend one place to the left: 1 0 0 0 0 1 1 1 0 1 1 0 1 Dividing line between dividend and quotient Note that after the shift, the rightmost position in the dividend register is “empty”. Subtraction is now carried out, and the first quotient digit of 1 is stored in the unused position of the dividend register: Next, we shift the dividend one place to the left: Circuits for Arithmetic Operations 639 Because subtraction would yield a negative result, we shift the dividend to the left again, and the second quotient bit remains 0: 0 1 1 1 1 1 1 0 0 1 1 0 1 0 0 0 1 0 1 1 0 1 third quotient digit Subtraction is now carried out, and the third quotient digit of 1 is stored in the unused position of the dividend register: A final shift is carried out and the fourth quotient bit is set to 0: 0 0 1 0 1 remainder 1 0 1 0 quotient The final result agrees with that obtained in the first example. Note that in the first step the leftmost 1 in the dividend is shifted left into the leftmost position (X8) in the X register. If we did not have a place for this bit, the division operation would have failed at this step because 0000 < 1101. However, by keeping the leftmost bit in X8, 10000 ≥1101, and subtraction can occur.
If as a result of a division operation, the quotient would contain more bits than are available for storing the quotient, we say that an overflow has occurred. For the divider of Figure 18-10 an overflow would occur if the quotient is greater than 15, because only 4 bits are provided to store the quotient. It is not actually neces-sary to carry out the division to determine if an overflow condition exists, because an initial comparison of the dividend and divisor will tell if the quotient will be too large. For example, if we attempt to divide 135 by 7 , the initial contents of the registers would be: 0 1 0 0 0 0 1 1 1 0 1 1 1 Because subtraction can be carried out with a nonnegative result, we should subtract the divisor from the dividend and enter a quotient bit of 1 in the rightmost place in the dividend register. However, we cannot do this because the rightmost place con-tains the least significant bit of the dividend, and entering a quotient bit here would destroy that dividend bit. Therefore, the quotient would be too large to store in the 4 bits we have allocated for it, and we have detected an overflow condition. In general, for Figure 18-10, if initially X8 X7 X6 X5 X4 ≥Y3 Y2 Y1 Y0 (i.e., if the left five bits of the dividend register exceed or equal the divisor), the quotient will be greater than 15 and an overflow occurs. Note that if X8 X7 X6 X5 X4 ≥Y3 Y2 Y1 Y0, the quotient is X8 X7 X6 X5 X4 X3 X2 X1 X0 Y3 Y2 Y1 Y0 ≥X8 X7 X6 X5 X4 0000 Y3 Y2 Y1 Y0 = X8 X7 X6 X5 X4 × 16 Y3 Y2 Y1 Y0 ≥16 The operation of the divider can be explained in terms of the block diagram of Figure 18-10. A shift signal (Sh) will shift the dividend one place to the left on the next rising clock edge. Because the subtracter is a combinational circuit, it computes 640 Unit 18 X8X7X6X5X4 – Y3Y2Y1Y0, and this difference appears at the subtracter output after a propagation delay. A subtract signal (Su) will load the subtracter output into X8X7X6X5X4 and set the quotient bit (the rightmost bit in the dividend register) to 1 on the next rising clock edge. To accomplish this, Su is connected to both the Ld input on the shift register and the data input on flip-flop X0. If the divisor is greater than the five leftmost dividend bits, the comparator output is C = 0; other-wise, C = 1. The control circuit generates the required sequence of shift and subtract signals. Whenever C = 0, subtraction cannot occur without a negative result, so a shift signal is generated. Whenever C = 1, a subtract signal is generated, and the quotient bit is set to one.
Figure 18-11 shows the state graph for the control circuit. When a start signal (St) occurs, the 8-bit dividend and 4-bit divisor are loaded into the appropriate registers. Note that this assumes the divisor and dividend are available and stable during the clock cycle when Load = 1; they may be available before and after this clock cycle, but they must be available at least during this clock cycle. If C is 1 after the load, the upper half of the dividend is larger than the divisor and the quotient would require five or more bits. Because space is only provided for a 4-bit quotient, this condition constitutes an overflow, so the divider is stopped, and the overflow indicator is set by the V output. Normally, the initial value of C is 0, so a shift will occur first, and the control circuit will go to state S2. Then, if C = 1, subtraction occurs. After the subtraction is completed, C will always be 0, so the next active clock edge will produce a shift. This process contin-ues until four shifts have occurred, and the control is in state S5. Then, a final subtrac-tion occurs if C = 1, and no subtraction occurs if C = 0. No further shifting is required, and the control goes to the stop state. For this example, we will assume that when the start signal (St) occurs, it will be 1 for one clock time, and, then, it will remain 0 until the control circuit is back in state S0. Therefore, St will always be 0 in states S1 through S5.
We will now design the control circuit using a one-hot assignment (see Section 15.9) to implement the state graph. One flip-flop is used for each state with Q0 = 1 in S0, Q1 = 1 in S1, Q2 = 1 in S2, etc. By inspection, the next-state and output equations are Q+ 0 = St ′Q0 + CQ1 + Q5 Q+ 1 = StQ0 (18-1) Q+ 2 = C′Q1 + CQ2 Q+ 3 = C′Q2 + CQ3 Q+ 4 = C′Q3 + CQ4 Q+ 5 = C′Q4 Load = St Q0 V = CQ1 Sh = C′(Q1 + Q2 + Q3 + Q4) = C′(Q0 + Q5)′ Su = C(Q2 + Q3 + Q4 + Q5) = C(Q0 + Q1)′ FIGURE 18-11 State Graph for Divider Control Circuit © Cengage Learning 2014 S5 S0 (stop) S1 S2 S4 S3 St′/0 St/Load C/V C/Su C′/0 C′/Sh C/Su C′/Sh C′/Sh C′/Sh C/Su C/Su Circuits for Arithmetic Operations 641 Because there are three arrows leading into S0, Q+ 0 has three terms. The equation for Sh has been simplified by noting that if the circuit is in state S1 or S2 or S3 or S4, it is not in state S0 or S5.
The subtracter in Figure 18-10 can be constructed using five full subtracters, as shown in Figure 18-12. Because the subtracter is a combinational circuit, whenever the numbers in the divisor and dividend registers change, these changes will propa-gate to the subtracter outputs. The borrow signal will propagate through the full subtracters before the subtracter output is transferred to the dividend register. If the last borrow signal (b9) is 1, this means that the result is negative. Hence, if b9 is 1, the divisor (Y3Y2Y1Y0) is greater than X8X7X6X5X4, and C = 0. Therefore, C = b9 ′, and a separate comparator circuit is unnecessary. Under normal operating conditions (no overflow) for this divider, we can also show that C = d ′ 8 . At any subtraction step, because the divisor is only four bits, d8 = 1 would allow a second subtraction without shifting. However, this can never occur because the quotient digit cannot be greater than 1. Therefore, if subtraction is possible, d8 will always be 0 after the subtraction, so d8 = 0 implies X8X7X6X5X4 is greater than Y3Y2Y1Y0 and C = d8 ′.
The block diagram of Figure 18-10 does not show how the dividend is initially loaded into the X register. This can be accomplished by adding a MUX at the X register inputs, as shown in Figure 18-13. This diagram uses bus notation to avoid drawing multiple wires. When several busses are merged together to form a single bus, a bus merger is used. For example, the symbol 5 3 1 9 9 5 3 X0 X (3:1) X (8:4) FIGURE 18-12 Logic Diagram for 5-Bit Subtracter © Cengage Learning 2014 Full Subtracter d8 b9 b8 b7 b6 b5 b4 = 0 X8 0 Full Subtracter d7 X7 Y3 Full Subtracter d6 X6 Y2 Full Subtracter d5 X5 Y1 Full Subtracter d4 X4 Y0 means that the 5-bit subtracter output is merged with bits X3X2X1 and a logic 1 to form a 9-bit bus. Thus, the MUX output will be d8d7d6d5d4X3X2X11 when Load = 0.
Similarly, the symbol 642 Unit 18 represents a bus splitter that splits the 9 bits from the X register into X8 X7 X6 X5 X4 and X3 X2 X1; X0 is not used. Bus mergers and splitters do not require any actual hardware; they are just a symbolic way of showing bus connections.
The X register is a left-shift register with parallel load capability, similar to the register in Figure 12-10. On the rising clock edge, it is loaded when Ld = 1 and shifted left when Sh = 1. Because the register must be loaded with the dividend when Load = 1 and with the subtracter output when Su = 1, Load and Su are ORed together and connected to the Ld input. The MUX selects the dividend (preceded by a 0) when Load = 1. When Load = 0, it selects the bus merger output which consists of the subtracter output, X3 X2 X1, and a logic 1. When Su = 1 and the clock rises, this MUX output is loaded into X. The net result is that X8 X7 X6 X5 X4 gets the subtracter output, X3 X2 X1 is unchanged, and X0 is set to 1.
Figure 18-14 shows an alternative version of the divider. The primary difference is the use of a 4-bit subtracter rather than a 5-bit subtracter. The 4-bit subtracter is shown in Figure 18-12 with the leftmost full subtracter deleted. It can be shown that the 4 least significant output bits from the 5-bit subtracter of Figure 18-13 do not depend upon X8. (See Problem 18.32.) Since the most significant bit of the 5-bit subtracter is discarded by the following shift of the X register, this bit is not needed. However, now the borrow from the 4-bit subtracter, b8, is not sufficient to determine whether a subtract operation should be done. The state graph of Figure 18-11 still applies, but now C depends on both X8 and b8.
FIGURE 18-13 Block Diagram for Divider Using Bus Notation © Cengage Learning 2014 X (8:0) 1 0 9-Wide 2-to-1 MUX Ld Sh Clock 0 9 9 9 8 Dividend (7:0) 9 5 1 0 Load Load Su Sh 5-bit Subtracter 0 5 4 3 X (3:1) X (8:4) Y (3:0) (Divisor) X0 Bus Merger Bus Splitter 9 Circuits for Arithmetic Operations 643 FIGURE 18-14 Alternative Divider © Cengage Learning 2014 Load Su Sh Sh Clock Load X (8:0) X (3:1) X (7:4) b8 Y (3:0) Dividend (7:0) (Divisor) Ld 0 9 8 8 8 4 3 1 4 4 8-wide 2-to-1 MUX 4-bit Subtracter 0 0 1 FIGURE 18-15 Another Alternative Divider © Cengage Learning 2014 Load Su Sh Sh Clock Clock Load X (8:4) X (3:0) X (7:4) b8 X3 Q Y (3:0) Dividend (3:0) Dividend (7:4) (Divisor) Ld Sh Ld 0 1 5 4 4 4 4 4 4 0 4-wide 2-to-1 MUX 4-bit Subtracter Figure 18-15 shows a second alternative divider. In this version only the upper part of the X register is loaded when a subtract operation is required. Then, on the following shift operation, a quotient bit of 1, Q = 1, is shifted into X0. If no sub-tract operation is required, a quotient bit of 0, Q = 0, is shifted into X0. This simpli-fies the circuit since only a 4-wide multiplexer is needed. This circuit is analyzed in Problem 18.33.
644 Unit 18 Programmed Exercise 18.1 Cover the answers with a sheet of paper and slide it down as you check your answers. Write your answer in the space provided before looking at the correct answers.
This exercise concerns the design of a circuit which forms the 2’s complement of a 16-bit binary number. The circuit consists of three main components—a 16-bit shift register which initially holds the number to be complemented, a control circuit, and a counter which counts the number of shifts. The control circuit processes the number in the shift register one bit at a time and stores the 2’s complement back in the shift register. Draw a block diagram of the circuit. Show the necessary inputs and outputs for the control circuit including a start signal (N) which is used to initiate the 2’s complement operation.
SI CK CK N Sh Control Circuit Sh X Z K Counter CK State a rule for forming the 2’s complement which is appropriate for use with the preceding block diagram. Answer Starting with the least significant bit, complement all of the bits to the left of the first 1.
Draw a state graph for the control circuit (three states) which implements the pre-ceding rule. The 2’s complement operation should be initiated when N = 1. (Assume that N will be 1 for only one clock time.) When drawing your graph, do not include any provision for stopping the circuit. (In the next step you will be asked to add the signal K to your state graph so that the circuit will stop after 16 shifts.) Explain the meaning of each state in your graph. Answer Circuits for Arithmetic Operations 645 Answer S2 S1 S0 N′/0 K′X/Z′ K′X′/Z K′X/Z KX/Z KX′/Z′ X′N/Z′ X′X/Z′ XN/Z XK/Z′ X′K/Z S0 Reset S1 No 1 received, do not complement X S2 A 1 has been received, complement X N′/0 X′/Z X/Z′ X′/Z′ X/Z XN/Z X′N/Z′ S0 S2 S1 The counter will generate a completion signal (K) when it reaches state 15. Modify your state graph so that when K = 1, the circuit will complete the 2’s complement oper-ation and return to the initial state. Also, add the Sh output in the appropriate places. Answer Check the input labels on all arrows leaving each state of your graph. Make sure that two of the labels on arrows leaving a given state cannot have the value 1 at the same time. Make any necessary corrections to your graph, and then check your final answer. Final Answer (Note: Sh should be added to the graph everywhere Z or Z′ appears.) 646 Unit 18 Programmed Exercise 18.2 This exercise concerns the design of a binary divider to divide a 6-bit number by a 3-bit number to find a 3-bit quotient. The right 3 bits of the dividend register should be used to store the quotient. Draw a block diagram for the divider. Omit the signals required to initially load the dividend register and assume the dividend is already loaded. Answer Sh Ld X6 X5 X4 X3 X2 Y2 Y1 Y0 C Su Sh St (Start Signal) V (Overflow Indicator) X1 X0 Subtracter and Comparator Dividend Register Control Clock 0 0 1 0 0 0 1 0 shift If the contents of the dividend register is initially 0100010 and the divisor is 110, show the contents of the dividend register after each of the first three rising clock edges. Also, indicate whether a shift or a subtraction should occur next.
Circuits for Arithmetic Operations 647 Answer 0 1 0 0 0 1 0 shift 1 0 0 0 1 0 0 subtract 0 0 1 0 1 0 1 shift 0 1 0 1 0 1 0 shift Now, show the remaining steps in the computation and check your answer by con-verting to decimal. Answer 1 0 1 0 1 0 0 subtract 0 1 0 0 1 0 1 (finished) If the dividend register initially contained 0011001 and the divisor is 010, can divi-sion take place? Explain. Answer No. Because 011 > 010, subtraction should occur first, but there is no place to store the quotient bit. In other words, the quotient would be greater than three bits, so an overflow would occur.
Draw a state graph for the divider which will produce the necessary sequence of Su and Sh signals. Assume that the comparator output is C = 1 if the upper four bits of the dividend register is greater than the divisor. Include a stop state in your graph which is different than the reset state. Assume that the start signal (St) will remain 1 until the division is completed. The circuit should go to the stop state when division is complete or when an overflow is detected. The circuit should then reset when St = 0.
648 Unit 18 Answer S3 S4 (stop) S1 S0 (reset) S2 St/0 St′/0 StC/V C/Su C/Su StC′/Sh St′/0 C/Su C′/0 C′/Sh C′/Sh Binary Multiplier to Be Designed x3 x2 x1 y3 y2 y1 Z6 Z5 Z4 Z3 Z2 Z1 Problems 18.3 Design a serial subtracter with accumulator for 5-bit binary numbers. Assume that negative numbers are represented by 2’s complement. Use a circuit of the form of Figure 18-1, except implement a serial subtracter using a D-CE flip-flop and any kind of gates. Give the state graph for the control circuit. Assume that St will remain 1 until the subtraction is complete, and the circuit will not reset until St returns to 0.
18.4 Design a binary multiplier which multiplies two 3-bit binary numbers to form a 6-bit product. This multiplier is to be a combinational circuit consisting of an array of full adders and AND gates (no flip-flops). Demonstrate that your circuit works by showing all of the signals which are present when 111 is multiplied by 111. (Hint: The AND gates can be used to multiply by 0 or 1, and the full adders can be used to add 2 bits plus a carry. Six full adders are required.) 18.5 The binary multiplier of Figure 18-7 has been redesigned so that whenever addition occurs the multiplier bit (M) will be set to 0. Specifically, the Ad signal is now con-nected to a synchronous clear input on only the rightmost flip-flop of the product Circuits for Arithmetic Operations 649 register of Figure 18-7 . Thus, if M is 1 at a given clock time and addition takes place, M will be 0 at the next clock time. Now, we can always add when M = 1 and always shift when M = 0. This means that the control circuit does not have to change state when M = 1, and the number of states can be reduced from ten to six. Draw the resulting state graph for the multiplier control with six states.
18.6 In order to allow for a larger number of bits, the control circuit of the binary divider (Figure 18-10) is to be redesigned so that it uses a separate counter and a subtract-shift control which is analogous to Figure 18-9(a). Draw the state graph for the subtract-shift control.
18.7 Below is the block diagram of a divider which will divide a 5-bit binary number X4X3X2X1X0 by a 5-bit binary number Y4Y3Y2Y1Y0. Initially, the 5-bit dividend is loaded into bits X4 through X0, and 0’s are loaded into bits X9 through X5. Because of its design, overflow will only occur if the divisor is 0. This divider operates similarly to the one given in Figures 18-10 and 18-11, except for the starting placement of the dividend.
Sh Ld X8 X7 X9 X6 X5 X4 Y3 Y2 Y4 Y1 Y0 C V Su Sh St X3 X2 X1 X0 Subtracter and Comparator Control Clock Overflow Indicator (a) Give the equation for the overflow signal V, generated by the overflow indicator.
(b) Illustrate the operation of the divider when 26 is divided by 5. Specify the sequence of Su and Sh outputs and the contents of the dividend register, and specify the quotient and the remainder.
(c) Draw the state graph for the control circuit. If there is an overflow, the circuit should remain in the starting state. Otherwise, when St = 1, the circuit should begin operation. Assume that St will be 1 for only one clock cycle.
(d) In Figure 18-10, the subtracter-comparator and the dividend register have one more bit on the left than the divisor register. Why is that not necessary here?
18.8 A serial logic unit has two 8-bit shift registers, X and Y, shown as follows. Inputs K1 and K2 determine the operation to be performed on X and Y. When St = 1, X and Y are shifted into the logic circuit one bit at a time and replaced with new val-ues. If K1K2 = 00, X is complemented and Y is unchanged. If K1K2 = 01, X and Y 650 Unit 18 are interchanged. If K1K2 = 10, Y is set to 0 and each bit of X is replaced with the exclusive-OR of the corresponding bits of X and Y, that is, the new xi is xi ⊕ yi. If K1K2 = 11, X is unchanged and Y is set to all 1’s.
Clock SI Sh Adder Shift Register X Y L Dec Counter Z St Z Control Sh St Sh C C SI K1 xin yin K2 Logic Circuit Sh X a Control Clock St SI Sh Y b Sh (a) Derive logic equations for xin and yin.
(b) Derive a state graph for the control circuit. Assume that once St is set to 1 it will remain 1 until all 8 bits have been processed. Then, St will be changed back to 0 some time before the start of the next computation cycle.
(c) Realize the logic circuit using two 4-to-1 multiplexers and a minimum number of added gates.
18.9 A circuit for adding one to the contents of a shift register has the following form: The adder circuit has an internal flip-flop that can be used to store a carry from the adder operation. The control unit has a counter available to determine when the add operation is complete. The counter input L enables a parallel load of the counter with the length of the shift register. The counter input Dec causes the counter to decrement. The counter output Z becomes 1 when the counter value is zero. When St becomes 1, the control unit generates Sh and C the required number of times to cause 1 to be added to the shift register contents. The control unit also generates the signals L and Dec to control the counter.
Design the adder and the control unit, using D flip-flops and NOR gates.
Circuits for Arithmetic Operations 651 18.10 Repeat Problem 18.9 so that 2 is added to the shift register contents rather than 1.
18.11 Repeat Problem 18.9 so that 3 is added to the shift register contents rather than 1.
18.12 A sequential circuit receives decimal numbers encoded in BCD one digit (4 bits) at a time, starting with the least significant digit. The circuit outputs are the 10’s complement of the input number, also encoded in BCD least significant digit first. Input decimal numbers are separated by one or more inputs of all 1’s, during which the circuit outputs all 1’s. Once valid BCD digits of a new number start, the circuit resumes computing and outputting the 10’s complement of the new number.
(a) Construct a state table and output table for the circuit. (Two states are sufficient.) (b) Realize the circuit using a minimum number of flip-flops.
18.13 Repeat Problem 18.12 assuming the decimal digits are encoded in excess-3 and the separator between decimal numbers is all 0’s, which produces all 0’s on the outputs.
18.14 A circuit that adds one to the contents of a shift register has the following form: The control circuit outputs I, which should set the ONE ADDER to the proper initial state, and then outputs Sh to the shift register the required number of times. Design the box labeled “ONE ADDER” using NOR gates and a D flip-flop with preset and clear inputs.
EXAMPLE: 18.15 (a) Draw a block diagram for a multiplier that can multiply two binary numbers, where the multiplier is 3 bits and the multiplicand is 4 bits. Use an 8-bit shift register along with other necessary blocks.
(b) Draw a state graph for the multiplier control.
(c) Illustrate the operation of the multiplier when 11 is multiplied by 5. Specify the sequence of add and shift outputs generated by the control circuit and specify the contents of the 8-bit register at each clock time.
(d) Draw the logic diagram for the multiplier using an 8-bit shift register of the form of Figure 12-10, a 4-bit adder, three J-K flip-flops, and any necessary gates.
Contents of shift register before: 000001011 Contents of shift register after I and 9 Sh outputs: 000001100 SI Clock One Adder Sh X Z Sh Control I St Clock 652 Unit 18 18.16 Work Problem 18.15 if the multiplier is 3 bits and the multiplicand is 5 bits, and show 20 multiplied by 6. Use a 9-bit shift register similar to Figure 12-10, five full adders, three D flip-flops, and a PLA for part (d). Show the PLA table.
18.17 The block diagram for a multiplier for positive binary numbers follows. The counter counts the number of shifts and outputs a signal K = 1 after two shifts.
K Ad M St Sh Adder X Register Ld Sh SI Clock 0 Clock Add-Shift Control Counter (a) Draw the state graph for the control circuit. Assume that St is 1 for one clock period to start the multiplier.
(b) Complete the following table showing the operation of the circuit if the multipli-cand is 11001 and the multiplier is 111: State Counter X St M K Ad Sh S0 00 000000111 1 1 0 18.18 Design a binary divider which divides a 7-bit dividend by a 2-bit divisor to give a 5-bit quotient. The system has an input St that starts the division process.
(a) Draw a block diagram for the subtracter-comparator. You may use full adders or full subtracters.
(b) Draw a block diagram for the rest of the system (do not show the adders or sub-tracters in the subtracter-comparator block).
(c) Draw the state graph for the control circuit. Assume that the start signal (St) is present for one clock period.
(d) Give the contents of the dividend register and the value of C at each time step if initially the dividend is 01010011 and the divisor is 11.
18.19 (a) Draw a block diagram for a divider that is capable of dividing a positive 6-bit binary number by a positive 4-bit binary number to give a 2-bit quotient. Use a dividend register, a divisor register, a subtracter-comparator block, and a control block.
Circuits for Arithmetic Operations 653 (b) Draw a state graph for the control circuit. Assume that the start signal St remains 1 for one or more clock times after the division is complete, and St must be set to 0 to reset the circuit.
(c) Show how the subtracter-comparator could be realized using full adders and inverters.
(d) Show the contents of the registers and the value of C after each time step if ini-tially the dividend is 101101 and the divisor is 1101.
18.20 Design a controller for an odd-parity generator. The circuit should transmit 7 bits from a shift register onto the output X. Then, on the next clock cycle, the eighth value of X should be chosen to make the number of 1’s be odd. In other words, the last value of X should be 1 if there was an even number of 1’s in the shift reg-ister, so that the 8-bit output word will have odd parity. (Parity was discussed in Section 13.1.) The circuit is shown. K will be 1 when the counter reaches 111.
Control B K X R Sh St Counter Sh SI Clock Clock Clock 0 K Clr (a) Give the state graph for the control circuit. Assume St = 1 for one clock cycle (three states).
(b) Implement the controller using D flip-flops and any necessary gates. Use a one-hot state assignment.
18.21 Design a serial logic unit to multiply a 6-bit number X by –1. Assume negative num-bers are represented by their 2’s complements. Recall that one way to find the 2’s complement is to invert all of the bits to the left of the rightmost 1. If the number is –32 = 100000, there is no 6-bit 2’s complement representation of +32, so an error signal Er should be generated.
(a) Give a block diagram for the circuit, using a control block, a 6-bit right-shift register, and a 3-bit counter. The controller has inputs St, K, and SO, and outputs Er, Clr, Sh, and SI. The shift register is like the register of Figure 12-7 , but it has 6 bits. The counter has a Clr input and an output K which is 1 when the counter reaches 6. Assume the shift register contains X at the beginning of the opera-tion. The shift register should contain −X when the operation is complete.
(b) Give the state graph for the control circuit. Be sure the circuit will work properly when taking the 2’s complement of 0. (0 × −1 = 0.) (c) Implement the controller using a one-hot state assignment and D flip-flops.
654 Unit 18 18.22 A serial Boolean logic unit has two 16-bit shift registers, A and B. A control signal (C) is used to select the Boolean operation to be performed. If C = 0, the contents of A are serially replaced by the bit-by-bit Boolean AND of A and B. If C = 1, the contents of A are serially replaced by the bit-by-bit exclusive-OR of A and B. After the numbers have been placed in A and B, and C is set to 0 or 1, a start signal (St) sets the circuit in operation. A counter is used to count the number of shifts. When the counter reaches state 15, it outputs a signal K = 1, which causes the control cir-cuit to stop after one more shift. Assume that St remains 1 and C does not change until the operation is completed. The control then remains in the stop state until St is changed back to 0.
(a) Draw a block diagram of the system, which includes the shift registers, the coun-ter, the control circuit, and a logic circuit that generates the serial input (SI) to the A register.
(b) Draw a state graph for the control circuit (three states).
(c) Design the control circuit using a PLA and D flip-flops.
(d) Design a logic circuit that generates SI.
18.23 Repeat 18.22, but assume that St = 1 for only one clock cycle, and that C may change during the operation of the circuit. Therefore, the circuit should operate according to what the value of C was when St = 1. Use a one-hot state assignment for (c). (Hint: C should be an input to the control circuit, and you will need another output of the control circuit to take the place of C in the logic circuit of part (d) of 18.22.) 18.24 A serial logic unit consists of a 4-bit shift register X and a control unit. The control unit has a start input (St), a shift output (Sh), and an output M which is the serial input to the shift register. In addition, signals C1 and C2 are used to select the logic operation performed on the shift register. When St = 1, then If C1C2 = 00, the contents of register X is serially replaced by all 0’s.
If C1C2 = 01, the contents of register X is serially replaced by all 1’s.
If C1C2 = 11, the contents of register X is serially replaced by its bit-by-bit comple-ment. Assume that C1C2 does not change until the selected operation is complete.
(a) Draw a block diagram for the system.
(b) Specify the state graph for the control unit. Assume that St stays 1 for one clock period.
(c) Design the control unit (not the shift register) using J-K flip-flops and any kind of gates. Also, design the logic inside the control unit which generates the serial input M to the shift register. (Hint: M depends only on C1, C2, and X.) 18.25 Design a circuit which sets a specified number of bits on the right side of a shift register to 0. The number of bits to be set to 0 is in register N before the start of the operation. When St = 1, the controller should shift right N times, and then shift left N times. The counter only counts down, and K = 1 when the counter reaches 000.
(a) Give the circuit. Use a control block, a 3-bit N register, a 3-bit down counter with load input (Ld) and K output (which is 1 when the counter reaches 000), and an 8-bit right/left shift register which functions according to the table in Problem 12.3 (except that it has 8 bits). Note that the counter does not count up, Circuits for Arithmetic Operations 655 so you will have to load N into the counter twice. The controller has inputs St and K, and outputs A, B, and Ld.
(b) Give the state graph for the control circuit. Assume St = 1 for one clock period.
(c) Implement the controller using two D flip-flops. Use a straight binary assignment.
18.26 Design a controller for the circuit of Problem 12.39 that will add three numbers. Assume each number (including the first one) appears on the 8-bit input data line for two consecutive clock cycles. You may not assume that the registers begin with a value of 0. When St = 1, the first input appears on the input data line for that clock cycle and the next one. The circuit should halt when the answer goes into the accumulator, and output a signal Done = 1. Done should remain 1 until St returns to 0. You may assume St = 1 for enough time for the operation to complete. Give the block diagram and the state graph (seven states), but you do not need to implement the state graph.
18.27 The given multiplier uses only counters to multiply a 4-bit multiplicand by a 4-bit multiplier to obtain an 8-bit product. This Ultra-Slow Multiplier is based on the principle that multiplication is repeated addition and that addition is repeated incre-menting. The multiplier works as follows: When the St signal is received, the 8-bit up counter is cleared, N1 is loaded into 4-bit counter A, and N2 is loaded into 4-bit counter B. Then, the controller decrements A and increments the up counter until A reaches zero. When A reaches zero, B is decremented and A is reloaded with N1. Then, the process is repeated until B reaches zero. When B reaches zero, the 8-bit up counter contains the product.
(a) Draw the state graph for the controller. Assume St = 1 for only one clock period.
8-Bit Up Counter CLR LD1 CT1 LD2 CT2 ZER2 ZER1 Product Clear Control St Done Count Load 4 Count Zero Zero Ultra-Slow Multiplier 4-Bit Down Counter A Multiplicand Load Count 4-Bit Down Counter B Multiplier N1 4 N2 (b) Realize the state graph using one or two J-K flip-flops and a minimum number of gates.
(c) If the multiplier is N1 and the multiplicand is N2, how many clock periods does it take for the Ultra-Slow Multiplier to calculate the product?
18.28 The following circuit is a multiplier circuit for 4-bit positive numbers. Multiplication is performed by adding the multiplicand to a partial product while decrementing the multiplier. This is continued until the multiplier is decremented to zero. (If the 656 Unit 18 multiplier is initially zero, no additions are done.) When the start input (S) changes to 1, the multiplicand and multiplier are available; the multiplier circuit loads them into A Reg and B Counter, respectively. The partial product register, implemented in two parts (PU and PL), is cleared, as is the carry-out FF for the adder (C FF). To avoid having an adder twice as long as the operands, the addition of the multiplicand to the partial product is done in two steps: First, the multiplicand is added to the lower half of the partial product; second, the carry from the first addition is added to the upper half of the partial product. The multiplier in the B counter is decremented for each addition, and the additions continue until the multiplier has been decremented to zero. Then the done signal (D) is generated, with the product available in the partial product register; D remains asserted and the product available until S returns to 0.
The control signals that the controller must generate are B Counter Zero Detect 4 Multiplier LB DB BZ Controller S D PU Reg 4 CP LPU PL Reg 4 A Reg 4 CP LPL LA Multiplicand MUX Adder AND Array MS EA 4 C FF 0 1 CC LB Load B Counter DB Decrement B Counter CP Clear PU and PL LPU Load PU LPL Load PL LA Load A Reg MS MUX Select Signal EA Signal ANDed with A Reg output CC Clear C FF D Done The input signals to the controller are start, S, and BZ; BZ = 0 when the B counter is zero.
(a) Determine the contents of the partial product register for each addition step when the multiplicand is 1011 and the multiplier is 0101.
(b) Draw a state graph for the controller. (Four states are sufficient.) (c) Realize the controller using D FFs and a one-hot state assignment. Give the next-state equations and the controller output equations.
(d) Realize the controller using a minimum number of D FFs.
Circuits for Arithmetic Operations 657 18.29 A few modifications of the circuit of Problem 18.28 are necessary so that it will mul-tiply 2’s complement numbers. For example, the Controller must have inputs that are the sign bits of the multiplier and multiplicand; the B Counter must be able to increment a negative multiplier to 0; and the AND Array must be changed so that its outputs can be the multiplicand, all 0’s or all 1’s.
(a) Redesign the multiplier so that it can multiply 2’s complement numbers using these suggested modifications.
(b) Determine the contents of the partial product register for each addition step when the multiplicand is 1011 and the multiplier is 0101. Repeat when the mul-tiplicand is 0101 and the multiplier is 1011.
(c) Draw a state graph for the controller. (At most, five states are required.) (d) Realize the controller using D FFs and a one-hot state assignment. Give the next-state equations and the controller output equations.
(e) Realize the controller using a minimum number of D FFs.
18.30 The Ultra-Slow Divider, shown in the following block diagram, works on a principle similar to the Ultra-Slow Multiplier in Problem 18.27 . When the St signal is received, the 8-bit down counter is loaded with the dividend (N1), the 4-bit down counter is loaded with the divisor (N2), and the 4-bit quotient up counter is cleared. The divi-dend counter and the divisor counter are decremented together, and every time the 4-bit divisor counter reaches zero, it is reloaded with the divisor and the quotient up counter is incremented. When the dividend counter reaches zero, the process termi-nates and the quotient counter contains the result.
(a) Draw the state graph for the controller.
(b) Realize the state graph using one or two D flip-flops and a minimum number of gates.
(c) If the dividend is N1 and the divisor is N2, how many clock cycles does it take to calculate the quotient?
(d) How can you tell if an overflow occurs during division?
(e) What will happen in your circuit if the divisor is zero?
CLR EZERO IZERO LOAD DOWN UP Dividend Load Control ST Done Count Clear Count Zero Ultra-Slow Divider 4-Bit Up Counter 8-Bit Down Counter Quotient Load Count 4-Bit Down Counter Divisor 8 N1 4 N2 658 Unit 18 18.31 In Problem 1.42 it was shown that the n-bit 2’s complement integer B = bn−1bn−2 · · · b1b0 has the decimal value –bn – 12n – 1 + bn – 22n – 2 + bn – 32n – 3 + · · · + b12 + b0. Based on this expression, multiplication of 2’s complement numbers, B × A, can be done by adding bi(A2i) to a partial product for i = 0 to n −2 and subtracting bn−1(A2n−1) from the partial product.
(a) Based on this algorithm, show the contents of ACC in Figure 18-7 for each step of the algorithm for the operands multiplicand A = 1101(−3) and multiplier B = 1010(−6). Repeat for operands A = 1000(−8) and B = 0110(6). Note that the value shifted into bit 7 of ACC will no longer be the carry-out from the adder as shown in Figure 18-7 (i.e., bit 8 of ACC will have to be replaced with a circuit that provides the proper value to shift into bit 7 of ACC).
(b) State in words what value should be shifted into bit 7 of ACC during a shift operation.
(c) Modify the circuit of Figure 18-7 so that 2’s complement numbers can be mul-tiplied using this algorithm. Replace bit 8 of ACC with a circuit that provides the value to shift into bit 7 of ACC during a shift operation. Let M3 be the sign bit of the multiplicand. Let Su be the control signal from the controller when a Subtract operation is required.
(d) Using the modified circuit of part (c), modify the state graph of Figure 18-8 to perform 2’s complement multiplication.
(e) Using the modified circuit of part (c), modify the state graph of Figure 18-9(c) to perform 2’s complement multiplication.
18.32 (a) Consider the 5-bit subtracter in Figure 18-13. Show that the four least significant output bits from the subtracter do not depend upon X8. Do this by showing examples of the four possible cases of X8 = 0 or 1 and X(7:4) is greater than or equal to Y(3:0) or less than Y(3:0).
(b) Only three of the four cases mentioned in part (a) can occur. Illustrate the case that cannot occur.
(c) If the state graph of Figure 18-11 describes the operation of the circuit of Figure 18-14, what is the expression for C?
(d) Compare the speed and circuit complexity of the dividers in Figures 18-13 and 18-14.
18.33 (a) Construct a state graph for the divider of Figure 18-15.
(b) Compare the speed and circuit complexity of the dividers in Figures 18-13 and 18-15.
18.34 This problem involves the design of a circuit that finds the integer part of the square root of an 8-bit unsigned binary number N using the method of subtracting out odd integers. To find the square root of N, we subtract 1, then 3, then 5, etc., Circuits for Arithmetic Operations 659 until we can no longer subtract without the result going negative. The number of times we subtract is equal to the integer part of the square root of N. For example, to find "27: 27 −1 = 26; 26 −3 = 23; 23 −5 = 18; 18 −7 = 11; 11 −9 = 2; 2 −11 (cannot subtract). Because we subtracted five times, "27: = 5. Note that the final odd integer is 1110 = 10112, and this consists of the square root (1012 = 510) fol-lowed by a 1.
660 State Machine Design with SM Charts U N I T 19 Objectives 1. Explain the different parts of an SM chart.
2. Given the input sequence to a state machine, determine the output sequence from its SM chart and construct a timing diagram.
3. Convert a state graph to an SM chart.
4. Construct an SM chart for the control circuit for a multiplier, divider, or other simple digital system.
5. Determine the next-state and output equations for a state machine by tracing link paths on its SM chart.
6. Realize an SM chart using a PLA or ROM and flip-flops.
State Machine Design with SM Charts 661 Study Guide 1. Study Section 19.1, State Machine Charts.
(a) For the example of Figure 19-2, if X1 = 0 and X2 = 1 when the machine is in state S1, specify the values of all of the outputs and the exit path number.
(b) For Figures 19-6(a) and (b), trace the link paths and determine the outputs when X1 = X3 = 1.
(c) Verify that the SM chart and state graph of Figure 19-7 are equivalent.
(d) Construct a timing chart for Figure 19-7(b) when the input sequence is X = 0, 1, 1, 0.
(e) Work Problems 19.1, 19.2, and 19.3.
2. Study Section 19.2, Derivation of SM Charts.
(a) Using the SM chart of Figure 19-9 to determine when to subtract and when to shift for the binary divider of Figure 18-10, show the contents of the divi-dend register at each time step when 28 is divided by 5.
(b) Compare the SM chart of Figure 19-10 with the state graph of Figure 18-9(c) and verify that in each state they will generate the same outputs when the inputs are the same.
(c) Compare the flowchart for the dice game (Figure 19-12) with the SM chart (Figure 19-13). Note that the Roll Dice box on the flowchart requires two states to implement on the SM chart. In the first state, the machine waits for the roll button to be pressed; in the second state, it generates a roll signal which lasts until the roll button is released. In state S1 3 variables are tested; if they are all 0, Sp is generated so that the sum will be stored in the point register at the same time the transition from S1 to S4 occurs.
(d) Work Problems 19.4, 19.5, and 19.6.
3. Study Section 19.3, Realization of SM Charts.
(a) For Figure 19-7(b) find simplified equations for A+ and B +.
(b) Verify Tables 19-1 and 19-2. For Table 19-2, why is Sp = 1 only in row 4, and Win = 1 in both rows 7 and 8?
(c) Expand row 16 of Table 19-2 to give the corresponding rows of the ROM table.
(d) Work Problems 19.7 , 19.8, 19.9, and 19.10.
662 State Machine Design with SM Charts Another name for a sequential circuit is an algorithmic state machine or simply a state machine. These names are often used when the sequential circuit is used to control a digital system that carries out a step-by-step procedure or algorithm. The state graphs in Figures 18-3, 18-8, 18-9, and 18-11 define state machines for control-ling adders, multipliers, and dividers. As an alternative to using state graphs, a special type of flowchart, called a state machine flowchart or SM chart, may be used to describe the behavior of a state machine. This unit describes the properties of SM charts and how they are used in the design of state machines.
19.1 State Machine Charts Just as flowcharts are useful in software design, flowcharts are useful in the hardware design of digital systems. In this section we introduce a special type of flowchart called a state machine flowchart, or SM chart for short. SM charts are also called ASM (algorithmic state machine) charts. We will see that the SM chart offers sev-eral advantages. It is often easier to understand the operation of a digital system by inspection of the SM chart instead of the equivalent state graph. A given SM chart can be converted into several equivalent forms, and each form leads directly to a hardware realization.
An SM chart differs from an ordinary flowchart in that certain specific rules must be followed in constructing the SM chart. When these rules are followed, the SM chart is equivalent to a state graph, and it leads directly to a hardware realiza-tion. Figure 19-1 shows the three principal components of an SM chart. The state of the system is represented by a state box. The state box contains a state name, and it may contain an output list. A state code may be placed outside the box at the top. A decision box is represented by a diamond-shaped symbol with true and false branches. The condition placed in the box is a Boolean expression that is evaluated to determine which branch to take. The conditional output box, which has curved ends, contains a conditional output list. The conditional outputs depend on both the state of the system and the inputs.
State Machine Design with SM Charts 663 An SM chart is constructed from SM blocks. Each SM block (Figure 19-2) con-tains exactly one state box together with the decision boxes and conditional output boxes associated with that state. An SM block has exactly one entrance path and one or more exit paths. Each SM block describes the machine operation during the time that the machine is in one state. When a digital system enters the state associ-ated with a given SM block, the outputs on the output list in the state box become true. The conditions in the decision boxes are evaluated to determine which path (or paths) is (are) followed through the SM block. When a conditional output box is encountered along such a path, the corresponding conditional outputs become true. A path through an SM block from entrance to exit is referred to as a link path.
For the example of Figure 19-2, when state S1 is entered, outputs Z1 and Z2 become 1. If inputs X1 and X2 are both equal to 0, Z3 and Z4 are also 1, and at the end of the state time, the machine goes to the next state via exit path 1. On the other hand, if X1 = 1 and X3 = 0, the output Z5 is 1, and an exit to the next state will occur via exit path 3. A given SM block can generally be drawn in several different forms. Figure 19-3 shows two equivalent SM blocks. In both Figures 19-3(a) and (b), the output Z2 = 1 if X1 = 0; the next state is S2 if X2 = 0 and S3 if X2 = 1.
FIGURE 19-1 Components of an SM Chart © Cengage Learning 2014 state_name/ Output List (a) State box Conditional Output List (c) Conditional output box xxx Optional State Code (b) Decision box Condition (True branch) (False branch) 1 0 FIGURE 19-2 Example of an SM Block © Cengage Learning 2014 S1/Z1 Z2 Z3 Z4 Z5 One Entrance Path One State 0 Link Path a Link Path b 0 1 2 3 n 1 1 0 1 n exit paths SM Block X1 X3 X2 664 Unit 19 The SM chart of Figure 19-4(a) represents a combinational circuit because there is only one state and no state change occurs. The output is Z1 = 1 if A + BC = 1; or else Z1 = 0. Figure 19-4(b) shows an equivalent SM chart in which the input variables are tested individually. The output is Z1 = 1 if A = 1 or if A = 0, B = 1, and C = 1. Hence, Z1 = A + A′BC = A + BC which is the same output function realized by the SM chart of Figure 19-4(a).
Certain rules must be followed when constructing an SM block. First, for every valid combination of input variables, there must be exactly one exit path defined. This is necessary because each allowable input combination must lead to a single next state. Second, no internal feedback within an SM block is allowed. Figure 19-5 shows an incorrect and correct way of drawing an SM block with feedback.
As shown in Figure 19-6(a), an SM block can have several parallel paths which lead to the same exit path, and more than one of these paths can be active at the same time. For example, if X1 = X2 = 1 and X3 = 0, the link paths marked FIGURE 19-3 Equivalent SM Blocks © Cengage Learning 2014 S1/Z1 S2/ S3/ S2/ S3/ Z2 Z2 Z2 X1 X2 0 1 0 1 (a) S1/Z1 X2 X1 X1 0 1 0 0 1 1 (b) FIGURE 19-4 Equivalent SM Charts for a Combinational Circuit © Cengage Learning 2014 S0/ Z1 Z1 A + BC 0 1 1 1 (a) S0/ A C B 0 0 0 1 (b) State Machine Design with SM Charts 665 with dashed lines are active, and the outputs Z1, Z2, and Z3 will be l. Although Figure 19-6(a) would not be a valid flowchart for a program for a serial computer, it presents no problems for a state machine implementation. The state machine can have a multiple-output circuit that generates Z1, Z2, and Z3 at the same time. Figure 19-6(b) shows a serial SM block, which is equivalent to Figure 19-6(a). In the serial block only one active link path between entrance and exit is possible.
For any combination of input values the outputs will be the same as in the equivalent parallel form. The link path for X1 = X2 = 1 and X3 = 0 is shown with a dashed line, and the outputs encountered on this path are Z1, Z2, and Z3. Regardless of whether the SM block is drawn in serial or parallel form, all of the tests take place within one clock time.
A state graph for a sequential machine is easy to convert to an equivalent SM chart. The state graph of Figure 19-7(a) has both Moore and Mealy outputs. The equivalent SM chart has three blocks—one for each state. The Moore outputs (Za, Zb, and Zc) are placed in the state boxes because they do not depend on the FIGURE 19-5 SM Block with Feedback © Cengage Learning 2014 S0/ X 0 1 (a) Incorrect S0/ X 0 1 (b) Correct FIGURE 19-6 Equivalent SM Blocks © Cengage Learning 2014 S0/Z1 S0/Z1 Z2 1 0 1 0 1 0 0 (a) (b) X1 Z3 X2 Z4 Z2 X3 X1 0 Z3 X2 0 1 1 1 Z4 X3 666 Unit 19 input. The Mealy outputs (Z1 and Z2) appear in conditional output boxes because they depend on both the state and input. In this example, each SM block has only one decision box because only one input variable must be tested. For both the state graph and SM chart, Zc is always 1 in state S2. If X = 0 in state S2, Z1 = 1 and the next state is S0. If X = 1, Z2 = 1 and the next state is S2.
Figure 19-8 shows a timing chart for the SM chart of Figure 19-7 with an input sequence X = 1, 1, 1, 0, 0, 0. In this example, all state changes occur immediately after the rising edge of the clock. Because the Moore outputs (Za, Zb, and Zc) depend on the state, they can only change immediately following a state change. The Mealy outputs FIGURE 19-7 Conversion of a State Graph to an SM Chart © Cengage Learning 2014 S0/Za S1/Zb Z2 Z1 0 1 Link 1 00 1/0 1/0 0/0 0/0 1/Z2 0/Z1 01 11 (b) Equivalent SM chart (a) State graph X S2/Zc 0 1 X 0 1 Link 3 Link 2 X S0 Za S1 Zb S2 Zc FIGURE 19-8 Timing Chart for Figure 19-7 © Cengage Learning 2014 Z2 S0 S1 S2 S2 S0 S0 Z1 Zc Zb Za X State Clock State Machine Design with SM Charts 667 (Z1 and Z2) can change immediately after a state change or an input change. In any case, all outputs will have their correct value during the active edge of the clock.
19.2 Derivation of SM Charts The method used to derive an SM chart for a sequential control circuit is similar to that used to derive the state graph. First, we should draw a block diagram of the sys-tem we are controlling. Next, we should define the required input and output signals to and from the control circuit. Then, we can construct an SM chart that tests the input signals and generates the proper sequence of output signals.
In this section we will give several examples of SM charts. The first example is an SM chart for control of the parallel binary divider, as shown in Figure 18-10. As described in Section 18.3, binary division requires a series of subtract and shift oper-ations. Derivation of an SM chart to generate the proper sequence of subtract and shift signals is very similar to derivation of the state graph of Figure 18-11. For the SM chart of Figure 19-9, S0 is the starting state. In S0, the start signal (St) is tested, FIGURE 19-9 SM Chart for Binary Divider © Cengage Learning 2014 0 1 0 1 0 1 0 0 1 1 0 1 St C C S0/ S2/ S1/ Load Sh Su Sh C S3/ Su Sh C S4/ Su C S5/ Su Sh V 668 Unit 19 and if St = 1, the Load signal is turned on and the next state is S1. In S1, the compare signal (C) is tested. If C = 1, the quotient would be larger than 4 bits, so an overflow signal (V = 1) is generated and the state changes back to S0. If C = 0, Sh becomes 1, so at the next clock the dividend is shifted to the left and the state changes to S2. C is tested again in state S2. If C = 1, subtraction is possible, so Su becomes 1 and no state change occurs. If C = 0, Sh = 1, and the dividend is shifted as the state changes to S3. The action in states S3 and S4 is identical to that in state S2. In state S5 the next state is always S0, and C = 1 causes subtraction to occur.
Next, we will derive the SM chart for the multiplier control of Figure 18-9(a). This control generates the required sequence of add and shift signals for a binary multiplier of the type shown in Figure 18-7. The counter counts the number of shifts and outputs K = 1 just before the last shift occurs. The SM chart for the multiplier control (Figure 19-10) corresponds closely to the state graph of Figure 18-9(c). In state S0, when the start signal St is 1, Load is turned on and the next state is S1. In S1, the multiplier bit M is tested to determine whether to add or shift. If M = 1, an add signal is generated and the next state is S2. If M = 0, no addition is required, so a shift signal is generated and K is tested. If K = 1, the circuit goes to the Done state, S3, at the time of the last shift; otherwise, the next state is S1. In S2 a shift signal is generated because a shift must always follow an add, and K is tested to determine the next state.
As a third example of SM chart construction, we will design an electronic dice game. Figure 19-11 shows the block diagram for the dice game. Two coun-ters are used to simulate the roll of the dice. Each counter counts in the sequence 1, 2, 3, 4, 5, 6, 1, 2, . . . . Thus, after the “roll” of the dice, the sum of the values in the two counters will be in the range 2 through 12.
FIGURE 19-10 SM Chart for Binary Multiplier © Cengage Learning 2014 0 1 0 0 1 0 1 1 St M K S0/ S1/ S3/Done K S2/Sh Load Ad Sh State Machine Design with SM Charts 669 The rules of the game are as follows: 1. After the first roll of the dice, the player wins if the sum is 7 or 11. He loses if the sum is 2, 3, or 12. Otherwise, the sum which he obtained on the first roll is referred to as his point, and he must roll the dice again.
2. On the second or subsequent roll of the dice, he wins if the sum equals his point, and he loses if the sum is 7. Otherwise, he must roll again until he finally wins or loses.
The inputs to the dice game come from two push buttons, Rb (roll button) and Reset. Reset is used to initiate a new game. When the roll button is pushed, the dice counters count at a high speed, so the values cannot be read on the display. When the roll button is released, the values in the two counters are displayed and the game can proceed. Because the button is released at a random time, this simulates a random roll of the dice. If the Win light or Lose light is not on, the player must push the roll button again. We will assume that the push buttons are properly debounced and that the changes in Rb are properly synchronized with the clock. Methods for debouncing and synchronization were discussed previously.
Figure 19-12 shows a flowchart for the dice game. After rolling the dice, the sum is tested. If it is 7 or 11, the player wins; if it is 2, 3, or 12, he loses. Otherwise, the sum is saved in the point register, and the player rolls again. If the new sum equals the point, he wins; if it is 7, he loses. Otherwise, he rolls again. After winning or losing, he must push Reset to begin a new game.
The components for the dice game shown in the block diagram (Figure 19-11) include an adder which adds the two counter outputs, a register to store the point, test logic to determine conditions for win or lose, and a control circuit. The input signals to the control circuit are defined as follows: D7 = 1 if the sum of the dice is 7 D711 = 1 if the sum of the dice is 7 or 11 FIGURE 19-11 Block Diagram for Dice Game © Cengage Learning 2014 Display Win Lose 1-to-6 Counter Point Register Display Comparator 1-to-6 Counter Control Test Logic Adder D2312 Sp Rb Reset Eq Roll Sum D711 D7 Dice Game Module 670 Unit 19 D2312 = 1 if the sum of the dice is 2, 3, or 12 Eq = 1 if the sum of the dice equals the number stored in the point register Rb = 1 when the roll button is pressed Reset = 1 when the reset button is pressed The outputs from the control circuit are defined as follows: Roll = 1 enables the dice counters Sp = 1 causes the sum to be stored in the point register Win = 1 turns on the win light Lose = 1 turns on the lose light FIGURE 19-12 Flowchart for Dice Game © Cengage Learning 2014 Roll Dice Roll Dice Store sum in point register Sum = 7 or 11 Sum = Point Sum = 7 Reset Sum = 2, 3, or 12 Win Reset Lose Y N N Y N Y N N Y N Y Y State Machine Design with SM Charts 671 We can now convert the flowchart for the dice game to an SM chart for the control circuit using the defined control signals. Figure 19-13 shows the resulting SM chart. The control circuit waits in state S0 until the roll button is pressed (Rb = 1). Then, it goes to state S1, and the roll counters are enabled as long as Rb = 1. As soon as the roll button FIGURE 19-13 SM Chart for Dice Game © Cengage Learning 2014 Sp 0 1 1 1 1 0 0 0 0 0 1 1 0 0 0 1 1 0 1 1 Rb Roll Rb D711 D2312 Rb Eq D7 Rb S0/ S1/ Roll S4/ S2/Win S5/ Reset S3/Lose Reset 672 Unit 19 is released (Rb = 0), D711 is tested. If the sum is 7 or 11, the circuit goes to state S2 and turns on the Win light; otherwise, D2312 is tested. If the sum is 2, 3, or 12, it goes to state S3 and turns on the Lose light; otherwise, the signal Sp becomes 1, and the sum is stored in the point register. It then enters S4 and waits for the player to “roll the dice” again. In S5, after the roll button is released, if Eq = 1, the sum equals the point and state S2 is entered to indicate a win. If D7 = 1, the sum is 7 and S3 is entered to indicate a loss. Otherwise, the control returns to S4 so that the player can roll again. When in S2 or S3, the game is reset to S0 when the Reset button is pressed.
Instead of using an SM chart, we could construct an equivalent state graph from the flowchart. Figure 19-14 shows a state graph for the dice game controller. The state graph has the same states, inputs, and outputs as the SM chart. The arcs have been labeled consistently with the rules for proper alphanumeric state graphs given in Section 14.5. Thus, the arcs leaving state S1 are labeled Rb, Rb′D711, Rb′D′ 711D2312, and Rb′D′ 711D′ 2312 . With these labels, only one next state is defined for each combina-tion of input values. Note that the structure of the SM chart automatically defines only one next state for each combination of input values.
FIGURE 19-14 State Graph for Dice Game Controller © Cengage Learning 2014 Rb′ /0 Rb/0 S1 Rb′D′ 711D2312/0 Rb′ Eq′D′ 7/0 Rb′ Eq′ D7/0 Rb′Eq/0 Rb′/0 Rb/0 Rb/Roll Reset′/0 Reset′/0 Reset/0 Reset/0 Rb′D′ 711D′ 2312/Sp Rb′ D711/0 Rb/Roll S0 S2 Win S4 S5 S3 Lose 19.3 Realization of SM Charts The methods used to realize SM charts are similar to the methods used to realize state graphs. As with any sequential circuit, the realization will consist of a combi-national subcircuit together with flip-flops for storing the state of the circuit (see Figure 13-17). In some cases, it may be possible to identify equivalent states in an SM chart and eliminate redundant states using the same method as was used for reducing state tables. However, an SM chart is usually incompletely specified in the State Machine Design with SM Charts 673 sense that all inputs are not tested in every state, which makes the reduction proce-dure more difficult. Even if the number of states in an SM chart can be reduced, it is not always desirable to do so because combining states may make the SM chart more difficult to interpret.
Before deriving next-state and output equations from an SM chart, a state assign-ment must be made. The best way of making the assignment depends on how the SM chart is realized. If gates and flip-flops (or the equivalent PLD realization) are used, the guidelines for state assignment given in Section 15.8 may be useful.
As an example of realizing an SM chart, consider Figure 19-7(b). We have made the state assignment AB = 00 for S0, AB = 01 for S1, and AB = 11 for S2. After a state assignment has been made, output and next-state equations can be read directly from the SM chart. Because the Moore output Za is 1 only in state 00, Za = A′B′. Similarly, Zb = A′ B and Zc = AB. The conditional output Z1 = ABX′ because the only link path through Z1 starts with AB = 11 and takes the X = 0 branch. Similarly, Z2 = ABX. There are three link paths (labeled link 1, link 2, and link 3), which ter-minate in a state that has B = 1. Link 1 starts with a present state AB = 00, takes the X = 1 branch, and terminates on a state in which B = 1. Therefore, the next state of B(B+) equals 1 when A′B′X = 1. Link 2 starts in state 01, takes the X = 1 branch, and ends in state 11, so B+ has a term A′BX. Similarly, B+ has a term ABX from link 3. The next-state equation for B thus has three terms corresponding to the three link paths: B+ = A′B′X link 1 + A′BX link 2 + ABX link 3 Similarly, two link paths terminate in a state with A = 1, so A+ = A′BX + ABX These output and next-state equations can be simplified with a Karnaugh map, using the unused state assignment (AB = 10) as a don’t-care condition.
As illustrated, the next-state equation for a flip-flop Q can be derived from the SM chart as follows: 1. Identify all of the states in which Q = 1.
2. For each of these states, find all of the link paths that lead into the state.
3. For each of these link paths, find a term that is 1 when the link path is followed. That is, for a link path from Si to Sj, the term will be 1 if the machine is in state Si and the conditions for exiting to Sj are satisfied.
4. The expression for Q+ (the next state of Q) is formed by ORing together the terms found in step 3.
Next, we will implement the multiplier control SM chart of Figure 19-10 using a PLA and two D flip-flops connected, as shown in Figure 19-15. The PLA has five inputs and six outputs. We will use a straight binary state assignment (S0 = 00, S1 = 01, etc.). Each row in the PLA table (Table 19-1) corresponds to one of the link paths in the SM chart. Because S0 has two exit paths, the table has two rows for present state S0. Because only St is tested in S0, M and K are don’t-cares as indicated by dashes. The first row corresponds to the St = 0 exit path, so the next state is 00 and all outputs 674 Unit 19 are 0. In the second row, St = 1, so the next state is 01 and the other PLA outputs are 1000. Because St is not tested in states S1, S2, and S3, St is a don’t-care in the corre-sponding rows. The outputs for each row can be filled in by tracing the corresponding link paths on the SM chart. For example, the link path from S1 to S2 passes through conditional output Ad when M = 1, so Ad = 1 in this row. Because S2 has a Moore output Sh, Sh = 1 in both of the rows for which AB = 10.
The SM chart for the dice game controller can be implemented using a PLA and three D flip-flops, as shown in Figure 19-16. The PLA has nine inputs and seven outputs, which are listed at the top of Table 19-2. In state ABC = 000, the next state is A+B+C+ = 000 or 001, depending on the value of Rb. Because state 001 has four exit paths, the PLA table has four corresponding rows. When Rb is 1, Roll is 1 and there is no state change. When Rb = 0 and D711 is 1, the next state is 010. When Rb = 0 and D2312 = 1, the next state is 011. For the link path from state 001 to 100, Rb, D711,and D2312 are all 0, and Sp is a conditional output. This path cor-responds to row 4 of the PLA table, which has Sp = 1 and A+B+C+ = 100. In state 010, the Win signal is always on, and the next state is 010 or 000, depending on the FIGURE 19-15 Realization of Figure 19-10 Using a PLA and Flip-Flops © Cengage Learning 2014 D D Clock Load Sh Ad A+ A B B+ St M K Done PLA TABLE 19-1 PLA Table for Multiplier Control © Cengage Learning 2014 Present State PLA Inputs PLA Outputs A B St M K A+ B+ Load Sh Ad Done S0 0 0 0 --0 0 0 0 0 0 0 0 1 --0 1 1 0 0 0 S1 0 1 -0 0 0 1 0 1 0 0 0 1 -0 1 1 1 0 1 0 0 0 1 -1 -1 0 0 0 1 0 S2 1 0 --0 0 1 0 1 0 0 1 0 --1 1 1 0 1 0 0 S3 1 1 ---0 0 0 0 0 1 State Machine Design with SM Charts 675 value of Reset. Similarly, Lose is always on in state 011. In state 101, A+B+C+ = 010 if Eq = 1; otherwise, A+B+C+ = 011 or 100, depending on the value of D7. States 110 amd 111 are unused, so all inputs and outputs are don’t-cares in these states.
If a ROM is used instead of a PLA, the PLA table must be expanded to 29 = 512 rows. To expand the table, the dashes in each row must be replaced with all possible combinations of 0’s and 1’s. For example, row 5 would be replaced with the following 8 rows: FIGURE 19-16 PLA Realization of Dice Game Controller © Cengage Learning 2014 D Clock A+ B+ Q C+ A B C Eq D2312 D7 D711 Reset Rb Sp Roll Lose Win PLA CK D Q CK D Q CK TABLE 19-2 PLA Table for Dice Game ABC Rb Reset D7 D711 D2312 Eq A+B+C+ Win Lose Roll Sp 1 000 0 – – – – – 000 0 0 0 0 2 000 1 – – – – – 001 0 0 0 0 3 001 1 – – – – – 001 0 0 1 0 4 001 0 – – 0 0 – 100 0 0 0 1 5 001 0 – – 0 1 – 011 0 0 0 0 6 001 0 – – 1 – – 010 0 0 0 0 7 010 – 0 – – – – 010 1 0 0 0 8 010 – 1 – – – – 000 1 0 0 0 9 011 – 1 – – – – 000 0 1 0 0 10 011 – 0 – – – – 011 0 1 0 0 11 100 0 – – – – – 100 0 0 0 0 12 100 1 – – – – – 101 0 0 0 0 13 101 0 – 0 – – 0 100 0 0 0 0 14 101 0 – 1 – – 0 011 0 0 0 0 15 101 0 – – – – 1 010 0 0 0 0 16 101 1 – – – – – 101 0 0 1 0 17 110 – – – – – – ---– – – – 18 111 – – – – – – ---– – – – © Cengage Learning 2014 676 Unit 19 The added entries have been printed in boldface.
The dice game controller can also be realized using a PAL. The required PAL equations can be derived from Table 19-2 using the method of map-entered vari-ables (Section 6.5) or using a CAD program such as LogicAid. Figure 19-17 shows maps for A+, B+, and Win. Because A+, B+, C+, and Rb have assigned values in most of the rows of the table, these four variables are used on the map edges, and the remaining variables are entered within the map. E1, E2, E3, and E4, on the maps represent the expressions given below the maps.
The resulting equations are A+ = A′B′C · Rb′D7 ′11D2 ′312 + AC′ + A · Rb + A · D7 ′Eq′ B+ = A′B′C · Rb′(D711 + D2312) + B · Reset′ + AC · Rb′(Eq + D7) C+ = B′ · Rb + A′B′C · D7 ′11D2312 + BC · Reset′ + AC · D7Eq′ Win = BC′ Lose = BC Roll = B′C · Rb Sp = A′B′C · Rb′D7 ′11D2 ′312 (19-1) These equations can also be derived using LogicAid or another CAD program. The entire dice game, including the control circuit, can be implemented using a small CPLD or FPGA. Implementation using VHDL is described in Section 20.4.
001 0 0 0 0 1 0 0 1 1 0 0 0 0 001 0 0 0 0 1 1 0 1 1 0 0 0 0 001 0 0 1 0 1 0 0 1 1 0 0 0 0 001 0 0 1 0 1 1 0 1 1 0 0 0 0 001 0 1 0 0 1 0 0 1 1 0 0 0 0 001 0 1 0 0 1 1 0 1 1 0 0 0 0 001 0 1 1 0 1 0 0 1 1 0 0 0 0 001 0 1 1 0 1 1 0 1 1 0 0 0 0 FIGURE 19-17 Maps Derived from Table 19-2 R = Reset E3 = D711 + D′ 711D2312 = D711 + D2312 E4 = Eq + Eq′D7 = Eq + D7 X 1 00 01 11 10 X 1 X 1 E1 00 CRb AB 01 11 10 X E2 R′ X 00 01 11 10 R′ X R′ X E3 00 CRb AB 01 11 10 R′ X E4 1 X 00 01 11 10 1 X X 00 CRb AB 01 11 10 A+ B+ E1 = D′ 711D′ 2312 E2 = D′ 7Eq′ Win X © Cengage Learning 2014 State Machine Design with SM Charts 677 This unit has illustrated one way of realizing an SM chart using a PLA or ROM. Alternative procedures are available which make it possible to reduce the size of the PLA or ROM by adding some components to the circuit. These methods are gener-ally based on transformation of the SM chart to different forms and encoding the inputs or outputs of the circuit.
Problems 19.1 Construct an SM block that has three input variables (D, E, F ), four output vari-ables (P, Q, R, S), and two exit paths. For this block, output P is always 1, and Q is 1 iff D = 1. If D and F are 1 or if D and E are 0, R = 1 and exit path 2 is taken. If (D = 0 and E = 1) or (D = 1 and F = 0), S = 1 and exit path 1 is taken.
19.2 Convert the state graph of Figure 13-11 to an SM chart.
19.3 Complete the following timing diagram for the SM chart of Figure 19-10. Assume St = 1.
Sh S0 Ad K M State Clock 19.4 Solve Problem 18.5 using an SM chart instead of a state graph.
19.5 Work through Programmed Exercise 18.1 using an SM chart instead of a state graph.
19.6 Solve Problem 18.6 using an SM chart instead of a state graph.
19.7 (a) For the SM chart of Figure 19-9, make the following state assignment for the flip-flops Q0, Q1, and Q2: S0: 000; S1: 001; S2: 100; S3: 101; S4: 110; S5: 111.
Derive the next-state and output equations by tracing link paths on the SM chart. Simplify the equations and, then, draw the circuit using D flip-flops and NAND gates.
678 Unit 19 (b) Repeat for the SM chart of Figure 19-10, using the following state assignment for flip-flops Q0 and Q1: S0: 00; S1: 01; S2: 11; S3: 10.
19.8 (a) Write the next-state and output equations for the dice game by tracing link paths on the SM chart (Figure 19-13). Use a straight binary assignment.
(b) Design the block labeled “Test Logic” on Figure 19-11.
19.9 Realize the SM chart of Figure 19-7(b) using a PLA and two D flip-flops. Draw the block diagram and give the PLA table.
19.10 For the following SM chart: (a) Draw a timing chart that shows the clock, the state (S0, S1, or S2), the inputs X1 and X2, and the outputs. Assume that X3 = 0 and the input sequence for X1X2 is 01, 00, 10, 11, 01, 10. Assume that all state changes occur on the rising edge of the clock, and the inputs change between clock pulses.
(b) Using a straight binary assignment, derive the next-state and output equa-tions by tracing link paths. Simplify these equations using the don’t-care state (AB = 11) and draw the corresponding circuit.
(c) Realize the chart using a PLA and D flip-flops. Give the PLA table.
(d) If a ROM is used instead of a PLA, what size ROM is required? Give the first five rows of the ROM table.
0 1 0 0 1 1 0 1 0 1 X1 X3 S0/ X1 S2/Z1 S1/Z3 Z2 Z1 X2 X2 Z3 19.11 Construct an SM block that has three input variables (A, B, and C), four outputs (W, X, Y, and Z), and two exit paths. For this block, output Z is always 1, and W is 1 iff A and B are both 1. If C = 1 and A = 0, Y = 1 and exit path 1 is taken. If C = 0 or A = 1, X = 1 and exit path 2 is taken.
State Machine Design with SM Charts 679 19.12 Convert the state graphs of Figures 14-4 and 14-6 to SM charts. Use conditional outputs for Figure 14-4.
19.13 Convert the state graph of Figure 13-15 to an SM chart. Test only one variable in each decision box. Try to minimize the number of decision boxes.
19.14 (a) Construct an SM chart for a Moore sequential circuit with a single input and a single output such that the output is 1 if and only if the input has been 1 for at least three consecutive clock times.
(b) Use a one-hot state assignment for the sequential circuit and derive the next-state and output equations.
(c) Make a state assignment for the sequential circuit using a minimum number of state variables and derive the next-state equation and output equations directly from the equations for the one-hot assignment.
(d) Simplify the next-state equations found in part (c).
19.15 (a) Construct an SM chart for the controller in Problem 18.21.
(b) Implement the controller using two D flip-flops and derive minimum two-level NAND-gate logic for the flip-flop input equations and the output equations. (Assign 00 to the initial state, 01 to the state reachable from the initial state, and 11 to the third state.) (c) Implement the controller using a one-hot state assignment. Again use D flip-flops and two-level NAND-gate logic for the flip-flop input equations and the output equations.
(d) Implement the controller using two D flip-flops with a 2-to-4 decoder connected to the D flip-flops outputs and two-level NAND-gate logic connected to the decoder outputs for the flip-flop input equations and the output equations. (Use the same 00, 01, 11 state assignment.) 19.16 Convert the state graph shown in Figure 18-8 to an SM chart.
19.17 Complete the following timing diagram for the SM chart of Figure 19-9.
Su Sh C St State Clock S0 S1 S2 S2 S3 S3 S4 680 Unit 19 19.18 Realize the SM chart of Figure 19-10 using a PLA and two D flip-flops. Draw the block diagram and give the PLA table. Use the same state assignment as in Problem 19.7(b).
19.19 Work Problem 19.10 for the following SM chart and the input sequence X1X2X3 = 011, 101, 111, 010, 110, 101, 001.
19.20 The circuit below counts the number of 1’s in an input A. Assume A is available when a start signal s becomes 1; A is loaded into a parallel loading shift register. At the same time a value is loaded into an up counter C. After completing the count of 1’s, the controller generates a signal Done until s has returned to 0. (Note that the serial input to R, ai, can be a constant value.) (a) Specify the value to be loaded into C.
(b) Construct an SM chart for the controller.
A s CLK a0 Done Controller Q Ld Up Counter C LC CLK Cnt IncC Cout Q Ld 8-bit Shift Register R LR CLK Sh SR 8 LR SR LC IncC a0 z 8 z Sin Cin ai ai 1 0 1 0 1 0 1 0 1 0 X2 X3 S0/ X1 S2/Z1 S1/Z1 Z2 Z1 X1 X2 Z3 State Machine Design with SM Charts 681 19.21 Redesign the controller of Problem 19.20 so that the circuit counts the number of “1 runs” in A rather than the number of 1’s. A “1 run” is 1 or more consecutive 1’s. For example, 11001011 contains three 1 runs, and 01110100 contains two 1 runs.
(a) Specify the value to be loaded into C.
(b) Construct an SM chart for the controller.
19.22 Modify the circuit of Problem 19.20 so that the zero detect circuit is connected to C rather than R; hence, z = 1 when C contains 0. When s = 1, the circuit computes the 2’s complement of A and stores it in register R.
(a) What is the minimum length of C, and what value must initially be loaded into C?
(b) Construct an SM chart for the controller.
19.23 Make two modifications to the circuit in Problem 19.20. First make R a 9-bit regis-ter; when A is loaded, a 0 is appended to the left end of A. Second, move the zero detect circuit to the output of C, so z becomes 1 when C contains 0. When the circuit completes operation, A is in R with a parity bit appended to the left end so that the 9 bits have odd parity.
(a) How many bits must C be, and what value must be loaded into C?
(b) Construct an SM chart for the controller.
19.24 Make two modifications to the circuit in Problem 19.20. First, move the zero detect circuit to the output of C, so z becomes 1 when C contains 0. Second, add an output ov to the controller. After loading A into R the circuit adds 3 to A leaving the sum in R; if the sum is incorrect and overflows, the controller makes ov = 1.
(a) How many bits must C be, and what value must be loaded into C?
(b) Construct an SM chart for the controller.
19.25 A sequential circuit has an input (s) and two outputs (z1 and z2). When s changes from 0 to 1, the circuit repeats the following pattern 12 times: z1 z2 = 10, 01, i.e., z1 is 1 for one clock period followed by z2 is 1 for one clock period repeated 12 times; otherwise, both z1 and z2 are 0. After the 24 output patterns, the circuit waits until s returns to 0, if it hasn’t already, and then the operation can repeat. The sequential circuit is to be designed in two parts: (1) a four-state controller and (2) a 4-bit parallel loading counter. The counter diagram is shown. When LDN is 0, the parallel inputs are loaded into the counter. When LDN is 1 and CE is 1, the counter increments. When LDN is 1 and CE is 0, the counter does not change state. The output TC is 1 when the counter value is decimal 15.
(a) Construct an SM chart for the controller. You need to specify the signals between the controller and the counter.
(b) Using a one-hot state assignment, write the next-state and output equations for the controller.
682 Unit 19 (c) Make a state assignment for the controller using two state variables. Assign 00 to the initial state and make the other assignments so that only one variable changes during each state change. Derive the next-state and output equations for the controller.
Clk LD LDN 4-Bit Counter CE TC P3 P2 P1 P0 Q3 Q2 Q1 Q0 19.26 Work Problem 18.28, parts (a), (b), and (c), but use an SM chart instead of a state graph. For part (d), design the controller using a minimum number of D flip-flops, a decoder, and NAND gates.
19.27 The following circuit is a multiplier for 8-bit, unsigned (positive) numbers. When the start input (S) changes to 1, the multiplicand and multiplier are available on the input lines, and this signals the controller to begin the multiplication process. Upon com-pletion, the product is available in the lower 8 bits of the 9-bit PU register combined with the 8-bit PL register. Assume S remains 1 until the D signal is generated. Then the circuit holds D and the product until S is returned to 0.
The data path portion of the circuit has the following components: (a) 8-bit A register for holding the multiplicand (b) 8-bit B register for holding the multiplier (c) 9-bit PU register for accumulating the upper part of the product (d) 8-bit PL register for the lower part of the product (e) 8-bit adder with inputs from A reg and 8 bits of PU; sum and carry-out are inputs of PU reg; carry-in is 0 The control section contains a 3-bit counter (C) with an all 1’s detection circuit connected to its outputs. The inputs to the controller are S, the least significant bit of B (B0) and the output of the all 1’s detection circuit (C1). The outputs of the control-ler are D, and all of the control signals for the registers. The control signals for the registers are (a) LA, load A (b) LB, load B (c) SB, shift B right with B0 connected to the shift-in bit (d) CC, clear C (e) IC, increment C (f ) CP, clear PU and PL (g) LPU, load PU (h) SP, shift PU and PL right; the shift-in bit of PU is 0 and the shift-in bit of PL is the least significant bit of PU Construct an SM chart for the controller using a minimum number of states. Do not modify the data path portion of the circuit.
State Machine Design with SM Charts 683 C Counter All 1’s Detect 3 CC IC C1 Controller S D PU Reg (9-Bits) 8 CP LPU PL Reg 8 A Reg 8 CP SP LA Multiplicand Adder 8 B0 co B Register 8 Multiplier LB 8 SP 0 si si si SB ci 0 PU8 19.28 (a) Derive an SM chart for the Ultra-Slow Divider in Problem 18.30.
(b) Realize the SM chart in (a) using a PLA and D flip-flops.
19.29 (a) Derive an SM chart for the elevator controller in Problem 16.29.
(b) Realize the SM chart in (a) using a PLA and D flip-flops.
19.30 Derive an SM chart for the Thunderbird taillight controller in Problem 16.30.
19.31 (a) Derive the SM chart for the tape player controller of Problem 16.31.
(b) Realize the control circuit using a PLA and D flip-flops.
19.32 Convert the state graph of Figure 13-9 to an SM chart.
684 VHDL for Digital System Design U N I T 20 Objectives 1. Given a block diagram and a state graph for a digital system’s control unit of the type discussed in Unit 18, write behavioral VHDL code for the system. Use one clocked process.
2. Compile and simulate the VHDL code you wrote for Objective 1.
3. Write synthesizable VHDL code for the system using control signals. Use two processes, one for the combinational logic and one for updating registers.
4. Compile, simulate, and synthesize the VHDL code you wrote for Objective 3.
5. Write a VHDL test bench to test a VHDL module.
VHDL for Digital System Design 685 Study Guide 1. Study Section 20.1, VHDL Code for a Serial Adder.
(a) In Figure 20-1: Which statements represent the full adder?
Why are concurrent statements used for the full adder instead of a clocked process?
Which VHDL statements are used to shift the X and Y register? Why are these statements in the clocked process?
(b) What change is required in the VHDL code if all register updates occur on the rising edge of the clock instead of the falling edge?
2. Study Section 20.2, VHDL Code for a Binary Multiplier.
(a) In Figure 20-2: Why are Mplier, Mcand, and ACC declared as type std_logic_vector instead of bit_vector?
After what state change does Done change from '1' to '0'?
When adding Mcand to ACC(7 downto 4), why is '0' concatenated to ACC(7 downto 4)? (line 29) What does the notation when 2∣4∣6∣8 mean? (line 34) (b) In Figure 20-3: Why is the initial value of ACC “UUUUUUUUU”?
When should the product be read?
686 Unit 20 (c) If the signal X, of type std_logic_vector(8 downto 0), is “111001101” initially, what is X after the execution of the following for loop? How long does it take?
for i in 5 downto 0 loop X <= X(7 downto 0) & X(8); wait for 10 ns; end loop; (d) In Figure 20-5, on lines 29 and 30, when i = 2 and Done = ‘1’, what are the values of Mcand and Mplier? What is the value of Product if the multiplier is working properly?
(e) In Figure 20-7: Which statement represents the adder?
Why are Load, Ad, Sh, and Done set to '0' (line 22) before the case statement?
Write a single VHDL statement that will clear ACC(8 downto 4) and load ACC(3 downto 0) with Mplier, so that lines 39 and 40 can be replaced with a single line.
Why is addout loaded into ACC in the second process instead of the first process?
In Figure 20-2 we set Done <= '1' in a concurrent statement (line 42), and not after when 9 => on line 37 in the process. Why?
In Figure 20-7 line 33, we set Done <= '1' after when 9 =>, which is unlike what we did in Figure 20-2. Why is this correct in this case?
(f ) In Figure 20-9: When does the statement in line 22 execute?
If Sh = '1', which statements execute following a rising clock edge?
VHDL for Digital System Design 687 If the clock rises at t = 10 ns, at what time are A, B, Count, and State updated? Explain why A and B are shifted as a unit even though the state-ments for updating A and B execute in sequence (line 51).
(g) In Figure 20-10 at time = 60 ns, explain the contents of the registers after the rising clock edge. (Hint: Refer to Figure 18-9(c) to determine what hap-pens in state 2 when K = '0'. Convert hexadecimal to binary and shift the binary before converting back to hexadecimal.) Repeat for time = 140 ns, noting that M = '1' before the rising clock edge.
(h) Read Appendix C, Tips for Writing Synthesizable VHDL Code.
(i) Work Problems 20.1, 20.2, 20.3, and 20.4.
3. Read Section 20.3, VHDL Code for a Binary Divider.
(a) In Figure 20-11: If Dividend(8 downto 4) >= Divisor, what is the value of Subout(4)?
If Dividend(8 downto 4) < Divisor, what is the value of Subout(4)?
Why is C equal to not Subout(4)?
(b) Work Problems 20.5, 20.6, and 20.7 .
4. Read Section 20.4, VHDL Code for a Dice Game Simulator.
Work Problem 20.8.
5. Read Section 20.5, Concluding Remarks.
By looking at the VHDL code for the dice game, determine the minimum num-ber of flip-flops required. Verify this against the value given in Table 20-1.
688 In this chapter, we illustrate the use of VHDL in the design of digital systems. Several of the examples are based on the multiplier and divider designs developed in Unit 18. We will use VHDL to describe a digital system at the behavioral level, so we can simulate the system to check out the algorithms used and to make sure that the sequence of operations is correct. We can then define the required control signals and the actions performed by these signals. Next, we write a VHDL descrip-tion of the system in terms of the control signals and verify its correct operation by simulation. We can then synthesize our design and download it to a CPLD or FPGA for final testing.
20.1 VHDL Code for a Serial Adder First, we will write VHDL code that represents the serial adder with accumulator shown in Figure 18-1. The operation of the adder is explained in Section 18.1. In Figure 18-1, if Sh = 1, the carry from the full adder is stored in the flip-flop at the same time the registers are shifted on the falling edge of the clock.
Figure 20-1 shows VHDL code for the serial adder. Provision for loading the X and Y registers and clearing the carry flip-flop (Ci) is not included in this code; how-ever, the VHDL simulator can be used to initialize X,Y, and Ci for testing the code. The code is based on the state graph for the controller shown in Figure 18-3. We have used two processes to represent the state machine in a manner similar to the state machine model of Figure 17-17 . The first process (lines 18–28) executes whenever state or St changes, and it generates the NextState and Sh signals. The second process (lines 29–38) updates the state after the falling edge of the clock. At the same time, if Sh = '1' the registers are shifted, and the carry is stored in the flip-flop (lines 33–36). The full adder is implemented using concurrent statements for the sum and carry (lines 15–16). This is appropriate because the full adder uses combinational logic that does not require a clock. Because std_logic and std_logic vectors are used in the code, the library and use statements (lines 1 and 2) are required. These statements could be omitted if bits and bit_vectors were used instead.
VHDL for Digital System Design VHDL for Digital System Design 689 1 library IEEE; 2 use IEEE.STD_LOGIC_1164.all; 3 entity serial is 4 Port (St: in std_logic; 5 Clk: in std_logic; 6 Xout: out std_logic_vector(3 downto 0)); 7 end serial; 8 architecture Behavioral of serial is 9 signal X, Y: std_logic_vector(3 downto 0); 10 signal Sh: std_logic; 11 signal Ci, Ciplus: std_logic; 12 signal Sumi: std_logic; 13 signal State, NextState: integer range 0 to 3; -- 4 states 14 begin 15 Sumi <= X(0) xor Y(0) xor Ci; -- full adder 16 Ciplus <= (Ci and X(0)) or (Ci and Y(0)) or (X(0) and Y(0)); 17 Xout <= X; 18 process (State, St) 19 begin 20 case State is 21 when 0 => 22 if St = ‘1’ then Sh <= ‘1’; NextState <= 1; 23 else Sh <= ‘0’; NextState <= 0; end if; 24 when 1 => Sh <= ‘1’; NextState <= 2; 25 when 2 => Sh <= ‘1’; NextState <= 3; 26 when 3 => Sh <= ‘1’; NextState <= 0; 27 end case; 28 end process; 29 process (clk) 30 begin 31 if clk’event and clk = ‘0’ then 32 State <= NextState; -- update state register 33 if Sh = ‘1’ then 34 X <= Sumi & X(3 downto 1); -- shift Sumi into X register 35 Y <= Y (0) & Y(3 downto 1); -- rotate right Y register 36 Ci <= Ciplus; end if; -- store next carry 37 end if; 38 end process; 39 end Behavioral; FIGURE 20-1 VHDL Code for Figure 18-1 © Cengage Learning 2014 690 Unit 20 20.2 VHDL Code for a Binary Multiplier In Section 18.2, we designed a multiplier for unsigned binary numbers. In this section we will show several ways of writing VHDL code to describe the multiplier operation. As indicated in Figure 18-7 , 4 bits from the accumulator (ACC) and 4 bits from the multiplicand register are connected to the adder inputs; the 4 sum bits and the carry output from the adder are connected back to the accumulator. When an add signal (Ad ) occurs, the adder outputs are loaded into the accumulator by the next clock pulse, thus, causing the multiplicand to be added to the accumulator. An extra bit at the left end of the product register temporarily stores any carry which is generated when the multiplicand is added to the accumulator. When a shift signal (Sh) occurs, all 9 bits of ACC are shifted right by the next clock pulse. See Section 18.2 for a more detailed explanation of the multiplier operation.
We will write a behavioral VHDL model for the multiplier (Figure 20-2) based on the block diagram of Figure 18-7 and the state graph of Figure 18-8. This model will allow us to check out the basic design of the multiplier and the multiplication algorithm before proceeding with a more detailed design. Because the control circuit has ten states, we have declared an integer in the range 0 to 9 for the state signal (line 12). The signal ACC represents the 9-bit accumulator output (line 13). -- This is a behavioral model of a multiplier for unsigned binary numbers. It multiplies a 4-bit -- multiplicand by a 4-bit multiplier to give an 8-bit product. The maximum number of clock -- cycles needed for a multiply is 10.
1 library IEEE; 2 use IEEE.STD_LOGIC_1164. ALL; 3 use IEEE.STD_LOGIC_ARITH. ALL; 4 use IEEE.STD_LOGIC_UNSIGNED. ALL; 5 entity mult4X4 is 6 port (Clk, St: in std_logic; 7 Mplier, Mcand : in std_logic_vector(3 downto 0); 8 Done: out std_logic; 9 Product: out std_logic_vector (7 downto 0)); 10 end mult4X4; 11 architecture behave1 of mult4X4 is 12 signal State: integer range 0 to 9; 13 signal ACC: std_logic_vector(8 downto 0); -- accumulator 14 alias M: std_logic is ACC(0); -- M is bit 0 of ACC 15 begin 16 Product <= ACC (7 downto 0); 17 process (Clk) 18 begin 19 if Clk’event and Clk = ‘1’ then -- executes on rising edge of clock FIGURE 20-2 Behavioral VHDL Code for Multiplier of Figure 18-7 © Cengage Learning 2014 VHDL for Digital System Design 691 The signals ACC, Mcand, and Mplier are declared as type std_logic_vector so that the overloaded “+” operator can be used for addition. The statement “alias M: std_logic is ACC(0);” allows us to use the name M in place of ACC(0). The product is set equal to the lower 8 bits of ACC in a concurrent statement (line 16).
Because all register operations and state changes occur on the rising edge of the clock, we will use a process that executes when Clk changes. The case statement specifies the actions to be taken in each state. In state 0, if St = '1' the multiplier is loaded into the accumulator at the same time the state changes to 1 (lines 21–26). From the state graph, we see that the same operations occur in states 1, 3, 5, and 7 . The notation “when 1 | 3 | 5 | 7 =>” means when state is 1 or 3 or 5 or 7 , the state-ments that follow will execute. When M = '1', the expression '0' & ACC(7 downto 4) + Mcand computes the adder output, which is loaded into ACC (lines 28–29). At the same time, the circuit goes to the next state in sequence (2, 4, 6, or 8). If M = '0', ACC is shifted to the right by loading ACC with '0' concatenated with the upper 8 bits of ACC (line 31). At the same time the state changes to 3, 5, 7 , or 9 (the present state + 2). In states 2, 4, 6, or 8 ACC is shifted to the right, and state changes to the next state in sequence (lines 34–36).
The Done signal needs to be turned on only in state 9. If we had used the statement “when 9 => State <= 0; Done <= '1'”, Done would be turned on at the same time the State changed to 0. This is too late because we want Done to turn on when the State 20 case State is 21 when 0 => --initial State 22 if St = ‘1’ then 23 ACC(8 downto 4) <= “00000”; -- clear upper ACC 24 ACC(3 downto 0) <= Mplier; -- load the multiplier 25 State <= 1; 26 end if; 27 when 1 | 3 | 5 | 7 => -- “add/shift” State 28 if M = ‘1’ then -- Add multiplicand to ACC 29 ACC(8 downto 4) <= (‘0’& ACC(7 downto 4)) + Mcand; 30 State <= State + 1; 31 else ACC <= ‘0’ & ACC(8 downto 1); -- Shift accumulator right 32 State <= State + 2; 33 end if; 34 when 2 | 4 | 6 | 8 => -- “shift” State 35 ACC <= ‘0’ & ACC(8 downto 1); -- Right shift 36 State <= State + 1; 37 when 9 => -- end of cycle 38 State <= 0; 39 end case; 40 end if; 41 end process; 42 Done <= ‘1’ when State = 9 else ‘0’; 43 end behave1; FIGURE 20-2 (Continued) 692 Unit 20 becomes 9. Furthermore, if Done <= '1' were included in the clocked process, a synthe-sizer would infer that we wanted to store Done in a flip-flop. Because we do not want to do this, we use a separate concurrent assignment statement. This statement is placed outside the process so that Done will be updated whenever the State changes.
Before continuing with the design, we will test the behavioral level VHDL code to make sure that the algorithm is correct and consistent with the hardware block diagram. At early stages of testing, we will want a step-by-step printout to verify the internal operations of the multiplier and to aid in debugging if required. When we think that the multiplier is functioning properly, we will only want to look at the final product output so that we can quickly test a large number of cases.
Figure 20-3 shows the command file and test results for multiplying 13 × 11. A clock is defined with a 20-ns period. The St signal is turned on at 2 ns and turned off one clock period later. By inspection of the state graph, the multiplication requires at most ten -- command file to test multiplier view list add list Clk St State ACC Done Product force St 1 2, 0 22 force Clk 1 0, 0 10 –repeat 20 force Mcand 1101 force Mplier 1011 run 200 ns delta Clk St State ACC done product 0 +1 1 U 0 UUUUUUUUU 0 UUUUUUUU 2 +0 1 1 0 UUUUUUUUU 0 UUUUUUUU 10 +0 0 1 0 UUUUUUUUU 0 UUUUUUUU 20 +2 1 1 1 0 0 0 0 0 1 0 1 1 0 0 0 0 0 1 0 1 1 22 +0 1 0 1 0 0 0 0 0 1 0 1 1 0 0 0 0 0 1 0 1 1 30 +0 0 0 1 0 0 0 0 0 1 0 1 1 0 0 0 0 0 1 0 1 1 40 +2 1 0 2 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 50 +0 0 0 2 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 1 60 +2 1 0 3 0 0 1 1 0 1 1 0 1 0 0 1 1 0 1 1 0 1 70 +0 0 0 3 0 0 1 1 0 1 1 0 1 0 0 1 1 0 1 1 0 1 80 +2 1 0 4 1 0 0 1 1 1 1 0 1 0 0 0 1 1 1 1 0 1 90 +0 0 0 4 1 0 0 1 1 1 1 0 1 0 0 0 1 1 1 1 0 1 100 +2 1 0 5 0 1 0 0 1 1 1 1 0 0 1 0 0 1 1 1 1 0 110 +0 0 0 5 0 1 0 0 1 1 1 1 0 0 1 0 0 1 1 1 1 0 120 +2 1 0 7 0 0 1 0 0 1 1 1 1 0 0 1 0 0 1 1 1 1 130 +0 0 0 7 0 0 1 0 0 1 1 1 1 0 0 1 0 0 1 1 1 1 140 +2 1 0 8 1 0 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1 1 150 +0 0 0 8 1 0 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1 1 160 +2 1 0 9 0 1 0 0 0 1 1 1 1 1 1 0 0 0 1 1 1 1 170 +0 0 0 9 0 1 0 0 0 1 1 1 1 1 1 0 0 0 1 1 1 1 180 +0 1 0 0 0 1 0 0 0 1 1 1 1 0 1 0 0 0 1 1 1 1 190 +0 0 0 0 0 1 0 0 0 1 1 1 1 0 1 0 0 0 1 1 1 1 200 +0 1 0 0 0 1 0 0 0 1 1 1 1 0 1 0 0 0 1 1 1 1 FIGURE 20-3 Command File and Simulation Results for (13 by 11) © Cengage Learning 2014 VHDL for Digital System Design 693 clocks, so the run time is set at 200 ns. The simulator output corresponds to the example given on page 600. Note that when Done = '1', the final product is 100011112 = 143.
To thoroughly test the multiplier, we need to run additional tests, including spe-cial cases and limiting cases. Test values for the multiplicand and multiplier should include 0, maximum values, and smallest nonzero values. We will write VHDL code to test the multiplier by supplying a sequence of values for the multiplicand and mul-tiplier. VHDL code that is written to test another VHDL module is often referred to as a test bench. Figure 20-4 shows how the test bench is connected to the multiplier module. The test bench generates the Clk and St signals as well as supplying values of Mplier and Mcand to the Multiplier module. The Multiplier module, in turn, sends the Done signal and the Product values back to the test bench. Using the VHDL test bench is analogous to having a hardware tester sitting on a work bench and plugging in the multiplier module into a test socket to test it.
We will use a for loop within the test bench code. The syntax for a VHDL for loop statement is [loop-label:] for index in range loop sequential statements end loop [loop-label]; The index is an integer variable that is defined only within the loop. This variable must not be explicitly declared because it is automatically declared by the compiler. When the loop is entered, the index is initialized to the first value in the range, and the sequential statements in the loop are executed. Then, the index is incremented (or decremented) to the next value, and the statements are executed again. This continues until the index equals the last value in the range, at which point the state-ments are executed for the last time and the loop exits. The for loop statement is a sequential statement that can be used within a process.
The VHDL code listing for the test bench is given in Figure 20-5. The test bench code is intended for simulation purposes only and does not have to be synthesizable. The port declaration has been omitted from the entity (lines 5–6) because we plan to use internal signals to connect the Multiplier to the test bench. The Multiplier module (mult4X4) is declared as a component within the architecture (lines 8–14). The multi-plicand and multiplier test values are placed in constant arrays dimensioned 1 to N (lines 16–18). Because we are using six pairs of values, the constant N is set to 6 (line 15). The internal signals in the test bench are declared in lines 19–22. For convenience, we have used the same signal names as used in the component declaration, although we do not have to do this. At the start of the architecture body, we use a component instantiation statement to connect the Multiplier module to the test bench signals FIGURE 20-4 Test Bench for Multiplier © Cengage Learning 2014 Multiplier Being Tested Product Done Mcand Mplier St Clk Test Bench 694 Unit 20 (line 24). The port map lists the test signals in the same order as in the component port. The next statement generates a Clk signal with a half period of 10 ns.
The process contains a for loop that reads values from the multiplicand and mul-tiplier arrays and then sets the start signal to '1' (lines 29–31). After the next rising clock edge, the start signal is turned off. Meanwhile, the multiplication is taking 1 library IEEE; 2 use IEEE.STD_LOGIC_1164. ALL; 3 use IEEE.STD_LOGIC_ARITH. ALL; 4 use IEEE.STD_LOGIC_UNSIGNED. ALL; 5 entity testmult is 6 end testmult; 7 architecture test1 of testmult is 8 component mult4X4 9 port (Clk: in std_logic; 10 St: in std_logic; 11 Mplier, Mcand: in std_logic_vector(3 downto 0); 12 Product: out std_logic_vector(7 downto 0); 13 Done: out std_logic); 14 end component; 15 constant N: integer:= 6; 16 type arr is array(1 to N) of std_logic_vector(3 downto 0); 17 constant Mcandarr: arr:= (“1011”, “1101”, “0001”, “1000”, “1111”, “1101”); 18 constant Mplierarr: arr:= (“1101”, “1011”, “0001”, “1000”, “1111”,“0000”); 19 signal Clk: std_logic = ‘0’; 20 signal St, Done: std_logic; 21 signal Mplier, Mcand: std_logic_vector(3 downto 0); 22 signal Product: std_logic_vector(7 downto 0); 23 begin 24 mult1: mult4X4 port map(Clk, St, Mplier, Mcand, Product, Done); 25 Clk <= not Clk after 10 ns; -- clock has 20 ns period 26 process 27 begin 28 for i in 1 to N loop 29 Mcand <= Mcandarr(i); 30 Mplier <= Mplierarr(i); 31 St <= ‘1’; 32 wait until Clk = ‘1’ and Clk’event; 33 St <= ‘0’; 34 wait until Done = ‘1’ ; 35 wait until Clk = ‘1’ and Clk’event; 36 end loop; 37 end process; 38 end test1; FIGURE 20-5 Test Bench for Multiplier © Cengage Learning 2014 VHDL for Digital System Design 695 place within the Multiplier module. When the multiplication is complete, the mul-tiplier turns on the Done signal. Done is turned off at the same time the multiplier control goes back to S0. The test bench process waits for Done = '1' and then waits for the next rising clock edge before looping back to read new values of Mcand and Mplier and restart the multiplication. After N times through the loop, the test is complete.
Figure 20-6 shows the command file for executing the test bench code and the simulator output. In the add list command line, “–NOtrigger Mplier Mcand product” together with “–Trigger done” causes the output to be displayed only when the Done signal changes. Without the –NOtrigger and –Trigger, the output would be displayed every time any signal on the list changed. We have annotated the simulator output to interpret the test results.
Next, we will model the same multiplier using two processes (see Figure 20-7). This model is based on Figures 17-16 and 17-17 . The first process represents the -- Command file to test multiplier view list add list –NOtrigger Mplier Mcand product – Trigger done run 1320 ns ns +delta mcand mplier product done 0 +0 U U U U U U U U UUUUUUUU U 0 +1 1 0 1 1 1 1 0 1 UUUUUUUU 0 150 +2 1 0 1 1 1 1 0 1 1 0 0 0 1 1 1 1 1 11 × 13 = 143 170 +2 1 0 1 1 1 1 0 1 1 0 0 0 1 1 1 1 0 330 +2 1 1 0 1 1 0 1 1 1 0 0 0 1 1 1 1 1 13 × 11 = 143 350 +2 1 1 0 1 1 0 1 1 1 0 0 0 1 1 1 1 0 470 +2 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 1 1 1 × 1 = 1 490 +2 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 1 0 610 +2 1 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 1 8 × 8 = 64 630 +2 1 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 810 +2 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 1 1 15 × 15 = 225 830 +2 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 1 0 930 +2 1 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 13 × 0 = 0 FIGURE 20-6 Command File and Simulation of Multiplier © Cengage Learning 2014 FIGURE 20-7 Two-Process VHDL Model for Multiplier © Cengage Learning 2014 -- This is a behavioral model of a multiplier for unsigned binary numbers. It multiplies a 4-bit -- multiplicand by a 4-bit multiplier to give an 8-bit product. The maximum number of clock cycles -- needed for a multiply is 10.
1 library IEEE; 2 use IEEE.STD_LOGIC_1164. all; 3 use IEEE.STD_LOGIC_ARITH. all; 4 use IEEE.STD_LOGIC_UNSIGNED. all; 696 Unit 20 5 entity mult4X4 is 6 port (Clk, St: in std_logic; 7 Mplier, Mcand: in std_logic_vector(3 downto 0); 8 Product: out std_logic_vector(7 downto 0); 9 Done: out std_logic); 10 end mult4X4; 11 architecture control_signals of mult4X4 is 12 signal State, Nextstate: integer range 0 to 9; 13 signal ACC: std_logic_vector(8 downto 0); -- accumulator 14 alias M: std_logic is ACC(0); -- M is bit 0 of ACC 15 signal addout: std_logic_vector(4 downto 0); -- adder output including carry 16 signal Load, Ad, Sh: std_logic; 17 begin 18 Product <= ACC(7 downto 0); 19 addout <= (‘0’ & ACC(7 downto 4)) + Mcand; -- uses “+” operator from the ieee._std_logic_unsigned package 20 process(State, St, M) 21 begin 22 Load <= ‘0’; Ad <= ‘0’; Sh <= ‘0’; Done <= ‘0’; 23 case State is 24 when 0 => 25 if St = ‘1’ then Load <= ‘1’; Nextstate <= 1; 26 else Nextstate <= 0; end if; 27 when 1 | 3 | 5 | 7 => -- “add/shift” State 28 if M = ‘1’ then Ad <= ‘1’; -- Add multiplicand 29 Nextstate <= State + 1; 30 else Sh <= ‘1’; Nextstate <= State + 2; end if; 31 when 2 | 4 | 6 | 8 => -- “shift” State 32 Sh <= ‘1’; Nextstate <= State + 1; 33 when 9 => Done <= ‘1’; Nextstate <= 0; 34 end case; 35 end process; 36 process (Clk) -- Register update process 37 begin 38 if Clk‘event and Clk = ‘1’ then -- executes on rising edge of clock 39 if Load = ‘1’ then ACC(8 downto 4) <= “00000”; 40 ACC(3 downto 0) <= Mplier; end if; -- load the multiplier 41 if Ad = ‘1’ then ACC(8 downto 4) <= addout; end if; 42 if Sh = ‘1’ then ACC <= ‘0’ & ACC(8 downto 1); end if; --Shift accumulator right 43 State <= Nextstate; 44 end if; 45 end process; 46 end control_signals; FIGURE 20-7 (Continued) VHDL for Digital System Design 697 combinational circuit that generates control signals and next-state information. The second process updates all of the registers on the rising edge of the clock. This model corresponds more closely to the actual hardware than the one-process model of Figure 20-2, and the control signals Ld, Sh, and Ad, as well as the adder output, appear explicitly in the code. The port declaration is the same for the two models, but the architectures are different.
Because the adder is a combinational circuit, we can define the adder output in a concurrent statement (line 19). This 5-bit output includes the 4 sum bits and the carry. It is efficient to represent the combinational part of the sequential control cir-cuit by a process with a case statement (lines 20–35). This process executes whenever State, St or M changes, and it computes the values of Nextstate, Load, Sh, Ad, and Done. The four control signals are set to '0' in line 22, and then they are set to '1' as required in the case statement. This technique avoids the necessity of setting these signals to '0' in each state and in each else clause where they are not set to '1'. At first glance, setting a signal to '0' and '1' at the same instant of time appears to be a conflict. However, when two sequential statements in a process both change the same signal at the same time, the value assigned by the second statement to execute overrides the value assigned by the first statement. The case statement determines the values of Nextstate and the control signals. For example, when state is 1, 3, 5, or 7 , if M = '1', the Ad signal is turned on and the Nextstate is the present state plus 1. However, no registers can change until the next active clock edge.
All register updates occur in the second process after the rising edge of Clk. If Load = '1', Mplier is loaded into the lower ACC and the upper ACC is cleared (lines 38–40). If Ad Ad = '1', the adder output is loaded into the upper ACC (line 41). If Sh = '1' ACC is shifted to the right (line 42). The state register is always updated (line 43).
Because the entity is the same for both multipliers, we can use the same test bench to test the second multiplier as we did for the first one, and we should obtain the same test results.
Next, we will write VHDL code for a binary multiplier that multiplies two 8-bit numbers to give a 16-bit product. For the control circuit, we will use an add-shift control with a counter, as shown in Figure 18-9, instead of using a state graph with more states. Figure 20-8 shows the block diagram for the 8 × 8 multiplier. This is of the same form FIGURE 20-8 Block Diagram for 8 × 8 Binary Multiplier © Cengage Learning 2014 Clr Sh Lin A (8:0) A (7:0) A(0) 8-Bit Adder Add-Shift Control Ld Load 0 9 8 8 Multiplicand 8 Multiplier St 8 Sh Ad Clr 0 Sh Lin B (7:0) Ld Sh Load Ad Load Sh K M = B(0) Clr Ct 3-Bit Counter Load Cout 698 Unit 20 as Figure 18-7 except the ACC register has been split into two registers—A and B. A is the 9-bit accumulator register, and B initially holds the 8-bit multiplier. When the multiplication is complete, the 16-bit product is in A(7 downto 0)& B. The controller generates signals Load, Sh, and Ad. The Load signal clears A, loads the multiplier into B, and clears the shift counter. The Sh signal shifts both A and B together and increments the counter. The Ad signal loads the adder outputs into A.
The VHDL code for the 8 × 8 multiplier (Figure 20-9) is based on the block diagram of Figure 20-8 and the state graph of Figure 18-9(c). The entity and sig-nal declarations are similar to those used in the previous examples except for the 1 library IEEE; 2 use IEEE.STD_LOGIC_1164. all; 3 use IEEE.STD_LOGIC_ARITH. all; 4 use IEEE.STD_LOGIC_UNSIGNED. all; 5 entity mult8X8 is 6 Port (Clk, St: in std_logic; 7 Mplier, Mcand: in std_logic_vector(7 downto 0); 8 Done: out std_logic; 9 Product: out std_logic_vector(15 downto 0)); 10 end mult8X8; 11 architecture Behavioral of mult8X8 is 12 signal State, NextState: integer range 0 to 3; 13 signal count: std_logic_vector(2 downto 0) := “000”; -- 3-bit counter 14 signal A: std_logic_vector(8 downto 0); -- accumulator 15 signal B: std_logic_vector(7 downto 0); 16 alias M: std_logic is B(0); -- M is bit 0 of B 17 signal addout: std_logic_vector(8 downto 0); 18 signal K, Load, Ad, Sh: std_logic; 19 begin 20 Product <= A(7 downto 0) & B; -- 16-bit product is in A and B 21 addout <= ‘0’ & A(7 downto 0) + Mcand; -- adder output is 9 bits including carry 22 K <= ‘1’ when count = 7 else ‘0’; 23 process (St, State, K, M) 24 begin 25 Load <= ‘0’; Sh <= ‘0’; Ad <= ‘0’; Done <= ‘0’; -- control signals are ‘0’ by default 26 case State is 27 when 0 => 28 if St = ‘1’ then Load <= ‘1’; NextState <= 1; 29 else NextState <= 0; end if; 30 when 1 => 31 if M = ‘1’ then Ad <= ‘1’; NextState <= 2; 32 else if K = ‘0’ then Sh <= ‘1’; NextState <= 1; 33 else Sh <= ‘1’; NextState <= 3; end if; FIGURE 20-9 VHDL Code for Multiplier with Shift Counter © Cengage Learning 2014 VHDL for Digital System Design 699 number of bits. The signal count in line 13 represents the 3-bit counter. Line 21 implements the 8-bit adder using a concurrent statement, and line 22 sets K to 1 when the count is 7 . The first process (lines 23–40) represents the combinational part of the state machine. It generates control signals Ad, Load, and Sh whenever the inputs state, St, M, and K change.
To make sure that the code will synthesize properly, we have included an else clause in each if statement so that the NextState is properly defined, regardless whether the condition is TRUE or FALSE. For example, in lines 28–29 NextState is 1 or 0 depending on the value of St. For simulation purposes, we could omit the else clause because a VHDL signal holds its value until it is explicitly changed. However, if we omitted the else clause, most synthesizers would generate an unnecessary latch.
The second process updates the registers on the rising edge of Clk. In lines 45–48, if Load = '1', the counter is cleared when the multiplier is loaded. In lines 50–53, if Sh = '1', the counter is incremented when the A-B registers are shifted. In a clocked process, the if statements do not need else clauses because all registers hold their current values until changed.
34 end if; 35 when 2 => 36 if K = ‘0’ then Sh <= ‘1’; NextState <= 1; 37 else Sh <= ‘1’; NextState <= 3; end if; 38 when 3 => 39 Done <= ‘1’; NextState <= 0; 40 end case; 41 end process; 42 process (Clk) 43 begin 44 if Clk’event and Clk = ‘1’ then -- update registers on rising edge of Clk 45 if Load = ‘1’ then 46 A <= “000000000”; Count <= “000”; -- clear A and counter 47 B <= Mplier; 48 end if; -- load multiplier 49 if Ad = ‘1’ then A <= addout; end if; 50 if Sh = ‘1’ then 51 A <= ‘0’ & A(8 downto 1); B <= A(0)& B(7 downto 1); -- right shift A and B 52 count <= count + 1; -- increment counter 53 -- uses “+” operator from ieee_std_logic_unsigned package 54 end if; 55 State <= NextState; 56 end if; 57 end process; 58 end Behavioral; FIGURE 20-9 (Continued) 700 Unit 20 Figure 20-10 shows a simulator command file used to test the multiplier with inputs 11 × 13. The A and B register values and the product are shown in hexadeci-mal on the resulting waveforms. The current multiplier bit (M) is the same as b(0). Note that at time = 240 ns, the state changes to 3, the Done signal is turned on, and the final product is the correct answer, 8F16 = 14310.
20.3 VHDL Code for a Binary Divider In Section 18.3 we designed a parallel divider for positive binary numbers that divides an 8-bit dividend by a 4-bit divisor to obtain a 4-bit quotient. Figure 20-11 shows VHDL code for the divider based on the block diagram of Figure 18-10 and FIGURE 20-10 Command File and Simulation of 8 × 8 Multiplier © Cengage Learning 2014 0 50 ns 100 ns 150 ns 200 ns 250 ns /mult8x8/product XXXX 000D 0586 02C3 0DC3 06E1 08F0 0478 023C 011E 000 001 010 011 100 101 110 111 0 1 2 1 2 1 2 1 3 XXX 000 005 002 00D 006 008 004 002 001 XX 0D 86 C3 E1 F0 78 3C 1E 8F /mult8x8/done /mult8x8/b /mult8x8/a /mult8x8/count /mult8x8/state /mult8x8/b(0) /mult8x8/st /mult8x8/clk 00B 011 11E1 0B0D 008F 000 000 add wave clk st state count a b done product force st 1 2, 0 22 force clk 1 0, 0 10 –repeat 20 force mcand 00001011 force mplier 00001101 run 280 FIGURE 20-11 VHDL Code for Divider © Cengage Learning 2014 1 library IEEE; 2 use IEEE.STD_LOGIC_1164. all; 3 use IEEE.STD_LOGIC_ARITH. all; 4 use IEEE.STD_LOGIC_UNSIGNED. all; 5 entity Divider is 6 Port (Dividend_in: in std_logic_vector(7 downto 0); 7 Divisor: in std_logic_vector(3 downto 0); VHDL for Digital System Design 701 8 St, Clk: in std_logic; 9 Quotient: out std_logic_vector(3 downto 0); 10 Remainder: out std_logic_vector(3 downto 0); 11 Overflow: out std_logic); 12 end Divider; 13 architecture Behavioral of Divider is 14 signal State, NextState: integer range 0 to 5; 15 signal C, Load, Su, Sh: std_logic; 16 signal Subout: std_logic_vector(4 downto 0); 17 signal Dividend: std_logic_vector(8 downto 0); 18 begin 19 Subout <= Dividend(8 downto 4) – (‘0’ & divisor); 20 C <= not Subout (4); 21 Remainder <= Dividend(7 downto 4); 22 Quotient <= Dividend(3 downto 0); 23 State_Graph: process (State, St, C) 24 begin 25 Load <= ‘0’; Overflow <= ‘0’; Sh <= ‘0’; Su <= ‘0’; 26 case State is 27 when 0 => 28 if (St = ‘1’) then Load <= ‘1’; NextState <= 1; 29 else NextState <= 0; end if; 30 when 1 => 31 if (C = ‘1’) then Overflow <= ‘1’; NextState <= 0; 32 else Sh <= ‘1’; NextState <= 2; end if; 33 when 2 | 3 | 4 => 34 if (C = ‘1’) then Su <= ‘1’; NextState <= State; 35 else Sh <= ‘1’; NextState <= State + 1; end if; 36 when 5 => 37 if (C = ‘1’) then Su <= ‘1’; end if; 38 NextState <= 0; 39 end case; 40 end process State_Graph; 41 Update: process (Clk) 42 begin 43 if Clk’event and Clk = ‘1’ then -- rising edge of Clk 44 State <= NextState; 45 if Load = ‘1’ then Dividend <= ‘0’ & Dividend_in; end if; 46 if Su = ‘1’ then Dividend(8 downto 4) <= Subout; Dividend(0) <= ‘1’; end if; 47 if Sh = ‘1’ then Dividend <= Dividend(7 downto 0) & ‘0’; end if; 48 end if; 49 end process update; 50 end Behavioral; FIGURE 20-11 (Continued) 702 Unit 20 the state graph of Figure 18-11. A concurrent statement (line 19) computes the sub-tracter output, subout, using an overloaded “−”operator. Then, line 20 computes C as the complement of the high order bit of the subtracter output (see Section 18.3 for justification).
The first process (lines 23–40) represents the combinational part of the sequen-tial circuit. It computes the values of NextState and the control signals whenever state, St, or C changes. As in the other examples, line 24 sets the control signals to '0', and these signals are set to '1' as required within the case statement. The second process (lines 41–49) updates the state and dividend registers on the rising edge of the clock. If Ld = '1', the 9-bit dividend register is loaded with '0' followed by the 8-bit dividend (line 45). If Su = '1', the subtracter output is loaded into the upper part of the dividend register and the quotient bit is set to '1' (line 46). If Sh = '1', the dividend register is shifted left (line 47).
20.4 VHDL Code for a Dice Game Simulator In this section we will write behavioral VHDL code for the dice game described in Section 19.2. The code in Figure 20-12 is based on the block diagram for the DiceGame Module in Figure 19-11 and the SM chart of Figure 19-13. The two coun-ters and the adder will be placed in a separate module, so the input to this module is the sum of the two counters, which represents the roll of the dice. This sum must be in the range 2 to 12 as declared in line 3. The Point register is a signal with the same range (line 8). We will use a two-process model for the dice game. The first process represents the combinational logic for the controller. Whenever the inputs Rb, Reset, Sum, or State change, this process computes new values for NextState, for the control signals (Sp and Roll), and for the outputs (Win and Lose). The case statement tests the state, and in each state nested if-then-else (or elsif) statements implement the conditional tests. In State 1 the Roll signal is turned on when Rb is 1. If all conditions test FALSE, Sp is set to 1, and the next state is 4. In the second process, the state is updated after the rising edge of the clock (line 38), and if Sp is 1, the sum is stored in the point register (line 39).
FIGURE 20-12 VHDL Code for Dice Game Controller © Cengage Learning 2014 1 entity DiceGame is 2 port (Rb, Reset, Clk: in bit; 3 Sum: in integer range 2 to 12; 4 Roll, Win, Lose: out bit); 5 end DiceGame; 6 architecture DiceBehave of DiceGame is 7 signal State, NextState: integer range 0 to 5; 8 signal Point: integer range 2 to 12; 9 signal Sp: bit; 10 begin VHDL for Digital System Design 703 To complete the VHDL implementation of the dice game we will add a module with two counters, which count from 1 to 6, and an adder as shown in Figure 20-13. The counters are initialized to 1 so that the sum of the two dice will always be in the range 2 through 12. When Cnt1 is in state 6, the next clock sets it to state 1, and Cnt2 is incremented (or Cnt2 is set to 1 if it is in state 6). The concurrent statement in line 19 implements the adder.
The main module shown in Figure 20-14 connects the DiceGame and Coun-ter modules together. The architecture starts with two component declarations (lines 6–14). The internal signals that connect the two modules, roll1 and sum1, are declared in lines 15 and 16. The two components are instantiated in lines 18 and 19. These statements connect the two components to each other and to the port signals.
11 process(Rb, Reset, Sum, State) 12 begin 13 Sp <= ‘0’; Roll <= ‘0’; Win <= ‘0’; Lose <= ‘0’; 14 case State is 15 when 0 => if Rb = ‘1’ then NextState <= 1; else NextState <= 0; end if; 16 when 1 => 17 if Rb = ‘1’ then Roll <= ‘1’; NextState <= 1; 18 elsif Sum = 7 or Sum = 11 then NextState <= 2; 19 elsif Sum = 2 or Sum = 3 or Sum = 12 then NextState <= 3; 20 else Sp <= ‘1’; NextState <= 4; 21 end if; 22 when 2 => Win <= ‘1’; 23 if Reset = ‘1’ then NextState <= 0; else NextState <= 2; end if; 24 when 3 => Lose <= ‘1’; 25 if Reset = ‘1’ then NextState <= 0; else NextState <= 3; end if; 26 when 4 => if Rb = ‘1’ then NextState <= 5; else NextState <= 4; end if; 27 when 5 => 28 if Rb = ‘1’ then Roll <= ‘1’; NextState <= 5; 29 elsif Sum = Point then NextState <= 2; 30 elsif Sum = 7 then NextState <= 3; 31 else NextState <= 4; 32 end if; 33 end case; 34 end process; 35 process(Clk) 36 begin 37 if Clk’ event and Clk = ‘1’ then 38 State <= NextState; 39 if Sp = ‘1’ then Point <= Sum; end if; 40 end if; 41 end process; 42 end DiceBehave; FIGURE 20-12 (Continued) 704 Unit 20 1 entity Counter is 2 port(Clk, Roll: in bit; 3 Sum: out integer range 2 to 12); 4 end Counter; 5 architecture Count of Counter is 6 signal Cnt1,Cnt2: integer range 1 to 6 := 1; 7 begin 8 process (Clk) 9 begin 10 if Clk’event and Clk = ‘1’ then 11 if Roll = ‘1’ then 12 if Cnt1 = 6 then Cnt1 <= 1; else Cnt1 <= Cnt1 + 1; end if; 13 if Cnt1 = 6 then 14 if Cnt2 = 6 then Cnt2 <= 1; else Cnt2 <= Cnt2 + 1; end if; 15 end if; 16 end if; 17 end if; 18 end process; 19 Sum <= Cnt1 + Cnt2; 20 end Count; FIGURE 20-13 Counter Module for Dice Game © Cengage Learning 2014 1 entity Game is 2 port (Rb, Reset, Clk: in bit; 3 Win, Lose: out bit); 4 end Game; 5 architecture Play1 of Game is 6 component Counter 7 port(Clk, Roll: in bit; 8 Sum: out integer range 2 to 12); 9 end component; 10 component DiceGame 11 port (Rb, Reset, Clk: in bit; 12 Sum: in integer range 2 to 12; 13 Roll, Win, Lose: out bit); 14 end component; 15 signal roll1: bit; 16 signal sum1: integer range 2 to 12; 17 begin 18 Dice: Dicegame port map(Rb, Reset, Clk, sum1, roll1, Win, Lose); 19 Count: Counter port map(Clk, roll1, sum1); 20 end Play1; FIGURE 20-14 Main Module for Dice Game © Cengage Learning 2014 VHDL for Digital System Design 705 20.5 Concluding Remarks Except for the test bench, all of the VHDL code in this chapter is synthesizable. The synthesis results depend on the target device and synthesizer that is used. Most synthesizers offer the choices of optimizing for area, for speed, or for something in between. Optimizing for area implies fewer macrocells or function generators are used, resulting in a smaller area used on the IC chip. Optimizing for speed means reducing the delay times along the various paths so that a higher clock speed may be used. This often results in using more components and a larger chip area.
Table 20-1 shows some typical synthesis results for five VHDL code examples from this chapter when the optimize for area option was chosen. Results shown here are for Xilinx CoolRunner CPLDs and for the Xilinx Spartan and Spartan II FPGAs. The Xilinx XST synthesizer was used for CoolRunner, and the FPGA Express synthesizer was used for Spartan. In all cases, the number of flip-flops is minimum and the same for the different devices. For CPLDs, the most important factors in determining the required chip area are the number of macrocells and the number of product terms, and the optimizer attempts to minimize these. For FPGAs, the optimizer attempts to reduce chip area by minimizing the required number of logic cells (CLBs, or slices). Each CLB or slice contains two four-input function gen-erators (also called lookup tables or LUTs) and two flip-flops. Most designs require more function generators than flip-flops, so a key factor in optimizing for area is to reduce the number of four-input function generators (LUTs).
In this text we have introduced the basic VHDL features needed to write syn-thesizable code. In most examples, we have related the VHDL code to the actual hardware that it represents. In Unit 10, we used concurrent statements to represent combinational logic. In Unit 17 , we used sequential statements in a process to rep-resent sequential logic and also to represent combinational logic. In this chapter we wrote VHDL code to describe small synchronous digital systems based on their block diagrams and state graphs.
In the example of Figure 20-2, we wrote a behavioral model for a multiplier using a single process to update the state and the registers on the rising clock edge. When a single process is used, it is often necessary to add concurrent statements for the combinational outputs (the Done signal, for example) to assure proper timing. The two-process model, used in the example of Figure 20-7 , is closer to the actual TABLE 20-1 Synthesis Results (Optimized for Area) Device Multiplier Fig. 20-2 Multiplier Fig. 20-7 Multiplier Fig. 20-9 Divider Fig. 20-11 Dice Game Fig. 20-12 + Flip-Flops 13 13 22 12 13 CoolRunner Macrocells 18 19 32 18 24 CPLD Product terms 63 61 108 70 72 Spartan 4-Input LUTs 38 32 36 23 31 FPGA CLBs 20 18 19 14 16 Spartan II 4-Input LUTs 30 30 35 30 30 FPGA Slices 16 15 19 16 19 © Cengage Learning 2014 706 Unit 20 hardware in that it explicitly generates control signals in a combinational process and then uses these signals to control register updates in a clocked process. We gen-erally prefer the two-process model because it introduces fewer timing problems. This is particularly important in large systems where the operation of a number of modules must be properly coordinated.
When writing VHDL code for synthesis, you must constantly keep in mind that you are designing hardware, not simply writing a computer program. Every VHDL statement that you write implies certain hardware. Poorly written VHDL code may result in excessive amounts of hardware when synthesized, and the hardware may malfunction because of timing problems. Simulation plays an important role in digi-tal design using VHDL. Functional simulation before synthesis is important to make sure that the hardware performs the intended functions and that the basic design is sound. However, just because the code simulates correctly does not mean that the code will synthesize and implement correctly. Review of the reports generated by the synthesizer may reveal problems such as generation of unintended latches. After the code is implemented, a timing simulation of the actual hardware is desirable. This type of simulation may reveal timing problems in the design, and it will help to determine the maximum clock speed. Debugging using a simulator is generally much easier than using the actual hardware because the internal signals within the hardware are generally not available for observation.
Appendix B summarizes the syntax for all VHDL statements used in the text. VHDL has many other features that are not discussed in this text. VHDL variables, as distinguished from signals, have not been introduced because VHDL code using variables may have timing problems when synthesized. Other useful features of VHDL include procedures, functions, attributes, generics, and generate. These fea-tures are described in references , , , , and .
Problems 20.1 In Figure 20-7 , if St changes from '0' to '1' at time 2 ns, and a rising edge of Clk occurs at 10 ns, in what sequence do the VHDL statements execute? (Hint: The first process executes more than one time.) 20.2 Write VHDL code for the 16-bit 2’s complementer described in Programmed Exercise 18.1. Use two processes.
20.3 Modify the VHDL code of Figure 20-7 to implement the multiplier of Problem 18.5. You may refer to the answer to Problem 18.5 for the state graph of the control unit.
20.4 Write a test bench to test the BCD-to-excess-3 code converter of Table 17-2. Test all 10 BCD digits in order, using an input stream consisting of a single constant vec-tor (which should begin “000010000100 . . .”). Note that the order of bits is least VHDL for Digital System Design 707 significant bit first, as in Section 16.2. (Table 16-3 is the same as Table 17-2, but with the states named dif ferently.) Define an expected output vector (“110000101010 . . .”). Set an error flag to '1' if the actual output does not match the expected output.
20.5 For the following VHDL code, draw a block diagram of the corresponding hardware and a state graph for the controller. If MplierData is 0101 and McandData is 1001 at the first clock edge when Start is 1, how many clock cycles will it take for Done to become 1, and what will the value of Product be when Done becomes 1? library IEEE; use IEEE.STD_LOGIC_1164.ALL; use IEEE.STD_LOGIC_ARITH.ALL; use IEEE.STD_LOGIC_UNSIGNED.ALL; entity olorin is Port ( Clk, Start: in std_logic; McandData, MplierData: in std_logic_vector(3 downto 0); Done: out std_logic; Product: out std_logic_vector(7 downto 0)); end olorin; architecture Behavioral of olorin is signal Init, K, Add: std_logic; signal Sum, Accumulator: std_logic_vector(7 downto 0); signal Mcand, Mplier: std_logic_vector(3 downto 0); signal State, NextState: integer range 0 to 2; begin Sum <= Accumulator + Mcand; K <= not Mplier(3) and not Mplier(2) and not Mplier(1) and not Mplier(0); Product <= Accumulator; process(State, Start, K) begin Init <= ‘0’; Add <= ‘0’; Done <= ‘0’; case state is when 0 => if Start = ‘1’ then Init <= ‘1’; NextState <= 1; else NextState <= 0; end if; when 1 => if K = ‘1’ then Done <= ‘1’; NextState <= 2; else Add <= ‘1’; NextState <= 1; end if; when 2 => if Start = ‘1’ then Done <= ‘1’; NextState <= 2; else NextState <= 0; end if; end case; end process; 708 Unit 20 20.6 A digital system consists of three registers and two adders, as shown in the follow-ing figure. An input bus is used to load the registers in sequence A, B, and C. The sum of A, B, and C is then loaded into A. Write VHDL code that describes the system. Process(Clk) begin if Clk’event and Clk = ‘1’ then State <= NextState; If Init = ‘1’ then Mcand <= McandData; Mplier <= MplierData; Accumulator <= “00000000“; end if; If Add = ‘1’ then Accumulator <= Sum; Mplier <= Mplier – 1; end if; end if; end process; end Behavioral; C (7:0) Adder CK CK 8 9 8 8 LdC B (7:0) Adder Control Circuit CK 8 8 LdB A (9:0) A (7:0) LdA LdB St LdC Ad Z (9:0) (Output) X (7:0) (Input) CK 0 0 10 10 10 LdA Ad 0 1 –/Ad LdA –/LdC –/LdB St/LdA St'/0 S1 S0 S3 S2 20.7 Modify the VHDL code of Figure 20-11 to use a counter as in Figure 20-9. You may refer to the answer to Problem 18.6 for the state graph for the control unit.
20.8 Write a test bench for the DiceGame controller of Figure 20-12. Use the following test sequence for sum: 7 , 11, 2, 4, 7 , 5, 6, 7 , 6, 8, 9, 6.
20.9 Modify the VHDL code of Figure 20-11 to implement the divider of Problem 18.7 .
VHDL for Digital System Design 709 20.10 Consider the multiplier of Problem 18.28.
(a) Write VHDL code that describes the multiplier.
(b) Write a test bench that tests the code of part (a). The test cases should include at least the following: zero multiplier, maximum multiplier and maximum multipli-cand, and maximum multiplier and zero multiplicand.
20.11 Repeat Problem 20.10 for the multiplier of Problem 18.29. In addition to the test cases listed in Problem 20.10, the test cases should include combinations of maxi-mum and minimum (signed) values of the multiplicand and multiplier.
Lab Design Problems Each of these problems is designed to fit on a small CPLD or FPGA circuit board that has at least eight input switches, two pushbuttons, and eight LEDs. Carry out the following steps for your assigned digital system design problem: 1. Draw a block diagram of the system showing registers, adders, MUXes, and other components. Define the necessary control signals. Specify the sizes of registers, adders, etc. Provide an active-high asynchronous reset for your design.
2. Draw a state graph for the control circuit.
3. Based on the results of steps 1 and 2, write a behavioral VHDL description of the system. Use one clocked process to update the state and the registers as in Figure 20-2. Compile and simulate your code.
4. Based on the results of steps 1 and 2, write a VHDL description of the system using control signals and two processes as in Figure 20-7 . Use one combinational process to generate the next-state and control signals. Use a clocked process to update the state and other registers. Compile and simulate your code.
5. Synthesize your VHDL code from step 4, download it to a CPLD or FPGA board, test it, and then demonstrate its operation.
20.A Design a divider for unsigned binary numbers that will divide a 7-bit dividend by a 4-bit divisor to give a 3-bit quotient. Assume that the start signal (St) is 1 for exactly one clock time. When St = 1, the dividend register should be loaded from the input bus. On the next clock cycle, the divisor register should be loaded from the same input bus. Then, if the quotient would require more than 3 bits, an overflow would occur, so V should be set to 1, and the controller should go back to the reset state. Otherwise, the controller should generate the appropriate sequence of shift and sub-tract signals and turn on a done signal when division is complete. Use an 8-bit divi-dend register and store the quotient in the lower 3 bits of the register.
20.B Same as 20.A, except use a 3-bit divisor and a 4-bit quotient. (An overflow would occur if the quotient would require more than 4 bits.) 20.C Same as 20.A, except use an 8-bit dividend, a 3-bit divisor, a 5-bit quotient, and a 9-bit dividend register. (An overflow would occur if the quotient would require more than 5 bits.) 710 Unit 20 20.D Same as 20.A, except use an 8-bit dividend, a 5-bit divisor, a 3-bit quotient, and a 9-bit dividend register. (An overflow would occur if the quotient would require more than 3 bits.) 20.E Design a multiplier for unsigned binary numbers that will multiply a 3-bit multi-plicand by a 4-bit multiplier to give a 7-bit product. Assume that the start signal (St) is 1 for exactly one clock time. When St = 1, the multiplier register should be loaded. After loading the multiplier, load the multiplicand into a separate register on the next clock, and then proceed with the multiplication. Both the multiplier and multiplicand should come from the same input bus. Inputs to this bus should come from switches on the FPGA board. Use an 8-bit accumulator register. The control-ler should generate the appropriate sequence of add and shift signals and turn on a done signal when multiplication is complete.
20.F Same as 20.E except use a 4-bit multiplicand, a 3-bit multiplier, and a 7-bit product.
20.G Same as 20.E except use a 5-bit multiplicand, a 3-bit multiplier, an 8-bit product, and a 9-bit accumulator.
20.H Same as 20.E except use a 3-bit multiplicand, a 5-bit multiplier, an 8-bit product, and a 9-bit accumulator.
20.I Design an 8-bit serial adder with accumulator for signed binary numbers similar to Figure 18-1, except provide for loading the registers and clearing the carry flip-flop. Represent signed negative numbers in 2’s complement. Assume that the start signal (St) is 1 for exactly one clock time. When St = 1, the accumulator register should be parallel loaded from a bus. Then, at the next clock the addend register should be loaded from the same bus. When addition is completed, output a Done signal for one clock time. Output an overflow signal if a 2’s complement overflow occurs. Design the control circuit using a 3-bit counter and a state graph with four states.
20.J Same as 20.I except change 8-bit to 7-bit.
20.K Same as 20.I except design a serial subtracter instead of an adder.
20.L Same as 20.I except design a serial subtracter instead of an adder and change 8-bit to 7-bit.
20.M Design a divider for unsigned binary numbers that divides a 16-bit dividend by an 8-bit divisor to give an 8-bit quotient. Use a 17-bit dividend register and store the quotient in the lower 8 bits of the register. Also, use a 4-bit counter to count the number of shifts, together with a subtract-shift controller.
The following instructions only apply to 20. N, 20.O, 20.P and 20.Q: 1. Use an active-high asynchronous reset to reset the circuit at any time.
2. When you press start and then clock the circuit, the multiplicand should be loaded in some internal register.
VHDL for Digital System Design 711 3. On the next clock cycle, the multiplier should be loaded into another inter-nal register.
4. Note that both the multiplicand and the multiplier should be loaded from the same 8 switches on the board. Use the least significant bits of the 8 switches to enter the multiplicand and the multiplier.
5. Once they are loaded, the circuit should cycle through the states until the final answer is calculated.
6. Once the product is calculated, the state should not change, and a done sig-nal should be set to high (and remain high).
20.N Design a multiplier for unsigned binary numbers that will multiply a 6-bit multipli-cand by a 7-bit multiplier to give a 13-bit result. Assume that the start signal (St) is 1 for exactly one clock time. When St = 1, the multiplier and multiplicand should be loaded in sequence. Use a 14-bit accumulator. The controller should generate the appropriate sequence of add and shift signals.
20.O Work Problem 20.N except use a 7-bit multiplicand and a 6-bit multiplier.
20.P Work Problem 20.N except use a 8-bit multiplicand and a 5-bit multiplier.
20.Q Work Problem 20.N except use a 5-bit multiplicand and a 8-bit multiplier.
20.R Design a divider for unsigned binary numbers that will divide a 6-bit dividend by a 4-bit divisor to give a 6-bit quotient. An asynchronous reset must be used to reset the circuit. Assume that the start signal (St) is 1 for exactly one clock cycle time. When St = 1, the dividend should be loaded from the input bus. On the next clock cycle the divisor should be loaded from the same input bus. Then if the divisor is 0, an overflow will occur, the V signal should be set and the controller should go back to the reset state. Otherwise, the controller should generate the appropriate sequence of shift and subtract signals and then turn on a done signal. Use an 11-bit dividend register and store the quotient in the lower bits. You may consult Problem 18.7 as a reference. You need to show only the quotient on the FPGA LEDs.
20.S Work Problem 20.R except use a 7-bit dividend and a 3-bit divisor to give a 7-bit quotient.
20.T Design an arithmetic unit that computes W = XY + Z, where X, Y and Z are all 4-bit unsigned numbers. X, Y and Z should be read sequentially from the same input bus. Assume that the start signal (St) is 1 exactly for one clock cycle. When St is '1', in the first clock cycle, the Multiplier (X ) should be loaded from the bus. In the second clock cycle, the Multiplicand (Y ) should be loaded from the same bus. Finally, in the third clock cycle, Z (the term to be added) should be loaded. Then the state machine should multiply X by Y. Use a 9-bit accumulator, and design the multiplier without using a counter. Use the overloaded addition operator to add. Use a second adder to add Z to XY and store the result in the accumulator using a fourth load signal.
712 Unit 20 20.U Same as Problem 20.T, except that X is a 5-bit number, Y is a 3-bit number, and Z is a 5-bit number. Use a 9-bit accumulator.
20.V Same as Problem 20.T, except that X is a 3-bit number, Y is a 5-bit number, and Z is a 5-bit number. Use a 9-bit accumulator.
20.W Same as Problem 20.T, except that X is a 6-bit number, Y is a 2-bit number, and Z is a 6-bit number. Use a 9-bit accumulator.
713 MOS and CMOS Logic APPENDIX A Most integrated circuits designed today use MOS or CMOS logic. MOS logic is based on the use of MOSFETs (metal-oxide-semiconductor field-effect transistors) as switching elements. Figure A-1 shows the symbols used to represent MOSFETs. The substrate (or body) is a thin slice of silicon. The gate is a thin metallic layer deposited on the substrate and insulated from it by a thin layer of silicon dioxide. A voltage applied to the gate is used to control the flow of current between the drain and source.
In normal operation of an n-channel MOSFET, shown in Figure A-1(a), a positive voltage (VDS) is applied between the drain and source. If the gate voltage (VGS) is 0, there is no channel between the drain and source and no current flows. When VGS is positive and exceeds a certain threshold, an n-type channel is formed between the drain and source, which allows current to flow from D to S. Operation of a p-channel MOSFET is similar, except VDS and VGS are negative. When VGS assumes a negative value less than the threshold, a p-type channel is formed between drain and source, which allows current to flow from S to D.
The symbol in Figure A-1(c) may be used to represent either a p- or n-channel MOSFET. When this symbol is used, it is generally understood that the substrate is connected to the most positive circuit voltage for p-channel MOSFETs (or the most negative for n-channel). If the power supply voltage is VDD, we will use positive logic FIGURE A-1 MOSFET Symbols © Cengage Learning 2014 Gate (G) + – VGS – VDS + n Substrate Source (S) (a) n-channel MOSFET Drain (D) Gate (G) + – VGS – VDS + p Substrate Source (S) Source Drain Gate (b) p-channel MOSFET Drain (D) (c) General MOSFET symbol 714 Appendix A (0 volts = logic 0 and VDD volts = logic 1) for n-channel MOS circuits and negative logic (VDD volts = logic 0 and 0 volts = logic 1) for p-channel MOS circuits. Using this convention, a logic 1 applied to the gate will switch the MOSFET to the ON state (low resistance between drain and source), and a logic 0 will switch it to the OFF state (high resistance between drain and source).
Figure A-2(a) shows a MOS inverter. When a logic 0 is applied to the gate, the MOSFET is in a high-resistance or OFF state, and the output voltage is approxi-mately VDD. When a logic 1 is applied to the gate, the MOSFET switches to a low-resistance or ON state, the output is connected to ground, and the output voltage is approximately 0.
Thus, the operation of the MOSFET is analogous to the operation of a switch in Figure A-2(b) which is open when Vin is a logic 0 and closed when Vin is a logic 1. In Figure A-2(d), a second MOSFET serves as a load resistor. The geometry of this MOSFET and the gate voltage VGG are chosen so that its resistance is high com-pared with the ON resistance of the lower MOSFET so that the switching operation of Figure A-2(d) is essentially the same as Figure A-2(a).
As shown in Figure A-3, MOSFETs can be connected in parallel or series to form NOR or NAND gates. In Figure A-3(a), a logic 1 applied to A or B turns on the cor-responding transistor and F becomes 0. Thus F′ = A + B and F = (A + B)′, which is the NOR function. In Figure A-3(c), a logic 1 applied to the A and B inputs turns on both transistors and F becomes 0. In this case F ′ = AB and F = (AB)′, which is the NAND function. More complex functions can be realized by using series-parallel combinations of MOSFETs. For example, the circuit of Figure A-3(e) performs the exclusive-OR function. The output of this circuit has a conducting path to ground, and F = 0 if A and B are both 1 or if A′ and B′ are both 1. Thus, F ′ = AB + A′B′ and F = A′B + AB′ = A ⊕ B. A′ and B′ are generated by inverters as in Figure A-2(d).
CMOS (complementary MOS) logic performs logic functions using a combina-tion of p-channel and n-channel MOSFETs. Compared with TTL or other bipolar transistor technologies, CMOS has the advantage of much lower power consump-tion. Figure A-4(a) shows a CMOS inverter built from a p-channel and an n-channel MOSFET. When 0 volts (logic 0) is applied to the gate inputs, the p-channel transis-tor (Q1) is on and the n-channel transistor (Q2) is off, so the output is +V(logic 1). When +V(logic 1) is applied to the gate inputs, Q1 is off and Q2 is on, so the output is 0 volts (logic 0).
FIGURE A-2 MOS Inverter © Cengage Learning 2014 VDD Vout Vin Vin Vin Vout (a) VDD Vout (b) (c) 0 VDD ≈ VDD ≈ 0 VDD Vout Vin VGG (d) MOS and CMOS Logic 715 In the remainder of this discussion we will use a bubble at the MOSFET gate input to indicate a p-channel transistor, which is turned on by a logic 0. No bubble at the gate input indicates an n-channel transistor, which is turned on by a logic 1. Figure A-4(b) shows the CMOS inverter using this bubble notation. The switch ana-log in Figure A-4(c) illustrates the operation of the inverter when the inverter input is 0. Q1 is on and Q2 is off as indicated by the closed and open switches. When the +V Q1 (p-channel) Q2 (n-channel) Vout Vin (a) +V Q1 (p-channel) Q2 (n-channel) Vout Vin Vin = 0 (b) +V Vout ≈ +V (c) Vin = +V +V Vout ≈ 0 (d) FIGURE A-3 MOS Gates © Cengage Learning 2014 VGG VGG VDD VDD A A B A B B A B F = (A + B)′ F = (AB)′ (a) MOS NOR gate (c) MOS NAND gate (b) Switch analog F F (d) Switch analog VDD VDD VGG VDD B A′ A B′ (e) MOS exclusive-OR gate F = A ⊕ B FIGURE A-4 CMOS Inverter © Cengage Learning 2014 716 Appendix A input is +V(logic 1), Q1 is off and Q2 is on, as indicated by the open and closed switches in Figure A-4(d). The following table summarizes the operation: Vin Vout Q1 Q2 0 +V ON OFF +V 0 OFF ON Figure A-5 shows a CMOS NAND gate. If A or B is 0 volts, then Q1 or Q2 is ON while Q3 or Q4 is off, and the output is +V. If A and B are both +V, then Q3 and Q4 are both ON while Q1 and Q2 are off, and the output is 0 volts. If 0 volts represents a logic 0 and +V represents a logic 1, this gate performs the NAND function, as indi-cated by the truth table of Figure A-5(b).
FIGURE A-5 CMOS NAND Gate © Cengage Learning 2014 A B F Q1 Q2 Q3 Q4 0 0 V ON ON OFF OFF 0 V V ON OFF OFF ON V 0 V OFF ON ON OFF V V 0 OFF OFF ON ON (b) Truth table +V + + + + + + + Q1 Q3 Q4 F B A Q2 (a) Circuit diagram FIGURE A-6 CMOS NOR Gate © Cengage Learning 2014 F +V Q1 Q2 Q3 Q4 B A Figure A-6 shows a CMOS NOR gate. If A = 1 (+V), Q1 is off and Q4 is on, F = 0. Likewise, if B = 1, Q2 is off and Q3 is on, so F = 0. Because F = 0 when A or B is 1, F ′ = A + B, and F = (A + B)′, which is the NOR function.
A p-channel and n-channel transistor pair can be connected to form a CMOS transmission gate (TG) as shown in Figure A-7 . The two enable inputs are normally complements so that when En = 1, both transistors are enabled and a low impedance path connects A and B. When En = 0, points A and B are disconnected. In other words, the transmission gate acts like a switch that is closed when En = 1 and open MOS and CMOS Logic 717 when En = 0. Two transistors are used because the p-channel transistor does a good job of transmitting a logic 1 and the n-channel transistor does a good job of transmit-ting a logic 0.
The 2-to-1 multiplexer of Figure 9-1 can be constructed from two TGs and an inverter, as shown in Figure A-8. When A = 0, the upper TG is enabled so that I0 is connected to F; when A = 1, the lower TG is enabled so that I1 is connected to F.
A CMOS gated D latch, as shown in Figure A-9(a), is easily constructed using two TGs and two inverters. The switch analogs of Figures A-9(b) and (c) represent FIGURE A-7 CMOS Transmission Gate and Switch Analog © Cengage Learning 2014 En′ A B En En A B FIGURE A-8 CMOS Multiplexer © Cengage Learning 2014 +V I0 I1 A A′ F FIGURE A-9 CMOS Latch and Switch Analogs © Cengage Learning 2014 D G D Q′ Q Q′ Q CK′ CK TG1 TG1 CK CK CK′ CK′ TG2 TG2 G = 1 G = 0 (a) (b) D Q′ Q TG1 TG2 (c) 718 Appendix A the TGs by switches. When G = 1, CK = 1 and TG1 is closed. Therefore, the latch is transparent, and D is transmitted through the inverters to the Q output. When G = 0, TG2 is closed, and the data in the latch is stored in the closed loop of the two invert-ers. That is, if Q = 0, it is still 0 after going through the two inverters, and if Q = 1, it is still 1 after going through the two inverters. Because TG1 is open, the data does not change when D changes, and the latch holds the stored value of Q.
A CMOS falling-edge-triggered D flip-flop, similar to the type shown in Figure 11-19, can be constructed from two CMOS latches (Figure A-10(a)). The switch analogs of Figures A-10(b) and (c) illustrate the flip-flop operation. When Clock is 1, the input latch is transparent and the output latch holds the current value of Q. When Clock goes to 0, the input latch holds its value, which is transmitted through the output latch to Q. Thus, Q can only change states following the falling edge of Clock.
The technology for implementing a CMOS integrated circuit continues to improve, resulting in smaller transistors, lower voltage levels, faster operation, and very high density logic. When no inputs are changing, the static power dissipation is very low. When the CMOS gates are switching, the power dissipation is proportional to the switching frequency. Thus, the power dissipation at a switching frequency of l00 MHz is ten times that at 10 MHz.
FIGURE A-10 Falling-Edge-Triggered D Flip-Flop © Cengage Learning 2014 Q′ Q′ Q Q D D CK′ CK CK CK CK′ CK′ CK CK′ CK′ CK Clock = 1 Clock (a) Construction from two latches (b) Switch analog for Clock = 1 Q′ Q D Clock = 0 (c) Switch analog for Clock = 0 719 VHDL Language Summary APPENDIX B Reserved words are in boldface type. Square brackets enclose optional items. Curly brackets enclose items which are repeated zero or more times. A vertical bar (|) indicates or.
Disclaimer: This VHDL summary is not complete and contains some special cases. Only VHDL statements used in this text are listed. For a complete description of VHDL syntax, refer to references and .
entity declaration entity entity-name is port(interface-signal-declaration); end [entity] [entity-name]; interface-signal declaration list-of-interface-signals: mode type [:= initial-value] {; list-of-interface-signals: mode type [:= initial-value]} Note: A signal can be of mode in, out, inout, or buffer.
architecture declaration architecture architecture-name of entity-name is [declarations] -- declare internal signals here begin architecture-body end [architecture] [architecture-name]; Note: The architecture body may contain component-instantiation statements, processes, assignment statements, procedure calls, etc.
integer type declaration type type_name is range integer_range; signal declaration signal list-of-signal-names : type_name [:= initial_value ]; constant declaration constant constant_name : type_name := constant_value; 720 Appendix B alias declaration alias identifier [:identifier-type] is item-name; Note: Item-name can be a constant, signal, variable, file, type name, etc.
array type and object declaration type array_type_name is array index_range of element_type; signal | constant array_name: array_type_name [:= initial_values]; component declaration component component-name [generic (list-of-generics-and-their types);] port (list-of-interface-signals-and-their-types); end component; component instantiation (concurrent statement) label: component-name [generic map (generic-association-list;)] port map (list-of-actual-signals); Note: Use open if a component output has no connection.
signal assignment statement (sequential or concurrent statement) signal < = [transport] expression [after delay_time]; Note: If concurrent, the signal value is recomputed every time a change occurs on the right-hand side. If [after delay-time] is omitted, the signal is updated after Δ time. If [transport] is omitted, an inertial delay is assumed. conditional assignment statement (concurrent statement only) signal < = expression1 when condition1 else expression2 when condition2 … [else expression]; selected signal assignment statement (concurrent statement only) with expression select signal < = expression1 [after delay_time1] when choice1, expression2 [after delay_time2] when choice2, … [expression [after delay_time] when others]; process statement (with sensitivity list) [process-label:] process (sensitivity-list) [declarations] --signal declarations not allowed begin sequential statements end process [process-label]; Note: This form of process is executed initially and thereafter only when an item on the sensitivity list changes value. The sensitivity list is a list of signals. No wait state-ments are allowed.
VHDL Language Summary 721 process statement (without sensitivity list) [process-label:] process [declarations] --signal declarations not allowed begin sequential statements end process [process-label]; Note: This form of process must contain one or more wait statements. It starts execu-tion immediately and continues until a wait statement is encountered.
wait statements wait on sensitivity-list; wait until Boolean-expression; wait for time-expression; if statement (sequential statement only) if condition then sequential statements {elsif condition then sequential statements } -- 0 or more elsif clauses may be included [else sequential statements] end if; case statement (sequential statement only) case expression is when choice1 = > sequential statements when choice2 = > sequential statements … [when others = > sequential statements] end case; for loop statement (sequential statement only) [loop-label:] for index in range loop sequential statements end loop [loop-label]; Note: You may use exit to exit the current loop.
report declaration report string-expression [severity severity-level]; VHDL Libraries and Packages VHDL libraries and packages are used to extend the functionality of VHDL by defining types, functions, components, and overloaded operators. The syntax for libraries and packages is as follows: library declaration library list-of-library names; 722 Appendix B use statement use library_name.package_name.item; (.item may be .all) package declaration package package-name is package declarations end [package][package-name]; package body package body package-name is package body declarations end [package body][package name]; When working with bits and bit_vectors, you may use the following declarations: library BITLIB; use BITLIB.bit_pack.all; The bit_pack package includes functions and components that work with signals of type bit and bit_vector. For example, the function call vec2int(A) converts a bit_ vector A to an integer. The CD contains a complete listing of bit_pack.
When working with std_logic and std_logic_vectors, the following declarations are required: library IEEE; use IEEE.std_logic_1164.all; The std_logic_1164 package defines the types std_logic and std_logic_vector, a reso-lution function for these types, conversion functions, and overloaded operators for logic operations. It does not define overloaded operators for arithmetic operations.
In order to perform arithmetic operations on std_logic_vectors, you may add the declaration use IEEE.std_logic_unsigned.all; Although this package is found in the IEEE library, it was written by Synopsys and it is not an IEEE standard. This package treats std_logic_vectors as if they were unsigned numbers and provides overloaded arithmetic operators for +, −, , =, /=, >, > =, <, and < =. For “+” and “−” if the left operand is a std_logic_vector, the right operand can be the same type, integer type, or std_logic type. For the comparison operators, the right operand can be a std_logic_vector or an integer. The function call CONV_INTEGER(A) converts a std_logic_vector A to an integer.
As an alternative to using std_logic_vectors and the overloaded operators defined in the std_logic_unsigned package, type unsigned may be used. Unsigned type is defined in the Synopsys package std_logic_arith and in the IEEE package numeric_std. To use the former, add the declaration use IEEE.std_logic_arith.all; A vector of type unsigned is similar to a std_logic_vector in that it is an array of std_logic bits, but it has its own overloaded arithmetic operators. Operators for +, −, , =, /=, >, > =, <, and < = are defined in the std_logic_arith package for various combinations of left and right operands. Unfortunately, logic operators AND, OR, and NOT are not defined for unsigned vectors in this package, so C < = A + B; VHDL Language Summary 723 works for unsigned vectors, but C < = A and B; is not allowed without calling type conversion functions. Some type conversion functions available in this package are as follows: conv_integer(A) converts an unsigned vector A to an integer conv_std_logic_vector(A) converts an unsigned vector A to a std_logic_vector conv_unsigned(B, N) converts an integer B to an unsigned vector of length N Conversion of a std_logic_vector to unsigned is not defined.
The IEEE numeric_std package, which actually is an IEEE standard, overcomes a number of the deficiencies in the std_logic_arith package. The statement use IEEE.numeric_std.all; invokes this package. It defines unsigned type and overloaded operators for arith-metic and comparison operations in a way similar to the std_logic_arith package, but in addition it defines overloaded operators for logic operations on unsigned vectors. Useful conversion functions in the package include TO_INTEGER(A) converts an unsigned vector A to an integer TO_UNSIGNED(B, N) converts an integer to an unsigned vector of length N The only significant deficiency is that this package does not define an overloaded operator for adding a std_logic bit to an unsigned type. Thus, a statement of the form sum < = A + B + carry; is not allowed when carry is of type std_logic. The carry must be converted to an integer before it can be added to the unsigned vector A + B.
We have used the std_logic_unsigned package in many examples in this book because it is easy to use. For complex VHDL projects, we recommend using the numeric_std package. Most VHDL simulators and synthesizers work well with either package.
724 Tips for Writing Synthesizable VHDL Code APPENDIX C One of our goals throughout this text is to write VHDL code that not only simulates correctly but also synthesizes correctly to implement hardware that works correctly. First and foremost, always remember that when you write VHDL code you are not writing a computer program; you are describing hardware. If you are designing a multiplier for binary numbers, do not simply write a program to multiply binary numbers. Instead think in terms of what registers are required and what sequence of operations on these registers will produce the desired result.
VHDL code that simulates correctly will not always implement correctly in hardware. A frequent cause of problems is the creation of unintended latches. Even though code simulates correctly, the presence of latches may cause timing problems when the code is actually implemented in hardware. After synthesizing your code, check the synthesis report to make sure no latches are present. If latches are present, check your code for the following: 1. Counters, shift registers, flip-flops, and other devices that change state in response to a clock edge must be updated only in a clocked process. The state of these devices should never be changed in a combinational process or in a con-current statement. All state changes for a given device must be specified within the same process.
Example: count <= count + 1; should not appear in a combinational process.
When this statement, which increments a counter, is placed in a clocked process, any statement that clears the counter must be placed in the same process.
2. If a combinational process sets control signals to '1' at various places in a case state-ment, all of these signals should be set to '0' before the start of the case statement.
3. For every if statement in a combinational process, check each signal that is assigned a value in the then clause. If such a signal is not assigned a value in step 2, then make sure that it is assigned a value in the else clause.
Example: if St = '1' then nextstate <=1; load <='1'; end if; will create a latch because nextstate is not defined when St = '0'. To eliminate the latch write if St = '1' then nextstate <= 1; load <= '1'; else nextstate <= 0; end if; This assumes that load is set to '0' in step (2).
Do not attempt to set the same signal to two different values in two different processes or in a process and in a concurrent statement.
Tips for Writing Synthesizable VHDL Code 725 A <='0'; is a concurrent statement, and A <= B; is another concurrent statement or a sequential statement in a process. These statements can attempt to set A to two different values at the same time. If A and B are bit signals, when you try to simu-late, you will get an error message that a signal has multiple drivers. That means a conflict exists because A could be driven to '0' and to '1' at the same time. If A and B are std_logic, the conflict still exists, but you will not get the error message. Instead, during simulation A will assume the value 'X' (unknown) if the simulator tries to set A to '0' and '1' at the same time. In both cases, the code will not synthesize properly because it does not correspond to any real hardware.
Also consider the following example: -- Example of what NOT TO DO: output A is assigned values -- in a concurrent statement and in a process.
entity two_drivers is port (B, clk, reset : in bit; A : out bit); end two_drivers; architecture arch of two_drivers is begin A <= '0' when reset = '0'; process (clk) begin if clk'event and clk = '0' then A <= B; end if; end process; end arch; In this example, A is supposed to represent a flip-flop that is reset to '0' when the signal reset is '0' and set equal to B on the falling clock edge. Although this code has correct syntax, it will not simulate properly because the two statements that change A occur as a concurrent statement and also as a sequential statement in a process so that A has two drivers. If the signals are std_logic instead of bits, A will assume a value of 'X' at times during the simulation. The code will not synthesize because all statements that change the output of flip-flop A must be placed in the same process. This also would apply if A were a register or a counter.
Exercise Change the preceding code so that the reset signal will work properly.
An easy way to write synthesizable VHDL code to perform arithmetic operations is to represent binary numbers as std_logic_vectors so that over-loaded operators can be used. This is explained on pages 319–320 of the text. Example 726 Appendix C Overloaded + and – operators cannot be used with bit vectors. If you use over-loaded operators with std_logic_vectors in your VHDL code, place the follow-ing declarations at the start of your code: library IEEE; -- this library contains several useful -- packages use IEEE.std_logic_1164.all; -- this package defines std_logic, -- std_logic_vectors and logic -- operations on these types use IEEE.std_logic_unsigned.all; -- this package defines overloaded -- operators for std_logic_vectors Remember that the VHDL operators +, –, and & have the same precedence and will be applied from left to right as they appear in a VHDL statement.
Thus A <= B + C&D is treated as A <= (B+C)&D If you want to do concatenation first, you must use parentheses.
A <= B + (C&D); 727 Proofs of Theorems APPENDIX D Finding Essential Prime Implicants Section 5.4 presents a method for finding all of the essential prime implicants which is based on finding adjacent 1’s on a Karnaugh map. The validity of the method is based on the following theorem: If a given minterm mj of F and all of its adjacent minterms are covered by a sin-gle term pj, then pj is an essential prime implicant of F.
Proof: 1. Assume pj is not a prime implicant. Then, it can be combined with another term pk to eliminate some variable xi and form another term which does not contain xi. Therefore, xi = 0 in pj and xi = 1 in pk, or vice versa. Then, pk covers a minterm mk which differs from mj only in the variable xi. This means that mk is adjacent to mj, but mk is not covered by pj. This contradicts the original assumption that all minterms adjacent to mj are covered by pj ; therefore, pj is a prime implicant.
2. Assume pj is not essential. Then, there is another prime implicant ph which covers mj. Because ph is not contained in pj, ph must contain at least one minterm which is adjacent to mj and not covered by pj. This is a contradic-tion, so pj must be essential.
State Equivalence Theorem The methods for determining state equivalence presented in Unit 15 are based on Theorem 15.1: Two states p and q of a sequential network are equivalent if and only if for every single input x, the outputs are the same and the next states are equivalent.
Proof: We must prove both part 1, the “if” part of the theorem, and part 2, the “only if” part.
728 Appendix D 1. Assume that λ(p, x) = λ(q, x) and δ(p, x) ≡δ(q, x) for every input x. Then, from Definition 15.1, for every input sequence X, λ[δ(p, x), X] = λ[δ(q, x), X] For the input sequence Y = x followed by X, we have λ(p, Y) = λ(p, x) followed by λ[δ(p, x), X)] λ(q, Y) = λ(q, x) followed by λ[δ(q, x), X)] Hence, λ(p, Y) = λ(q, Y) for every input sequence Y, and p ≡q by Definition 15.1.
2. Assume that p ≡q. Then, by Definition 15.1, λ(p, Y) = λ(q, Y) for every input sequence Y. Let Y = x followed by X. Then, λ(p, x) = λ(q, x) and λ[δ(p, x), X] = λ[δ(q, x), X] for every sequence X. Hence, from Definition 15.1, δ(p, x) ≡δ(q, x).
729 Answers to Selected Study Guide Questions and Problems APPENDIX E UNIT 1 Study Guide Answers 2. (e) Two of the rows are: 1110 16 14 E 1111 17 15 F 3. (b) 11002 −1012 = [1 × 23 + 1 × 22 + 0 × 21 + 0 × 20] −[ 1 × 22 + 0 × 21 + 1 × 20] note borrow from column 1 = [1 × 23 + 1 × 22 + (0 −1) × 21 + (10 + 0) × 20] − [ 1 × 22 + 0 × 21 + 1 × 20] note borrow from column 2 = [1 × 23 + (1 −1) × 22 + (10 −1) × 21 + 10 × 20] − [ 1 × 22 + 0 × 21 + 1 × 20] note borrow from column 3 = [(1 −1) × 23 + (10 −0) × 22 + 1 × 21 + 10 × 20] − [ 1 × 22 + 0 × 21 + 1 × 20] = [ 0 × 23 + 1 × 22 + 1 × 21 + 1 × 20] = 1112 5. (f ) sign & mag: − 0, 2’s comp: – 32, 1’s comp: – 31 (g) Overflow occurs when adding n-bit numbers and the result requires n + 1 bits for proper representation. You can tell that an overflow has occurred when the sum of two positive numbers is negative or the sum of two nega-tive numbers is positive.
A carry out of the last bit position does not indicate that an overflow has occurred.
6. (a) BCD: 0001 1000 0111 excess-3: 0100 1011 1010 6-3-1-1: 0001 1011 1001 2-out-of-5: 00101 10100 10010 UNIT 1 Answers to Problems 1.1 (a) 2F5.4016 = 001011110101.010000002 (b) 7B.2B16 = 01111011.001010112 (c) 164.E316 = 000101100100.111000112 (d) 427.816 = 010000100111.10002 730 Appendix E 1.2 (a) 7261.38 = 3761.410, EB1.616 = 3761.410 (b) 2635.68 = 1437.810, 59D.C16 = 1437.810 1.3 3252.10026 1.4 (a) 5B1.1C16 (b) 010110110001.000111002 = 2661.0708 (c) 112301.01304 (d) 3564.610 1.5 (a) Add: 11001. Subtract: 0101. Multiply: 10010110.
(b) Add: 1010011. Subtract: 011001. Multiply: 11000011110.
(c) Add: 111010. Subtract: 001110. Multiply: 1100011000.
1.6 (a) 1111 11110100 −1000111 10101101 (b) 111 1 1110110 −111101 0111001 (c) 11111 1 10110010 − 111101 01110101 1.7 2’s complement: (a) 010101 + 001011 100000 (b) 110010 + 100000 (1) 010010 (c) 100111 + 010010 111001 OVERFLOW! OVERFLOW!
(d) 110100 + 001101 (1) 000001 (e) 110101 + 101011 (1) 100000 1’s complement: (a) 010101 + 001011 100000 (b) not assigned (c) 100110 + 010010 111000 because −32 cannot be represented OVERFLOW! in 6 bits (d) 110011 + 001101 (1) 000000 + 1 000001 (e) 110100 + 101010 (1) 011110 + 1 011111 OVERFLOW!
1.8 For a word length of N, the range of 2’s complement numbers that can be repre-sented is −2N−1 to 2N−1 − 1.
So, for a word length of 8, the range is −27 to 27 − 1, or −128 to 127. Because 1’s complement has a “negative zero” (11111111) in addition to zero (00000000), the values that can be represented range from −(27 − 1) to 27 − 1, or −127 to 127.
1.9 Dec. 7-3-2-1 3 6 5 9 0 0000 0011 0111 0110 1010 1 0001 or 2 0010 0100 3 0011 or 0100 4 0101 5 0110 6 0111 Answers to Selected Study Guide Questions and Problems 731 7 1000 8 1001 9 1010 UNIT 2 Study Guide Answers 2. (d) 1; 0; 1; 1 (e) 1, 1; 0, 0; 0; 1 3. (a) four variables, 10 literals (d) F = (A′ B)′ (e) F = (A + B′)C (f ) Circuit should have two OR gates, three AND gates, and three inverters.
4. (b) A, 0, 0, A; A, 1, A, 1 6. (c) Z = ABC 7 . (a) Sum of products Neither Product of sums (Here, A and B′ are each considered to be separate terms in the product.) Neither (b) Fewer terms are generated.
(c) D[A + B′(C + E)] = D(A + B′) (A + C + E) 8. (a) AE + B′C′ + C′D (b) C′DE + AB′CD′E 10. (a) a′ + b + c (b) ab′c′d (c) a(b′ + c′) (d) (a + b) (c′ + d′) (e) a′ + b(c + d′) UNIT 2 Answers to Problems 2.1 (a) X(X′ + Y ) = XX′ + XY = 0 + XY = XY (b) X + XY = X(1 + Y) = X(1) = X (c) XY + XY′ = X(Y + Y′) = X(1) = X (d) (A + B)(A + B′) = AA + AB′ + AB + BB′ = A + AB′ + AB + BB′ = A(1 + B + B′) + 0 = A(1) = A 2.2 = (a) X Y X X = (b) Y Y Z X X Z X 2.3 (a) 1 (Law 5) (b) CD + AB′E (Law 8D) (technically, we also used Law 3D) (c) AF (Uniting (1)) (d) C + D′B + A′ (Uniting (1)) (e) A′B + D (Absorption (2)) (f ) A + BC + DE + F (Elimination (3)) 2.4 (a) F = A + E + BCD (one AND gate and one OR gate with three inputs) (b) Y = A + B 2.5 (a) ACD′ + BE (b) A′B′ + A′D′ + C′B′ + C′D′ 2.6 (a) (A + C′)(A + D′)(B + C′)(B + D′) (b) X(W + Z)(W + Y) (c) (A′ + E)(B + E)(C + E)(A′ + D + F )(B + D + F )(C + D + F ) 732 Appendix E (d) Z(W′ + X)(Q′ + W′ + Y) (e) (A′ + D′)(C + D′) (f ) (A + B + D)(A + C + D)(A + B + E)(A + C + E) 2.7 D A B C E F (a) + U X Y Z V W (b) + 2.8 (a) ABC + ABD′ (b) A′B′ + A′CD′ (c) A′BC′ 2.9 (a) F = A′B (b) G = T′ UNIT 3 Study Guide Answers 1. (b) (b′ + d)(b + a)(b + c) (a + d)(b + d)(a′ + b′ + c) (c) w′y′ + x′y′z′ + xy + wyz 5. (b) A′B′C + BC′D′ + AB′D′ + BCD (c) Add BCD; eliminate A′BD, ABC UNIT 3 Answers to Problems 3.6 (a) WY′X + WY′Z′ + W′X′Y + W′X′Z (b) A′D + AC 3.7 (a) (C′ + D)(C + D′ + B′) (b) (D′ + A′ + B′)(D′ + C + B′)(D + A + C′)(D + A′ + B) 3.8 F = (AB) ⊕ [(A ≡D) + D] = A′ + BD′ + B′D 3.9 No. Consider A = 1, B = 1, C = 0 or A = 1, B = 0, C = 1.
3.10 (a) W′X + WY′Z + WYZ′ (b) BD + A′BC + AB′ + AC′ (c) (A + C + D)(A′ + C′ + D′)(B + C′ + D) 3.11 AE′ + AC′ + B′ + CD′ + D′E′ 3.12 A′CD′E + A′B′D′ + ABCE + ABD = A′CD′E + BCD′E + A′B′D′ + ABCE + ABD = A′B′D′ + ABD + BCD′E UNIT 4 Study Guide Answers 2. (d) ab′c′d (e) a + b + c′ + d′ (g) (a + b′ + c)(a′ + b + c′)(a′ + b′ + c)(a′ + b′ + c′) 3. (c) m0 + m1 + m3 + m4 = Σ m(0, 1, 3, 4) M2M5M6M7 = Π M(2, 5, 6, 7) 4. (b) m19 (c) A′BCD′E (e) M19 (f ) (A + B′ + C′ + D + E′) 5. (a) 65536 (d) (a0m0 + a1m1 + a2m2 + a3m3)(b0m0 + b1m1 + b2m2 + b3m3) = . . . = a0b0m0 + a1b1m1 + a2b2m2 + a3b3m3 (f ) f = Π M(2, 5, 6) f ′ = Σ m(2, 5, 6) = Π M(0, 1, 3, 4, 7) 6. (b) Σ m(0, 5) + Σ d(1, 3, 4) Answers to Selected Study Guide Questions and Problems 733 UNIT 4 Answers to Problems 4.1 (a) U: Safe unlocked, J: Mr. Jones present, E: Mr. Evans present, B: Normal business hours, S: Security guard present U = (J + E)BS (b) O: Wear overshoes, A: You are outside, R: Raining heavily, S: Wearing suede shoes, M: Mother tells you to O = ARS + M (c) L: Laugh at joke, F: It is funny, G: Good taste, O: Offensive, P: Told by professor L = FGO′ + PO′ (d) D: Elevator door opens, S: Elevator is stopped, F: Level with floor, T: Timer expired, B: Button pressed D = SFT ′ + SFB 4.2 (a) Y = A′B′C′D′E′ + AB′C′D′E′ + ABC′D′E′ or Y = C′ (b) Z = ABC′D′E′ + ABCD′E′ + ABCDE′ or Z = BE′ 4.3 F1 + F2 = Σ m(0, 3, 4, 5, 6, 7); General rule: F1 + F2 is the sum of all minterms which are present in either F1 or F2, because F1 + F2 = Σ ai mi + Σ bi mi = Σ (ai + bi)mi 4.4 (a) 16 (b) F(x, y) = 0, x′y′, x′y, x′, xy′, y′, x′y + xy′, x′ + y′, xy, x′y′ + xy, y, x′ + y, x, x + y′, x + y, 1 4.5 A B C D E F 0 0 0 1 1 X 0 0 1 X X 1 0 1 0 X X X 0 1 1 X X 1 or 1 1 X 1 0 0 X 0 0 1 0 1 X X 1 1 1 0 X X X 1 1 1 X 0 0 or 0 X 0 4.6 (a) F = A′B′ + AB(d1 = 1, d5 = 0) (b) G = C(d2 = 0, d6 = 0) 4.7 (a) Σ m (1, 2, 4) (b) Π M (0, 3, 5, 6, 7) 4.8 (a) F = A′B′C′D′ + A′B′C′D + A′B′CD′ + A′B′CD + A′BC′D′ + A′BC′D + A′BCD′ + AB′C′D′ + AB′C′D + ABC′D′ F = Σ m(0, 1, 2, 3, 4, 5, 6, 8, 9, 12) (b) F = (A + B′ + C′ + D′)(A′ + B + C′ + D)(A′ + B + C′ + D′) (A′ + B′ + C + D′) (A′ + B′ + C′ + D)(A′ + B′ + C′ + D′) F = Π M(7, 10, 11, 13, 14, 15) 4.9 (a) F = Σ m(0, 1, 4, 5, 6) (b) F = Π M(2, 3, 7) (c) F ′ = Σ m(2, 3, 7) (d) F ′ = Π M(0, 1, 4, 5, 6) 4.10 (a) F = Σ m(1, 4, 5, 6, 7, 10, 11) (b) F = Π M(0, 2, 3, 8, 9, 12, 13, 14, 15) (c) F ′ = Σ m(0, 2, 3, 8, 9, 12, 13, 14, 15) (d) F ′ = Π M(1, 4, 5, 6, 7, 10, 11) 734 Appendix E 4.11 (a) di = xi ⊕ yi ⊕ bi bi+ 1 = bi xi ′ + xi ′yi + bi yi (b) di = si, bi+1 is the same as ci+1 with xi replaced by xi′ 4.12 UNIT 5 Study Guide Answers 3. (d) 6, 10, 12, 15; 0, 12, 9, 10 (g) f1 = a′b + bc′ + a′cd + ac′d f2 = b′c + cd + a′bd + ab′d′ 4. (a) a′b′d′, b′c′d′, ac′d′, ac′d, also a′b′cd, and all the other minterms.
(b) AB′C′ and AC′D are prime implicants.
5. (a) 4 (c) We cannot determine if B′C′ is essential.
(f ) Yes (i) A′D′ because of m4, B′D′ because of m10 6. (b) A′D′ is not essential because all of its minterms are covered by other prime implicants. BC′ is essential because of m13. B′CD is essential because of m11.
Minimum sum = B′CD + BC′ + BD′ + A′B′.
(d) A′C′ + ACD + 5AB or BC′6 8. (a) F = AB′D′ + B′D′E′ + A′BDE (b) 8, 16, 25, 26, 28 (d) P1 + P2 + P3 + P4 + BCDE + AC′E (f ) AC′E′ + A′DE + ACE + B′CE + (AB′C or ADE′ or ACD or AB′E′) xi ′ xi ′ yi bi yi bi bi + 1 xi yi di bi FA FA y3 x3 z3 s3 FA FA y2 x2 z2 s2 FA FA y1 x1 z1 s1 FA FA y0 x0 z0 s0 C0 = 1 C0 = 0 Answers to Selected Study Guide Questions and Problems 735 UNIT 5 Answers to Problems 5.3 (a) f = bc′ + a′c′ + ab′c (b) f = e′f ′ + d′e′ + d′f ′ (c) f = r′ + t′ (d) f = y + x′z + xz′ 5.4 (a) (b) F = D′ + B′C + AB (c) F = (A + B′ + D′)(B + C + D′) 5.5 (a) 1 0 1 4 1 12 1 00 01 11 10 8 0 1 0 5 1 13 0 9 1 3 0 7 1 15 1 11 1 00 CD AB 01 11 10 2 1 6 1 14 1 10 C1 C2 X1 X2 Z 0 0 0 0 0 0 0 0 1 1 0 0 1 0 1 0 0 1 1 1 0 1 0 0 0 0 1 0 1 1 0 1 1 0 1 0 1 1 1 0 1 0 0 0 0 1 0 0 1 0 1 0 1 0 0 1 0 1 1 1 1 1 0 0 1 1 1 0 1 0 1 1 1 0 0 1 1 1 1 1 (b) Z = C1 ′ X1 ′ X2 + C1 ′ X1 X1 ′ + C1 X1 X2 + C1 C2 X1 ′X2 ′ + 5C1 ′ C2 ′ X2 or C1 ′ C2 ′ X1 or C2 ′ X1 X26 5.6 (a) f = a′d + a′b′c′ + b′cd + abd′ + 5a′bc or bcd′6 a′d →m5; a′b′c′ →m0; b′cd →m11; abd′ →m12 (b) f = bd + a′c + b′d′ + 5a′b or a′d′6 bd →m13, m15; a′c →m3; b′d′ →m8, m10 (c) f = c′d′ + a′d′ + b′ c′d′ →m12; a′d′ →m6; b′ →m10, m11 5.8 (a) f = a′b c′ + a c′d + b′c d′; f = (b′ + c′)(c′ + d′)(a + b + c)(a′ + c + d) (b) f = a′b′d + bc′d′ + cd; f = (b + d)(b′ + d′)(a′ + c)5(b′ + c′) or (c′ + d)6 736 Appendix E 5.10 (a) C′D′E′ →m16, m24; A′CE′ →m14; ACE →m31; A′B′DE →m3 (b) A′B′DE, A′D′E′, CD′E, A′CE′, ACE, A′B′C, B′CE, C′D′E′, A′CD′ 5.11 f = (a + b + c + d) (a + b′ + e′) (a′ + d′ + e) (a′ + b + c′) (a + c + e′) (c + d + e′) 5(a′ + b′ + c + d) or (a′ + b′ + c + e)6 5.12 (a) F = Π M(0, 1, 9, 12, 13, 14) F = (A + B + C + D)(A + B + C + D′)(A′ + B′ + C + D) (A′ + B′ + C + D′)(A′ + B′ + C′ + D)(A′ + B + C + D′) (b) F′ = A′B′C′ + ABD′ + AC′D (c) F = (A + B + C) (A′ + B′ + D) (A′ + C + D′) 5.13 F = A′C′ + B′C + ACD′ + BC′D Minterms m0, m1, m2, m3, m4, m5, m7, m8, m10, and m11 can be made don’t-cares individually and will not change the given expression. UNIT 6 Study Guide Answers 2. (f ) (2, 6) 3. (a) m0 −a′b′c′ (m0, m1) −a′b′ m1 −a′b′c (m1, m5) −b′c prime m5 −ab′c (m5, m7) −ac m7 −abc (d) A′B′C′ and ABC are not prime implicants.
4. (b) a′c′d′, bc′, ab′c 5. (b) F = bd + a′b, F = bd + bc′, F = bc′ + a′b, F = a′b + c′d UNIT 6 Answers to Problems 6.2 (a) a′c′d (1, 5) b′c′d (1, 9) a′bd (5, 7) ab′d (9, 11) abd′ (12, 14) bcd (7, 15) acd (11, 15) abc (14, 15) (b) a′b′c′ (0, 1) b′c′d′ (0, 8) ab′d′ (8, 10) acd′ (10, 14) a′d (1, 3, 5, 7) bc (6, 7, 14, 15) 6.3 (a) f = a′c′d + ab′d + abd′ + bcd or f = b′c′d + a′bd + abd′ + acd (b) f = a′d + bc + ' a′b′c′ + ab′d′ OR b′c′d′ + acd′ OR b′c′d′ + ab′d′ / 6.4 f = b′cd′ + bc′ + a′d + (a′b OR a′c) [1 other solution] 6.5 Prime implicants: ab, c′d, ac′, bc′, ad, bd F = ab + c′d or F = ab + ac′ or F = ab + ad or F = ac′ + ad or F = ac′ + bd or F = ad + bc′ Answers to Selected Study Guide Questions and Problems 737 6.6 (a) F = A′B + A′C′D′ + AB′D + A′C′E + BCDE (b) Z = A′B′ + ABD + EB′C′ + EA′C + FAB + GBD [several other solutions] UNIT 7 Study Guide Answers 1. (b) Z1: six gates, 13 inputs, four levels Z2: five gates, 11 inputs, five levels (d) 2. (a) 0; 1; 1,1,1 ; 0, 0, 0 6. (a) (1) No (2) Yes (3) No (b) because C requires no gate (c) five gates, 10 inputs; using common gate: four gates, nine inputs (d) F1 = a′cd + acd + ab′c′; F2 = a′cd + bcd + a′bc′ + acd′; F3 = bcd + acd + a′c′d UNIT 7 Answers to Problems 7 .1 (a) f = (a + b)(a′ + b′)(a + c + d′)(a′ + c′ + d′) OR f = (a + b)(a′ + b′)(a + c + d′)(b + c′ + d′) OR f = (a + b)(a′ + b′)(b′ + c + d′)(a′ + c′ + d′) OR f = (a + b)(a′ + b′)(b′ + c + d′)(b + c′ + d′) (b) f = a′b(c + d′) + ab′(c′ + d′) 7 .2 (a) Z = (C′ + E′)(AD + B) + A′D′E′ (four levels, 13 inputs) (b) Z = (B(C + D) + A)(E + FG) (four levels, 12 inputs) 7 .3 AND-OR: F = a′bd + ac′d; OR-AND: F = d(a′ + c′)(a + b) D A B C F G Z E a′ c′ b d d F a NAND-NAND a′ c′ F d′ a b NOR-NOR a c b′ d′ d′ F a′ a c b′ d′ d′ a′ OR-NAND a c F d′ a′ b′ a c a′ b′ AND-NOR F NOR-OR F d NAND-AND 738 Appendix E 7 .4 F = BC′(A + D) + AB′C (three levels, four gates, 10 inputs) 7 .5 Z = (A + C + D)(A′ + B′C′D′) (convert circuit to four NOR gates) 7 .6 Z = A(BC + D) + C′D (convert circuit to five NAND gates) 7 .7 Z = E(A + B(D + CF )) (convert circuit to five NOR gates) 7 .8 (a) F B A B′ A′ D′ C C′ A B′ E Z F′ G C′ D A′ B E′ Z F G′ C D′ (b) 7 .9 f1 = acd′ + ad + a′b′d; f2 = a′d′ + a′b′d + acd′ (six gates, 16 inputs) 7 .10 f1 = ab′d + b′cd + a′bd′ f2 = ab′c + b′cd′ + bc′d′ + 5ac′d′ or ab′d′6 f3 = ab′c + b′cd + a′bc (11 gates, 34 inputs) 7 .11 F1 = (a + c)(a + b′) (a′ + b′ + c) (a′ + b + c′) F2 = (a + c′) (b′ + c + d) (a′ + b′ + c) (a′ + b + c′) or (a + c′) (a + b′ + d) (a′ + b′ + c) (a′ + b + c′) (eight gates minimum, 23 gate inputs) 7 .12 f1 = (a + b + c) (b′ + d) f2 = (a + b + c) (b′ + c + d) (a′ + c) f3 = (b′ + c + d) (a + c) (b + c′) 7 .13 (a) Replace all gates in the AND-OR circuit which corresponds to Equations (7-25(b)) with NAND gates. Invert the c input to the f2 output gate.
(b) Replace all gates in Answer 7 .12 with NOR.
Answers to Selected Study Guide Questions and Problems 739 UNIT 8 Study Guide Answers 3. a′ b f g′ d′ c′ e Z V 0 5 10 15 20 25 30 35 40 t (ns) 4. (a) Factor out the expression such that the number of inputs on each gate is less than or equal to the maximum allowed. This will result in the addition of more levels of logic.
(b) Yes.
(c) Even if the two-level expressions had common terms, most of these common terms would be lost when the expressions are factored.
5. (a) B′ goes to 0 at 80 ns. Z goes to 1 at 50 ns and goes to 0 at 110 ns.
6. (a) y1 goes to 1 at 15 ns. y2 goes to 0 at 30 ns. Z goes to 1 at 25 ns and, then, goes to 0 at 40 ns.
(c) A pair of adjacent 1’s corresponding to a′bc and abc are not in the same loop in the Karnaugh map, but a′bc and a′bc′ are both in a′b. Without the map, when b = c = 1 and a changes from 0 to 1, a′b may go to 0 before ac becomes 1. But when a = 0, b = 1, and c changes from 1 to 0, a′b remains 1.
(g) The application of DeMorgan’s laws to convert a circuit from one form to another will not introduce any hazards.
7 . (b) If G = 0, gate 4 is faulty. If G = 1, gate 1 is faulty. UNIT 8 Answers to Problems 8.1 8.2 (a) F = A′C′D′ + BC′D + AC (hazards are 1101↔1111 and 0100↔0101 [static 1]) OR F = (A′ + C + D) (B + C + D′) (A + C′) (hazards are 0001↔0011 and 1000 ↔ 1001 [static 0]) (b) F t = A′C′D′ + BC′D + AC + A′BC′ + ABD (c) F t = (A′ + C + D) (B + C + D′) (A + C′) (A′ + B + C) (A + B + D′) 8.3 (a) Glitch in output of G occurs between 6 ns and 7 ns (static 1-hazard).
(b) Modified equation to avoid hazards: G = A′C′D + BC + A′BD 8.4 A = 1 E = X B = Z F = 0 C = X G = 0 D = 1 H = X 8.5 Gate 3 is connected incorrectly or is malfunctioning.
740 Appendix E UNIT 9 Study Guide Answers 2. (a) (b) Z = A′C′I0 + A′CI1 + AC′I2 + ACI3 (c) Before C changes, Z = I4, and after C changes, Z = I5.
(d) (e) MUX inputs: I0 = B, I1 = B′, control = A 3. (f ) AND-gate inputs are A′B′, A′B, AB′, and AB 4. (a) Inputs BCD; A = 0 5. (b) 32 words × 4 bits; 1024 × 8 (c) 16 words × 5 bits; 16 × 10 6. (a) Four inputs, seven terms, three outputs (b) Four inputs, four terms, three outputs (c) I0 I1 A B I2 I3 0 1 I0 I1 0 1 A Z 0 1 A B C D F1 F2 F3 1 1 --1 0 1 1 -1 1 1 1 0 1 1 0 -0 1 0 0 -1 1 0 1 1 (f ) When ABC = 010, F0F1F2F3 = 0111.
8. (c) f = c′(d′ + a) + c(a′b′ + bd) (d) G a b f e d c G00 G01 G10 G11 FG f e d c FG f e d c FG f e d c FG Answers to Selected Study Guide Questions and Problems 741 UNIT 9 Answers to Problems 9.1 (a) I0 I1 B I2 A Z (b) (c) A Z I0 I1 I2 I3 B C I4 I5 I6 I7 B C Z A B I0 I1 C I2 I3 C I4 I5 C I6 I7 C Y 4 4 X A 4 4 X 4 4 Y A 4 4-Bit Subtracter Difference Bout 9.2 742 Appendix E 9.3 9.4 (a) (b) 9.5 4 4 Y 4 4-Bit Subtracter Difference Bout 4 4 X 4 4 X 4 4 Y A 3-to-8 Line Decoder m0 m1 m2 m3 m4 m5 m6 X Y Cin m7 Sum Cout 3-to-8 Line Decoder m0 m1 m2 m3 m4 m5 m6 X Y Cin m7 Sum Cout 4-to-2 Priority Encoder y0 y1 y2 y3 a b c a = y2 + y3 b = y1y2 + y3 c = y0 + y1 + y2 + y3 ′ Answers to Selected Study Guide Questions and Problems 743 9.6 9.7 Block diagram for a Gray code adder: Partial Truth Table a b c d e f g h S3 S2 S1 S0 Cout (0 + 0 = 0) 0 0 0 0 0 0 0 0 0 0 0 0 0 (1 + 2 = 3) 0 0 0 1 0 0 1 1 0 0 1 0 0 (5 + 7 = 12) 1 1 1 0 1 0 1 1 0 0 1 1 1 (8 + 9 = 17) 1 0 0 1 1 0 0 0 1 0 1 1 1 9.8 (a) 4-to-2 Priority Encoder EnA EnB EnC 4-Bit Adder 4 2 EnD 4 4 4 Sum Cout 4 4 4 A B C D E 28 × 5 ROM a b c d S3 S2 S1 S0 Cout Sum (S3 is the most significant bit) The size of the ROM is 256 words × 5 bits.
N1 N2 e f g h A AB′D A′C′ BC C′D′ AC CD B C D X Y Z 744 Appendix E (b) Truth Table for the ROM A B C D X Y Z 0 0 0 0 1 1 1 0 0 0 1 1 1 1 0 0 1 0 0 0 0 0 0 1 1 0 0 1 0 1 0 0 1 1 1 0 1 0 1 1 1 1 0 1 1 0 1 0 0 0 1 1 1 1 0 1 1 0 0 0 1 1 0 1 0 0 1 1 0 1 1 0 1 0 0 1 0 1 0 1 1 1 1 1 1 1 0 0 1 1 0 1 1 0 1 0 0 0 1 1 1 0 1 1 0 1 1 1 1 1 1 1 9.9 X Y Difference Bout Bin Answers to Selected Study Guide Questions and Problems 745 9.10 (a) A4 = W′ + X′Y′ A3 = WX′Y′ A2 = W′X + XZ + XY A1 = W′Y + WXY′Z′ + YZ A0 = W′Z + WXZ′ + X′Y′Z + WYZ′ W X Y Z W′ X′Y′ A4 WX′Y′ A3 W′X XZ XY A2 W′Y WXY′Z′ YZ A1 W′Z WXZ′ X′Y′Z WYZ′ A0 (b) W X Y Z A4 A3 A2 A1 A0 0 ---1 0 0 0 0 -0 0 -1 0 0 0 0 1 0 0 -0 1 0 0 0 0 1 --0 0 1 0 0 -1 -1 0 0 1 0 0 -1 1 -0 0 1 0 0 0 -1 -0 0 0 1 0 1 1 0 0 0 0 0 1 0 --1 1 0 0 0 1 0 0 --1 0 0 0 0 1 (continued) 746 Appendix E 1 1 -0 0 0 0 0 1 -0 0 1 0 0 0 0 1 1 -1 0 0 0 0 0 1 9.11 (a) Not inverting, three AND gates. Inverting, F = ac + b′c′d, two AND gates.
(b) Not inverting, two AND gates. Inverting, F = ad + ac + bd + bc, four AND gates.
9.12 (b) 9.13 F = b′(ade′ + a′cd′e) + b ((c′d′e + a′cd′e) + ac′de′) UNIT 10 Study Guide Answers 1. (b) Both statements execute at 5 ns. C and D are updated at 5 + Δ ns.
(c) M <= not M after 5 ns; (d) A <= (not B and C) or (B and not C); 2. (a) (b) F <= ‘1‘ when A&B = “00“ else ‘0‘ when A&B = “01“ else C; a b c 1 Sum 1 0 M 5 10 15 20 25 t (ns) B A C F 0 1 Answers to Selected Study Guide Questions and Problems 747 (c) AB <= A&B with AB select F <= ‘1‘ when “00“, ‘0‘ when “01“, C when “10“, C when “11“; 3. (c) Change all (3 downto 0) to (4 downto 0). Change (3 downto 1) to (4 downto 1).
Add another instance of a full adder – FA4: FullAdder port map (A(4), B(4), C(4), Co, S(4)); Change Co in FA3 to C(4).
(f ) architecture ckt of fig8_5 is signal G1: bit; begin G1 <= A and B after 20 ns; G2 <= G1 nor C after 20 ns; end ckt; 5. (a) not (A&B xor “10”) not (A&B) xor “10” (b) The given statement will keep executing over and over again.
7 . (a) A = ‘1’, B = ‘X’, C = ‘0’, D = ‘1’, E = ‘X’, F = ‘Z’ (b) If F is of type bit, compiler will log an error.
If F is std_logic, it will be 0 for 2 ns and, then, become X.
(c) Addout 10011, Sum 0011, Cout = 1 (d) Addout <= (‘0‘ & A) + (“000“ & B); Sum <= Addout(5 downto 0); Cout <= Addout(6); (e) UNIT 10 Answers to Problems 10.1 (a) F <= not A and B and C; G <= D and not E; N <= F xor G; I <= not N; (b) I <= not (( not A and B and C) xor (D and not E)); 10.2 E A F B D G C A B G H I F C D E 748 Appendix E 10.3 (a) (b) 10.4 entity quad_mux is port (X, Y: in bit_vector(3 downto 0); A: in bit; Z: out bit_vector(3 downto 0)); end quad_mux; architecture equations of quad_mux is begin Z <= X when A = ‘0‘ else Y; end equations; 10.5 entity ROM is port (A, B, Cin: in bit; Sum, Cout: out bit); end ROM; architecture table of ROM is type ROM8_2 is array(0 to 7) of bit_vector(1 downto 0); constant ROM1: ROM8_2 := (“00“, “01“, “01“, “10“, “01“, “10“, “10“,“11“); signal index: integer range 0 to 7; signal S: bit_vector(1 downto 0); begin index <= vec2int(A&B&Cin); S <= ROM1(index); Sum <= S(0); Cout <= S(1); end table; 10.6 (a) F = 000001101 (b) The expression evaluates to TRUE.
C B E D A G 1 F 0 0 1 C D E B D F E A D Answers to Selected Study Guide Questions and Problems 749 10.7 entity average is port (a, b, c, d: in std_logic_vector(15 downto 0); f: out std_logic_vector(15 downto 0)); end average; architecture behavioral of average is signal sum: std_logic_vector(17 downto 0); begin sum <= (“00“ & a) + b + c + d; f <= sum (17 downto 2) + sum (1); end behavioral; 10.8 Bus <= A when EnA = ‘1‘ else “ZZZZ“; Bus <= B when EnB = ‘1‘ else “ZZZZ“; Bus <= C when EnC = ‘1‘ else “ZZZZ“; Bus <= D when EnD = ‘1‘ else “ZZZZ“; Addout <= ‘0‘ & E + Bus; Sum <= Addout(3 down to 0); Cout <= Addout(4); 10.9 (a) (b) UNIT 11 Study Guide Answers 1. Left inverter has a 1 output; right inverter has a 0 output.
2. (b) P = Q = 0 (c) S and R cannot both be 1 simultaneously.
3. (c) A B F I0 T1 T2 T3 T4 A B I1 A B I2 A B I3 I0 I1 I2 I3 A B F sel <= A&B with sel select F <= I0 when “00“, I1 when “01“, I2 when “10“, I3 when “11“; Q G D 750 Appendix E 4. (b) Q changes to 1 after first rising clock edge and back to 0 after third rising clock edge.
(d) Hold time violation (D is not stable for 2 ns after second falling clock edge.) (e) = 7 ns.
5. (c) For a rising-edge-triggered flip-flop, the value of the inputs is sensed at the rising edge of the clock, and inputs can change when the clock is low. For a master-slave flip-flop, if the inputs change when the clock is low, the flip-flop outputs may be incorrect.
6. (c) 7 . (b) Q changes its value at times 1 and 2.
8. (b) (c) If CLK = 1, it will produce a falling edge at the clock input of the D flip-flop, causing the output to change. If CLK = 0, only the rising edge is affected, so the output does not change at the wrong time.
En cannot be changed when the clock is 1.
The flip-flops in Figures 11-31(b) and (c) can only change on the falling edge of the clock.
(d) CK D CE ClrN Q+ x x x 0 0 x x 0 1 Q (no change) ↓ 0 1 1 0 ↓ 1 1 1 1 0,1,↑ x 1 1 Q (no change) 9. (b) S = Q′T, R = QT Same as answer to Study Guide 6(c) except connect J and K and label it T.
S R Q Q′ CK J K Q Preset Clear D Clock Answers to Selected Study Guide Questions and Problems 751 UNIT 11 Answers to Problems 11.1 11.2 (a) R = 1 and H = 0 cannot occur at the same time.
(b) R H Q Q+ Q+ = R + HQ 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 1 1 0 0 X 1 0 1 X 1 1 0 1 1 1 1 1 (c) 11.3 z y x 0 10 20 30 40 50 60 70 80 90 100 P Q H R Q 50 100 150 200 P R S 752 Appendix E 11.4 11.5 Connect the clock directly to the input G1 and connect the clock to G2 through an inverter.
11.6 (a) Q+ = SR′ + R′Q (b) 11.7 11.8 D G S R Q Q′ Q P G2 D Clock = G1 S R Q Q′ Clk S R Q K J Clock D Q CE Din Clock Answers to Selected Study Guide Questions and Problems 753 11.9 (a) (b) 11.10 (a) (b) (c) UNIT 12 Study Guide Answers 1. (a) G = 0, H = 249; G = 0, H = 70; G = 118, H = 118; G = 91, H = 118; G = 91, H = 118 2. (b) S0 is 1 between the rising edges of clocks 10 and 11, and also 1 between the rising edges of clocks 14 and 16.
Q2 Q1 Clock ClrN Q Clock K J PreN ClrN D Q Q′ Clk Q J K T Q Q′ Clk Q D T Q Q′ Clk Q D CE 754 Appendix E Clock Cycle Number State of Shift Register when Clock = 1 Q7 Q6 Q5 Q4 Q3 Q2 Q1 Q0 1 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 3 1 0 0 0 0 0 0 0 ---------14 0 0 0 0 0 0 1 1 15 0 0 0 0 0 0 0 1 16 0 0 0 0 0 0 0 0 3. (b) (d) (f ) State 101 goes to 110, which goes to 011.
(g) State 001 goes to 100; 101 goes to 110, which goes to 011.
4. (e) (k) F1 = 1 F2 = 0 TA TB TC A B C Clock 0 0 0 0 1 1 1 1 0 0 1 1 0 0 1 1 0 1 0 1 0 1 0 1 DA DB DC 000 011 010 111 110 100 Answers to Selected Study Guide Questions and Problems 755 UNIT 12 Answers to Problems 12.1 ClrN Ad Clock 12.2 4-bit Parallel-In Parallel-Out Shift Register SI Serial Out Sh Ld Clock 00 01 10 11 D3 A B Clock SI Q3 D Q 00 01 10 11 D2 Q2 D Q 00 01 10 11 D1 Q1 D Q 00 01 10 11 D0 Q0 D Q For a right shift, Sh = 1, Ld = 0 or 1. For a left shift, Sh = 0, Ld = 1.
12.3 12.4 (a) (b) D′ Clock A B C D TD D′ Clock A B C D DD 756 Appendix E 12.5 DD = D+ = D′CBA + DC′ + DB′ + DA′ DB = B+ = B′A + BA′ DC = C+ = C′BA + CB′ + CA′ DA = A+ = A′ 12.6 Uses three flip-flops: Q3 Q2 Q1 Many correct solutions are possible. One is: D3 = Q1 + Q2Q3 ′ D2 = Q2 ′Q3 D1 = Q1 ′Q3 ′ 12.7 (a) DC = CA + BA′ DB = C′ + BA′ DA = B′A′ + CB + C′B′ If CBA = 000, next state is 011.
(b) TC = B′A′ + C′A′ TB = C′B′ + CBA TA = CB′ + CA′ + C′BA If CBA = 000, next state is 110.
12.8 (a) JC = A′ JB = C′ JA = C KC = B′A′ KB = CA KA = CB′ + C′B If CBA = 000, next state is 110.
(b) SC = BA′ SB = C′ SA = CA′ RC = B′A′ RB = CA RA = CB′A + C′B If CBA = 000, next state is 010.
12.9 (a) Q Q+ M N 0 0 0 X 0 1 1 X 1 0 X 0 1 1 X 1 (b) MC = B MB = C′A MA = C′ NC = A NB = C′ NA = C′ + B UNIT 13 Study Guide Answers 2. (a) Mealy: output a function of both input and state Moore: output a function of state only (b) Before the active clock edge After the active clock edge When the flip-flops change state When the flip-flops change state or when the inputs change (c) Immediately preceding the active clock edge (d) Mealy: False outputs can appear when the state has changed to its next value, but the input has not yet changed.
Moore: No false outputs occur because output is not a function of input.
Changing the inputs at the same time the state change occurs will eliminate false outputs.
No, because the output of the first Mealy circuit will still change to its final value before the active clock edge.
3. (a) Before the clock pulse Q+ means the state of flip-flop Q after the active clock edge (i.e., the next state of flip-flop Q).
000 001 100 010 101 110 Answers to Selected Study Guide Questions and Problems 757 (c) Mealy: output associated with transitions between states Moore: output associated with state (d) Present: Before the active clock edge Next: after the clock pulse (e) Output depends only on the state and not on the input.
4. (a) 1101 (c) 1001 (e) 5. (a) (c) 6. (a) (g) δ(S3, 1) = S2, λ(S3, 1) = 0, δ(S1, 2) = S2, λ(S1, 2) = 3 S2 S1 S0 , 0 1 1 0 0 1 0 1 S3 1 S2 0 S0 0 S1 0 1 0 0 0 0 1 1 0 0 1 1 0 Zd Z 1 0 0 1 False outputs Z S1 S0 S2 S0 State Clock 0 1 0 0 1 X False output Mealy Moore Z S1 S0 S2 S3 State Clock 0 1 0 0 0 0 1 X Z2 Z1 False output 758 Appendix E UNIT 13 Answers to Problems 13.2 This is a Moore machine.
13.3 (a) A+ = A(B′ + X) + A′(BX′ + B′X) B+ = AB′X + B(A′ + X′) 1 1 1 0 1 1 0 1 101 011 110 111 0 1 0 1 1 0 0 0 1 0 1 0 0 1 0 0 000 001 100 010 , S0 S3 S5 S6 S1 S7 S2 S4 0 0 0 0 1 1 0 0 0 1 1 0 1 0 1 0 1 0 1 1 1 1 , 0 0 1 1 0 1 0 1 0 1 Present State Next State (A+B+) AB x = 0 x = 1 Z 00 00 10 0 01 11 01 0 11 01 10 1 10 10 11 0 This is a Moore machine.
(b) Z = (0)00101 (c) 13.4 (a) Q+ 1 Q+ 2 Q+ 3 Z Q1Q2Q3 X = 0 1 0 1 S0 0 0 0 001 001 0 1 S1 0 0 1 011 011 0 1 S2 0 1 0 100 101 1 0 S3 0 1 1 010 011 1 0 S4 1 0 0 001 001 0 1 S5 1 0 1 011 011 0 1 S6 1 1 0 100 101 1 0 S7 1 1 1 010 011 1 0 Z B A X Clock Answers to Selected Study Guide Questions and Problems 759 (b) (c) From diagram: 0 1(0) 1 0 1 From graph: 0 1 1 0 1 (same except for false output) (d) Change input on falling edge of clock 13.5 (a) Mealy Machine (b) A+B+C+ Z ABC X = 0 X = 1 X = 0 X = 1 000 011 010 1 0 001 000 100 1 0 010 100 100 0 1 011 010 000 0 1 100 100 001 1 0 (c) Z Q3 Q2 Q1 Clock X False 000 010 011 100 , 001 0 1 0 1 0 0 1 1 1 0 1 0 1 0 0 1 0 0 1 1 (d) Z 0 0 0 1 0 C B A X Clock False outputs Correct output sequence: 00010 760 Appendix E 13.6 (a) 14 ns (b) Z Q2 Q1 D2 D1 X Clock 0 ns 5 ns 10 ns 15 ns 20 ns 25 ns 30 ns 35 ns 40 ns Correct output sequence: Z = 0101 0 0 0 0 0 1 1 0 1 1 1 1 0,1 0 S0 S2 S1 S3 Clock Manchester RZ NRZI NRZ Bit sequence 1 0 0 0 1 1 1 0 (c) Next State Z X = 0 X = 1 X = 0 X = 1 S0 S2 S2 0 0 S1 S0 S3 0 0 S2 S3 S1 0 1 S3 S1 S3 1 1 UNIT 14 Study Guide Answers 1. (b) last row: 11 10 01 0 1 (c) JA = BX′ KA = X ⊕ B JB = A + X KB = A Z = AB′ 8. (a) Answers to Selected Study Guide Questions and Problems 761 9. (b) Change N to NS′; add loop to S3: S′N′/0 NS = Z 00 01 10 11 00 01 10 11 S3 S3 S5 S1 S5 0 0 1 0 10. The output for the third input of X = 1 is don’t care, since the third input can only be 0.
Z1Z2 X = 0 X = 1 X = 0 X = 1 S0 S1 S3 00 00 S1 S1 S2 00 00 S2 S4 S3 10 00 S3 S4 S3 00 00 S4 S5 S2 01 00 S5 S5 S6 00 00 S6 S7 S6 00 00 S7 S5 S6 01 00 X = 0 1 0 1 S0 – S1 – – S1 S2 S3 – – S2 S0 – 0 – S3 S0 – 1 – UNIT 14 Answers to Problems 14.4 14.5 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 0,1 S2 0 S1 0 S0 0 S3 0 S8 0 S5 0 S4 1 S7 0 S6 0 S0 S3 S1 S2 S6 S7 S4 S5 0 00 0 00 0 00 0 00 0 01 0 01 0 00 0 10 1 00 1 00 1 00 1 00 1 00 1 00 1 00 1 00 762 Appendix E 14.6 X1X2 = 00 01 10 11 Z S0 S0 S1 S3 S2 0 S1 S0 S1 S3 S2 0 S2 S4 S1 S3 S2 0 S3 S4 S1 S3 S2 0 S4 S4 S5 S7 S6 1 S5 S0 S5 S7 S6 1 S6 S4 S5 S7 S6 1 S7 S0 S5 S7 S6 1 (a 4-state solution is also possible) 14.7 (a) (b) S2 S1 S0 0 0 0 0 1 0 1 0 1 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 1 0 1 0 1 0 1 0 1 1 1 0 1 0 1 0 S1 S2 S5 S4 S7 S8 S6 S3 S0 14.8 (a) X1X2 = Z1Z2 00 01 10 11 00 01 10 11 S0 S1 S2 S3 S4 00 00 00 00 S1 S1 S2 S3 S4 00 10 10 10 S2 S1 S2 S3 S4 01 00 10 10 S3 S1 S2 S3 S4 01 01 00 10 S4 S1 S2 S3 S4 01 01 01 00 Answers to Selected Study Guide Questions and Problems 763 (b) NRZI (Moore) NRZI (Mealy) NRZ Clock 1 1 0 1 0 0 1 0 False output X1X2 = 00 01 10 11 Z1Z2 S0 S1 S4 S7 S10 00 S1 S1 S3 S6 S9 00 S2 S1 S3 S6 S9 01 S3 S2 S4 S6 S9 10 S4 S2 S4 S6 S9 00 S5 S2 S4 S6 S9 01 S6 S2 S5 S7 S9 10 S7 S2 S5 S7 S9 00 S8 S2 S5 S7 S9 01 S9 S2 S5 S8 S10 10 S10 S2 S5 S8 S10 00 14.9 (a) X = 0 1 X = 0 1 S0 S0 S1 0 1 S1 S1 S0 1 0 X = 0 1 S0 S0 S1 0 S1 S1 S0 1 (b) (c, d) 14.10 Next State Output (DEF ) 000 001 010 011 100 101 110 111 000 001 010 011 100 101 110 111 S0 S0 S0 S0 S0 S1 S1 S0 S0 100 100 100 100 010 010 001 001 S1 S1 S0 S1 S0 S1 S0 S1 S0 110 000 110 000 101 000 101 000 For S0: For S1: A′ + AB + AB′ = A′ + A = 1 A′C′ + AC′ + C = C′ + C = 1 A′ · AB = 0; A′ · AB′ = 0; A′C′ · AC′ = 0; AB · AB′ = 0 A′C′ · C = 0; AC′ · C = 0 764 Appendix E 14.11 x′ 0 x′ 0 x 0 x 0 – z – z – z – z S0 S3 S1 S4 S2 S5 UNIT 15 Study Guide Answers 2. (b) λ(p, 01) = 00 and λ(q, 01) = 01; therefore, p ≢q (c) No. You would have to try an infinite number of test sequences to be sure the circuits were equivalent.
(d) S2 ≡S3 iff S1 ≡S5 and S4 ≡S2. But S1 ≢S5 because the outputs are different. Therefore, S2 ≢S3.
3. (a) (b) f ≡g a-d b-f a-f f d c b a a-d b-g a-g a-g b-f a-d a-b g f d c b (c) a ≡c, b ≡d, b ≡e, d ≡e 0 1 0 1 a b a 0 1 b b b 0 0 6. (a) 1) Some input sequences to the circuit may not occur and 2) the output may be observed at only some time periods.
(b) S0 S3 S2 S1 S1 S2 S1, S2 S0, S3 S1, S2 Maximal Compatibles: (S0, S1), (S1, S2), (S0, S3). (S0, S3) and (S1, S2) produce a two-state reduced table.
X = 0 1 0 1 (S0, S3) = S0 S1 S0 0 1 (S1, S2) = S1 S1 S0 1 0 Answers to Selected Study Guide Questions and Problems 765 (c) S0 S3 S2 S1 S1 S2 S1, S3 S0, S2 S0, S2 X = 0 1 0 1 S0 – S1 – – S1 S2 S3 – – S2 S0 – 0 – S3 S0 – 1 – X = 0 1 0 1 (S0, S1, S2) = S0 S0 S1 0 – (S0, S1, S3) = S1 S0 S1 1 – (b) 7 . (b) Z = X′AB′ + XA′BC′ 8. (b) Interchanging columns or complementing columns does not affect circuit cost for symmetric flip-flops.
(c) Complementing columns (to make the first row all 0’s) does not change the cost of the circuit. (f ) Numbering columns from left to right, column 3 is same as column 4, column 2 is column 5 complemented, column 1 is column 6 complemented.
9. (e) D1 = XQ1 ′ + XQ3 + Q2Q3 ′ + X′Q1Q2 ′ or D1 = XQ1 ′ + XQ2 + Q2 ′Q3 + X′Q1Q3 ′, D2 = Q3, D3 = X′Q3 + XQ2Q3 ′ + (Q1 ′Q3 or Q1 ′Q2) Z = XQ2Q3 + X′Q2 ′Q3 + X′Q2Q3 ′ (f ) J1 = X, K1 = X′Q2Q3 + XQ2 ′Q3 ′ 11. (b) Q+ 5 = XQ2 + X′YQ2 + X′Q5 (c) Q2 + = Q1M Q3 + = Q2K + Q1KM′ (d) Ad = Q1M Done = Q3 UNIT 15 Answers to Problems 15.1 (a) Maximal Compatibles: (S0, S1, S2), (S0, S1, S3) Next State Output Present State X = 0 X = 1 X = 0 X = 1 A A C 1 0 B C F 0 0 C B A 0 0 F B F 1 0 Input 1 0 0 Output (from B) 0 1 0 Output (from G) 0 1 1 766 Appendix E 15.2 Present State Next State Output X = 0 X = 1 a c c 1 c d f 0 d f a 1 f c d 0 15.3 (a) No, states S2 and S4 have no corresponding states in Mr. Ipflop’s design.
(b) Because there is no way of reaching S2 and S4 by starting from S0, the two circuits would perform the same.
15.4 (a) D = X1 ′X2Q′ + X1X2 ′Q′ + X2 ′X3Q + X2X3 ′Q (b) S = X1 ′X2Q′ + X1X2 ′Q′ R = X2 ′X3 ′Q + X2X3Q 15.5 (a) Only one assignment—000 001 011 OR 010 etc.
101 100 (b) 000 000 000 000 000 000 000 000 000 000 001 001 001 001 001 001 001 001 001 001 etc.
010 010 010 010 011 011 011 011 110 110 100 101 110 111 100 101 110 111 010 011 15.6 (a) (b) S1 S2 0 1 S4 S3 S6 S5 S7 00 BC Z = A A 01 11 10 S8 S1 S8 0 1 S7 S5 S3 S4 S2 00 BC DA = A+ = A′B′ + XA′ + X′AC′ DB = B+ = etc.
DC = C+ = etc.
A 01 11 10 S6 A C 0 1 B E F D 00 Q2Q3 Q1 01 11 10 15.7 (a) (b) D1 = XQ1 D2 = Q1 ′Q3 ′ + X′Q1 ′ D3 = X′Q1 ′Q3 ′ + XQ1 ′Q3 + 5XQ2 ′ or Q2Q36 Z = XQ1 Answers to Selected Study Guide Questions and Problems 767 15.8 (a) A = 00, B = 01, C = 10, D = 11 (b) T1 = X1 ′X2Q2 ′ + X1 ′Q1Q2 + X1Q1 ′Q2 + X1X2 ′ T2 = X1Q1 ′Q2 ′ + X1Q1Q2 Z1 = X1Q2, Z2 = X1 ′Q1 + Q1Q2 ′ 15.9 Q1 Q2 Q3 Assign S0 1 0 0 S1 0 1 0 ROM 24 Words 4 Bits Per Word D D Clock Q1 Q2 Q1 + Q2 + Z2 Z1 X2 X1 D1 = X′Q1 + XY′Q3 D2 = XQ1 + YQ3 + X′Q2 D3 = XQ2 + X′Y′Q3 P = XQ1 + Y′Q3 + XQ2 S = X′Q1 + XY′Q3 UNIT 16 Study Guide Answers 1. (a) Because the input sequences are listed in reverse order 2. (b) m leads, where 2m−1 < n ≤2m 3. (b) 64 words × 7 bits (d) Z = 0, D1 = 1, D2 = 1, D3 = 0; Q1Q2Q3 = 110 8. (a) Yes (c) Yes 9. (a) After the clock (when the state has just changed) and before the input is set to its new value, the output may be wrong (false output).
(b) No, because the output is always correct before the active clock edge UNIT 16 Answers to Problems 16.15 X1 X2 Q1 Q2 Q1 + Q2 + Z1 Z2 0 0 0 0 1 1 0 0 0 0 0 1 0 0 1 0 0 0 1 0 1 1 0 0 0 0 1 1 1 0 0 0 0 1 0 0 1 0 1 0 0 1 0 1 0 1 1 0 0 1 1 0 0 0 1 0 0 1 1 1 1 0 0 0 1 0 0 0 0 1 1 1 1 0 0 1 1 0 1 1 1 0 1 0 0 1 1 1 1 0 1 1 0 1 0 1 1 1 0 0 0 0 0 1 1 1 0 1 1 1 1 1 1 1 1 0 0 1 0 1 1 1 1 1 0 0 0 1 768 Appendix E 16.16 (a) Same as Figure 16-10 with ROM replaced by PLA.
(b) X A B C Z DA DB DC 0 – – – 0 1 0 0 0 – – 0 0 0 1 0 – 0 – 1 0 0 1 0 – 0 1 – 0 0 1 0 – 1 – – 0 0 0 1 1 – 0 – 0 0 0 1 0 1 0 1 1 0 0 0 1 0 1 0 1 0 0 0 16.17 (a) 0 0 S0 0 0 1 1 1 1 S1 0 0 S2 0 S3 1 (b) ai+1 = ai + xi bi = [ai ′(xi bi)′]′ bi+1 = xi bi ′ + xi ′ bi = [(xi bi ′)′(xi ′ bi)′]′ z = an+1bn+1 (c) a1 = b1 = 0, a2 = 0, b2 = x1 (d) Similar to Figure 16-9 with one output UNIT 17 Study Guide Answers 1. (a) When a falling edge of CLK occurs (b) Whenever there is a change in St or Q1 or V (c) Statements S3 and S4 will execute (d) The code represents a rising-edge-triggered D flip-flop with asynchronous, active-low clear and preset. Because ClrN has higher priority, Q will be set to ‘0’ when both ClrN and SetN are ‘0’.
(e) SN and RN override J and K, including at a clock edge. Q will be ‘0’. (f ) They will get the old value of Qint because of the 8-ns delay.
2. (a) entity register is port (CLK, CLR, Ld: in bit; D: in bit_vector (3 downto 0); Q: out bit_vector (3 downto 0)); end register; architecture eqn of register is begin -- Given code here end eqn; (b) Q will change at time 10 + Δ ns (c) On line 6 of the VHDL code, make this change— elsif LS = ‘1’ then Q <= Q (2 downto 0) & Q (3); Answers to Selected Study Guide Questions and Problems 769 (d) Change the indicated lines of code as shown— line 3: process (ClrN, CLK) lines 5 to 7: if ClrN = ‘0’ then Q <= “0000”; elsif CLK’event and CLK = ‘1’ then if En = ‘1’ then Q <= Q + 1; (e) When Carry1 = ‘1’ and Qout2 = “1111” (f ) No overloaded “+” operator is defined for bit_vectors (g) After the rising edge, Qout1 = “0000” and Qout2 = “1010” (h) Control Signals Next State ClrN LdN PT Q+ 3 Q+ 2 Q+ 1 Q+ 0 X 0 X D3 D2 D1 D0 X 1 1 Present state + 1 0 1 0 0 0 0 0 1 1 0 Q3 Q2 Q1 Q0 3. (a) process (A, B, D) begin E <= (A and B) or D after 5 ns; end process; 4. (a) Nextstate = S4 and Z = 1 (b) Because there are only seven states. Also, specifying the range restricts the number of bits used to represent the integer. When X changes to 1, Nextstate = 2, and Z = 0. Then, when CLK changes to 1, State = 2, Nextstate = 4, and Z = 1 (c) The glitch occurs because the change in state and change in the value of X a little while later causes process (State, X) to execute two times, thereby updating the value of Nextstate two times. This glitch does not affect the ‘state’ because the state will not be updated until the next positive clock edge.
(d) Because Q1, Q2, and Q3 must be updated only on the CLK edge, the other signals must not appear on the sensitivity list. The new values will be com-puted at 5 ns, and the values are updated at 15 ns.
(e) The statements of lines 13, 14, and 18 will execute. (f ) ROM output = 1100 5. (a) Connect En to CE and A to D (b) See Figure 11-31(c) (change to rising-edge trigger) (c) Use four D-CE flip-flops. Connect ASR to every CE input, D3 to Q3, D2 to Q3, D1 to Q2, and D0 to Q1. Label Q3 . . . Q0 as A(3) . . . A(0).
6. (a) process begin A <= B or C; wait on B, C; end process; (b) 2 ns (Both sequential statements execute immediately with no delay.) 770 Appendix E UNIT 17 Answers to Problems 17 .1 Code to implement a T flip-flop entity tff is port (t, clk, clrn: in bit; q, qn: out bit); end tff; architecture eqn of tff is signal qint: bit; -- Internal value of q begin q <= qint; qn <= not qint; process (clk, clrn) begin if clrn = ‘0’ then qint <= ‘0’; elsif clk’event and clk = ‘1’ then qint <= (t and not qint) or (not t and qint); end if; end process; end eqn; 17 .2 Right-shift register with synchronous reset entity rsr is Port (clk, clr, ld, rs, lin: in bit; d: in bit_vector(3 downto 0); q: out bit_vector(3 downto 0)); end rsr; architecture eqn of rsr is signal qint: bit_vector(3 downto 0); begin q <= qint; process (clk) begin if clk’event and clk = ‘1’ then if clr = ‘1’ then qint <= “0000”; elsif ld = ‘1’ then qint <= d; elsif rs = ‘1’ then qint <= lin & qint(3 downto 1); end if; end if; end process; end eqn; Answers to Selected Study Guide Questions and Problems 771 17 .3 (a) 4-bit binary up/down counter entity updown is Port (clrn, clk, load, ent, enp, up: in std_logic; d: in std_logic_vector(3 downto 0); q: out std_logic_vector(3 downto 0); co: out std_logic); end updown; architecture eqn of updown is signal qint: std_logic_vector(3 downto 0) := “0000”; begin q <= qint; co <= (qint(3) and qint(2) and qint(1) and qint(0) and ent and up) or (not qint(3) and not qint(2) and not qint(1) and not qint(0) and ent and not up); process (clrn, clk) begin if clrn = ’0’ then qint <= “0000”; elsif clk’event and clk = ’1’ then if load = ’0’ then qint <= d; elsif (ent and enp and up) = ’1’ then qint <= qint + 1; elsif (ent and enp and not up) = ’1’ then qint <= qint – 1; end if; end if; end process; end eqn; 17 .3 (b) 8-bit binary up/down counter. (For block diagram, connect the carry-out of the first counter to ENT of the second.) entity updown8bit is Port (clrn, clk, load, ent, enp, up: in std_logic; d: in std_logic_vector(7 downto 0); q: out std_logic_vector(7 downto 0); co: out std_logic); end updown8bit; architecture structure of updown8bit is component updown is Port (clrn, clk, load, ent, enp, up: in std_logic; d: in std_logic_vector(3 downto 0); q: out std_logic_vector(3 downto 0); co: out std_logic); end component; signal co1: std_logic; signal q1,q2: std_logic_vector(3 downto 0); 772 Appendix E begin c1: updown port map (clrn, clk, load, ent, enp, up, d(3 downto 0),q1,co1); c2: updown port map (clrn, clk, load, co1, enp, up, d(7 downto 4),q2, co); q <= q2 & q1; end structure; 17 .4 MUX with a and b as control inputs entity mymux is Port (a, b, c, d: in bit; z: out bit); end mymux; architecture eqn of mymux is signal sel: bit_vector(1 downto 0); begin sel <= a & b; process (a, b, c, d) begin case sel is when “00” => z <= not c or d; when “01” => z <= c; when “10” => z <= not c xor d; when “11” => z <= not d; end case; end process; end eqn; 17 .5 Implements the state machine of Table 14-1 entity sm1 is Port (x, clk: in bit; z: out bit); end sm1; architecture table of sm1 is signal State, Nextstate: integer range 0 to 2 := 0; begin process (State, x) begin case State is when 0 => if x = ’0’ then Nextstate <= 0; else Nextstate <= 1; end if; z <= ‘0’; when 1 => if x = ’0’ then Nextstate <= 2; else Nextstate <= 1; end if; z <= ‘0’; Answers to Selected Study Guide Questions and Problems 773 when 2 => if x = ’0’ then Nextstate <= 0; z <= ‘0’; else Nextstate <= 1; z <= ‘1’; end if; end case; end process; process (clk) begin if clk’event and clk = ’0’ then State <= Nextstate; end if; end process; end table; 17 .6 (a) See Figure 13-17 , with m = 2, n = 2, and k = 2.
(b) Implements the state machine of Table 13-4 library BITLIB; use BITLIB.bit_pack.all; entity sm is Port (x1, x2, clk: in bit; z1,z2: out bit); end sm; architecture Behavioral of sm is type rom16_4 is array (0 to 15) of bit_vector(3 downto 0); -- Input is in the order X1 X2 Q1 Q2 -- Output in order Q1 Q2 Z1 Z2 constant myrom: rom16_4 := (“1100”, “0010”, “1100”, “1000”, “1010”, “0110”,“0010”, “1000”, “0111”, “1011”, “0111”, “0101”, “0001”, “1111”, “0101”, “0001”); signal index: integer range 0 to 15; signal q1,q2: bit; signal rom_out: bit_vector(3 downto 0); begin index <= vec2int(x1&x2&q1&q2); rom_out <= myrom(index); z1 <= rom_out(1); z2 <= rom_out(0); process(clk) begin if clk’event and clk = ’1’ then q1 <= rom_out(3); q2 <= rom_out(2); end if; end process; end Behavioral; 774 Appendix E 17 .7 (a) There are two D-CE flip-flops. For each, CE = LdA + LdB. D1 = LdA A1 + LdA′ LdB B1, D2 = LdA A2 + LdA′ LdB B2.
(b) CE does not change. For each D input, replace the gates with a 2-to-1 MUX, with LdA as the control input, and B and A as the data inputs for 0 and 1, respectively. (Alternately, use LdB as the control input, and swap A and B on the data inputs.) 17 .8 All statements execute at time = 20 ns A becomes 1 at 35 ns (not the final value) B becomes 1 at 20 ns + Δ (not the final value) C becomes 1 at 30 ns D becomes 2 at 23 ns A becomes 5 at 35 ns (overrides the previous value) B becomes 7 at 20 ns + Δ (overrides the previous value) UNIT 18 Study Guide Answers 1. (a) X Y ci si c+ i t0 0110 0011 0 1 0 t1 1011 1001 0 0 1 t2 0101 1100 1 0 1 t3 0010 0110 1 1 0 t4 1001 0011 0 (0) (1) (b) Y would fill up with 0’s from the left: 0011, 0001, 0000, 0000, 0000.
(c) S0 and Y0, no.
2. (a) add 0 0 0 0 0 1 1 0 1 1 1 1 1 shift 0 1 1 1 1 1 1 0 1 shift 0 0 1 1 1 1 1 1 0 add 0 0 0 1 1 1 1 1 1 1 1 1 1 shift 1 0 0 1 0 1 1 1 1 add 0 1 0 0 1 0 1 1 1 1 1 1 1 shift 1 1 0 0 0 0 1 1 1 0 1 1 0 0 0 0 1 1 (b) 10, 6. (c) 10, 6. (d) 15 bits (f ) Product register has 17 bits. Adder is 8 bits wide, multiplicand has 8 bits. 18 states. 3-bit counter, K = 1 when counter is in state 7 (1112), control graph unchanged.
3. (b) Change Y to 2’s complement by inverting each bit and adding 1 (by setting the carry input of the first full adder to 1). Also change C so that it is equal to the carry out of the last full adder.
(c) An overflow will occur if X8X7X6X5X4 ≥Y3Y2Y1Y0, because subtraction is possible but there is no place to store the quotient bit, since there are only 4 bits available to store the quotient. (f ) To set the quotient bit to 1.
Answers to Selected Study Guide Questions and Problems 775 UNIT 18 Answers to Problems 18.3 Control Circuit SI Sh x3 St Clock x2 x1 x0 SI CE D Q Sh Sh y x d b x′ y y x′ y3 x4 y4 y2 y1 y0 Full Adder x1 y2 x2 y1 Full Adder x3 y1 Full Adder x3 y2 Full Adder x3 y3 Full Adder x1 y3 x1 Z1 Z2 Z3 S4 0 S5 0 S3 0 S2 1 S1 0 S6 C7 1 1 C6 1 C5 1 C4 1 C3 1 C2 1 0 0 1 1 1 1 1 0 1 1 1 1 Z4 Z5 Z6 y1 x2 y2 Full Adder x2 y3 18.4 776 Appendix E 18.5 18.6 St′ 0 St Load – Done M′ Sh M′ Sh M′ Sh M′ Sh M Ad M Ad M Ad M Ad S4 S1 S3 S2 S0 S5 S0 (Stop) S2 S1 S3 C′ 0 C Su K′C′ Sh KC′ Sh C Su C V St′ 0 St Load C′ Sh 18.7 (a) V = y0 ′y1 ′y2 ′y3 ′y4 ′ = (y0 + y1 + y2 + y3 + y4)′ (b) (c) (0 0 1 0 1) Sh Su 0 0 0 0 0 1 1 0 1 0 1 0 0 0 0 0 1 1 0 1 0 0 1 0 0 0 0 1 1 0 1 0 0 0 1 0 0 0 1 1 0 1 0 0 0 0 0 1 0 0 0 0 1 1 0 0 0 1 1 0 0 0 0 1 1 0 0 0 1 0 1 0 0 0 1 1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 1 0 1 remainder = 1 quotient = 5 , S0 S3 S1 S5 S2 S4 V 0 C′ 0 C Su St′ 0 StV′ Sh C′ Sh C′ Sh C′ Sh C′ Sh C Su C Su C Su C Su (d) After five shifts, the division is complete.
18.8 (a) xin = K1 ′K2 ′a′ + K1 ′K2b + K1K2 ′(a ⊕ b) + K1K2a yin = K1 ′K2 ′b + K1 ′K2a + K1K2 ′ · 0 + K1K2 · 1 (b) Use the state graph of Figure 18-6(b), with nine states total.
(c) 00 01 10 11 a a b a k1 k2 xin 00 01 10 11 b a 1 0 b yin Answers to Selected Study Guide Questions and Problems 777 UNIT 19 Study Guide Answers 1. (b) Z1, Z2, Z4 (for both charts) (d) 2. (a) 0 0 0 0 1 1 1 0 0 C = 0, Sh 0 0 0 1 1 1 0 0 0 C = 0, Sh 0 0 1 1 1 0 0 0 0 C = 1, Su 0 0 0 1 0 0 0 0 1 C = 0, Sh 0 0 1 0 0 0 0 1 0 C = 0, Sh 0 1 0 0 0 0 1 0 0 C = 1, Su 0 0 0 1 1 0 1 0 1 (result) 3. (a) A+ = BX B+ = A′X + BX UNIT 19 Answers to Problems 19.1 19.2 Z2 Z1 S0 S0 S1 S2 S0 Zc Zb Za X State Clock P Q S R 0 1 1 0 1 (1) (2) 0 D E F S0/ S2/ S1/ Z Z Z X X X S3/ Z X 0 1 1 0 1 0 0 1 778 Appendix E 19.3 Sh Ad K M State S0 S1 S2 S1 S1 S2 S3 Clock 19.4 19.5 S0/ St 0 1 S1/ Sh Ad M 1 0 S4/ Sh Ad M 1 0 ...
S0/ S2/ N 0 1 X X K K K 1 0 1 0 0 1 1 0 0 1 0 1 S1/ X Z Z Z Answers to Selected Study Guide Questions and Problems 779 19.6 S0/ St S1/ S2/ 0 1 C 1 0 1 0 C 1 0 K C 0 1 V Sh Su Sh Su 19.7 (a) Q+ 0 = Q0 ′Q1 ′Q2C′ + Q0Q1 ′ + Q0Q2 ′ Q+ 1 = Q0Q1 ′Q2C′ + Q0Q1Q2 ′ Q+ 2 = Q0 ′Q1 ′Q2 ′St + Q0Q2 ′C′ + Q0Q1 ′Q2C Load = Q0 ′Q1 ′Q2 ′St, Su = Q0C, Sh = Q1 ′Q2C′ + Q0Q2 ′C′, V = Q0 ′Q1 ′Q2C (These equations could be further simplified using don’t-cares.) (b) Q+ 0 = Q0 ′Q1M + Q0 ′Q1M′K + Q0Q1K Q+ 1 = Q0 ′Q1 ′St + Q0 ′Q1M′K′ + Q0 ′Q1M + Q0Q1K′ Load = Q0 ′Q1 ′St, Sh = Q0Q1 + Q0 ′Q1M′, Ad = Q0 ′Q1M, Done = Q0Q1 ′ 19.8 (a) A+ = A′B′C · Rb′D7 ′11D2 ′312 + AB′C′ + AB′ · Rb + AB′Eq′D7 ′ B+ = A′B′C · D711 + A′B · Reset′ + AB′C · Rb′Eq′D7 ′ C+ = A′B′Rb + A′BC · Reset′ + B′C′Rb + AB′C · Rb′Eq′D7 Roll = B′C · Rb Sp = A′B′C · Rb′D7 ′11D2 ′312 Win = A′BC′ Lose = A′BC (These equations could be further simplified using don’t-cares.) (b) If the input from the adder is S3S2S1S0, then the equations realized by the test logic block are D7 = S2S1S0 D711 = S1S0(S2 + S3) D2312 = S3 ′S2 ′ + S3S2 19.9 (a) A+ = BX Za = A′B′ Z1 = ABX′ B+ = A′X + BX Zb = A′B Z2 = ABX Zc = AB 780 Appendix E X A B A+ B+ Za Zb Zc Z1 Z2 1 – 1 1 1 0 0 0 0 0 1 0 – 0 1 0 0 0 0 0 – 0 0 0 0 1 0 0 0 0 – 0 1 0 0 0 1 0 0 0 – 1 1 0 0 0 0 1 0 0 0 1 1 0 0 0 0 0 1 0 1 1 1 0 0 0 0 0 0 1 19.10 (a) Z3 Z2 Z1 X3 X2 X1 State Clock S0 S0 S1 S2 S1 S1 S2 (b) D1 = Q1 ′X1 ′X2 ′X3 + Q2X2 ′ D2 = Q2 ′X1 + Q1 ′Q2 ′X2 ′X3 ′ + Q2X2 Z1 = Q2 ′X1 ′ + Q1 Z2 = Q1 ′Q2 ′X1 Z3 = Q1 ′X1 ′X2 + Q2 (c) Q1 Q2 X1 X2 X3 D1 D2 Z1 Z2 Z3 0 0 1 – – 0 1 0 1 0 0 0 0 1 – 0 0 1 0 1 0 0 0 0 1 1 0 1 0 0 0 0 0 0 0 0 1 1 0 0 0 1 – 0 – 1 0 0 0 1 0 1 – 1 – 0 1 0 0 1 1 0 0 – – 0 0 1 0 0 1 0 1 – – 0 1 1 0 0 (d) 25 × 5 ROM Q1 Q2 X1 X2 X3 D1 D2 Z1 Z2 Z3 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 1 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 1 1 0 0 1 0 1 0 0 1 0 0 0 1 0 1 0 Answers to Selected Study Guide Questions and Problems 781 UNIT 20 Study Guide Answers 1. (a) lines 15 and 16 The full adder is combinational logic.
Lines 34 and 35, which are in clocked process because it is a clocked register (b) In line 31, change clk = ‘0’ to clk = ‘1’.
2. (a) So we can use the overloaded “+” operator The change from state 9 to state 0 To make the result be 5 bits Lines 35 and 36 will execute when State is 2, 4, 6, or 8.
(b) ACC is uninitialized and is not loaded until St = ‘1’ at a rising clock edge. When Done = 1, i.e., in state 9, 160–180 ns.
(c) X = 101111001, 60 ns (d) Mcand = 1101, Mplier = 1011, and product is 10001111 = 143 (e) Line 19 To avoid having to set them to 0 in each case where they are not 1. When they are set to 1, it overrides line 22 because these are sequential statements. ACC <= “00000” & Mplier; Because it is a clocked register that is updated on the rising clock edge.
The process executes on the rising clock edge, and when state is 9 at the rising clock edge, it is too late; the state is about to change to 0.
The process of lines 20–34 is not clocked; it executes when State changes to 9.
(f ) Whenever the value of count changes.
Lines 51 and 52.
10 ns + Δ.
Sequential statements execute in 0 time, so A and B update simultaneously.
(g) At time 60 ns, we are in state 2 when K = 0, so Sh = 1. So A = 00B16 = 0000010112 shifts to the right to become 00516 = 0000001012. At time 140 ns, we are in state 1 and M = 1, so Ad = 1. So we add the mul-tipicand, 0000010112, to A = 00616 = 0000001102 to get 01116 = 0000100012.
3. (a) 0; 1 C should be 1 iff we can subtract, i.e., Dividend(8 downto 4) > Divisor. UNIT 20 Answers to Problems 20.1 First process executes at t = 2 ns. Lines 22–25 execute.
Second process executes at t = 10 ns. Lines 38–40 and 43 execute.
Because the state changes, first process executes again at 10 + Δ ns. Lines 22–23 and lines 27–30 execute.
20.2 entity complementer is Port (clk, n: in std_logic; Regout: out std_logic_vector(15 downto 0)); end complementer; architecture Behavioral of complementer is signal State, NextState: integer range 0 to 2 := 0; signal count: std_logic_vector(3 downto 0) := ”0000“; --4-bit counter 782 Appendix E signal X, Z, Sh: std_logic; signal K: std_logic := ’0’; signal Reg: std_logic_vector(15 downto 0); begin Regout <= Reg; X <= Reg(0); K <= ’1’ when count = “1111“ else ’0’; process (State, X, N, K) begin case State is when 0 => if N = ’0’ then NextState <= 0; Sh <= ’0’; Z <= ’0’; elsif X = ’1’ then NextState <= 2; Sh <= ’1’; Z <= ’1’; else NextState <= 1; Sh <= ’1’; Z <= ’0’; end if; when 1 => Sh <= ’1’; if K = ’1’ then NextState <= 0; if X = ’1’ then Z <= ’1’; else Z <= ’0’; end if; elsif X = ’0’ then NextState <= 1; Z <= ’0’; else NextState <= 2; Z <= ’1’; end if; when 2 => Sh <= ’1’; if K = ’1’ then NextState <= 0; if X = ’1’ then Z <= ’0’; else Z <= ’1’; end if; elsif X = ’0’ then NextState <= 2; Z <= ’1’; else NextState <= 2; Z <= ’0’; end if; end case; end process; process (clk) begin if clk’event and clk = ’1’ then if Sh = ’1’ then Reg <= Z & Reg(15 downto 1); count <= count + 1; end if; State <= NextState; end if; end process; end Behavioral; 20.4 entity test is end test; architecture Behavioral of test is component sm17_2 is Port (x,clk: in std_logic; z: out std_logic); end component; constant N: integer:= 40; Answers to Selected Study Guide Questions and Problems 783 signal flag: std_logic:= ‘0’; signal clk: std_logic:= ‘1’; signal x,z: std_logic; constant x_seq: std_logic_vector(1 to 40) : = (“0000100001001100001010100110111000011001”); constant z_seq: std_logic_vector(1 to 40) : = (“1100001010100110111000011001010111010011”); begin sm1: sm17_2 port map(x,clk,z); clk <= not clk after 10 ns; -- clock has 20 ns period process begin for i in 1 to N loop x <= x_seq(i); wait for 5 ns; -- wait for z to become stable if z = z_seq(i) then flag <= ‘0’; else flag <= ‘1’; end if; wait until clk’event and clk = ‘1’; wait for 5 ns; end loop; end process; end Behavioral; 20.5 Ld Clr Accumulator (7:0) Adder Mcand (3:0) McandData Add Add Done Init Init 8 4 4 4 8 8 MplierData Clk Sum Product Ld Init Clk Dec Ld Mplier (3:0) Down Counter Add Init Clk Start Control Circuit Start/Init Start/Done K/Done Start′/0 Start′/0 K′/Add K S1 S2 S0 784 Appendix E 20.6 entity prob20_6 is Port (st, clk: in std_logic; X: in std_logic_vector(7 downto 0); Z: out std_logic_vector(9 downto 0)); end prob20_6; architecture Behavioral of prob20_6 is signal State, NextState: integer range 0 to 3 := 0; signal lda, ldb, ldc, ad: std_logic; signal B, C: std_logic_vector(7 downto 0); signal A: std_logic_vector(9 downto 0); signal sumAB: std_logic_vector(8 downto 0); signal sumABC: std_logic_vector(9 downto 0); begin sumAB <= (“0“&A(7 downto 0)) + B; sumABC <= (“0“&sumAB) + C; Z <= A; process (st, State) begin lda <= ‘0‘; ldb <= ‘0‘; ldc <= ‘0‘; ad <= ‘0‘; case State is when 0 => if st = ‘1‘ then lda <= ‘1‘; NextState <= 1; else NextState <= 0; end if; when 1 => ldb <= ‘1‘; NextState <= 2; when 2 => ldc <= ‘1‘; NextState <= 3; when 3 => ad <= ‘1‘; lda <= ‘1‘; NextState <= 0; end case; end process; process(clk) begin if clk‘event and clk = ‘1‘ then if lda = ‘1‘ then if ad = ‘1‘ then A <= sumABC; else A <= (“00“ & X); end if; elsif ldb = ‘1‘ then B <= X; elsif ldc = ‘1‘ then C <= X; end if; State <= NextState; end if; end process; end Behavioral; 785 References 1. Ashenden Peter J. The Designer’s Guide to VHDL, 3rd ed. San Francisco: Morgan Kaufmann Publishers, 2008.
2. Bhasker, J. A Guide to VHDL Syntax. Upper Saddle River, NJ: Prentice-Hall, 1995.
3. Bhasker, J. VHDL Primer, 3rd ed. Upper Saddle River, NJ: Prentice-Hall, 1999.
4. Brayton, Robert, et al. Logic Minimization Algorithms for VLSI Synthesis. Secaucus, NJ: Springer, 1984.
5. Givone, Donald D. Digital Principles and Design. New York: McGraw-Hill, 2003.
6. Katz, Randy H. and Gaetano Borriello. Contemporary Logic Design, 2nd ed. Upper Saddle River, NJ: Prentice Hall, 2004.
7. Mano, M. Morris and Michael D. Ciletti, Digital Design, 5th ed. Upper Saddle River, NJ: Prentice Hall, 2012.
8. Mano, M. Morris and Charles R. Kime. Logic and Computer Design Fundamentals, 4th ed. Old Tappan, NJ: Pearson Prentice Hall, 2008.
9. Marcovitz, Alan B. Introduction to Logic Design, 3rd ed. New York: McGraw-Hill, 2009.
10. McCluskey, Edward J. Logic Design Principles. Upper Saddle River, NJ: Prentice Hall, 1986.
11. Miczo, Alexander. Digital Logic Testing and Simulation, 2nd ed. New York: John Wiley & Sons, Ltd West Sussex, England, 2003.
12. Patt, Yale N. and Sanjay J. Patel. Introduction to Computing Systems: From Bits and Gates to C and Beyond, 3rd ed. New York: McGraw-Hill, 2013.
13. Roth, Charles H. Jr. and Lizy Kurian John. Digital Systems Design Using VHDL, 2nd ed. Toronto, Ontario: Cengage Learning, 2008.
14. Rushton, Andrew. VHDL for Logic Synthesis, 3rd ed. West Sussex, England: John Wiley & Sons, Ltd, 2011.
15. Wakerly, John F. Digital Design Principles & Practices, 4th ed. Upper Saddle River, NJ: Prentice Hall, 2006.
16. Weste, Neil and David Harris. CMOS VLSI Design: A Circuits and Systems Perspective, 4th ed. Boston: Addison-Wesley, 2010.
786 786 Symbols ' ', VHDL bit values, 302 " ", string literals, 314 ', complementation operation, 37 , 39 --, VHDL comments, 302 {}, clause repetitions, VHDL, 306–307 +, inclusive OR operation, 38–39, 43–46 <=, concurrent statement assignment operator, 299 ·, AND operation, 38–39, 43–46 ⊕, exclusive OR operation, 68–70 Δ, delta time delay, 321–322 ≡, equivalence operation, 69–70 A Absorption theorems, 46–47 , 49 Accumulator, 378–380, 629–633 parallel adder with, 378–380 serial adder with, 629–633 Active-low clear and preset inputs, 352–353 Adder design, 104–107 , 108–114, 307–311, 320–321, 378–380, 629–633, 688–689 accumulator with, 378–380, 629–633 binary algebra for, 108–114 carry-lookahead, 111–114 design of, 108–114 full, 108–110 IEEE standard logic and, 320–321 parallel, 108–110, 378–380 registers for, 378–380, 629–631 serial, 629–633, 688–689 subtracter using, 110–111 truth tables created for, 104–107 VHDL code for, 688–689 VHDL modules, 307–311, 318–321 Addition 1’s Complement 19–20 2’s Complement 17–19 Addresses, memory and, 271 After delay expressions, [ ], 301–303, 305 Algorithmic state machine (ASM) charts, 662. See also State machine (SM) charts Alphanumeric graph notation, 476–478 American Standard Code for Information Interchange (ASCII) code, 23 AND operation (·), 38–39, 43–46 AND-OR circuits, 200 Architecture declaration, VHDL, 306–308 Arithmetic operation circuits, 626–659 binary divider, 637–643 binary multiplier, 633–637 serial adder with accumulator, 629–633 Arrays, 312–314 declaration of type, 312–313 unconstrained types, 313–314 string literals, " ", 314 Assignment operator (<=), concurrent statements, 299 Assignment statements, 299–305 combinational circuits, 299–303 conditional statements, 304–305 concurrent statements, 300–303, 305 multiplexers, 304–305 VHDL signals, 299–303 Associative laws, 43–44, 46 Asynchronous clear and preset inputs, 353 Asynchronous sequential circuits, 354–357 B Base, number systems, 9 begin keyword, 306, 311, 590–591 Behavioral description, 300 Bi-directional I/O Pin VHDL Binary arithmetic, 12–15 Binary-coded-decimal (BCD) representation, 21–22 Binary codes, 21–23 Binary counter, 384–389 Binary divider design, 637–643, 667–668, 700–702 Binary logical operators, VHDL, 315 Binary multiplier design, 633–637 , 668, 690–700 Bit values ' ', VHDL, 302 Boolean algebra, 29–86, 87–122 absorption theorems, 46–47 , 49 associative laws, 43–44, 46 cancellation law, 76 combinational logic design and, 96–97 commutative laws, 43, 46 complementarity laws, 42, 46 complementing expressions, 52–53 consensus theorem, 47 , 49, 70–72 conversion of English sentences to, 94–96 definition, 45–46 DeMorgan’s laws, 45–46, 52–53 distributive laws, 45, 46, 66–68 don’t-care minterms, 103–104 duality, 49 elimination theorems, 47–48, 49 expansion, 97–103 expressions, 39–41, 49–52, 66–68, 72–74 idempotent laws, 42, 46 incompletely specified functions, 103–104 involution law, 42, 46 laws of, 43–46 maxterm functions, 97–103 minterm functions, 97–103 operations for, 37–39, 68–70 simplification theorems for, 46–49 subtracter design using, 110–111 switching circuit design, 37–39, 42–43 switching devices and, 37–38 switching expressions, 72–74 theorems for, 41–43, 46–49 truth tables, 40–41, 96–97 , 104–107 uniting theorems, 46–47 , 49 valid equations, proof of, 74–76 Boolean expressions, 39–41, 49–53, 66–68, 72–74, 139–140, 142–143, 152–153 adding redundant terms, 73 algebraic simplification of, 72–74 combining terms, 72 complement of, 52–53 eliminating literals, 73 eliminating terms, 73 evaluation of, 40 factoring using Karnaugh maps, 152–153 inverse of, 52–53 Karnaugh maps for, 139–140, 142–143, 152–153 literals, 40 multiplying out and factoring, 49–52, 66–68 product of sums (POS), 50–51 simplification of, 46–52, 139–140, 142–143 sum of products (SOP), 49–50, 51 switching expressions, 72–74 truth tables and, 40–41 Boolean operations, 37–39, 43–46, 68–70 AND (·), 38–39, 43–46 associative laws, 43–44, 46 commutative laws, 43, 46 complementation ('), 37 , 39 DeMorgan’s laws, 45–46 distributive laws, 45, 46 equivalence (≡), 69–70 exclusive OR (⊕), 68–70 inclusive OR (+) operation, 38–39, 43–46 inversion ('), 37 , 39 Borrowing process, 14–15 Index Index 787 Buffers, 265–268, 279 multiplexer (MUX) gate connections, 265–268 programmable array logic devices (PAL) gate connections, 279 Bus merger, 641–642 Bus splitter, 641–642 C Cancellation law, 76 Carry, 12 end-around, 19–20 flip-flop, 428, 630–632 Carry-lookahead adder, 111–114 case statement, 600–601 Charts, see Prime implicants; Timing diagrams Circuit design, 6–8 Clause repetitions, {}, 306–307 Clock enable, 354 Clock skew, 434–435 Clock speed, 434 Clocked sequential circuits, 412–452 general models for, 432–436 Mealy machine, 422–424, 432–435 Moore machine, 421–424, 435–436 Moore state graphs, 426–430 parity checker, 419–421 signal tracing, 421–424 state tables, 425–432 timing charts (diagrams), 421–424, 430–432 transition tables, 425–432 Closed circuits, 43 CMOS logic, 713–718 Code converter design, 549–552 Code synthesis, VHDL, 608–611, 705–706, 724–726 Combinational circuits, 7 , 96–97 , 225–251, 299–303 behavioral description, 300 concurrent assignment statements, 300–303 dataflow description, 300 gate delays, 232–235 hazards in combinational logic, 234–240 high-impedance (hi-Z) connections, 241 input/output value problems, 241–242 limited gate fan-in design, 230–232 logic design for, 96–97 , 229–230 sequential circuits compared to, 7 signal delays, 301–303 simulation of, 240–242 testing of, 240–242 timing diagrams for, 232–233 truth tables used for, 96–97 VHDL description of, 299–303 Combinational logic design, 96–97 Comments (--), VHDL, 302 Commutative laws, 43, 46 Complementarity laws, 42, 46 Complementation (') operation, 37 , 39 Complementing expressions, 52–53, 140 Complex programmable logic devices (CPLD), 260, 280–281, 559–563 Computer-aided design (CAD), 184–185, 570–572 simplification of function packages, 184–185 sequential circuit design using, 570–572 Concurrent assignment state-ments, VHDL, 300–303, 305 Condition, 662 Conditional assignment state-ments, VHDL, 304–305 Conditional output box, 662 Configurable logic blocks (CLB), 282–283 Consensus term, 70 Consensus theorem, 47 , 49, 70–72, 140 Conversion, 1, 8–12, 94–96, 210–214, 473–476, 665–666 Boolean equations from English, 94–96 circuits using alternative gate symbols, 210–214 number systems, 1, 8–12 serial data code, 473–476 state graph to SM chart, 665–666 Counters, 375–376, 383–398, 596–599 binary, 384–389 D flip-flops for design of, 386–389, 393–395 J-K flip-flops for design of, 395–402 Johnson, 383–384 Karnaugh maps for, 386–387 loadable, 388–389 next-state maps for, 389–391 other sequences for, 389–395 registers with fixed sequences as, 383–384 ring, 383–384 ripple, 385, 405 self-starting, 392–393 sequential logic modeling, 596–599 shift-register, 384 S-R flip-flops for design of, 395–402 state changes and, 375–376, 383–384 T flip-flops for design of, 384–386, 389–393 transition tables for, 385–386 twisted ring, 383–384 up-down, 387–388 VHDL processes for, 596–599 CPLD, 280–281, 559–562 Critical race, 356–357 Cross-coupled form, 338–339 Cyclic shift register, 594–596 D D flip-flops, 346–348 Data path, 682 Data selector. See Multiplexer Data transfer registers, 377–378 Dataflow description, 300 Debouncing, 341–342 Decimal system conversions, 8–11 Decision box, 662 Declaration of VHDL type, 312–313 Decoders, 268–270 Decomposition of switching functions, 283–285 Delays, 232–235, 301–303, 305, 321–322, 347–348 after delay expressions, [ ], 301–303, 305 assignment statements for, 301–303 combinational circuits, 232–235, 301–303 delta (Δ) time, 321–322 flip-flops, 347–348 hazards in combinational logic caused by, 234–235 ideal, 235 inertial, 234–235 multiplexers (MUX), 305 parameters for, 347–348 propagation, 232–233, 301, 347 timing diagrams for, 232–233 transport, 235 VHDL signals and, 301–303, 305, 321–322 Delta (Δ) time delay, 321–322 DeMorgan’s laws, 45–46, 52–53 Dice game design, 668–672, 674–676, 702–704 state graph for, 672 state machine (SM) charts for, 668–672, 674–676 VHDL code for, 702–704 Digital system design, 684–712 binary divider, 700–702 binary multiplier, 690–700 dice game, 702–704 serial adders, 688–689 VHDL code for, 684–712 Digital systems, 6–8 Diodes, 8 Disjoint window sequence detectors, 462–463 Distinct (nonequivalent) state assignment, 522–523 Distributive laws, 45, 46, 66–68 Don’t cares, 103–104, 147–148, 181–182 Karnaugh maps with, 147–148 Quine-McCluskey method for, 181–182 simplification of, 147–148, 181–182 truth tables with, 181–182 values of, 103–104 Double throw switches, 342 Duality, 49 Dynamic hazards, 234, 237–239 E Edge-triggered flip-flops, 345, 346–348 Electrically erasable programmable ROM (EEPROM), 273, 274–275 Elimination theorems, 47–48, 49 elsif clauses, 592 Enable input, 264–265 Encoders, 270–271 end keyword, 306, 590–591 End-around carry, 19–20 Entity declaration, VHDL, 306–308 Entrance path, 663 Equivalence operation (≡), 69–70 Equivalent circuit design, 69–70 Equivalent sequential circuits for state tables, 512–514 Equivalent state assignment, 519–523 Equivalent states, 507–512 Essential hazards, 355–365 Essential prime implicants, 146–148, 177–178, 216–217 , 727 defined, 146, 177 Karnaugh maps and, 146–148, 214–217 minimum expression determined using, 146–148 multiple-output circuit realization and, 216–217 prime implicant chart selection of, 177–178 theorem proof, 727 Essential prime implicates, 149 Exclusive OR operation (⊕), 68–70 Exclusive-NOR, 70 Exit paths, 663 Expansion using maxterm and minterm functions, 97–103 788 Index F Factoring an expression using Karnaugh maps, 152–153 False outputs, 424 Feedback connections, 337 Field-programmable gate arrays (FPGA), 230, 282–285, 563–565 Field-programmable logic arrays (FPLA), 278 Flip-flops, 345, 346–354, 375–402, 517–518, 590–593 active-low real and preset inputs, 352–353 asynchronous clear and preset inputs, 353 characteristic equation, 341, 357–358 clock enable, 354 counter design using, 384–402 D, 346–348, 386–389, 393–395 edge-triggered, 345, 346–348 input equations, 398–402, 517–519 J-K, 350–351, 395–402 latches and, 345 master-slave, 345, 350, 351 registers, 375–384 required inputs for, 398–402 sensitivity lists, 590–593 sequential logic modeling, 590–593 S-R, 349–350, 395–402 state table derivation of, 517–519 T, 351–352, 384–386, 389–393 timing parameters for, 347–348 VHDL process for, 590–593 Fraction conversion, 10–11 Full adder, 108–110 Full subtracter, 110–111 Functionally complete, 205 G Gated latches, 342–345 Gates, 39, 44, 68–70, 193–224, 225–251, 265–268 AND and OR circuits, 200 AND design, 39, 44 AND-OR circuit, 200 buffers, 265–268 combinational circuit design using, 225–251 delays, 232–235 determination of number of, 200–203 equivalence design, 69–70 high-impedance (hi-Z) connections, 241, 266–267 inverters for, 210–214 levels of, 199–200 limited fan-in, 230–232 multi-level circuit design using, 193–224 NAND design, 204–214, 217–218 NOR design, 204–214, 217–218 OR design, 39, 44, 68–70 OR-AND circuit, 200 OR-AND-OR circuit, 200 three-state (tri-state) buffers, 266–268 tree diagram representation of, 200–201 two-level circuit design using, 206–209 Glitches, 239–240, 356, 424 Gray code, 22 H Half adder, 85, 121, 328 Hardware description language (HDL), 8, 281, 294–330. See also VHDL Hazards, 234–240, 354–357 asynchronous sequential circuits, 354–357 circuit design for avoidance of, 239 combinational logic, 234–240 dynamic, 234, 237–239 essential, 355–365 glitches, 239–240, 356 ideal delay, 235 inertial delay, 234–235 Karnaugh maps for, 235–239 races, 356–357 SOP expressions for, 237–238 static-1, 234 static-0, 234–236 transport delay, 235 Heuristic procedures, 184–185 Hexadecimal conversion, 12 High-impedance (hi-Z) connections, 241, 266–267 Hold time, 347 I Ideal delay, 235 Idempotent laws, 42, 146 IEEE standard logic, 318–321 if statements, 590–592 Implicant, defined, 144, 176. See also Prime Implicants Implicate, defined, 149 Incompletely specified functions, 103–104. See also Don’t care minterms Incompletely specified state tables, 478–479 Inertial delay, 234 Input/output value problems, 241–242 Integer conversion, 9–10 Integrated circuits (IC), 252–293, 571 buffers for, 265–268, 279 computer-aided design (CAD) for, 571 decoders, 268–270 defined, 260 encoders, 270–271 field-programmable gate arrays (FPGA), 230, 282–285 large-scale integration circuits (LSI), 260 medium-scale integration (MSI) circuits, 260 multiplexers (MUX), 261–265 programmable logic devices (PLD), 260, 275–281 read-only memory (ROM), 260, 271–275 small-scale integration (SSI) circuits, 260 switching elements for, 272–274, 275–277 switching functions and, 265, 283–285 three-state (tri-state) buffers, 266–268 very-large-scale integration (VLSI) circuits, 260 Inverse of expressions, 52–53 Inversion (') operation, 37 , 39 Inverters for circuit conversion, 210–214 Involution law, 42, 46 Iterative circuit design, 553–556 J J-K flip flops, 350–351, 395–402 Johnson counter, 383–384 K Karnaugh maps, 123–166, 182–184, 214–217 , 235–239, 386–387 , 524–528 combinational circuit hazards found using, 235–239 complements on, 140 consensus theorem on, 140 counter design using, 386–387 don’t cares in, 147–148 essential prime implicants in, 146–148, 214–217 factoring an expression using, 152–153 five-variable, 149–151, 154 four-variable, 141–149 map-entered variable simplification, 182–184 minimum product-of-sums for, 135–136 minimum sum-of-products for, 134–135 minterms on, 138, 141, 144–149 mirror-image, 154 prime implicants from, 144–149, 151 product terms plotted on, 138–139 Quine-McCluskey method use of, 182–184 simplified expressions found using, 139–140, 142–143 state assignment from, 524–528 switching functions, 134–136 three-variable, 137–141 two-level, multiple-output circuit design using, 214–217 two-variable, 136–137 Veitch diagrams, 153 L Language, VHDL, 719–723 Large-scale integration circuits (LSI), 260 Latches, 338–345 cross-coupled form, 338–339 flip-flops and, 345 gated, 342–345 next-state (characteristic) equation for, 340–341 race condition, 343 set-reset (S-R), 338–342 switch debouncing, 341–344 transparent, 344 Libraries, VHDL, 316–318 Link path, 663 Literals, 40, 73 Loadable counter, 388–389 LogicAid, 131, 171, 228, 455, 547 , 570, 676 Lookup table (LUT), 282–283 Logic design, 6–7 Logic equation generation and minimization, CAD for, 570 M Manchester code, 473–476 Map-entered variable simplification, 182–184 Mask-programmable logic arrays, 278 Mask-programmable ROM, 273–274 Master-slave flip-flops, 345, 350, 351 Maxterm functions, 97–103 conversion with minterm forms, 102–103 defined, 98 expansion, 97–104 general functions, 100–103 standard product of sums, 98–100 Mealy state and transition tables, 428–430 Mealy state machine, 422–424, 432–435, 457–460, 601–607 analysis of, 422–424, 435–436 clock skew, 434–435 Index 789 clock speed, 434 false outputs, 424 general model for, 432–435 sequence detector design, 457–460 timing charts for, 422–424 VHDL model of, 601–607 Medium-scale integration (MSI) circuits, 260 Memory, 260, 271–275, 314, 556–557 address, 271 electrically erasable programmable ROM (EEPROM), 273, 274–275 mask-programmable ROM, 273–274 programmable ROM (PROM), 273, 274 read-only memory (ROM), 260, 271–275, 556–557 sequential circuit design using, 556–557 switching elements in, 272–274 VHDL description of, 314 Metal-oxide- semiconductor field effect transistors, see MOSFET Metastable state, 340 Minimum clock period, 348 Minimum product-of-sums, 135–136, 143, 147 , 149 defined, 135 Karnaugh maps for, 143 prime implicates for, 147 , 149 procedure for, 135–136 Minimum sum-of-products, 134–135, 137 , 139–141, 144–149, 151, 167–192 defined, 134–135 Karnaugh maps for, 137 , 139–141 Petrick’s method, 179–181 prime implicants for, 144–149, 151, 173–176 procedure for, 135 Quine-McCluskey method for, 167–179 Minterm functions, 97–104, 136, 138, 141, 144–149 conversion with maxterm forms, 102–103 defined, 97 don’t care, 103–104, 147 expansion, 97–103 four-variable Karnaugh map, 141, 144–149 general functions, 100–103 Karnaugh maps, 136, 138, 141, 144–149 prime implicants for, 144–149 standard sum of products, 98–100 three-variable Karnaugh map, 138, 141 uniting theorem for, 136 Moore state graphs, 426–430 Moore state machine, 422–424, 435–436, 460–462, 607–608 analysis of, 422–424, 435–436 general model for, 435–436 sequence detector design, 460–462 timing charts for, 422–424 VHDL model of, 607–608 MOS logic, 713–718 MOSFETs, 713–718 Multi-level circuits, 193–224 conversion using alternative gate symbols, 210–214 essential prime implicants for, 216–217 inverters for, 210–214 Karnaugh maps for, 214–217 multi-level design, 209–210 multiple-output design, 217–218 NAND design, 204–214, 217–218 NOR design, 204–214, 217–218 number of gates for, 200–203 two-level design, 206–209 two-level, multiple-output design, 214–217 Multiple-output circuits, 214–218 essential prime implicants for, 216–217 multiple-output design, 217–218 NAND design, 204–214, 217–218 NOR design, 204–214, 217–218 two-level, multiple-output, 214–217 Multiplexers (MUX), 261–265, 304–305 conditional assignment statements, 304–305 logic design of integrated circuits (IC), 261–265 switching functions for, 265 VHDL models for, 304–305 Multiplying out and factoring, 49–52, 66–68 distributive laws for, 66–68 expressions, 66–68 product of sums (POS), 50–51 sum of products (SOP), 49–50, 51 theorems for, 49 N NAND circuit design, 204–214, 217–218 conversion using alternative gate symbols, 210–214 functionally complete logic sets, 205 inverters for, 210–214 multi-level, 209–210 multiple-output, 217–218 single-level, 204 two-level, 206–209 two-level, multiple-output, 214–217 Negative number representa tion, 16–21 1’s complement, 19–21 sign and magnitude, 16 2’s complement, 16–19 Next state, 340 Next-state (characteristic) equations, 340–341, 357–358, 673 Next-state maps, 340–341, 389–391, 517–519, 523–528 counters from, 389–391 flip-flop input equations from, 517–519 next-state equations for, 340–341 state assignments from, 523–528 Non-return-to-zero (NRZ) code, 473–474 Non-return-to-zero-inverted (NRZI) code, 473 NOR circuit design, 204–214, 217–218 conversion using alternative gate symbols, 210–214 functionally complete logic sets, 205 inverters for, 210–214 multi-level, 209–210 multiple-output, 217–218 single-level, 204 two-level, 206–209 two-level, multiple-output, 214–217 Normally closed (NC) contacts, 37 Normally open (NO) contacts, 37 Number systems, 1–28 ASCII code, 23 binary arithmetic, 12–15 binary codes, 21–23 conversion and, 1, 8–12 digital systems, 6–8 negative representation, 16–21 1’s complement, 19–21 overflow, 16, 18 sign and magnitude, 16 2’s complement, 16–19 O One-hot state assignment, 528–530 1’s complement numbers, 19–21 Open circuits, 42–43 Operators, VHDL, 315–316 OR-AND circuits, 200 OR-AND-OR circuits, 200 OR circuit design, 39, 44, 68–70, 200 Order of operation ( ), 300 Output list, 662 Overflow, 16, 18–21 P Packages, VHDL, 316–318 Parallel adder, 108–110, 378–380 accumulator with, 378–380 design of, 108–110 Parallel switch circuits, 42–43 Parentheses ( ) for Boolean expressions, 39 Parity bit, 416 Parity checker, 419–421 PC board layout, CAD for, 571–572 Petrick’s method, 179–181 Present state, 340 Prime implicants, 144–149, 151, 173–184, 216–217 charts, 176–191 defined, 176 don’t-cares and, 147–148, 181–182 essential, 146–148, 177–178, 216–217 Karnaugh maps for, 144–149, 151 minimum sum-of-products from, 144–149 multiple-output circuit realization and, 216–217 Petrick’s method, 179–181 Quine-McCluskey method for, 173–176, 181–184 Prime implicates, 149 process keyword, 590–591 Product of sums (POS), 50–51, 98, 136–137 direct realization of, 51 minimum, 136–137 multiplying out and factoring, 50–51 standard (maxterm), 98 Product terms plotted on Karnaugh maps, 138–139 Programmable array logic devices (PAL), 260, 278–280 Programmable logic arrays (PLA), 260, 275–278, 557–559 Programmable logic devices (PLD), 260, 275–281, 557–559, 570 computer-aided design (CAD) for, 570 complex programmable logic devices (CPLD), 260, 280–281 programmable array logic devices (PAL), 260, 278–280 programmable logic arrays (PLA), 260, 275–278, 557–559 sequential circuit design using, 557–559 790 Index Programmable ROM (PROM), 273, 274 Propagation delay, 232–233, 347 Q Quine-McCluskey method, 167–192 don’t care simplification using, 181–182 Karnaugh maps for, 182–184 prime implicants determined from, 173–176 prime implicant charts, 176–179 R Race condition, 343 Races, asynchronous sequential circuits, 356–357 Radix, number systems, 9 Read-only memory (ROM), 260, 271–275, 314, 556–557 Redundant state elimination, 505–507 Redundant terms, adding, 73 Registers, 375–384, 594–596 counters as, 383–384 cyclic shift, 594–596 data transfers, 377–378 parallel adder with accumulator using, 378–380 sequential logic modeling, 594–596 serial in and out data, 381–382 shift, 380–384 VHDL processes for, 594–596 Relational operators, VHDL, 315 Relays, 8 Resolution functions, 319 Ring counter, 383–384 RZ code, 473 S Schematic capture, CAD, 570 Self-starting counter, 392–393 Sensitivity list, 590–593 Sequence detectors, 457–463 Sequential circuits, 7–8, 336–369, 370–411, 412–452, 453–496, 497–544, 545–584 asynchronous, 354–357 clocked, 412–452 code converter design, 549–552 complex design using state graphs and tables, 463–467 complex programmable logic devices (CPLD) used for, 559–563 computer-aided design (CAD) and, 570–572 counters, 375–376, 383–398 design of, 545–584 equivalent, 512–514 essential hazards, 355–365 feedback connections and, 337 field-programmable gate arrays (FPGA) used for, 563–565 flip-flops, 345, 346–354, 375–402 glitches, 356 iterative circuit design, 553–556 latches, 338–345 Mealy machine, 422–424, 432–435 Moore machine, 421–424, 435–436 next-state (characteristic) equations for, 340–341, 354–355 parity checker, 419–421 procedure for design of, 548–549 programmable logic array (PLA) used for, 557–559 races, 356–357 read-only memory (ROM) used for, 556–557 reduction of state tables, 497–544 registers, 375–384 sequence detector design, 457–463 simulation and testing of, 565–570 state assignment, 497–544 state graphs and tables, 453–496 transition tables, 425–432 Sequential logic modeling, 585–625 begin and end keywords, 590–591 case statement, 600–601 code synthesis, 608–611 counters, 596–599 flip-flops, 590–593 if statements, 590–592 Mealy state machine, 601–607 Moore state machine, 607–608 process keyword, 590–591 registers, 594–596 VHDL for, 585–625 wait statements, 611–613 Serial adder, 629–633, 688–689 accumulator with, 629–633 VHDL code for, 688–689 Serial data code conversion, 473–476 Serial in and out data, 381–382 Set-reset (S-R) latches, 338–344 gated, 342–344 next-state (characteristic) equation for, 340–341 switch debouncing, 341–342 Setup time, 347 Shannon’s theorem, 284–285 Shift operators, VHDL, 316 Shift-register counter, 384 Shift registers, 380–384 Sign and magnitude numbers, 16 Signal tracing, 421–424 Signals, 299–305, 311–312 after delay expressions, [ ], 301–303 assignment statements, 299–305 combinational circuits, 299–303 constants and, 311–312 declaration of, 311–312 delays, 301–303, 305 multiplexers, 304–305 predefined, 311–312 VHDL, 299–305, 311–312 Simplification of functions, 46–52, 66–68, 70–74, 123–166, 167–192 adding redundant terms, 73 Boolean algebra for, 46–52, 66–68, 70–74 combining terms, 72 computer-aided design (CAD) packages for, 184–185 consensus theorem, 70–72 eliminating literals, 73 eliminating terms, 73 heuristic procedures for, 184–185 incompletely specified functions, 181–182 Karnaugh maps, 123–166 map-entered variables, 182–184 minimum product-of-sums, 135–136 minimum sum-of-products, 134–135, 144–149, 167–192 multiplying out and factoring, 49–52, 66–68 Petrick’s method, 179–181 Quine-McCluskey method, 167–192 SimUaid, CAD, 571 Simulations, 240–242, 565–570 combinational logic circuits, 240–242 computer-aided design (CAD), 570 sequential circuits, 565–570 Single switch circuit, 42 Single throw switches, 342 Sliding window sequence detec-tors, 462–463 SM blocks, 663–664 SM Charts, See State Machine Charts Small-scale integration (SSI) circuits, 260 Spikes, timing charts, 424 S-R flip-flops, 349–350, 395–402 Standard product of sums, 98–100. See also Maxterm Standard sum of products, 98–100. See also Minterm State assignment, 519–544, 673 distinct (nonequivalent), 522–523 equivalent, 519–523 guidelines for, 523–528 Karnaugh maps for, 524–528 next-state maps for, 523–528 one-hot, 528–530 state machine (SM) charts), 673 State box, 662 State code, 662 State equivalence, 507–512, 727–728 State graphs and tables, 420–421, 425–432, 453–496, 497–544 alphanumeric graph notation, 476–478 complex sequential circuit design using, 463–467 construction of transition tables, 425–426 derivation of, 453–496 equivalent sequential circuits, 512–514 equivalent states in, 507–512 flip-flop input equations for, 517–519 graph construction, 467–472 incompletely specified, 478–479, 514–516 Mealy state graphs, 428–430 Moore state graphs, 426–430 next-state maps and, 517–519, 523–528 parity checker design using, 420–421 reduction of, 497–544 redundant state elimination, 505–507 sequence detector design using, 457–463 serial data code conversion using, 473–476 state assignment, 519–544 symbolic state representation, 425 table construction, 425–426 transition tables and, 425–432 State machine (SM) charts, 660–683 binary divider use of, 667–668 binary multiplier use of, 668 Index 791 components of, 662–667 conversion of state graph to, 665–666 derivation of, 667–672 dice game use of, 668–672, 674–676 next-state equation for, 673 realization of, 672–677 state assignment for, 673 Static hazards, 234–237 String literals, " ", 314 Structural code, 300 Subtracter design, 110–111 Sum of products (SOP), 49–50, 51, 98–100, 134–135, 144–149, 273–278 combinational circuit hazards found using, 237–238 direct realization of, 51 Karnaugh maps for, 134–135, 144–149 minimum, 134–135, 144–149 multiplying out and factoring, 49–51 prime implicants, 144–149 standard (minterm), 98–100 Switch debouncing, 341–342 Switching algebra, 37 . See also Boolean algebra Switching circuits, 7–8, 37–39, 42–43, 94–96 basic theorems for, 42–43 Boolean operations for, 37–39 closed, 43 combinational, 7 conversion of English to Boolean equations, 94–96 design of, 37–39, 42–43, 94–96 normally closed (NC) contacts, 37 normally open (NO) contacts, 37 open, 43 parallel, 42–43 sequential, 7–8 Switching devices, 8, 36–37 Boolean algebra and, 36–37 diodes, 8 relays, 8 transistors, 8 Switching elements, 272–274, 275–277 programmable logic arrays (PLA) use of, 275–277 read-only memory (ROM) use of, 272–274 Switching expressions, 72–74. See also Boolean expressions Switching functions, 97–104, 123–166, 167–197 , 265, 283–285 algebraic simplification of, 97–103 decomposition of, 283–285 don’t care minterms, 103–104 field-programmable gate arrays (FPGA) and, 283–285 Karnaugh maps for, 123–166 minimum forms of, 134–136 minterm and maxterm expansions, 97–103 multiplexer implementation and, 265 Quine-McCluskey method for, 167–192 Shannon’s theorem for, 284–285 Synchronizer, 569–570 Synthesis tools, CAD, 571 T T flip-flops, 351–352 Testing, 240–242, 565–571 combinational logic circuits, 240–242 computer-aided design (CAD), 571 sequential circuits, 565–570 Three-state (tri-state) buffers, 266–268, 318–319 Three-state (tri-state) bus, 267–268, 377–378 Time delay, 321–322 Timing diagrams, 232–233, 421–424, 430–432 combinational circuits, 232–233 construction and interpretation of, 430–432 false outputs, 424 propagation delay and, 232–233 sequential circuits, 421–424, 430–432 Timing parameters, flip-flops, 347–348 Transients in output, 234 Transistors, 8 Transition tables, 385–386, 425–432 Transmission gate, 716 Transparent latch, 344, 346 Transport delay, 235 Tree diagram gate representation, 200–201 Truth tables, 40–41, 44–45, 96–97 , 104–107 , 181–182 adder design and, 104–107 associative law proof using, 44 Boolean expressions and, 40–41 creation of, 104–107 combinational logic design using, 96–97 DeMorgan’s law proof using, 45 distributive law proof using, 45 don’t care’s in, 181–182 numeric values for, 104–106 Twisted ring counter, 383–384 Two-level circuit design, 206–209 Two-level, multiple-output circuit design, 214–217 2’s complement numbers, 16–19 U Unconstrained VHDL types, 313–314 Uniting theorems, 46–47 , 49, 136 Up-down counter, 387–388 Unwanted latches (VHDL), 609 V Valid equations, proof of, 74–76 Variables, 40, 72–73, 95–96, 97–103, 182–184 adding redundant terms, 73 assignment of, 95–96 combining terms, 72 eliminating literals, 73 eliminating terms, 73 Karnaugh map use of, 182–184 literals as, 40, 97 map-entered, 182–184 minterm and maxterm expansions, 97–103 Quine-McCluskey simplification and, 182–184 Veitch diagrams, 153 Very high-speed integrated circuit (VHSIC), 299 Very-large-scale integration (VLSI) circuits, 260 Verilog HDL, 298, 571 VHDL, 8, 294–330, 585–625, 684–712, 719–726 adders and, 307–311, 320–321 after delay expressions, 301–303, 305 arrays, 312–314 assignment statements for, 299–305 begin and end keywords, 306, 311, 590–591 binary divider using, 700–702 binary multiplier using, 690–700 bit values ‘ ’, 302 clause repetitions, {}, 306–307 code compilation and simulation, 321–322 code applications, 684–712 code synthesis, 608–611, 705–706 combinational circuits described by, 299–303 combinational logic modeling using, 599–601 comments (--), 302 concatenation (&), 315 concurrent assignment statements, 300–303, 305 conditional assignment statements, 304–305 constants, 311–312 counters modeled using, 596–599 delays, 301–303, 305, 321–322 dice game using, 702–704 digital system design using, 684–712 flip-flops modeled using, 590–593 hardware language uses, 8, 281, 298–288 IEEE standard logic and, 318–321 language, 719–723 libraries, 316–318 modeling process, 585–625 modules, 306–311 multiplexers, models for, 304–305 operators, 315–316 packages, 316–318 predefined types, 311–312 read-only memory (ROM) described by, 314 registers modeled using, 596 sensitivity list, 590–593 sequential logic modeling using, 585–625 sequential machines modeled using, 601–608 serial adders using, 688–689 signals, 299–305, 311–312 structural code, 300 wait statements, 611–613 writing synthesizable code, 724–726 VHDL modules, 306–311 adders, 307–311 architecture declaration, 306–308 entity declaration, 306–308 simulation of, 308–311 W wait statements, 611–613 when others clause, 601 X Xilinx CoolRuner CPLDs, 559 Xilinx Virtex/Spartan II FPGA, 563 XOR (exclusive-OR), 68 XNOR (exclusive-NOR), 70 |
14154 | https://www.intechopen.com/chapters/82879 | What is Open Access?
Open Access is an initiative that aims to make scientific research freely available to all. To date our community has made over 100 million downloads. It’s based on principles of collaboration, unobstructed discovery, and, most importantly, scientific progression. As PhD students, we found it difficult to access the research we needed, so we decided to create a new Open Access publisher that levels the playing field for scientists across the world. How? By making research easy to access, and puts the academic needs of the researchers before the business interests of publishers.
Authors, Editors and Institutions
We are a community of more than 103,000 authors and editors from 3,291 institutions spanning 160 countries, including Nobel Prize winners and some of the world’s most-cited researchers. Publishing on IntechOpen allows authors to earn citations and find new collaborators, meaning more people see your work not only from your own field of study, but from other related fields too.
Content Alerts
Brief introduction to this section that descibes Open Access especially from an IntechOpen perspective
How it Works Manage preferences
Contact
Want to get in touch? Contact our London head office or media team here
Careers
Our team is growing all the time, so we’re always on the lookout for smart people who want to help us reshape the world of scientific publishing.
Home > Books > Heat Transfer - Fundamentals, Enhancement and Applications
Open access peer-reviewed chapter
Boiling and Condensation
Written By
Bijoy Kumar Purohit, Zakir Hussain and PVR Sai Prasad
Submitted: 08 February 2022 Reviewed: 14 June 2022 Published: 29 July 2022
DOI: 10.5772/intechopen.105882
DOWNLOAD FOR FREE
Cite this chapter
There are two ways to cite this chapter:
Download citation
From the Edited Volume
Heat Transfer - Fundamentals, Enhancement and Applications
Edited by Salim Newaz Kazi
Book Details Order Print
Chapter metrics overview
587 Chapter Downloads
View Full Metrics
DOWNLOAD FOR FREE
Cite this chapter
There are two ways to cite this chapter:
Download citation
Impact of this chapter
IntechOpen Downloads
587
Total Chapter Downloads on intechopen.com
IntechOpen Views
9,172
Total Chapter Views on intechopen.com
Citations
Citations
Advertisement
Abstract
This chapter contains a brief overview of both boiling and condensation heat transfer phenomena. Boiling and condensation are the two convective heat transfer phenomena that involve phase change from liquid to vapour and vapour to liquid, respectively. The chapter starts with the basis of heat transfer with an emphasis on the boiling and condensation phenomenon. Next, the overview of the boiling phenomenon and its different classifications like pool, flow, and subcooled and saturated boiling are discussed in detail. Different boiling regimes (natural convection boiling, nucleate boiling, transition boiling and film boiling) with the observed heat transfer rate in the case of pool boiling are mentioned in detail using the boiling curve. The heat transfer aspect and basics of condensation with types (drop and film-wise condensation) and application are also presented. The derivation for the calculation of the rate of heat transfer during film condensation with the correlations for heat transfer coefficient on vertical, horizontal and inclined plates is explained. Some numerical for the calculation of the rate of heat transfer and heat transfer coefficient for condensation phenomena has been also been mentioned. Apart from a basic overview, this chapter also includes information about the advanced heat transfer enhancement techniques available for boiling and condensation.
Keywords
Heat transfer
boiling
condensation
film-wise condensation
boiling regimes
convection
Heat transfer coefficient
Author Information
Show +
Bijoy Kumar Purohit
Department of Chemical Technology, Loyola Academy Degree and PG College, Secunderabad, Telangana, India
Zakir Hussain
Department of Chemical Technology, Loyola Academy Degree and PG College, Secunderabad, Telangana, India
PVR Sai Prasad
Department of Chemical Technology, Loyola Academy Degree and PG College, Secunderabad, Telangana, India
Address all correspondence to: pch16001@rgipt.ac.in
1. Introduction
Heat is a type of energy that is in transit between a hot body (source at a higher temperature) and a cool body (receiver at a lower temperature). The driving force for heat energy transport between two points is the temperature difference between them. Calorie and joule are the most frequent units for expressing heat energy .
Heat transfer is the branch of science concerned with determining the rates of heat energy transfers. Conduction, convection and radiation are three modes, by which the transfer of heat occurs from a hot source to a cold recipient. In the conduction mode of heat transfer, the heat energy is generally transferred within the substance or to another substance in physical contact and is caused by lattice vibration and free electron movement. Convection is the transmission of heat due to the macroscopic motion of molecules within the medium. In general, conduction heat transfer is observed within solid mediums and convection occurs within fluids (gases or liquids) mediums by the mixing of hot and cold portions of the fluid. In the radiation mode, heat is transferred through electromagnetic waves produced by a hot body. Radiation heat can be transferred over the medium within vacuums and space .
Sensible heat is the heat that must be transferred to raise or lower the temperature of a system when no phase change is observed within the medium. The latent heat of phase change is the thermal energy associated with a unit amount of matter at a fixed temperature and pressure when it experiences a phase transition (from solid to liquid and vapour to liquid or vice versa) .
Advertisement
2. Boiling and condensation phenomenon
Boiling and condensation both are under the convection heat transmission process in which the system undergoes a phase transition and are opposite to each other. These processes include the involvement of both sensible and latent heat.
Boiling is the process of transferring a medium from a liquid to a vapour state by applying heat. When a liquid medium is applied to heat, then the medium will start to boil at a certain temperature (boiling point temperature). At this particular temperature, the liquid phase changes to the vapour state, known as the boiling phenomenon.
In reverse, condensation is the process of transferring a medium from a vapour to a liquid by removing the heat from the medium. When a medium initially in the vapour state is cooled, then its phase will change from vapour to liquid state, known as the condensation phenomenon. Vapours are generated by boiling, and liquid droplets are formed by condensation [1, 3].
Advertisement
3. Heat transfer to boiling liquids
Boiling phenomenon is generally observed in unit operations such as evaporation, distillation and steam generation and is the opposite of the condensation phenomenon. When the liquid medium is exposed to a surface, at a temperature above the saturation temperature of the liquid, the phase of the medium changes from liquid to vapour.
Suppose a liquid medium is kept within a solid vessel, to which heat is supplied to boil the liquid. Let the temperature of the solid surface be ‘Ts’ and the liquid medium have the saturation temperature of ‘Tsat’. Initially, let the solid surface temperature be below the saturation temperature of the liquid. The boiling will start, when the temperature of the supplied liquid increases from ‘Ts’ to the saturation temperature ‘Tsat’. Further on increasing the temperature of the supplied liquid, the boiling rate will also increase.
According to Newton’s law of convection, heat transferred from a solid surface to the liquid (through convection mode) is
Q=hATS−TSat=hA∆Texcess
Here, TS−TSat=∆Texcess = excess temperature = temperature of the supplied liquid – saturation temperature of liquid = the extra heat supplied in excess above the saturation temperature of the fluid, during boiling of the liquid medium [3, 4].
3.1 Classification of the boiling phenomenon
According to the bulk fluid motion and the bulk fluid temperature, the boiling phenomenon can be classified into two basic categories.
Based on the bulk fluid motion within the liquid medium
Pool boiling: Boiling phenomenon within a liquid medium, which is at a stationary or non-flow condition, is called pool boiling. In pool boiling, heat is generally supplied through a submerged solid surface (by placing a heating coil inside the liquid) or boiling water within a solid container from external heat. Bubbles generate during the heating process travel in the liquid medium, due to buoyance, and the heat gets transferred through the natural convection process.
Flow boiling: Boiling phenomenon within a liquid medium, which is at flowing condition, is called flow boiling. In the case of flow boiling, heat is generally transferred to a flowing liquid medium through the forced convection process. Boiling in a liquid medium when it is flowing over a hot surface or within a heated pipe is an example of flow boiling [3, 5].
2. Based on the bulk liquid temperature within the liquid medium
Subcooled or local boiling: The boiling phenomenon is said to be subcooled or local boiling if the temperature of the bulk liquid medium above the heating surface is less than the saturation temperature of the liquid.
Saturated boiling: The boiling phenomenon is said to be saturated if the temperature of the liquid medium above the heating surface is about the saturation temperature of the liquid.
At the early stages of pool boiling, the liquid adjacent to the hot solid surface vaporises and the bubbles are formed by absorbing heat from the hot solid surface. The bubbles contain more heat energy and travel within the liquid medium due to the convection phenomenon.
But during the initial stage of boiling, the bulk fluid (a certain height above a hot solid surface) will be at a temperature much less than the liquids saturation temperature. These bubbles when they move away from the hot surface and come in contact with cold liquid, they condense and collapse by transferring the absorbed heat (from the hot surface) into the liquid medium. This phenomenon happens when the bulk liquid is at a temperature much lower than the saturation temperature (subcooled or local boiling).
Further, when the temperature of the entire liquid medium reaches about the saturation temperature, the bubbles will not condense and will start rising to the top (saturated boiling) (Figures 1 and 2) [3, 6].
3.2 Boiling regimes and the boiling curve in case of pool boiling
Boiling process in the pool of a liquid medium will start, when the supplied temperature exceeds the saturation temperature (ΔTexcess >0). Depending on this excess temperature ΔTexcess supplied to the liquid medium, different types of boiling regimes are observed in a pool of liquid [1, 3, 4]. Those regimes are
Natural convection boiling
Nucleate boiling
Transition boiling
Film boiling
To demonstrate these boiling regimes for a pool of liquid, a plot between boiling heat flux (rate of heat transfer per unit area) versus the excess temperature supplied is shown and known as the boiling curve (Figure 3).
3.2.1 Natural convection boiling (to point a on the boiling curve)
Boiling or saturation temperature of a pure liquid substance depends on the applied pressure. But in practice, the bubbles are forming on the heating surface only after being heated to a few more degrees above its saturation temperature (up to 6°C for water).
The transfer of heat within the fluid (from the heating surface to the bulk fluid) in this step is by natural convection, and hence the heat flux curve increases slowly. During this condition, the liquid will be at a slightly superheated state and the superheated liquids will evaporate when it rises to the free surface.
3.2.2 Nucleate boiling (between points A and C on the boiling curve)
Upon further increasing the excess temperature (ΔTexcess), the bubbles will start forming at the temperature with respect to point A of the boiling curve. With further increase in excess temperature, the rate of formation of bubbles and hence the heat flux will increase till the point C in the boiling curve.
The nucleate boiling regime (from A to C) can be further divided into two separate regions (from A to B and from B to C). In the region from A to B, with excess heat supplied beyond point A, isolated bubbles will start forming on the heated surface. As soon the bubbles start to move, these bubbles will dissolute in the liquid (subcooled boiling). The formation and dissolution of the bubble will be repeated till the temperature of the liquid reaching to saturated temperature. During nucleate boiling, the movement of the bubbles is responsible for the increase in heat transfer coefficient and heat flux.
In the region from B to C, with excess heat supplied beyond point B, the bubbles form at a great rate and a continuous column of vapour in the liquid will be observed. These bubbles move to the free surface (saturated boiling) where the vapour got released from the bubbles. The heat flux observed in this region will be larger due to the combined effect of liquid entrainment and evaporation.
High heat transfer rates are observed in the case of the nucleate boiling regime compared to other regimes; hence, it is the most desirable boiling regime in practice. For water, it can be achieved with ΔTexcess within about 30°C. The correlation for the boiling heat flux for this region was proposed by Rohsenow, which is [6, 7, 8, 9].
q=μlhfggρl−ρvσ12Cpl∆TexcessCsfhfgPrln3
3.2.3 Transition boiling (between points C and D on the boiling curve)
With Δ Texcess value near reaching the point C, the rate of evaporation of bubbles at the heater surface will be at a very high rate throughout the entire solid surface. These bubbles may cover the heater surface; hence, the contact between solid surface and liquid will be difficult. This formed vapour film acts as an insulation due to the low thermal conductivity of the vapour relative to that of the liquid, and hence the heat flux decreases beyond point C.
The heat flux till point C reaches a maximum value and is called the critical (or maximum) heat flux, qmax. The correlation for the boiling critical heat flux for this region for boiling was proposed by Lienhard et al. and is expressed as [6, 7, 8]:
qmax=0.149ρlhfgσgρl−ρvρv214
3.2.4 Film boiling (beyond point D on the boiling curve)
During the transition boiling, the heater surface will be completely covered by a continuous stable layer of vapour film (with increasing ΔTexcess). As the vapour film separates the liquid from the heater surface and will be responsible for transferring less heat flux, the heat flux will reach a minimum value (point D), called the Leidenfrost point. The correlation for the boiling minimum heat flux at the Leidenfrost point for a horizontal plate was proposed by Zuber, which is .
qmax=0.09ρvhfgσgρl−ρvρl+ρv214
As the ∆Texcess further increases, the heat transfer will start due to the radiation from hot solid surface to liquid through the vapour medium. The heat flux will again rise slowly and as the heating takes place over a film of vapour, it is known as film boiling. The correlation for the boiling heat transfer coefficient for this region for boiling above a horizontal tube was proposed by Bromley, which is given as follows [6, 7, 8]. However, for a vertical plate, the constant 0.62 and D will be replaced by 0.7 and L, respectively:
h=0.62kv3ρvρl−ρvghfg+0.4CpvΔTexcessDμvΔTexcess14
Burnout point: As the heat flux is decreasing beyond point C, the boiling process will not be advised to continue further. Beyond point C, the power that needs to be provided to the heater surface will be more (as the heat flux decreases). However, in this condition of excess power supply, the temperature of the nichrome wire (heater) immersed in the liquid will abruptly rise to the melting point of the wire, resulting in burnout. Burnout can be avoided by using platinum wire, which has a much higher melting point.
Advertisement
4. Heat transfer in condensation
Condensation is a convection process of changing a vapour medium to a liquid state and generally occurs when a saturated vapour comes into contact with a cold solid surface at a temperature less than the saturation temperature of the vapour. The latent heat of vaporisation must be removed during the condensation.
Condensers are widely used in the chemical industry. The process of condensation occurs by two distinct mechanisms/modes and at different rates of heat transfer. Those are film-wise and drop-wise condensation [2, 3].
4.1 Difference between drop-wise and film-wise condensation
4.1.1 Drop-wise condensation
When a saturated vapour comes into contact with a cold solid surface (a surface at a lower temperature than the saturated temperature of vapour), it condenses to liquid form. If condensate does not wet the surface, then the droplets of liquid are formed on the surface.
The size of droplets expands with time and eventually drops down the surface in a random pattern (due to the effect of gravity), leaving the metal surface bare on which further condensation develops.
4.1.2 Film-wise condensation
When a saturated vapour comes into contact with a cold surface (a surface at a lower temperature than the saturated temperature of vapour), it condenses to liquid form. If condensate wets the surface, then it forms a continuous film of condensate.
These condensates completely cover the solid surface, and then heat must be transported through the condensed liquid layer. Then the vapours have to condense into the liquid film rather than direct contact with the surface. Under the action of gravity, the condensate eventually flows down the surface. The condensation caused by this technique is termed as film-wise condensation [2, 3].
The film covering the solid surface serves as a heat transmission barrier in film-wise condensation, but in drop-wise condensation, a considerable section of the surfaces is exposed directly to the vapour. Hence, the heat transfer coefficients (and thus the heat transfer rates) in drop-wise condensation are generally four to eight times greater than in film-wise condensation. The presence of dirt on the surfaces (where condensate drops develop), which appear to favour drop-wise condensation, is known as nucleation sites. Because most surfaces become wet after being exposed to the condensing vapours, film-wise condensation is very common (Figure 4) [2, 3, 6].
| Drop-wise condensation | Film-wise condensation |
--- |
| In drop-wise condensation, the condensate liquids partially wet the complete solid surface by forming droplets of condensate on the surface. | In film-wise condensation, the condensed liquid wets the solid surface by forming a continuous film of condensate on the surface. |
| These droplets then fall down the surface under the action of gravity, leaving the bare solid surface to condense further. | Condensate flows down the surface under the action of gravity by forming a continuous film, and further heat transfer takes place through this layer. |
| As the bare solid surface is further available to condense, the heat transfer coefficients and thus heat transfer rate are very high compared to film-wise condensation.The heat transfer coefficient value is difficult to predict. | Due to the presence of a continuous liquid film of condensate between the vapour and solid surface, the heat transfer coefficients and thus heat transfer rate are very low compared to drop-wise condensation.The heat transfer coefficient value can be predicted easily. |
| Drop-wise condensation is difficult to achieve and generally occurs on oily or greasy surfaces. | Film-wise condensation is easily obtainable and generally occurs on smooth, clean and uncontaminated surfaces. |
| Drop-wise condensation condition is difficult to maintain and is unstable.Drop-wise condensation is commonly not used industrially. | Film-wise condensation conditions can be easily maintained and stable.Film-wise condensation is commonly used industrially. |
4.2 Heat transfer for film-wise condensation on vertical plate
Let us consider a vertical plate maintained at a constant surface temperature ‘Ts’ with a height ‘L’ and width ‘b’. Let us consider a single vapour medium, at the saturation temperature ‘Tsat’, exposed to this surface [3, 4]. The surface temperature of the solid surface is below the saturation temperature (Ts < Tsat). When this saturated vapour comes in contact with the cold surface, then the vapour will condense on it.
In the case of film-wise condensation, it will form a continuous film of condensate on the surface of the vertical plate. The condensate liquid film layer ultimately flows down and will obtain a state as shown in the figure under the influence of viscosity and gravity.
Let the downward direction is taken as the positive x-direction with the origin placed at the top of the plate where condensation initiates, as shown in Figure 5. The film thickness of condensate ‘δ’ and thus the mass flow rate of the condensate increase with respect to the length of plate ‘x’.
Heat must be transferred from the vapour to the plate through the film, which provides heat transfer resistance. The greater the thermal resistance of the film, the slower the rate of heat transfer will be. Nusselt first derived the analytical relationship between the heat transfer coefficient throughout the length of the plate in film condensation on a vertical plate in 1916, using the following assumptions:
The surface temperature of solid surface (‘Ts’) and the vapour is at saturation temperature (‘Tsat’) and is more than solid surface temperature (Ts < Tsat).
The temperature of condensate liquid varies linearly across the liquid film.
The flow within the condensate liquid layer is laminar and the acceleration of the condensate liquid layer is negligible.
Heat transfer within the condensate liquid film is through conduction mode only (no convection phenomenon in the film).
All the properties of the condensate liquid are constant throughout the film.
The viscous shear on the liquid–vapour interface is negligible (velocity of the saturated vapour is maintained very low to avoid drag on the condensate film).
The rate of heat transfer from the vapour phase to the solid surface with respect to vertical direction x can be expressed as:
Q=hxATsat−Ts=klATsat−Tsδx
Then,Heat flux=q=QA=hxTsat−Ts=klTsat−Tsδx
hx=klδxE1
The heat transfer coefficient value for the heat transfer from the vapour to the plate is changing along the length of the plate due to the thermal resistance offered by the varying thickness of condensate liquid film. If the thickness of the film is more, then more will be the thermal resistance for the flow of heat from vapour to solid and thus lower the rate of heat transfer.
Let us consider a small selected volume element of condensate in the vertical x-direction. Since the acceleration of the small section fluid is assumed zero, then according to Newton’s second law of motion, it can be written as:
∑Fx=max=0
∑FxDownward direction↓=∑FxUpward direction↑
Weight force↓=Viscous shear force↑+Buoyancy force↑
The forces that act on this small elemental volume will be the weight of the liquid element (acting downward), viscous shear or fluid friction force (acting upward) and buoyancy force (acting upward).
Weight↓or gravity forceonsmall liquid element=ρlgδx−ydx
Viscous shear force↑onsmall liquid element=μldudydx
Buoyancy force↑onsmall liquid element=ρVgδx−ydx
Thus,
ρlgδx−ydx=μldudydx+ρVgδx−ydx
μldudydx=ρlgδx−ydx−ρVgδx−ydx
dudy=ρl−ρVgδx−yμl
du=ρl−ρVgμlδx−ydy
Integrating the aforementioned equation from y = 0 to y, we will have the relationship between the velocity along the length of the vertical pipe:
[At y = 0; u = 0 (no-slip boundary condition) and at y = y; u = u (y) (not zero)]
∫0uydu=ρl−ρVgμl∫0yδx−ydy
u=ρl−ρVgμlyδx−y22
Then, the mass flow rate of the condensate with the boundary layer thickness is ‘δ’, at any location ‘x’ over the solid surface will be
ṁ=∫ρludA=∫0δρlρl−ρVgμlyδx−y22bdy
ṁ=ρlρl−ρVgbμl∫0δyδx−y22dy
ṁ=ρlρl−ρVgbμlδx22δx−δx32×3=ρlρl−ρVgbδx33μl=ρlρl−ρVgbδx33μl
Then
dṁdx=ddxρlρl−ρVgbδx33μl=ρlρl−ρVgb3μlddxδx3=ρlρl−ρVgbδx2μldδxdxE2
Again, the rate of heat transfer from the vapour to the solid surface through the liquid film layer will be equal to the amount of heat released when vapour is condensed and is expressed as:
dQ=dṁхλ=klATsat−Tsδx=hxATsat−Ts
dQ=dṁхλ=klbхdxTsat−Tsδx=hxbхdxTsat−Ts
dṁdx=klbTsat−TsδxλE3
Equating the aforementioned two Eqs. (2) and (3), we have
dṁdx=klbTsat−Tsδxλ=ρlρl−ρVgbδx2μldδxdx
klbTsat−Tsδxλ=ρlρl−ρVgbδx2μldδxdx
klbμlTsat−Tsρlρl−ρVgbλdx=δx3dδx
δx3dδx=klμlTsat−Tsρlρl−ρVgλdx
The liquid film thickness at any location x can be determined by integrating the aforementioned equation from x = 0 (δx = 0 at the top of the plate) to x = x (δx = x):
∫0δxδx3dδx=klμlTsat−Tsρlρl−ρVgλ∫0xdx
δx44=klμlTsat−Tsρlρl−ρVgλx
δx=4klμlTsat−Tsxρlρl−ρVgλ14
Then the heat transfer rate from the vapour to the solid plate surface at any location x along the length of the plate can be expressed as (from Eq. (1)):
hx=klδx
hx=kl4klμlTsat−Tsxρlρl−ρVgλ14=ρlρl−ρVgλkl44klμlTsat−Tsx14
hx=ρlρl−ρVgλkl34μlTsat−Tsx14
Upon integrating the aforementioned equation for the local heat transfer coefficient over the entire length of the plate (L), the value average heat transfer coefficient value is determined:
havg=hVertical=1L∫0Lhxdx=0.943ρlρl−ρVgλkl3μlTsat−TsL14
Note: In general, the density of the vapour medium will be negligible compared to the density of the liquid:
ρl≫ρVorρl≈ρl−ρV
hVertical=0.943ρl2gλkl3μlTsat−TsL14
Note 1: In case, the vertical plate is inclined at an angle Θ. The heat transfer coefficient is
hInclined=hVerticalcosθ14
Note 2: In the case of the horizontal tube or sphere with diameter D, the heat transfer coefficient is
hHorizontal=0.729ρlρl−ρVgλkl3μlTsat−TsD14=0.729ρl2gλkl3μlTsat−TsD14
Note 3: The aforementioned equations are applicable for a single-tube system, in case N number of tubes are arranged in the system or a stack of tubes are present. h1 is the heat transfer coefficient for the top tube. Then the heat transfer coefficient for N tubes (hN) is
hN=h1N14
Advertisement
5. Research and techniques of enhancement of boiling and condensation heat transfer
Enhancement of boiling heat transfer: Different advanced techniques that can be used to improve heat transfer in pool boiling are classified as active or passive techniques. Active approaches regulate the fluid movement by different techniques such as mixing the fluid using mechanical agitation, pumping the fluid, vibrating the surface of the container, rotating the container continuously, and adding an external electrostatic or magnetic field [6, 7, 10]. On the other hand, passive heat transfer enhancement techniques focus on changing fluid characteristics and/or heat transfer surfaces, such as increasing the number of active nucleation sites and the rate of bubble formation at each site [11, 12]. A rough, dirt-covered surface produces more nucleation sites than a smooth surface. The rate of nucleation can also be promoted by applying a thin porous layer to the surface or constructing mechanical voids on the surface to allow for continuous vapour production.
Different surface modification approaches for improving channel flow boiling heat transfer were reviewed by Liang et al. and Kim et al. . It covers macroscale (the use of cylindrical pins, macro ribs and twisted tape inserts), microscale (the use of micro-fins, micro-pin-fins, artificial cavities porous coating) and nanoscale (the use of nanotubes or nanowires to coat a heating surface) [13, 14] techniques to enhance the rate of heat transfers. Nanostructure approaches are reported to be less effective than macroscale and microscale improvement techniques.
Shah et al. investigated the flow pattern, nucleate boiling, bubble growth, void fraction, liquid layer thickness, critical heat flux, pressure drop and heat transfer models for boiling fluid in microchannels. Adnan et al. investigated the usage of nanofluids (h-BN/DCM and SiO2/DCM) to improve heat transmission in pool boiling. These nanoparticles were found to greatly improve the thermal properties of the base fluid, with a 27.59% improvement in the rate of heat transfer coefficient for saturation boiling. Heat transfer enhancement employing ZnO-water, TiO2-water, and Al2O3-water nanofluids has also been reported [17, 18, 19]. Amiri et al. reported that multi-walled carbon nanotubes treated with cysteine, silver nanoparticles and Gum Arabic exhibited significant enhancement in the pool boiling heat transfer coefficients and critical heat fluxes when added with different concentrations to the aqueous media. Chen et al. reported a recent and detailed review on the boiling heat transfer enhancement using different nanofluid solutions .
Enhancement of condensation heat transfer: Many recent reviewed research articles [23, 24, 25] are reported for advanced condensation phenomenon techniques. For condensation, the two major conditions that are nucleation on the surface and departure of liquid droplets are greatly influenced by the hydrophilicity and hydrophobicity properties of solid surfaces. Similar to boiling, numerous surface modification techniques are used to improve the heat transfer rate for condensation. Among them, constructing low free energy surfaces and building micro-nano structure surfaces are two possibilities to enhance the nucleation of liquid droplets .
Metallisation, ion implantation and organic polymer coating are available reported methods for lowering surface free energy. Some precious metals, such as gold, silver, palladium, rhodium, and chromium, can be plated on solid surfaces to produce metallisation. Ion implantation procedures involve the ionisation of gases such as nitrogen, argon, helium, and hydrogen using a high-voltage electric field before bombarding them into a metal surface. A thin covering of organic polymer such as fluorocarbon polymer, silica gel polymer, hexamethyldisiloxane polymer, fluorinated propylene polymer, polyhexafluoropropylene polymer and poly(p-xylene) polymers can also be used to induce drop-wise condensation on a solid metal surface [27, 28, 29, 30].
In micro-nano structure surfaces techniques, different micro-nano structures like nanowires, nanocons, nanosheets, nanoblocks of carbon nanotube, nanographene particles, ZnO, Ni and polystyrene are fabricated on the solid surfaces that provide the nucleation sites and promoting drop-wise condensation [22, 26, 30, 31].
Advertisement
6. Conclusion
This chapter provides a comprehensive overview of the boiling and condensation phenomenon. These are the two opposite phenomena related to convective heat transfer which is the heat transfer involved during changing phase from liquid to vapour and from vapour to liquid, respectively. Boiling occurs when the temperature of liquids raises above its saturation temperature. Boiling can be classified as pool and flow boiling and as subcooled and saturated boiling. Depending on the value of the excess temperature supplied (above saturation temperature) to the liquid medium, different types of boiling regimes are observed in a pool of liquid. Those regimes include natural convection boiling, nucleate boiling, transition boiling, and film boiling.
Again, the condensation process deals with changing a vapour to a liquid state with two distinct mechanisms, that is, film-wise condensation and drop-wise condensation. The heat transfer coefficients (and thus the heat transfer rates) in drop-wise condensation are greater than in film-wise condensation. Drop-wise condensation is difficult to achieve and generally occurs on oily or greasy surfaces. Film-wise condensation is easily obtainable and generally occurs on smooth, clean uncontaminated surfaces.
Advertisement
7. Numerical related to condensations
Example 1: Consider a vertical tube within which hot gas is flowing at 80°C. The tube has a diameter of 40 mm and 1 m in length. This tube is now utilised to condense steam at atmospheric pressure. Determine the mass of condensate or the rate of condensation per hour that will generate in this system. Given the properties of condensate:
k = 0.67 W/m.K; ρ = 972 kg/m3; λ = 2310 kJ/kg; μ = 3.55 х 10−04 (N.s)/m2.
Answer:
We know that the heat transfer coefficient over a vertical surface will be
hVertical=0.943ρl2gλkl3μlTsat−TsL14
L = height of the vertical plate = 1 m; D = diameter of the vertical plate = 40 mm = 0.04 m; g = gravitational acceleration = 9.81 m/s2; ρl = densities of the condensed liquid = 972 kg/m3; μl = viscosity of the condensed liquid = 3.55 х 10−04 (N.s)/m2 = 355 х 10−06 kg/m·s; λ = latent heat of vaporisation = 2310 kJ/kg = 2310 х 103 J/kg; kl=thermal conductivity of the condensed liquid = 0.67 W/m.K; Ts = surface temperature of the plate = 60°C = 273.15 + 60 = 333.15 K; Tsat = saturation temperature (at atmospheric pressure) of the condensing fluid = 100°C = 273.15 + 100 = 373.15 K.
Then
hVertical=0.9439722х9.81х2310х103х0.673355х10−6х373.15−333.15х114=4352Wm2.K
We know that the rate of heat transfer from the vapour to the solid surface through the liquid film layer will be equal to the amount of heat released when vapour is condensed and is expressed as:
dQ=dṁхλ=klATsat−Tsδx=hxATsat−Ts
Q=ṁхλ=hxATsat−Ts
Area of heat transfer = π х D х L = π х 0.04 х 1 = 0.12564 m2
Mass of condensate=ṁ=hxATsat−Tsλ=4352х0.12564х373.15−333.152310х103=9.46х10−03kgs=34.08kghr
Example 2: Consider a horizontal tube within which hot gas is flowing at 80°C. The tube has a diameter of 40 mm and 1 m in length. This tube is now utilised to condense steam at atmospheric pressure. Determine the mass of condensate that will generate in this system. Given the properties of condensate:
k = 0.67 W/m.K; ρ = 972 kg/m3; λ = 2310 kJ/kg; μ = 3.55 х 10−04 (N.s)/m2.
Answer:
We know that the heat transfer coefficient over a horizontal surface will be
hHorizontal=0.729ρl2gλkl3μlTsat−TsD14
L = height of the horizontal plate = 1 m; D = diameter of the vertical plate = 40 mm = 0.04 m; g = gravitational acceleration = 9.81 m/s2; ρl = densities of the condensed liquid = 972 kg/m3; μl = viscosity of the condensed liquid = 3.55 х 10−04 (N.s)/m2 = 355 х 10−06 kg/m·s; λ = latent heat of vaporisation = 2310 kJ/kg = 2310 х 103 J/kg; kl=thermal conductivity of the condensed liquid = 0.67 W/m.K; Ts = surface temperature of the plate = 60°C = 273.15 + 60 = 333.15 K; Tsat = saturation temperature (at atmospheric pressure) of the condensing fluid = 100°C = 273.15 + 100 = 373.15 K.
Then
hHorizontal=0.7299722х9.81х2310х103х0.673355х10−6х373.15−333.15х0.0414=7522Wm2.K
We know that the rate of heat transfer from the vapour to the solid surface through the liquid film layer will be equal to the amount of heat released when vapour is condensed and is expressed as:
dQ=dṁхλ=klATsat−Tsδx=hxATsat−Ts
Q=ṁхλ=hxATsat−Ts
Area of heat transfer = π х D х L = π х 0.04 х 1 = 0.12564 m2
Mass of condensate=ṁ=hxATsat−Tsλ==75222х0.12566х373.15−333.152310х103=0.016kgs=58.91kghr
Example 3: Consider a vertical tube with a temperature at 96°C and is exposed to steam at saturation temperature at atmospheric pressure. The tube has a diameter of 20 mm and 30 cm in length. Obtain the outside film heat transfer coefficient and the rate of heat transfer. Given the properties of condensate:
k = 0.57 kcal/hr-m-oC; ρ = 950 kg/m3; λ = 540 kcal/kg; μ = 1.02 kg/m.hr.
Answer:
We know that the heat transfer coefficient over a vertical surface will be
hVertical=0.943ρl2gλkl3μlTsat−TsL14
L = height of the vertical plate = 30 cm = 0.3 m; D = diameter of the vertical plate = 20 mm = 0.02 m; g = gravitational acceleration = 9.81 m/s2; ρl = densities of the condensed liquid = 950 kg/m3; μl = viscosity of the condensed liquid = 1.02 kg/m · hr. = 2.83 х 10−4 kg/m.s; λ = latent heat of vaporisation = 540 kcal/kg = 540 х 103 х 4.184 J/kg = 2,259,360 J/kg; kl=thermal conductivity of the condensed liquid = 0.57 kcal/hr-m-oC = (0.57 х 103 х 4.184/3600) J/s-m-oC = 0.66 W/m. oC; Ts = surface temperature of the plate = 96°C; Tsat = saturation temperature (atmospheric pressure) of condensing fluid =100°C.
Then
hVertical=0.9439502х9.81х2259360х0.6632.83х10−4х100−60х0.314=6049.28Wm2.°C
Area of heat transfer = π х D х L = π х 0.002 х 0.3 = 0.018846 m2.
We know that
Rate of heat transfer=Q=hxATsat−Ts=6049.28х0.018846х100−96=456.018W
Example 4: A tube 40 mm in diameter and 1 m in length is used to condense steam at 100°C. The tube surface is at 60°C. Determine for which arrangement of the tube, the rate of heat transfer and the mass of condensate will be maximum. (a) Vertical, (b) horizontal, (c) inclined at an angle of 45°C and (d) ten number of horizontal tubes in the vertical direction. Properties of condensate are.
k = 0.67 W/m.K; ρ = 972 kg/m3; λ = 2310 kJ/kg; μ = 3.55 х 10−04 (N.s)/m2.
Answer:
Given data, L = height of the vertical plate = 1 m; D = diameter of the vertical plate = 40 mm = 0.04 m; g = gravitational acceleration = 9.81 m/s2; ρl = densities of the condensed liquid = 972 kg/m3; μl = viscosity of the condensed liquid = 3.55 х 10−04 (N.s)/m2 = 355 х 10−06 kg/m·s; λ = latent heat of vaporisation = 2310 kJ/kg = 2310 х 103 J/kg; kl=thermal conductivity of the condensed liquid = 0.67 W/m.K; Ts = surface temperature of the plate = 60°C = 273.15 + 60 = 333.15 K; Tsat = saturation temperature (atmospheric pressure) of condensing fluid =100°C = 273.15 + 100 = 373.15 K.
Area of heat transfer = A = π х D х L = π х 0.04 х 1 = 0.12564 m2
We know that the heat transfer coefficient over a vertical surface will be
hVertical=0.943ρl2gλkl3μlTsat−TsL14
hVertical=0.9439722х9.81х2310х103х0.673355х10−6х373.15−333.15х114=4352Wm2.K
We know that
Rate of heat transfer=Q=hxATsat−Ts=4352х0.12564х373.15−333.15=21871.42W
Mass of condensate=ṁ=hxATsat−Tsλ=21871.422310х103=9.46х10−3kgs=34.08kghr
2. Heat transfer coefficient over a horizontal surface will be
hHorizontal=0.729ρl2gλkl3μlTsat−TsD14
hHorizontal=0.7299722х9.81х2310х103х0.673355х10−6х373.15−333.15х114=3364.37Wm2.K
We know that
Rate of heat transfer=Q=hxATsat−Ts=3364.37х0.12564х373.15−333.15=16907.98W
Mass of condensate=ṁ=hxATsat−Tsλ=16907.982310х103=7.31х10−3kgs=26.35kghr
3. Heat transfer coefficient for the inclined angle of 45°C will be
hInclined=hVerticalcosθ14
hInclined=4352хcos4514=3990Wm2.K
We know that
Rate of heat transfer=Q=hxATsat−Ts=3990х0.12564х373.15−333.15=20052.15W
Mass of condensate=ṁ=hxATsat−Tsλ=20052.152310х103=8.68х10−3kgs=31.25kghr
4. Heat transfer coefficient for 10 number horizontal tubes in the vertical direction will be
hN=h1N14
hN=3364.37х1014=5982Wm2.K
We know that
Rate of heat transfer=Q=hxATsat−Ts=5982х0.12564х373.15−333.15=30063.14W
Mass of condensate=ṁ=hxATsat−Tsλ=30063.142310х103=0.014kgs=46.85kghr
Mass of condensate and the heat transfer rate will be maximum for the arrangement with 10 horizontal tubes in the vertical direction.
Example 5: Consider a stainless steel pan with water at atmospheric pressure. Externally heat is supplied, to boil the liquid, through the bottom of pan (diameter is 40 cm) and a temperature of 106°C is maintained at the inner surface of the bottom of the pan. Considering steady state condition, determine the rate of heat transfer to the water and the rate of evaporation of water.
Data: The saturation temperature of Tsat = 100°C and the properties of water at this condition are.
| σ= 0.0589 N/m | hfg = 2257 х 103 J/kg | Prl= 1.75 |
---
| ρl=957.9 kg/m3 | ρv=0.6 kg/m3 | μl= 0.282 х 10−3 kg · m/s |
| Cpl= 4217 J/kg · °C | Csf= 0.013 | n = 1 |
Answer:
The rate of heat transfer will be equal to the product of heat flux and heat transfer area.
Here, ∆Texcess=TS−TSat= excess temperature = temperature of the supplied liquid – saturation temperature of liquid = 106–100 = 6°C.
Excess temperature resembles the stage of nucleate boiling of liquid. Hence, the heat flux at this nucleate boiling condition will be (Rohsenow, )
q=μlhfggρl−ρvσ12Cpl∆TexcessCsfhfgPrln3
q=0.282х10−3х2257х1039.81х957.9−0.60.0589124217х60.013х2257х103х1.7513
q=30409.35Wm2
Heat transfer area or the surface area of the bottom of the pan:
A=π4D2=π4×0.42=0.125m2
The rate of heat transfer will be = Q = q х A = 30409.35Wm2×0.12m2=3821W.
Again, the rate of evaporation of water (ṁ) can be determined from the formula:
Q=ṁ∗λ
ṁ=Qλ=38212257х103=1.692х10−3kgs≈1.7gram of water evaporatespersec
Advertisement
Nomenclature
Q
Amount of heat transferred from a solid surface to the fluid, W
ax
Acceleration of small selected volume element of condensate, m/s2
hN
Average heat transfer coefficient for N tubes, W/m2.K
h1
Average heat transfer coefficient for top horizontal tube, W/m2.K
havgorh
Average heat transfer coefficient value, W/m2.K
hInclined
Average heat transfer coefficient value for inclined surface, W/m2.K
hHorizontal
Average heat transfer coefficient value for horizontal surface, W/m2.K
hVertical
Average heat transfer coefficient value for vertical surface, W/m2.K
qmax
Critical (or maximum) heat flux, W/m2
D
Diameter of the horizontal tube or sphere, m
x
Distance along the length of the solid surface, m
y
Distance along the width of the condensate, m
ρl
Densities of the condensed liquid, kg/m3
ρV
Densities of the condensed vapour, kg/m3
hfg or λ
Enthalpy or latent heat of vaporisation, J/kg
Csf
Experimental constant depends on the fluid-surface combination
n
Experimental constant depends on the fluid
∆Texcess
Excess temperature supplied to fluid, °C, K
δ
Film thickness of condensate, m
δx
Film thickness of condensate along the L direction, m
Fx
Force on small selected volume element of condensate, kg/m.s2
g
Gravitational acceleration, m/s2
q
Heat flux, W/m2
hx
Heat transfer coefficient along the L direction, W/m2·°C, W/m2·K
L or H
Height of the solid surface, m
Θ
Inclination angle of a solid surface, 0
ṁ
Mass flow rate of condensate along the length of condensate, kg/s
m
Mass of small selected volume element of condensate, kg
N
Number of horizontal tubes arranged in stacks
Prl
Prandtl number of liquid
Cpl
Specific heat of the liquid, J/kg. oC
Cpv
Specific heat of the vapour, J/kg. oC
A
Surface area of solid surface, m2
σ
Surface tension in the vapour-liquid interface, N/m
Tsat
Saturation temperature of the condensing fluid, °C or K
Ts
Surface temperature of the solid surface, °C or K
kl
Thermal conductivity of the condensed liquid, W/m·°C or W/m·K
kv
Thermal conductivity of the vapour, W/m·°C or W/m·K
u
Velocity rate of condensate along the length of condensate, m/s
μl
Viscosity of the condensed liquid, kg/m·s
μv
Viscosity of the vapour, kg/m·s
b
Width of the solid surface, m
References
Kern DQ, Kern DQ. Process Heat Transfer. Vol. 5. New York: McGraw-Hill; 1950
McCabe WL, Smith JC, Harriott P. Unit Operations of Chemical Engineering. Vol. 5. New York: McGraw-hill; 1993
Holman JP. Heat Transfer. 10th ed. New York: Mc-GrawHill Higher Education; 2010
Bergman TL, Bergman TL, Incropera FP, Dewitt DP, Lavine AS. Fundamentals of Heat and Mass Transfer. United States: John Wiley & Sons; 2011
Welty J, Rorrer GL, Foster DG. Fundamentals of Momentum, Heat, and Mass Transfer. John Wiley & Sons; 2020
Cengel Y, Heat TM. A Practical Approach. New York, NY, USA: McGraw-Hill; 2003
Dutta BK. Heat Transfer: Principles and Applications. India: PHI Learning Pvt. Ltd.; 2000
Coulson JM. Coulson & Richardson Chemical Engineering, Volume 1. Disp, 10, 32. 2000
Rohsenow WM, Hartnett JP, Ganic EN. Handbook of Heat Transfer Fundamentals. 1985
Tillery SW, Heffington S, Smith MK, Glezer A. Boiling heat transfer enhancement by submerged vibration induced jets. In: The Ninth Intersociety Conference on Thermal and Thermomechanical Phenomena In Electronic Systems (IEEE Cat. No. 04CH37543). Vol. 2. New York: IEEE; 2004. pp. 17-22
Bergles AE, Nirmalan V, Junkhan GH, Webb RL. Bibliography on Augmentation of Convective Heat and Mass Transfer-II (No. ISU-ERI-AMES-84221). Ames (USA): Iowa State Univ. of Science and Technology; 1983 Heat Transfer Lab
Liang G, Mudawar I. Review of channel flow boiling enhancement by surface modification, and instability suppression schemes. International Journal of Heat and Mass Transfer. 2020;146:118864
Kim DE, Yu DI, Jerng DW, Kim MH, Ahn HS. Review of boiling heat transfer enhancement on micro/nanostructured surfaces. Experimental Thermal and Fluid Science. 2015;66:173-196
Barber J, Brutin D, Tadrist L. A review on boiling heat transfer enhancement with nanofluids. Nanoscale Research Letters. 2011;6(1):1-16
Saha SK, Celata GP, Kandlikar SG. Thermofluid dynamics of boiling in microchannels. In: Advances in Heat Transfer. Vol. 43. Amsterdam: Elsevier; 2011. pp. 77-226
Çiftçi E, Sözen A. Heat transfer enhancement in pool boiling and condensation using h-BN/DCM and SiO2/DCM nanofluids: Experimental and numerical comparison. International Journal of Numerical Methods for Heat & Fluid Flow. 2020;31(1):26-52
Prajapati OS, Rohatgi N. Flow boiling heat transfer enhancement by using ZnO-water nanofluids. Science and Technology of Nuclear Installations. 2014;2014
He Y, Jin Y, Chen H, Ding Y, Cang D, Lu H. Heat transfer and flow behaviour of aqueous suspensions of TiO2 nanoparticles (nanofluids) flowing upward through a vertical pipe. International Journal of Heat and Mass Transfer. 2007;50(11–12):2272-2281
Prajapati OS, Rajvanshi AK. Al2O3-water nanofluids in convective heat transfer. In: Applied Mechanics and Materials. Vol. 110. Switzerland: Trans Tech Publications Ltd.; 2012. pp. 3667-3672
Amiri A, Shanbedi M, Amiri H, Heris SZ, Kazi SN, Chew BT, et al. Pool boiling heat transfer of CNT/water nanofluids. Applied Thermal Engineering. 2014;71(1):450-459
Chen J, Ahmad S, Cai J, Liu H, Lau KT, Zhao J. Latest progress on nanotechnology aided boiling heat transfer enhancement: A review. Energy. 2021;215:119114
Kandlikar SG. Handbook of Phase Change: Boiling and Condensation. England: Routledge, Taylor & Francis; 2019
Kharangate CR, Mudawar I. Review of computational studies on boiling and condensation. International Journal of Heat and Mass Transfer. 2017;108:1164-1196
Wang SP, Chato JC. Review of Recent Research on Boiling and Condensation Heat Transfer with Mixtures. Urbana, Illinois: Air Conditioning and Refrigeration Center TR-23, College of Engineering. University of Illinois at Urbana-Champaign; 1992
Moreira TA, Furlan G, e Oliveira GHDS, Ribatski G. Flow boiling and convective condensation of hydrocarbons: A state-of-the-art literature review. Applied Thermal Engineering. 2021;182:116129
Hu X, Yi Q, Kong X, Wang J. A review of research on dropwise condensation heat transfer. Applied Sciences. 2021;11(4):1553
Erb RA. Wettability of metals under continuous condensing conditions. The Journal of Physical Chemistry. 1965;69(4):1306-1309
Qi Z, Dongchang Z, Jifang L. Surface materials with dropwise condensation made by ion implantation technology. International Journal of Heat and Mass Transfer. 1991;34(11):2833-2835
Ma X, Xu D, Lin J. Dropwise condensation on superthin polymer surface. Journal of Chemical Industry and Engineering-China. 1993;44:165
Tanasawa I. Advances in condensation heat transfer. In: Advances in Heat Transfer. Vol. 21. Amsterdam: Elsevier; 1991. pp. 55-139
Akbari A, Alavi Fazel SA, Maghsoodi S, et al. Pool boiling heat transfer characteristics of graphene-based aqueous nanofluids. Journal of Thermal Analysis and Calorimetry. 2019;135:697-711
Written By
Bijoy Kumar Purohit, Zakir Hussain and PVR Sai Prasad
Submitted: 08 February 2022 Reviewed: 14 June 2022 Published: 29 July 2022
DOWNLOAD FOR FREE
Cite this chapter
There are two ways to cite this chapter:
Download citation
© 2022 The Author(s). Licensee IntechOpen. This chapter is distributed under the terms of the Creative Commons Attribution 3.0 License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Continue reading from the same book
View All
Heat Transfer
Edited by Md. Salim Newaz Kazi
Published: 01 February 2023
IntechOpen Author/Editor? To get your discount, log in.
Your cart
Discounts available on purchase of multiple copies. View rates
| | |
--- |
| Subtotal | €0.00 |
Local taxes (VAT) are calculated in later steps, if applicable.
Support: orders@intechopen.com |
14155 | https://files.eric.ed.gov/fulltext/EJ1093423.pdf | Visualising the roots of quadratic equations with complex coefficients Nicholas S. Bardell QuEST Global Engineering nick.bardell@quest-global.com Introduction T his paper is a natural extension of the root visualisation techniques first presented by Bardell (2012) for quadratic equations with real coefficients. Consideration is now given to the familiar quadratic equation y = ax2 + bx + c in which the coefficients a, b, c are generally complex, as shown explicitly in Equation (1) with the usual notation. y =(aR +iaI ) x 2 +(bR +ibI ) x +(cR +icI ) (1) The roots are most easily found from the ‘standard’ quadratic equation formula, suitably modified to account for the complex coefficients thus: x = −(bR +ibI )± (bR +ibI ) 2 −4(aR +iaI )(cR +icI ) 2(aR +iaI ) (2) A routine application of Equation (2) will furnish the desired roots, and for most students this is usually the final step in a given analysis. However, there are many rich nuggets of information to be mined from a fuller consideration of Equations (1) and (2), with the pièce de résistance being an ability to somehow visualise the location and nature of the roots. Surprisingly little has been written about this topic. Hardy (2008, pp. 94– 95) finds the solution for the roots by dividing Equation (1) through by the (aR + iaI) term, effectively forcing the leading coefficient to be monic and thus losing the general condition that all coefficients are arbitrary complex numbers. His solutions are thus non-generic, and some of the conditions he puts forward for the type of roots that result from a given set of complex coefficients are therefore of limited value. McCarthy (n.d.) has also noted these shortcomings. In response he has produced a highly insightful article about the most general form of a quadratic equation with generally complex coefficients, as shown in Equation (1), and therein derives various criteria that can be applied to the complex coefficients in order to predict particular Australian Senior Mathematics Journal vol. 28 no. 1 7 types of roots. His solutions are totally generic and accord with the current work; all of his various root criteria are tried, tested, and proved herein.
A reasonable starting point would focus on plotting the curve represented by Equation (1). This is more difficult than it looks, and a simple x–y plot can only be found by separating the real and imaginary components of y and presenting them both on the same set of axes. However, such a plot is hard to interpret and in general does not reveal any information about the location or the nature of the roots. It is a lamentable fact that few mathematics text books get even this far, and the remarkable dearth of information on this particular topic has been noted by Hardy (2008, pp. 94–95) and McCarthy (n. d.). By way of illustration, consider the following equation: y =(1−i) x 2 + (−2 + 6i) x + (3 −2i) (3) The real and imaginary parts are plotted separately over the range –4 ≤ x ≤ 6 as shown in Figure 1. Figure 1. Plot of the real and imaginary parts of Equation (3).
Although the curves for Re(y) and Im(y) may intersect each other and/ or the x-axis once, twice, or not at all, there is no great significance to any of these intersections. From Equation (2) the roots are determined as: x1 = 0.414 + 0.419i and x2 = 3.586 – 2.419i. From Figure 1, the Im(y) curve crosses the x-axis at points (a) x = 0.354 and (b) x = 5.646; the common intersection between the Re(y) and Im(y) curves occurs at points (c) x = 0.775 and (d) x = 3.225; and the vertices of either curve are located at points (e) x = 1 and (f) x = 3. None of these points (a) to (f) corresponds to the real or imaginary part of either root. Such observations beg the questions: Where are the roots located, why does the x–y plot give no hint of their nature, and how can we visualise things more clearly?
Bardell Australian Senior Mathematics Journal vol. 28 no. 1 8 Visualising the roots of quadratic equations with complex coefficients The aim of this paper is to answer these fundamental questions. The explanations offered will be of most interest to those teaching and studying a Mathematics Specialism (ACARA, n.d., Unit 3) such as the Victorian VCE (Specialist Mathematics, 2010), HSC in NSW (Mathematics Extension in NSW, 1997) or Queensland QCE (Mathematics C, 2009). Some of the stated aims of Specialist Mathematics (ACARA, n.d., Rationale) are to develop students’ • “understanding of concepts and techniques drawn from complex numbers”, • “ability to solve applied problems using concepts and techniques drawn from complex numbers” and • “capacity to choose and use technology appropriately”.
Whilst the basics of these topics may be thoroughly covered in various textbooks, real-world applications and visualisations of these concepts are not —this paper helps answer these needs.
Theory: Complex generalisation Since the roots resulting from Equation (2) can be complex, this implies that the values assigned to x in Equation (1) do not have to be limited to the set of real numbers but rather could—and possibly should—include complex values. Whilst this is implicitly obvious, since no restriction was ever placed on x or y at the outset, it is rarely presented as an explicit proposition. Perhaps one reason why this is seldom considered is simply one of expedience —constructing a plot using generally complex values of x is not for the faint-hearted! Nevertheless, if this line of reasoning is pursued, and x is allowed to take a generally complex value G + iH, in which i is the complex number −1 , then substituting this into Equation (1) yields: y =(aR +iaI )(G + iH ) 2 +(bR +ibI )(G + iH )+(cR +icI ) (4a) Equation (4a) can be expanded and simplified to y = aRG 2 −aRH 2 −2aIGH +bRG −bIH +cR +i(2aRGH +aIG 2 −aIH 2 +bRH +bIG +cI ) (4b) Since y must also be generally complex, of the form A + iB, then it is possible to equate the real (Re) and imaginary (Im) parts of both sides of Equation (4b).
Equating Re parts: A = aRG2 – aRH2 – 2aIGH + bRG – bIH + cR (5) Equating Im parts: B = 2aRGH + aIG2 – aIH2 + bRH + bIG + cI (6) Equations (5) and (6) represent three-dimensional surfaces describing the generalised complex form of Equation (1). It is noted that when H = 0, i.e., a section taken through either surface to reveal the real GA or GB plane, that the equations A = aRG2 + bRG + cR and B = aIG2 + bIG + cI are obtained, and Australian Senior Mathematics Journal vol. 28 no. 1 9 the trace of each of these curves is nothing more than the original Equation (1) split into its real and imaginary parts. It is now becoming evident that the x–y plane shown in Figure 1 is simply a two-dimensional ‘slice’ of a more general three-dimensional solution space. This latter three-dimensional representation contains all the information necessary to reveal the nature of the roots given by Equation (2) and will be used to explain why they can occur in any general combination.
The surface A for Re(y) The expression for Re(y) shown in Equation (5) is a quadric surface that can be identified and classified by reducing it to its simplest (canonical) form by translation and rotation of axes. See Bardell (2012, Appendix A), for further details, and the procedure for determining the expressions for m, n, p and β. Thus: G' = G – m (7a) H' = H – n (7b) ZA = A – p (7c) where m = −(bRaR +bIaI ) 2(aR 2 +aI 2) (7d) n = −(bIaR −bRaI ) 2(aR 2 +aI 2) (7e) p = −bR 2aR −2bRbIaI +bI 2aR + 4aR 2cR + 4aI 2cR 4(aR 2 +aI 2) (7f) followed by a counter-clockwise rotation in the plane of the newly translated G'H' axes about a normal through the local origin by an amount βA where tanβA = aR − aR 2 +aI 2 aI (7g) This coordinate transformation renders Equation (5) in the form, Z A = aR 2 +aI 2X A 2 − aR 2 +aI 2YA 2 (8) which is readily classified as a hyperbolic paraboloid with a vertex centred at (m, n, p). This surface can easily be constructed over a range of G, H values for a specific quadratic equation with complex coefficients (see Bardell (2012, pp. 8–9). The following observations follow: • Only aI, the imaginary part of the coefficient of the x2 term, causes the rotation of the principal planes of the surface A. If aI = 0 then the orientation of the principal planes will align with the G'H'-axes. (This result follows from Equation (7g), despite it appearing to become indeterminate on account of the right hand side becoming 0/0. However, a single application of L’Hôpital’s rule confirms that in the limit as aI → 0, the expression for the right hand side also tends to zero, and hence βA = 0).
Bardell Australian Senior Mathematics Journal vol. 28 no. 1 10 Visualising the roots of quadratic equations with complex coefficients • The altitude p of the local G'H' origin above the GH plane is independent of cI but dependent on all the other coefficients.
• When the imaginary components of all the coefficients are zero, familiar results for the real coefficient case are recovered, as expected; see Bardell (2012) for a comparison.
The surface B for Im(y) The expression for Im(y), as shown in Equation (6), is also that of a general quadric surface, with many similarities to surface A. Once again, by adopting exactly the same approach to transform and rotate the GHB axes, this equation can also be reduced to its simplest (canonical) form thus: G' = G – q (9a) H' = H – r (9b) ZB = B – s (9c) where q = −(bRaR +bIaI ) 2(aR 2 +aI 2) (9d) r = −(bIaR −bRaI ) 2(aR 2 +aI 2) (9e) s = −bI 2aI −2bRbIaR +bR 2aI + 4aR 2cI + 4aI 2cI 4(aR 2 +aI 2) (9f) followed by a counter-clockwise rotation in the plane of the newly translated G'H' axes about a normal through the local origin by an amount βB where tanβB = −aI + aR 2 +aI 2 aR (9g) This coordinate transformation renders Equation (6) in the form, Z B = aR 2 +aI 2X B 2 − aR 2 +aI 2YB 2 (10) which again is readily classified as a hyperbolic paraboloid with a vertex centred at (q, r, s). This surface can also be constructed without difficulty; it is identical in form to that for A, (as confirmed by comparing Equations (8) and (10)) but differs in terms of its orientation—note the subtle difference between Equations (7g) and (9g)—and the altitude of its vertex origin above the GH-plane. The following observations follow: • Only aI, the imaginary part of the coefficient of the x2 term, causes the rotation of the principal plane XBZB of the surface. If aI = 0 then tanβB = 1 (from Equation (9g)) and the principal planes are rotated by π/4 counter-clockwise about a normal through the local G'H' origin, as found by Bardell (2012) for the case with only purely real coefficients.
• The altitude s of the local G'H' origin above the GH-plane is independent of cR but dependent on all the other coefficients.
Australian Senior Mathematics Journal vol. 28 no. 1 11 • When the imaginary components of all the coefficients are zero, the results for the real coefficient case are recovered, as expected; see Bardell (2012) for details.
The relation between the surfaces A and B Both these surfaces share a common origin projected on to the horizontal GH-plane, since m = q and n = r as shown by Equations (7d), (9d) and (7e), (9e). Incidentally, these terms ((m, n) or (q, r)) may be verified to be the real and imaginary parts respectively of the first part of Equation (2), namely −(bR +ibI ) 2(aR +iaI ) (11) rendered as a single complex number. This locates the common local G'H' origin of both surfaces when viewed in the GH-plane. Note that in general, because both m, q ≠ 0 and n, r ≠ 0, the local origin of each surface no longer lies at a single point (–b/2a) on the G-axis as it does for a quadratic equation with only real coefficients; indeed, it is now displaced away from the GH origin altogether such that it no longer lies in the GA plane, and it can vary in altitude. This is why a simple x–y plot of both Re(y) and Im(y), as shown in Figure 1, is unlikely to reveal the whereabouts of the roots, since a section taken at H = 0 will not, in general, pass through the common local G'H' origin as it does in the case of real coefficients. Note also that the vertical location of each surface’s origin—whether above or below the GH-plane—differs by an amount (p – s). The terms p (see Equation (7f)) and s (see Equation (9f)) may also be verified as the real and imaginary parts of −[(bR +ibI ) 2 −4(aR +iaI )(cR +icI )] 4(aR +iaI ) (12) which is just the term –Δ/4a generalised to its complex form; see Bardell (2012, Section 3.4) for further details. Here, the discriminant Δ takes the form Δ = (bR + ibI)2 – 4(aR + iaI)(cR + icI). It is important to note that the origin of the surface B is no longer coincident with the GH-plane, i.e., s ≠ 0. It is for this reason that the G'H' axes are shown projected on the zero plane in the plots that follow.
Although both A and B are now rotated relative to the GH axes, the orientation of the principal plane XBZB of the surface B is always rotated counter-clockwise by a constant angle π/4 relative to the principal plane XAZA of the surface A regardless of the values of the participating coefficients. This result follows immediately from the well-known tangent relationship tan(βB −βA)= tan(βB)−tan(βA) 1+tan(βB)tan(βA) (13) which, upon substitution of the expressions for tan(βA) from Equation (7g) and tan(βB) from Equation (9g), reduces to tan(βB −βA)= 1 (14a) i.e., βB −βA = π 4 (14b) Bardell Australian Senior Mathematics Journal vol. 28 no. 1 12 Visualising the roots of quadratic equations with complex coefficients Both surfaces are hence ‘locked’ together in terms of their rotational relationship, and the GH coordinates of their origin; however, they are ‘free’ to rotate in unison about the common local Z-axis and also to move relative to one another, but in the vertical Z-sense only, i.e., (p – s) ≠ constant. As for the case with purely real coefficients, the roots are found from the two common points of intersection of the surfaces A = B = 0.
Location of the roots To find the location of the roots in the GH-plane, a similar procedure to that described by Bardell (2012) is adopted. By definition, the roots occur when y = 0, implying that both Re(y) and Im(y) must simultaneously be zero. In other words, the location and nature of the roots will be defined where the two surfaces for Re(y) (≡ A) and Im(y) (≡ B) have a common intersection with a horizontal plane positioned at zero altitude. Analytically, this could be accomplished by solving Equations (5) and (6) simultaneously for G and H with both A and B = 0. However, this approach proves algebraically fairly intractable and will not be pursued further here, although it should nonetheless be mentioned that the resulting expressions for the roots x1 at (G1, H1) and x2 at (G2, H2) consist of the real and imaginary parts of Equation (2), as expected. It is also noted that in general G2 ≠ G1 which is in contrast to the (conjugate) form of the roots (where G2 = G1) that was reported by Bardell (2012) when all the coefficients are real.
It is also stated, without proof, that if the roots are considered in the G'H' axis system, which is centred at the combined surfaces’ common local origin at (m, n) in the GH plane, then these roots are equi-pitched about this local origin and lie diametrically opposite each other on a circle of diameter: D = (G1 −G2) 2 + (H1 −H 2) 2 (15) In the special case when all the coefficients are real, G1 = G2 and hence Equation (15) reduces to: D = (H1 −H 2)= 4aRcR −bR 2 aR (16) which is recognised as the total distance along the H'-axis between a pair of conjugate roots.
Results and examples In order to give some meaning to the concepts discussed above, attention will now be focused on the quadratic equation originally presented in Equation (3), which yields generally complex roots. In the three-dimensional surfaces that follow, the horizontal plane contains the Re(x) (≡ G) and Im(x) (≡ H) Australian Senior Mathematics Journal vol. 28 no. 1 13 axes, thus forming the Argand plane, whilst the vertical axis represents either Re(y) (≡ A) or Im(y) (≡ B) depending on which surface is being investigated.
All the three-dimensional plots presented in this paper were constructed using Mathcad (2007), which is one of many VCE/QCE/HSC-approved computer algebra systems available to schools, and fully commensurate with the following ACARA (2009, Section 6.5.2) stated aim: “digital technologies can make previously inaccessible mathematics accessible, and enhance the potential for teachers to make mathematics interesting to more students”.
Type I(a): Complex distinct roots From Equation (3), the complex coefficients are: aR = 1, aI = -1; bR = –2, bI = 6; cR = 3, cI = –2. These data, when substituted in Equations (7d–7g) and (9d–9g) yield the surface parameters shown in Table 1; the roots follow from Equation (2) as: x1 = 0.414 + 0.419i and x2 = 3.586 – 2.419i.
Table 1. The complex generalisation surface parameters for y = (1 – i)x2 + (–2 + 6i)x + (3 – 2i).
Surface A Surface B Parameter Value Equation Parameter Value Equation ZA √2XA 2 – √2YA 2 (8) ZB √2XB 2 – √2YB 2 (10) m 2 (7d) q 2 (9d) n –1 (7e) r -1 (9e) p 4 (7f) s 5 (9f) βA π/8 or 22.5º (7g) βB 3π/8 or 67.5º (9g) The surface A is constructed as described by Bardell (2012, pp. 8–9), and the following Figures 2 to 5 illustrate the key surface parameters sum-marised in Table 1. For clarity, the G'H' axes are shown projected on the zero plane.
Figure 2. The surface A corresponding to the real part of the complex generalisation of y = (1 – i)x2 + (–2 + 6i)x + (3 – 2i).
Bardell Australian Senior Mathematics Journal vol. 28 no. 1 14 Visualising the roots of quadratic equations with complex coefficients Figure 3. View on the GA plane of the surface A.
Figure 4. View on the HA plane of the surface A.
Australian Senior Mathematics Journal vol. 28 no. 1 15 Figure 5. View on the GH plane of the surface A.
Figure 5 clearly shows the how the surface A is rotated by an angle π/8 counter-clockwise about its local origin at (m, n). Figures 6 to 9 are constructed for the surface B using the techniques described by Bardell (2012, pp. 8–9). These figures show a general quadric surface in contrast to the bi-linear (degenerate) case which resulted from purely real coefficients. Again, for clarity, the G'H' axes are shown projected on the zero plane.
B or Im(y) H or Im(x) G or Re(x) H’ G’ Figure 6. The surface B corresponding to the imaginary part of the complex generalization of y = (1 – i)x2 + (–2 + 6i)x + (3 – 2i).
Bardell Australian Senior Mathematics Journal vol. 28 no. 1 16 Visualising the roots of quadratic equations with complex coefficients Figure 7. View on the GB plane of the surface B.
Figure 7 vividly shows s ≠ 0 (s = 5 in this particular case) and Figure 8 shows r ≠ 0 (r = –1 in this particular case). The surface B hence has more ‘scope’ to influence the location and nature of the roots than its real-coefficient counterpart investigated by Bardell (2012), in which both s = 0 and r = 0.
Figure 8. View on the HB plane of the surface B.
Australian Senior Mathematics Journal vol. 28 no. 1 17 Figure 9. View on the GH plane of the surface B.
Figure 9 clearly shows how the surface B is rotated by an angle 3π/8 counter-clockwise about its local origin at (q, r); superimposing Figures 9 and 5 shows how a constant angular difference of π/4 is always maintained between surface B and surface A as per Equation (14b).
Figure 10. The distinct complex roots found at the common intersection of A = B = 0 from the complex generalization of y = (1 – i)x2 + (–2 + 6i)x + (3 – 2i).
Bardell Australian Senior Mathematics Journal vol. 28 no. 1 18 Visualising the roots of quadratic equations with complex coefficients As explained above, the complex roots are defined by the simultaneous satisfaction of Equations (5) and (6), namely A = B = 0, or Re(y) = Im(y) = 0. This is shown graphically in Figure 10 by the two points resulting from the intersection of the surfaces A and B with each other and with a horizontal plane positioned at zero altitude. These points are the two roots of the quadratic equation.
Figure 11 shows a view on the GH (Argand) plane from directly above. The location of the two roots at G1 = 0.414 and H1 = 0.419; i.e., x1 = 0.414 + 0.419i and at G2 = 3.586 and H2 = –2.419; i.e., x2 = 3.586 – 2.419i is clearly visible, being at the two unique points of intersection where A = B = 0. The location of the roots relative to the combined surfaces’ common origin at (2, –1) is x1' = –1.586 + 1.419i and x2' = 1.586 – 1.419i. These roots are each of equal magnitude 2.128 units and located opposite each other on a circle of diameter 4.256 units.
Figure 11. Plan view of the surfaces A and B showing the location of the generally complex roots of y = (1 – i)x2 + (–2 + 6i)x + (3 – 2i).
Finally, if a section is taken through both surfaces at H = 0, the traces of the ‘cut’ ends of surfaces A and B fully replicate the curves for Re(y) and Im(y) respectively shown in Figure 1. This vividly illustrates how the original x–y plane alone is merely a ‘slice’ of a much bigger picture, and is therefore very limited in the information it can convey for this type of problem.
Australian Senior Mathematics Journal vol. 28 no. 1 19 Figure 12. Section taken at H = 0 revealing the original traces of Re(y) and Im(y) from Equation (3) and Figure 1.
This completes the detailed review of a specific case in support of the methodology advanced in the section Theory. It is noted that for a given set of participating coefficients, generally complex roots (which includes real, imaginary, or a combination thereof) may be expected to occur. Some further examples are now given to illustrate the wide variety of root combinations that can exist for this type of quadratic equation with complex coefficients. These examples are intended to showcase some of the many different surface arrangements that can occur as the participating complex coefficients in a given equation are varied, and hence the plethora of roots that are possible.
Type I(b): Complex equal (repeated) roots A pair of equal complex roots can only occur if m ≠ 0 and n ≠ 0 but p = s = 0 such that only a single point results from the intersection of A = B = 0. This is equivalent to ensuring the discriminant Δ in Equation (2) is zero. From a consideration of both the real and imaginary parts of the discriminant, this levies the following constraint on the complex coefficients: bR 2 −bI 2 =4(aRcR - aIcI ) and 2bRbI =4(aRcI −aIcR ) (17) A suitable set of coefficients that satisfies Equation (17) is: aR = 4, aI = 16/3; bR = 8, bI = 4; cR = 3, cI = 0. These data yield Δ = 0, m = –0.6, n = 0.3, p = 0, s = 0. The resulting equal (repeated) roots are x1, x2 = –0.6 + 0.3i. Note how these roots coincide with the common local origin (m, n) of both surfaces at altitude p = s = 0. Bardell Australian Senior Mathematics Journal vol. 28 no. 1 20 Visualising the roots of quadratic equations with complex coefficients Type I(c): Complex conjugate roots A pair of complex conjugate roots can occur, but only if: • they fall on a line running parallel to the H-axis—to ensure the same real G-value; and • the local origin of both surfaces is positioned at n = 0 in the GH-plane—to ensure equal and opposite imaginary ±H-values.
McCarthy (n.d.) has proved that the complex coefficients must obey the criteria shown in Equation (18) to ensure conjugate roots: bR 2 −4aRcR < 0 and (aRbI −aIbR )= 0 and (aRcI −aIcR )= 0 (18) Figure 13. The complex conjugate roots found at the common intersection of A = B = 0 from the complex generalization of y = (1 + 2i)x2 + (2 + 4i)x + (5 + 10i).
McCarthy (n.d.) has shown further that if the complex coefficients are considered as vectors, then for complex conjugate roots to occur a, b, c must be collinear. A suitable set of coefficients that satisfies Equation (18) is: aR = 1, aI = 2; bR = 2, bI = 4; cR = 5, cI = 10. These data yield Δ = 48 – 64i, m = –1, n = 0, p = 4, s = 8. From Equation (2) the resulting complex conjugate roots are x1 = –1 – 2i, x2 = –1 + 2i. These roots are shown in Figure 13. Each root is clearly equidistant from the local G'H' origin at (–1, 0). For clarity, the G'H' axes are shown projected on the zero plane.
Hardy (2008, pp. 94–95) asserts that complex conjugate roots can exist only if all the coefficients are real. This is actually incorrect as will now be demonstrated. From the elementary theory of roots of a general quadratic equation, if ax2 + bx + c = 0 has roots α, β, then by definition the sum of the roots (α + β) = –b/a and the product of the roots αβ = c/a. This condition Australian Senior Mathematics Journal vol. 28 no. 1 21 holds for coefficients that are either real or complex. If the roots form a complex conjugate pair, i.e., α = G + iH and β = G – iH, then clearly the sum of the roots α + β = 2G is real, and the product of the roots αβ = G2 + H2 is also real. This means that the sum and product quantities –b/a and c/a in the original quadratic equation must also be real. This reasoning led Hardy to conclude that all the participating coefficients therefore had to be real for complex conjugate roots to result. However, this is not necessarily the case.1 Only the ratios –b/a and c/a must be real, but not the actual coefficients themselves. (In the current example, with complex coefficients, the ratios –b/a = –2 and c/a = 5 are most definitely real). The ratios are unique, but the actual values of a, b, c are not themselves uniquely determined. Now, it must also be noted that if the original equation with complex coefficients is divided through by the (aR + iaI) term, x2 + 2x + 5 = 0 results, and it could be argued that the complex coefficients given here reduce to a real coefficient example. However, the surface representations A and B that result from the two forms of the quadratic equation are quite different, indicating each equation is unique, even though the resulting roots turn out to be the same.
This illustrates why rendering a quadratic equation monic, as Hardy does, masks certain important information, and shows that if only the roots are given, it is not possibly to reconstruct the original quadratic equation with complex coefficients unless the (aR + iaI) term is known.
Type I(d): Purely imaginary roots Purely imaginary roots can only occur if they lie somewhere on the line G = 0. McCarthy (n.d.) has proved that the criteria for this to occur are: bI 2 + 4aRcR ≥0 and (aRbI + aIbR )= 0 and (aRcI −aIcR )= 0 (19) One possible set of coefficients that satisfies Equation (19) is: aR = 1, aI = 1; bR = –2, bI = 2; cR = 1, cI = 1. These data yield Δ = –16i, m = 0, n = –1, p = 2, s = 2. The resulting roots are x1 = –2.414i, x2 = 0.414i. These roots are located equidistant from the local origin at (0, –1) in the GH plane, as expected. McCarthy (n.d.) has also noted that if the complex coefficients are considered as vectors, then for purely imaginary roots to occur, a ⊥ b and a || c, which is demonstrated by the numerical values used here.
Type II: Mixed roots—one complex root, one real root A mixed root solution to Equation (1) can occur. The real root must lie somewhere along the G-axis (i.e, H = 0), but there is no restriction on the location of the complex root. No general criteria applicable to the coefficients have been reported that will guarantee this particular outcome. For clarity, the G'H' axes are shown projected on the zero plane.
1 This conclusion is a direct conequence of Hardy (2008) making the term x2 monic.
Bardell Australian Senior Mathematics Journal vol. 28 no. 1 22 Visualising the roots of quadratic equations with complex coefficients Figure 14. The mixed roots found at the common intersection of A = B = 0 from the complex generalisation of y = (1 + i)x2 –2x + (–8 – 4i).
A suitable set of coefficients that will yield mixed roots is: aR = 1, aI = 1; bR = –2, bI = 0; cR = –8, cI = –4. These data yield Δ = 20 + 48i, m = 0.5, n = –0.5, p = –8.5, s = –3.5. The resulting roots are x1 = –2, x2 = 3 – i as shown in Figure 14. About their local G'H' origin at (0.5, –0.5) these roots become –2.5 + 0.5i and 2.5 – 0.5i, lying on a circle of diameter 26 . A plot of this quadratic equation in the Cartesian x–y plane shows the Re(y) and Im(y) traces both crossing the x-axis at x = –2. This point locates the purely real root, but there is no further information available to indicate the whereabouts of the complex root (see Figure 15). Figure 15. Plot of y = (1 + i)x2 – 2x + (–8 – 4i).
Australian Senior Mathematics Journal vol. 28 no. 1 23 Note also that it is quite possible to have a mixed solution consisting of a purely real root and a purely imaginary root. The real root must lie somewhere along the G-axis (i.e, H = 0) and the imaginary root must lie somewhere along the H-axis (i.e, G = 0). Again, no general criteria applicable to the coefficients have been reported that will guarantee this particular outcome.
Type III(a): Real distinct roots Roots that are real and distinct must both lie along the G-axis (i.e., H = 0).
McCarthy (n.d.) has proved that the complex coefficients required to produce a pair of purely real roots must obey the following criteria: bR 2 −4aRcR ≥0 and (aRbI −aIbR )= 0 and (aRcI −aIcR )= 0 (20) A set of coefficients that satisfies Equation (20) is: aR = 1, aI = 0.5; bR = 4, bI = 2; cR = –2, cI = –1. These data yield Δ = 18 + 24i, m = –2, n = 0, p = –6, s = –3. The resulting real and distinct roots are x1 = –4.449, x2 = 0.449 as shown in Figure 16. Although both roots are real, the view of the combined surfaces presented here, and the manner of their intersection with each other and the zero plane, looks very different from that found from the analogous real-coefficient case (see Bardell, 2012). For clarity, the G'H' axes are shown projected on the zero plane. Figure 16. The real and distinct roots found at the common intersection of A = B = 0 from the complex generalisation of y = (1 + i/2)x2 + (4 + 2i)x + (–2 – i).
Bardell Australian Senior Mathematics Journal vol. 28 no. 1 24 Visualising the roots of quadratic equations with complex coefficients Again, contrary to popular belief, purely real roots can result from a quadratic equation with generally complex coefficients. McCarthy (n.d.) has shown further that if the complex coefficients are considered as vectors, then for real roots to occur a, b, c must be collinear, per the present example. This condition is the same as that applicable to finding complex conjugate roots, and only the additional constraint on the value of bR 2 – 4aRcR dictates the final result. It is interesting to note that if bR 2 – 4aRcR = 0 then coincident real roots will result, these being the transition point between real and complex conjugate roots.
For the given example, following the argument presented for complex conjugate roots, a similar conclusion holds here. If the roots are purely real, i.e., α = G1 and β = G2, then clearly the sum of the roots α + β = G1 + G2 is real, and the product of the roots αβ = G1G2 is also real. This means that the sum and product quantities –b/a and c/a must also be real which could lead one to conclude that all the participating coefficients therefore have to be real for real roots to result. However, only the ratios –b/a and c/a must be real, but not the actual coefficients themselves. In the current example, –b/a = 4 and c/a = –2 (both real), yet the defining coefficients are themselves complex.
A plot of this quadratic equation in the Cartesian x–y plane (H = 0) shows the Re(y) and Im(y) traces have common intersections and cross the x-axis at x1 = –4.449, x2 = 0.449 which indicates the solution involves two real roots. It is noted the two roots are equi-spaced about the point (–2, 0) which is the common vertex of the curves represented by Re(y) and Im(y) in the x–y plane and of course the common vertex (m, n) of the surfaces A and B.
Figure 17. Plot of y = (1 + i/2)x2 + (4 + 2i) x + (–2 – i).
Australian Senior Mathematics Journal vol. 28 no. 1 25 Type III(b): Real equal (repeated) roots With reference to the complex repeated roots presented in section Type I(b), the same criterion applies here but with the additional constraint that now n or r = 0 (which implies bIaR – aIbR = 0 from Equation(7e)) to enforce a solution on the real GA plane. Hence the complex coefficients must now obey: bR 2 −bI 2 =4(aRcR −aIcI ) and 2bRbI =4(aRcI −aIcR ) and (aRbI −aIbR )=0 (21) Alternatively, from Section 3.5 above, the following [equivalent] condition also holds: bR 2 −4aRcR = 0 and (aRbI −aIbR )= 0 and (aRcI −aIcR )= 0 (22) A set of coefficients that identically satisfies Equation (21) and Equation (22) is: aR = 1, aI = 1/4; bR = 4, bI = 1; cR = 4, cI = 1. These data yield Δ = 0, m = –2, n = 0, p = 0, s = 0. The local origin of both surfaces lies on the zero plane at GH = (–2, 0) and is itself the single point that results from the intersection of A = B = 0. Hence the resulting repeated real roots are x1 = x2 = –2, coincident with the local origin.
Figure 18. Plot of y = (1 + i/4)x2 + (4 + i)x + (4 + i).
Figure 18 shows the traces of the Re(y) and Im(y) parts of the quadratic equation in just the Cartesian x–y plane (H = 0). Both curves have a single common point of intersection that is also tangential with the x-axis at x = –2. This point indicates the location of a repeated real root.
Bardell Australian Senior Mathematics Journal vol. 28 no. 1 26 Visualising the roots of quadratic equations with complex coefficients Conclusions A quadratic equation with generally complex coefficients can yield any possible combination of roots. This is in complete contrast to the real-coefficient counterpart studied by Bardell (2012). For a given set of complex coefficients it is not easy to predict what type and combination of roots will result—to this end some general criteria have been either quoted from McCarthy (n.d.) and verified, or developed from the graphical considerations presented herein.
This paper has shown that the complex generalisation of a quadratic equation may easily be extended to accommodate the case with complex coefficients. The roots are still found from the intersection of the hyperbolic paraboloid surfaces A and B, representing the real and imaginary parts of the generalisation respectively, with a plane at zero altitude, as first described by Bardell (2012). Many similarities between the two types are evident, although when the coefficients are generally complex any possible combination of the roots may occur. This is primarily due to both three-dimensional surfaces exhibiting a greater freedom of orientation and elevation compared with their real-coefficient counterparts and thus more varied opportunities to intersect each other and the zero plane. A fuller understanding of this, and other phenomena, has been facilitated by the visualisation techniques presented in this paper. It has further been shown that the roots are always spaced equi-distant from the common local origin of the real and imaginary defining surfaces, and only under special circumstances do complex conjugate roots now result. Attempts to plot a quadratic equation with complex coefficients in only the Cartesian x–y plane fail to reveal any useful information about the location and nature of the roots unless they happen to contain a purely real part, in which case the curves representing Re(y) and Im(y) must both coincide at the point where they intersect the x-axis.
Finally, it should be mentioned that teachers can use programs such as Mathcad (2007) to show students how hyperbolic paraboloid surface functions, such as A and B described herein, can be easily plotted, zoomed, rotated, etc. The subject matter presented in this paper could easily form the basis of a classroom-based learning exercise in three-dimensional graphics using computer algebra systems that would amply satisfy the ACARA (2009, Section 6.5.1) stated aim, namely, that “digital technologies allow new approaches to explaining and presenting mathematics”.
Australian Senior Mathematics Journal vol. 28 no. 1 27 References Australian Curriculum, Assessment and Reporting Authority [ACARA]. (n.d.) Senior Secondary Curriculum – Specialist Mathematics Curriculum. Unit 3. Retrieved from
australiancurriculum.edu.au/SeniorSecondary/mathematics/specialist-mathematics/ Curriculum/SeniorSecondary#page=3 Australian Curriculum, Assessment and Reporting Authority [ACARA]. (n.d.) Senior Secondary Curriculum – Specialist Mathematics Curriculum. Rationale. Retrieved from
australiancurriculum.edu.au/SeniorSecondary/mathematics/specialist-mathematics/ RationaleAims Australian Curriculum, Assessment and Reporting Authority [ACARA]. (2009). Shape of the Australian Curriculum: Mathematics. Retrieved from: resources/Australian_Curriculum-_Maths.pdf Bardell, N. S. (2012). Visualizing the roots of quadratic equations with real coefficients. Australian Senior Mathematics Journal, 26(2), 6–20.
Board of Studies NSW. (1997). HSC mathematics extension in NSW. Retrieved from
boardofstudies.nsw.edu.au/syllabus_hsc/pdf_doc/maths4u_syl.pdf Hardy, G. H. (2008). A course of pure mathematics centenary edition (10th ed.). Cambridge, UK: Cambridge University Press.
McCarthy, P. J. (n.d.). Discriminant for the quadratic equation with complex coefficients. Retrieved from Parametric Technology Corporation (2007). Mathcad 14.0.
Queensland Studies Authority. (2009). Queensland Mathematics C senior syllabus. Retrieved from Victorian Curriculum and Assessment Authority [VCAA]. (2010). VCE Specialist Mathematics. Retrieved from Bardell Australian Senior Mathematics Journal vol. 28 no. 1 28 |
14156 | https://chem.libretexts.org/Bookshelves/General_Chemistry/Map%3A_A_Molecular_Approach_(Tro)/14%3A_Chemical_Kinetics/14.04%3A_The_Integrated_Rate_Law-_The_Dependence_of_Concentration_on_Time | 14.4: The Integrated Rate Law- The Dependence of Concentration on Time - Chemistry LibreTexts
Skip to main content
Table of Contents menu
search Search build_circle Toolbar fact_check Homework cancel Exit Reader Mode
school Campus Bookshelves
menu_book Bookshelves
perm_media Learning Objects
login Login
how_to_reg Request Instructor Account
hub Instructor Commons
Search
Search this book
Submit Search
x
Text Color
Reset
Bright Blues Gray Inverted
Text Size
Reset
+-
Margin Size
Reset
+-
Font Type
Enable Dyslexic Font - [x]
Downloads expand_more
Download Page (PDF)
Download Full Book (PDF)
Resources expand_more
Periodic Table
Physics Constants
Scientific Calculator
Reference expand_more
Reference & Cite
Tools expand_more
Help expand_more
Get Help
Feedback
Readability
x
selected template will load here
Error
This action is not available.
chrome_reader_mode Enter Reader Mode
14: Chemical Kinetics
Map: A Molecular Approach (Tro)
{ }
{ "14.01:_Catching_Lizards" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "14.02:_Rate_of_a_Chemical_Reaction" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "14.03:_The_Rate_Law-_The_Effect_of_Concentration_on_Reaction_Rate" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "14.04:_The_Integrated_Rate_Law-_The_Dependence_of_Concentration_on_Time" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "14.05:_The_Effect_of_Temperature_on_Reaction_Rate" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "14.06:_Reaction_Mechanisms" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "14.07:_Catalysis" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1" }
{ "00:_Front_Matter" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "01:_Matter_Measurement_and_Problem_Solving" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "02:_Atoms_and_Elements" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "03:_Molecules_Compounds_and_Chemical_Equations" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "04:_Chemical_Reactions_and_Aqueous_Reactions" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "05:_Gases" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "06:_Thermochemistry" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "07:_The_Quantum-Mechanical_Model_of_the_Atom" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "08:_Periodic_Properties_of_the_Elements" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "09:_Chemical_Bonding_I-_Lewis_Structures_and_Determining_Molecular_Shapes" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "10:_Chemical_Bonding_II-_Valance_Bond_Theory_and_Molecular_Orbital_Theory" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "11:_Liquids_Solids_and_Intermolecular_Forces" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "12:_Solids_and_Modern_Materials" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "13:_Solutions" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "14:_Chemical_Kinetics" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "15:_Chemical_Equilibrium" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "16:_Acids_and_Bases" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "17:_Aqueous_Ionic_Equilibrium" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "18:_Gibbs_Energy_and_Thermodynamics" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "19:_Electrochemistry" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "20:_Radioactivity_and_Nuclear_Chemistry" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "21:_Organic_Chemistry" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "22:_Biochemistry" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "23:_Chemistry_of_the_Nonmetals" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "24:_Metals_and_Metallurgy" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "25:_Transition_Metals_and_Coordination_Compounds" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1", "zz:_Back_Matter" : "property get Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass230_0.b__1" }
Fri, 14 Aug 2020 20:43:53 GMT
14.4: The Integrated Rate Law- The Dependence of Concentration on Time
46996
46996
admin
{ }
Anonymous
Anonymous User
2
false
false
[ "article:topic", "showtoc:no", "license:ccbyncsa", "licenseversion:40" ]
[ "article:topic", "showtoc:no", "license:ccbyncsa", "licenseversion:40" ]
Search site Search Search Go back to previous article
Sign in
Username Password Sign in
Sign in
Sign in
Forgot password
Expand/collapse global hierarchy
1. Home
2. Bookshelves
3. General Chemistry
4. Map: A Molecular Approach (Tro)
5. 14: Chemical Kinetics
6. 14.4: The Integrated Rate Law- The Dependence of Concentration on Time
Expand/collapse global location
14.4: The Integrated Rate Law- The Dependence of Concentration on Time
Last updated Aug 14, 2020
Save as PDF
14.3: The Rate Law- The Effect of Concentration on Reaction Rate
14.5: The Effect of Temperature on Reaction Rate
Page ID 46996
( \newcommand{\kernel}{\mathrm{null}\,})
Table of contents
1. Learning Objectives
2. Zeroth-Order Reactions
1. Units
First-Order Reactions
Example 14.4.1
Strategy:
Solution
Exercise 14.4.1
Example 14.4.2
Strategy:
Solution
Exercise 14.4.2
Second-Order Reactions
Example 14.4.3
Strategy:
Solution
Exercise 14.4.3
Example 14.4.4
Strategy:
Solution
Exercise 14.4.4
Summary
Learning Objectives
To apply rate laws to zeroth, first and second order reactions.
Either the differential rate law or the integrated rate law can be used to determine the reaction order from experimental data. Often, the exponents in the rate law are the positive integers: 1 and 2 or even 0. Thus the reactions are zeroth, first, or second order in each reactant. The common patterns used to identify the reaction order are described in this section, where we focus on characteristic types of differential and integrated rate laws and how to determine the reaction order from experimental data. The learning objective of this Module is t o know how to determine the reaction order from experimental data.
Zeroth-Order Reactions
A zeroth-order reaction is one whose rate is independent of concentration; its differential rate law is
rate=k.
We refer to these reactions as zeroth order because we could also write their rate in a form such that the exponent of the reactant in the rate law is 0:
(14.4.1)rate=−Δ[A]Δt=k[reactant]0=k(1)=k
Because rate is independent of reactant concentration, a graph of the concentration of any reactant as a function of time is a straight line with a slope of −k. The value of k is negative because the concentration of the reactant decreases with time. Conversely, a graph of the concentration of any product as a function of time is a straight line with a slope of k, a positive value.
Figure 14.4.1: The graph of a zeroth-order reaction. The change in concentration of reactant and product with time produces a straight line.
Graph of concentration against time. The reactant is in purple and has a slope of minus k. The product is in green and has a slope of positive k.
The integrated rate law for a zeroth-order reaction also produces a straight line and has the general form
(14.4.2)[A]=[A]0−kt
where [A]0 is the initial concentration of reactant A. Equation 14.4.2 has the form of the algebraic equation for a straight line,
y=mx+b,
with y=[A], mx=−kt, and b=[A]0.)
Units
In a zeroth-order reaction, the rate constant must have the same units as the reaction rate, typically moles per liter per second.
Although it may seem counterintuitive for the reaction rate to be independent of the reactant concentration(s), such reactions are rather common. They occur most often when the reaction rate is determined by available surface area. An example is the decomposition of N 2 O on a platinum (Pt) surface to produce N 2 and O 2, which occurs at temperatures ranging from 200°C to 400°C:
(14.4.3)2N 2O(g)→Pt 2N 2(g)+O 2(g)
Without a platinum surface, the reaction requires temperatures greater than 700°C, but between 200°C and 400°C, the only factor that determines how rapidly N 2 O decomposes is the amount of Pt surface available (not the amount of Pt). As long as there is enough N 2 O to react with the entire Pt surface, doubling or quadrupling the N 2 O concentration will have no effect on the reaction rate. At very low concentrations of N 2 O, where there are not enough molecules present to occupy the entire available Pt surface, the reaction rate is dependent on the N 2 O concentration. The reaction rate is as follows:
(14.4.4)rate=−1 2(Δ[N 2O]Δt)=1 2(Δ[N 2]Δt)=Δ[O 2]Δt=k[N 2O]0=k
Thus the rate at which N 2 O is consumed and the rates at which N 2 and O 2 are produced are independent of concentration. As shown in Figure 14.4.2, the change in the concentrations of all species with time is linear. Most important, the exponent (0) corresponding to the N 2 O concentration in the experimentally derived rate law is not the same as the reactant’s stoichiometric coefficient in the balanced chemical equation (2). For this reaction, as for all others, the rate law must be determined experimentally.
Figure 14.4.2: A Zeroth-Order Reaction. This graph shows the concentrations of reactants and products versus time for the zeroth-order catalyzed decomposition of N 2 O to N 2 and O 2 on a Pt surface. The change in the concentrations of all species with time is linear.
Graph of concentration against time. N2O is the reactiant is graphed in purple. O2 is one of the products and is graphed in green. The second product is N2 which is graphed in red
A zeroth-order reaction that takes place in the human liver is the oxidation of ethanol (from alcoholic beverages) to acetaldehyde, catalyzed by the enzyme alcohol dehydrogenase. At high ethanol concentrations, this reaction is also a zeroth-order reaction. The overall reaction equation is
Figure 14.4.2
where \ce{NAD^{+}}) (nicotinamide adenine dinucleotide) and NADH (reduced nicotinamide adenine dinucleotide) are the oxidized and reduced forms, respectively, of a species used by all organisms to transport electrons. When an alcoholic beverage is consumed, the ethanol is rapidly absorbed into the blood. Its concentration then decreases at a constant rate until it reaches zero (Figure 14.4.3a). An average 70 kg person typically takes about 2.5 h to oxidize the 15 mL of ethanol contained in a single 12 oz can of beer, a 5 oz glass of wine, or a shot of distilled spirits (such as whiskey or brandy). The actual rate, however, varies a great deal from person to person, depending on body size and the amount of alcohol dehydrogenase in the liver. The reaction rate does not increase if a greater quantity of alcohol is consumed over the same period of time because the reaction rate is determined only by the amount of enzyme present in the liver. Contrary to popular belief, the caffeine in coffee is ineffective at catalyzing the oxidation of ethanol. When the ethanol has been completely oxidized and its concentration drops to essentially zero, the rate of oxidation also drops rapidly (part (b) in Figure 14.4.3).
Figure 14.4.3: The Catalyzed Oxidation of Ethanol (a) The concentration of ethanol in human blood decreases linearly with time, which is typical of a zeroth-order reaction. (b) The rate at which ethanol is oxidized is constant until the ethanol concentration reaches essentially zero, at which point the reaction rate drops to zero.
These examples illustrate two important points:
In a zeroth-order reaction, the reaction rate does not depend on the reactant concentration.
A linear change in concentration with time is a clear indication of a zeroth-order reaction.
First-Order Reactions
In a first-order reaction, the reaction rate is directly proportional to the concentration of one of the reactants. First-order reactions often have the general form A → products. The differential rate for a first-order reaction is as follows:
(14.4.5)rate=−Δ[A]Δt=k[A]
If the concentration of A is doubled, the reaction rate doubles; if the concentration of A is increased by a factor of 10, the reaction rate increases by a factor of 10, and so forth. Because the units of the reaction rate are always moles per liter per second, the units of a first-order rate constant are reciprocal seconds (s−1).
The integrated rate law for a first-order reaction can be written in two different ways: one using exponents and one using logarithms. The exponential form is as follows:
(14.4.6)[A]=[A]0e−kt
where [A]0 is the initial concentration of reactant A at t=0; k is the rate constant; and e is the base of the natural logarithms, which has the value 2.718 to three decimal places. Recall that an integrated rate law gives the relationship between reactant concentration and time. Equation 14.4.6 predicts that the concentration of A will decrease in a smooth exponential curve over time. By taking the natural logarithm of each side of Equation 14.4.6 and rearranging, we obtain an alternative logarithmic expression of the relationship between the concentration of A and t:
(14.4.7)ln[A]=ln[A]0−kt
Because Equation 14.4.7 has the form of the algebraic equation for a straight line,
y=mx+b,
with y=ln[A] and b=ln[A]0, a plot of ln[A] versus t for a first-order reaction should give a straight line with a slope of −k and an intercept of ln[A]0. Either the differential rate law (Equation 14.4.5) or the integrated rate law (Equation 14.4.7) can be used to determine whether a particular reaction is first order.
Figure 14.4.4: Graphs of a first-order reaction. The expected shapes of the curves for plots of reactant concentration versus time (top) and the natural logarithm of reactant concentration versus time (bottom) for a first-order reaction.
First-order reactions are very common. One reaction that exhibits apparent first-order kinetics is the hydrolysis of the anticancer drug cisplatin. Cisplatin, the first “inorganic” anticancer drug to be discovered, is unique in its ability to cause complete remission of the relatively rare, but deadly cancers of the reproductive organs in young adults. The structures of cisplatin and its hydrolysis product are as follows:
Figure 14.4.5: Cis-platin reaction with water.
Both platinum compounds have four groups arranged in a square plane around a Pt(II) ion. The reaction shown in Figure 14.4.5 is important because cisplatin, the form in which the drug is administered, is not the form in which the drug is active. Instead, at least one chloride ion must be replaced by water to produce a species that reacts with deoxyribonucleic acid (DNA) to prevent cell division and tumor growth. Consequently, the kinetics of the reaction in Figure 14.4.4 have been studied extensively to find ways of maximizing the concentration of the active species.
If a plot of reactant concentration versus time is not linear but a plot of the natural logarithm of reactant concentration versus time is linear, then the reaction is first order.
The rate law and reaction order of the hydrolysis of cisplatin are determined from experimental data, such as those displayed in Ta ble 14.4.1. The table lists initial rate data for four experiments in which the reaction was run at pH 7.0 and 25°C but with different initial concentrations of cisplatin.
Table 14.4.1: Rates of Hydrolysis of Cisplatin as a Function of Concentration at pH 7.0 and 25°C| Experiment | [Cisplatin]0 (M) | Initial Rate (M/min) |
---
| 1 | 0.0060 | 9.0 × 10−6 |
| 2 | 0.012 | 1.8 × 10−5 |
| 3 | 0.024 | 3.6 × 10−5 |
| 4 | 0.030 | 4.5 × 10−5 |
Because the reaction rate increases with increasing cisplatin concentration, we know this cannot be a zeroth-order reaction. Comparing Experiments 1 and 2 in Table 14.4.1 shows that the reaction rate doubles [(1.8 × 10−5 M/min) ÷ (9.0 × 10−6 M/min) = 2.0] when the concentration of cisplatin is doubled (from 0.0060 M to 0.012 M). Similarly, comparing Experiments 1 and 4 shows that the reaction rate increases by a factor of 5 [(4.5 × 10−5 M/min) ÷ (9.0 × 10−6 M/min) = 5.0] when the concentration of cisplatin is increased by a factor of 5 (from 0.0060 M to 0.030 M). Because the reaction rate is directly proportional to the concentration of the reactant, the exponent of the cisplatin concentration in the rate law must be 1, so the rate law is rate = k[cisplatin]1. Thus the reaction is first order. Knowing this, we can calculate the rate constant using the differential rate law for a first-order reaction and the data in any row of Table 14.4.1. For example, substituting the values for Experiment 3 into Equation 14.4.5,
3.6 × 10−5 M/min = k(0.024 M)
1.5 × 10−3 min−1 = k
Knowing the rate constant for the hydrolysis of cisplatin and the rate constants for subsequent reactions that produce species that are highly toxic enables hospital pharmacists to provide patients with solutions that contain only the desired form of the drug.
Example 14.4.1
At high temperatures, ethyl chloride produces HCl and ethylene by the following reaction:
CHA 3CHA 2Cl(g)Δ HCl(g)+CA 2HA 4(g)
Using the rate data for the reaction at 650°C presented in the following table, calculate the reaction order with respect to the concentration of ethyl chloride and determine the rate constant for the reaction.
data for the reaction at 650°C| Experiment | [CH 3 CH 2 Cl]0 (M) | Initial Rate (M/s) |
---
| 1 | 0.010 | 1.6 × 10−8 |
| 2 | 0.015 | 2.4 × 10−8 |
| 3 | 0.030 | 4.8 × 10−8 |
| 4 | 0.040 | 6.4 × 10−8 |
Given: balanced chemical equation, initial concentrations of reactant, and initial rates of reaction
Asked for: reaction order and rate constant
Strategy:
Compare the data from two experiments to determine the effect on the reaction rate of changing the concentration of a species.
Compare the observed effect with behaviors characteristic of zeroth- and first-order reactions to determine the reaction order. Write the rate law for the reaction.
C Use measured concentrations and rate data from any of the experiments to find the rate constant.
Solution
The reaction order with respect to ethyl chloride is determined by examining the effect of changes in the ethyl chloride concentration on the reaction rate.
A Comparing Experiments 2 and 3 shows that doubling the concentration doubles the reaction rate, so the reaction rate is proportional to [CH 3 CH 2 Cl]. Similarly, comparing Experiments 1 and 4 shows that quadrupling the concentration quadruples the reaction rate, again indicating that the reaction rate is directly proportional to [CH 3 CH 2 Cl].
B This behavior is characteristic of a first-order reaction, for which the rate law is rate =k[CH 3 CH 2 Cl].
C We can calculate the rate constant (k) using any row in the table. Selecting Experiment 1 gives the following:
1.60 × 10−8 M/s = k(0.010 M)
1.6 × 10−6 s−1 = k
Exercise 14.4.1
Sulfuryl chloride (SO 2 Cl 2) decomposes to SO 2 and Cl 2 by the following reaction:
SO 2Cl 2(g)→SO 2(g)+Cl 2(g)
Data for the reaction at 320°C are listed in the following table. Calculate the reaction order with regard to sulfuryl chloride and determine the rate constant for the reaction.
Data for the reaction at 320°C| Experiment | [SO 2 Cl 2]0 (M) | Initial Rate (M/s) |
---
| 1 | 0.0050 | 1.10 × 10−7 |
| 2 | 0.0075 | 1.65 × 10−7 |
| 3 | 0.0100 | 2.20 × 10−7 |
| 4 | 0.0125 | 2.75 × 10−7 |
Answerfirst order; k = 2.2 × 10−5 s−1
We can also use the integrated rate law to determine the reaction rate for the hydrolysis of cisplatin. To do this, we examine the change in the concentration of the reactant or the product as a function of time at a single initial cisplatin concentration. Figure 14.4.6a shows plots for a solution that originally contained 0.0100 M cisplatin and was maintained at pH 7 and 25°C.
Figure 14.4.6: The Hydrolysis of Cisplatin, a First-Order Reaction. These plots show hydrolysis of cisplatin at pH 7.0 and 25°C as (a) the experimentally determined concentrations of cisplatin and chloride ions versus time and (b) the natural logarithm of the cisplatin concentration versus time. The straight line in (b) is expected for a first-order reaction.
The concentration of cisplatin decreases smoothly with time, and the concentration of chloride ion increases in a similar way. When we plot the natural logarithm of the concentration of cisplatin versus time, we obtain the plot shown in part (b) in Figure 14.4.6. The straight line is consistent with the behavior of a system that obeys a first-order rate law. We can use any two points on the line to calculate the slope of the line, which gives us the rate constant for the reaction. Thus taking the points from part (a) in Figure 14.4.6 for t = 100 min ([cisplatin] = 0.0086 M) and t = 1000 min ([cisplatin] = 0.0022 M),
slope=ln[cisplatin]1000−ln[cisplatin]100 1000 min−100 min−k=ln0.0022−ln0.0086 1000 min−100 min=−6.12−(−4.76)900 min=−1.51×10−3 min−1 k=1.5×10−3 min−1
The slope is negative because we are calculating the rate of disappearance of cisplatin. Also, the rate constant has units of min−1 because the times plotted on the horizontal axes in parts (a) and (b) in Figure 14.4.6 are in minutes rather than seconds.
The reaction order and the magnitude of the rate constant we obtain using the integrated rate law are exactly the same as those we calculated earlier using the differential rate law. This must be true if the experiments were carried out under the same conditions.
Video Example Using the First-Order Integrated Rate Law Equation:
Example Using the First-Order Integrated Rate Law Equation(opens in new window) [youtu.be]
Example 14.4.2
If a sample of ethyl chloride with an initial concentration of 0.0200 M is heated at 650°C, what is the concentration of ethyl chloride after 10 h? How many hours at 650°C must elapse for the concentration to decrease to 0.0050 M (k = 1.6 × 10−6 s−1) ?
Given: initial concentration, rate constant, and time interval
Asked for: concentration at specified time and time required to obtain particular concentration
Strategy:
Substitute values for the initial concentration ([A]0) and the calculated rate constant for the reaction (k) into the integrated rate law for a first-order reaction. Calculate the concentration ([A]) at the given time t.
Given a concentration [A], solve the integrated rate law for time t.
Solution
The exponential form of the integrated rate law for a first-order reaction (Equation 14.4.6) is [A] = [A]0 e−kt.
A Having been given the initial concentration of ethyl chloride ([A]0) and having the rate constant of k = 1.6 × 10−6 s−1, we can use the rate law to calculate the concentration of the reactant at a given time t. Substituting the known values into the integrated rate law,
[CH 3CH 2Cl]10 h=[CH 3CH 2Cl]0e−kt=0.0200 M(e−(1.6×10−6s−1)[(10 h)(60 min/h)(60 s/min)])=0.0189 M
We could also have used the logarithmic form of the integrated rate law (Equation 14.4.7):
ln[CH 3CH 2Cl]10 h=ln[CH 3CH 2Cl]0−kt=ln0.0200−(1.6×10−6s−1)[(10 h)(60 min/h)(60 s/min)]=−3.912−0.0576=−3.970[CH 3CH 2Cl]10 h=e−3.970 M=0.0189 M
B To calculate the amount of time required to reach a given concentration, we must solve the integrated rate law for t. Eq uation 14.4.7 gives the following:
ln[CH 3CH 2Cl]t=ln[CH 3CH 2Cl]0−kt kt=ln[CH 3CH 2Cl]0−ln[CH 3CH 2Cl]t=ln[CH 3CH 2Cl]0[CH 3CH 2Cl]t t=1 k(ln[CH 3CH 2Cl]0[CH 3CH 2Cl]t)=1 1.6×10−6s−1(ln0.0200 M 0.0050 M)=ln4.0 1.6×10−6s−1=8.7×10 5 s=240 h=2.4×10 2 h
Exercise 14.4.2
In the exercise in Example 14.4.1, you found that the decomposition of sulfuryl chloride (SOA 2ClA 2) is first order, and you calculated the rate constant at 320°C.
Use the form(s) of the integrated rate law to find the amount of SOA 2ClA 2 that remains after 20 h if a sample with an original concentration of 0.123 M is heated at 320°C.
How long would it take for 90% of the SO 2 Cl 2 to decompose?
Answer a0.0252 MAnswer b29 h
Second-Order Reactions
The simplest kind of second-order reaction is one whose rate is proportional to the square of the concentration of one reactant. These generally have the form
2 Aproducts⋅
A second kind of second-order reaction has a reaction rate that is proportional to the product of the concentrations of two reactants. Such reactions generally have the form A + B → products. An example of the former is a dimerization reaction, in which two smaller molecules, each called a monomer, combine to form a larger molecule (a dimer).
The differential rate law for the simplest second-order reaction in which 2A → products is as follows:
(14.4.8)rate=−Δ[A]2Δt=k[A]2
Consequently, doubling the concentration of A quadruples the reaction rate. For the units of the reaction rate to be moles per liter per second (M/s), the units of a second-order rate constant must be the inverse (M−1·s−1). Because the units of molarity are expressed as mol/L, the unit of the rate constant can also be written as L(mol·s).
For the reaction 2A → products, the following integrated rate law describes the concentration of the reactant at a given time:
(14.4.9)1[A]=1[A]0+kt
Because Equation 14.4.9 has the form of an algebraic equation for a straight line, y = mx + b, with y = 1/[A] and b = 1/[A]0, a plot of 1/[A] versus t for a simple second-order reaction is a straight line with a slope of k and an intercept of 1/[A]0.
Second-order reactions generally have the form 2A → products or A + B → products.
Video Discussing the Second-Order Integrated Rate Law Equation: Second-Order Integrated Rate Law Equation(opens in new window) [youtu.be]
Simple second-order reactions are common. In addition to dimerization reactions, two other examples are the decomposition of NO 2 to NO and O 2 and the decomposition of HI to I 2 and H 2. Most examples involve simple inorganic molecules, but there are organic examples as well. We can follow the progress of the reaction described in the following paragraph by monitoring the decrease in the intensity of the red color of the reaction mixture.
Many cyclic organic compounds that contain two carbon–carbon double bonds undergo a dimerization reaction to give complex structures. One example is as follows:
Figure 14.4.7
For simplicity, we will refer to this reactant and product as “monomer” and “dimer,” respectively. The systematic name of the monomer is 2,5-dimethyl-3,4-diphenylcyclopentadienone. The systematic name of the dimer is the name of the monomer followed by “dimer.” Because the monomers are the same, the general equation for this reaction is 2A → product. This reaction represents an important class of organic reactions used in the pharmaceutical industry to prepare complex carbon skeletons for the synthesis of drugs. Like the first-order reactions studied previously, it can be analyzed using either the differential rate law (Equation 14.4.8) or the integrated rate law (Equation 14.4.9).
Table 14.4.2: Rates of Reaction as a Function of Monomer Concentration for an Initial Monomer Concentration of 0.0054 M| Time (min) | [Monomer] (M) | Instantaneous Rate (M/min) |
---
| 10 | 0.0044 | 8.0 × 10−5 |
| 26 | 0.0034 | 5.0 × 10−5 |
| 44 | 0.0027 | 3.1 × 10−5 |
| 70 | 0.0020 | 1.8 × 10−5 |
| 120 | 0.0014 | 8.0 × 10−6 |
To determine the differential rate law for the reaction, we need data on how the reaction rate varies as a function of monomer concentrations, which are provided in Table 14.4.2. From the data, we see that the reaction rate is not independent of the monomer concentration, so this is not a zeroth-order reaction. We also see that the reaction rate is not proportional to the monomer concentration, so the reaction is not first order. Comparing the data in the second and fourth rows shows that the reaction rate decreases by a factor of 2.8 when the monomer concentration decreases by a factor of 1.7:
5.0×10−5 M/min 1.8×10−5 M/min=2.8 and 3.4×10−3 M 2.0×10−3 M=1.7
Because (1.7)2 = 2.9 ≈ 2.8, the reaction rate is approximately proportional to the square of the monomer concentration.
rate ∝ [monomer]2
This means that the reaction is second order in the monomer. Using Equation 14.4.8 and the data from any row in Table 14.4.2, we can calculate the rate constant. Substituting values at time 10 min, for example, gives the following:
(14.4.10)rate=k[A]2(14.4.11)8.0×10−5 M/min=k(4.4×10−3 M)2(14.4.12)4.1M−1⋅min−1=k
We can also determine the reaction order using the integrated rate law. To do so, we use the decrease in the concentration of the monomer as a function of time for a single reaction, plotted in Figure 14.4.8a. The measurements show that the concentration of the monomer (initially 5.4 × 10−3 M) decreases with increasing time. This graph also shows that the reaction rate decreases smoothly with increasing time. According to the integrated rate law for a second-order reaction, a plot of 1/[monomer] versus t should be a straight line, as shown in Figure 14.4.8b. Any pair of points on the line can be used to calculate the slope, which is the second-order rate constant. In this example, k = 4.1 M−1·min−1, which is consistent with the result obtained using the differential rate equation. Although in this example the stoichiometric coefficient is the same as the reaction order, this is not always the case. The reaction order must always be determined experimentally.
Figure 14.4.8: Dimerization of a Monomeric Compound, a Second-Order Reaction. These plots correspond to dimerization of the monomer in Figure 14.4.6 as (a) the experimentally determined concentration of monomer versus time and (b) 1/[monomer] versus time. The straight line in (b) is expected for a simple second-order reaction.
For two or more reactions of the same order, the reaction with the largest rate constant is the fastest. Because the units of the rate constants for zeroth-, first-, and second-order reactions are different, however, we cannot compare the magnitudes of rate constants for reactions that have different orders.
Example 14.4.3
At high temperatures, nitrogen dioxide decomposes to nitric oxide and oxygen.
2NO 2(g)→Δ 2NO(g)+O 2(g)
Experimental data for the reaction at 300°C and four initial concentrations of NO 2 are listed in the following table:
Experimental data for the reaction at 300°C and four initial concentrations of NO2| Experiment | [NO 2]0 (M) | Initial Rate (M/s) |
---
| 1 | 0.015 | 1.22 × 10−4 |
| 2 | 0.010 | 5.40 × 10−5 |
| 3 | 0.0080 | 3.46 × 10−5 |
| 4 | 0.0050 | 1.35 × 10−5 |
Determine the reaction order and the rate constant.
Given:balanced chemical equation, initial concentrations, and initial rates
Asked for: reaction order and rate constant
Strategy:
From the experiments, compare the changes in the initial reaction rates with the corresponding changes in the initial concentrations. Determine whether the changes are characteristic of zeroth-, first-, or second-order reactions.
Determine the appropriate rate law. Using this rate law and data from any experiment, solve for the rate constant (k).
Solution
A We can determine the reaction order with respect to nitrogen dioxide by comparing the changes in NO 2 concentrations with the corresponding reaction rates. Comparing Experiments 2 and 4, for example, shows that doubling the concentration quadruples the reaction rate [(5.40 × 10−5) ÷ (1.35 × 10−5) = 4.0], which means that the reaction rate is proportional to [NO 2]2. Similarly, comparing Experiments 1 and 4 shows that tripling the concentration increases the reaction rate by a factor of 9, again indicating that the reaction rate is proportional to [NO 2]2. This behavior is characteristic of a second-order reaction.
B We have rate = k[NO 2]2. We can calculate the rate constant (k) using data from any experiment in the table. Selecting Experiment 2, for example, gives the following:
rate=k[NO 2]2 5.40×10−5 M/s=k(0.010 M)2 0.54M−1⋅s−1=k
Exercise 14.4.3
When the highly reactive species HO 2 forms in the atmosphere, one important reaction that then removes it from the atmosphere is as follows:
2HO 2(g)→H 2O 2(g)+O 2(g)
The kinetics of this reaction have been studied in the laboratory, and some initial rate data at 25°C are listed in the following table:
Some initial rate data at 25°C| Experiment | [HO 2]0 (M) | Initial Rate (M/s) |
---
| 1 | 1.1 × 10−8 | 1.7 × 10−7 |
| 2 | 2.5 × 10−8 | 8.8 × 10−7 |
| 3 | 3.4 × 10−8 | 1.6 × 10−6 |
| 4 | 5.0 × 10−8 | 3.5 × 10−6 |
Determine the reaction order and the rate constant.
Answersecond order in HO 2; k = 1.4 × 10 9 M−1·s−1
If a plot of reactant concentration versus time is notlinear, but a plot of 1/(reactant concentration) versus time is linear, then the reaction is second order.
Example 14.4.4
If a flask that initially contains 0.056 M NO 2 is heated at 300°C, what will be the concentration of NO 2 after 1.0 h? How long will it take for the concentration of NO 2 to decrease to 10% of the initial concentration? Use the integrated rate law for a second-order reaction (Equation 14.4.9) and the rate constant calculated above.
Given: balanced chemical equation, rate constant, time interval, and initial concentration
Asked for: final concentration and time required to reach specified concentration
Strategy:
Given k, t, and [A]0, use the integrated rate law for a second-order reaction to calculate [A].
Setting [A] equal to 1/10 of [A]0, use the same equation to solve for t.
Solution
A We know k and [NO 2]0, and we are asked to determine [NO 2] at t = 1 h (3600 s). Substituting the appropriate values into Equation 14.4.9,
1[NO 2]3600=1[NO 2]0+kt=1 0.056 M+[(0.54M−1⋅s−1)(3600 s)]=2.0×10 3M−1
Thus [NO 2]3600 = 5.1 × 10−4 M.
B In this case, we know k and [NO 2]0, and we are asked to calculate at what time [NO 2] = 0.1[NO 2]0 = 0.1(0.056 M) = 0.0056 M. To do this, we solve Equation 14.4.9 for t, using the concentrations given.
t=(1/[NO 2])−(1/[NO 2]0)k=(1/0.0056 M)−(1/0.056 M)0.54M−1⋅s−1=3.0×10 2 s=5.0 min
NO 2 decomposes very rapidly; under these conditions, the reaction is 90% complete in only 5.0 min.
Exercise 14.4.4
In the previous exercise, you calculated the rate constant for the decomposition of HO 2 as k = 1.4 × 10 9 M−1·s−1. This high rate constant means that HO 2 decomposes rapidly under the reaction conditions given in the problem. In fact, the HO 2 molecule is so reactive that it is virtually impossible to obtain in high concentrations. Given a 0.0010 M sample of HO 2, calculate the concentration of HO 2 that remains after 1.0 h at 25°C. How long will it take for 90% of the HO 2 to decompose? Use the integrated rate law for a second-order reaction (Equation 14.4.9) and the rate constant calculated in the exercise in Example 14.4.3.
Answer2.0 × 10−13 M; 6.4 × 10−6 s
In addition to the simple second-order reaction and rate law we have just described, another very common second-order reaction has the general form A+B→products, in which the reaction is first order in A and first order in B. The differential rate law for this reaction is as follows:
rate=−Δ[A]Δt=−Δ[B]Δt=k[A][B]
Because the reaction is first order both in A and in B, it has an overall reaction order of 2. (The integrated rate law for this reaction is rather complex, so we will not describe it.) We can recognize second-order reactions of this sort because the reaction rate is proportional to the concentrations of each reactant.
Summary
The reaction rate of a zeroth-order reaction is independent of the concentration of the reactants. The reaction rate of a first-order reaction is directly proportional to the concentration of one reactant. The reaction rate of a simple second-order reaction is proportional to the square of the concentration of one reactant. Knowing the rate law of a reaction gives clues to the reaction mechanism.
zeroth-order reaction:rate=−Δ[A]Δt=k[A]=[A]0−kt
first-order reaction: rate=−Δ[A]Δt=k[A][A]=[A]0e−kt ln[A]=ln[A]0−kt
second-order reaction:rate=−Δ[A]Δt=k[A]2 1[A]=1[A]0+kt
14.4: The Integrated Rate Law- The Dependence of Concentration on Time is shared under a CC BY-NC-SA 4.0 license and was authored, remixed, and/or curated by LibreTexts.
Back to top
14.3: The Rate Law- The Effect of Concentration on Reaction Rate
14.5: The Effect of Temperature on Reaction Rate
Was this article helpful?
Yes
No
Recommended articles
14.1: Catching Lizards
14.2: Rate of a Chemical ReactionReaction rates are reported as either the average rate over a period of time or as the instantaneous rate at a single time. Reaction rates can be dete...
14.3: The Rate Law- The Effect of Concentration on Reaction RateThe rate law for a reaction is a mathematical relationship between the reaction rate and the concentrations of species in solution. Rate laws can be e...
14.5: The Effect of Temperature on Reaction RateA minimum energy (activation energy,Ea) is required for a collision between molecules to result in a chemical reaction. Plots of potential energy for ...
14.6: Reaction MechanismsA balanced chemical reaction does not necessarily reveal either the individual elementary reactions by which a reaction occurs or its rate law. A reac...
Article typeSection or PageLicenseCC BY-NC-SALicense Version4.0Show Page TOCno on page
Tags
This page has no tags.
© Copyright 2025 Chemistry LibreTexts
Powered by CXone Expert ®
?
The LibreTexts libraries arePowered by NICE CXone Expertand are supported by the Department of Education Open Textbook Pilot Project, the UC Davis Office of the Provost, the UC Davis Library, the California State University Affordable Learning Solutions Program, and Merlot. We also acknowledge previous National Science Foundation support under grant numbers 1246120, 1525057, and 1413739. Privacy Policy. Terms & Conditions. Accessibility Statement.For more information contact us atinfo@libretexts.org.
Support Center
How can we help?
Contact Support Search the Insight Knowledge Base Check System Status×
contents readability resources tools
☰ |
14157 | https://www.mathgptpro.com/zh-CN/app/calculator/scientific-notation | 返校AI套餐 - 凭借您在学术旅程中所需的所有工具，征服2025-2026学年。
PDF 作业助手
AI 白板
.科学计数法简介
.什么是科学计数法？
.1理解科学计数法的概念
.1科学计数法的标准形式：
.1为什么科学计数法很重要？
1.科学记数法的重要性
1.1如何将数字转换为科学记数法？
1.1.1转换为科学记数法的步骤
1.1.1.11. 确定有效数字（尾数）：
1.1.1.22. 确定指数 $n$ ：
1.1.1.33. 以 $N \times 10^n$ 的形式书写。
1.1.1.4示例 1：将 45,000 转换为科学记数法
1.1.1.51. 确定 $N$ ：
1.1.1.62. 确定 $n$ ：
1.1.1.73. 科学记数法：
1.1.1.8示例 2：将 0.00032 转换为科学记数法
1.1.1.91. 确定 $N$ ：
1.1.1.102. 确定 $n$ ：
1.1.1.113. 科学记数法：
.如何将科学计数法转换为标准形式？
.1转换为标准形式的步骤
.1.11. 确定 $N$ 和 $n$ 在 $N \times 10^n$ 中。
.1.22. 移动 $N$ 中的小数点：
.1.33. 如有必要，填充零。
.1.4示例 1：将 $6.7 \times 10^5$ 转换为标准形式
.1.5示例 2：将 $9.81 \times 10^{-3}$ 转换为标准形式
.如何使用科学计数法进行计算？
.1乘法
.1.11. 乘以系数（尾数）：
.1.22. 相加指数：
.1.33. 写出结果：
.1.41. 乘以系数：
.1.52. 相加指数：
.1.63. 结果：
.除法
.11. 除以系数：
.12. 减去指数：
.13. 写出结果：
.11. 除以系数：
.12. 减去指数：
.13. 结果：
.加法和减法
.11. 使指数相同：
.12. 加或减系数：
.13. 写出结果：
.11. 调整指数：
.12. 加系数：
.13. 结果：
.如何使用 Mathos AI 科学计数法计算器？
.1使用计算器的步骤
.1.11. 输入数字：
.1.22. 选择操作：
.1.33. 点击计算：
.1.44. 查看结果：
.使用 Mathos AI 科学计数法计算器的好处
.科学计数法的一些实际应用是什么？
.1天文学
.1化学
.1物理
.1工程
.1财务
.科学记数法如何帮助比较数字?
.1示例: 比较 $4.5 \times 10^9$ 和 $2.3 \times 10^{11}$.
.1示例: 比较 $5.6 \times 10^{-7}$ 和 $1.2 \times 10^{-5}$.
.什么是工程记数法，它与科学记数法有何不同?
.1理解工程记数法
.1工程记数法的标准形式:
.1何时使用工程记数法?
.如何处理科学计数法中的有效数字？
.1理解有效数字
.1有效数字的规则
.1在计算中应用有效数字
.计算器如何处理科学计数法？
.1使用科学计算器
.避免科学计数法的常见错误
.11. 小数位数计算错误：
.12. 指数符号错误：
.13. 系数调整不正确：
.14. 忽略有效数字：
.15. 在没有调整的情况下进行不同指数的加减：
.结论
.常见问题
.11. 什么是科学记数法，为什么要使用它？
.12. 如何将一个数字转换为科学记数法？
.13. 我可以使用计算器进行科学记数法的数字运算吗？
.14. 科学记数法和工程记数法有什么区别？
.15. 为什么有效数字在科学记数法中很重要？
输入文本，或在此粘贴/拖放图片。（输入 \ 或 $ 插入公式）
Shift + Enter 换行
Mathos AI | 科学计数法计算器 - 将数字转换为科学计数法
科学计数法简介
在这本全面的指南中，我们将揭开科学计数法的神秘面纱，探索如何在标准形式和科学计数法之间进行转换，并讨论其实际应用。我们还将向您介绍 Mathos AI 科学计数法计算器，这是一个方便的工具，可以让您的计算变得轻松无比。无论您是正在解决数学问题的学生，还是对处理庞大数字感到好奇的人，这本指南将使科学计数法变得易于理解和愉快！
什么是科学计数法？
理解科学计数法的概念
科学计数法是一种表示过大或过小的数字的方式，这些数字在十进制形式中不方便书写。它通过将数字表示为一个介于 1 和 10 之间的数字与 10 的幂的乘积来简化数字。
科学计数法的标准形式：
N×10n
N 是一个大于或等于 1 且小于 10 的数字。
n 是一个整数（正数或负数），表示 10 的指数。
数字 5,000 可以写成科学计数法为 5×103。
数字 0.0008 可以写成 8×10−4。
为什么科学计数法很重要？
科学记数法的重要性
简化计算：使得对大数或小数的乘法和除法更容易。
减少错误：最小化计数零时的错误。
标准化沟通：提供了一种在科学和工程中表达数字的通用方式。
增强理解：有助于比较大小和理解数量的规模。
如何将数字转换为科学记数法？
转换为科学记数法的步骤
1. 确定有效数字（尾数）：
将原始数字的小数点移动，以创建一个介于 1 和 10 之间的新数字 N。
2. 确定指数 n ：
对于大于 1 的数字：
计算小数点向左移动的位数。
n 为正。
对于小于 1 的数字：
计算小数点向右移动的位数。
n 为负。
3. 以 N×10n 的形式书写。
示例 1：将 45,000 转换为科学记数法
1. 确定 N ：
将小数点向左移动 4 位：45,000 变为 4.5 。
2. 确定 n ：
向左移动了 4 位，因此 n=4。
3. 科学记数法：
4.5×104
因此，45,000 的科学记数法是 4.5×104。
示例 2：将 0.00032 转换为科学记数法
1. 确定 N ：
将小数点向右移动 4 位：0.00032 变为 3.2 。
2. 确定 n ：
向右移动了 4 位，因此 n=−4。
3. 科学记数法：
3.2×10−4
因此，0.00032 的科学记数法是 3.2×10−4。
如何将科学计数法转换为标准形式？
转换为标准形式的步骤
1. 确定 N 和 n 在 N×10n 中。
2. 移动 N 中的小数点：
如果 n 是正数：
将小数点向右移动 n 位。
如果 n 是负数：
将小数点向左移动 ∣n∣ 位。
3. 如有必要，填充零。
示例 1：将 6.7×105 转换为标准形式
确定 N=6.7 和 n=5。
移动小数点：
向右移动 5 位：6.7 变为 670,000 。
因此，6.7×105 的标准形式是 670,000。
示例 2：将 9.81×10−3 转换为标准形式
确定 N=9.81 和 n=−3。
移动小数点：
向左移动 3 位：9.81 变为 0.00981 。
因此，9.81×10−3 的标准形式是 0.00981 。
如何使用科学计数法进行计算？
乘法
1. 乘以系数（尾数）：
计算 N1×N2。
2. 相加指数：
ntotal =n1+n2。
3. 写出结果：
(N1×N2)×10ntotal 。
示例：计算 (2×103)×(3×105)。
1. 乘以系数：
2×3=6。
2. 相加指数：
3+5=8。
3. 结果：
6×108。
除法
1. 除以系数：
计算 N1÷N2。
2. 减去指数：
ntotal =n1−n2。
3. 写出结果：
(N1÷N2)×10ntotal 。
示例：计算 (6×108)÷(2×104)。
1. 除以系数：
6÷2=3。
2. 减去指数：
8−4=4。
3. 结果：
3×104。
加法和减法
1. 使指数相同：
调整一个或两个数字，使得 n1=n2。
2. 加或减系数：
Ntotal =N1±N2。
3. 写出结果：
Ntotal ×10n。
示例：Add(5×106)+(3×105)。
1. 调整指数：
将 5×106 转换为 50×105。
2. 加系数：
50+3=53。
3. 结果：
53×105 或 5.3×106。
如何使用 Mathos AI 科学计数法计算器？
使用科学计数法进行计算有时可能会很棘手，特别是在加法和减法时。Mathos AI 科学计数法计算器简化了这个过程，提供快速准确的结果。
使用计算器的步骤
1. 输入数字：
以科学计数法格式输入数字（例如，3.2×104 ）。
2. 选择操作：
从加法、减法、乘法或除法中选择。
3. 点击计算：
计算器处理数字。
4. 查看结果：
答案以科学计数法和标准形式显示。
示例：乘法 (4.5×107)×(2×10−3)。
输入：4.5×107 和 2×10−3。
输出：9×104。
因此，乘积是 9×104 或 90,000 。
使用 Mathos AI 科学计数法计算器的好处
准确性：消除手动计算中的错误。
速度：提供即时结果。
用户友好的界面：易于输入数字和选择操作。
教育工具：帮助理解计算中涉及的步骤。
科学计数法的一些实际应用是什么？
天文学
太空中的距离：
地球到太阳的距离：1.496×108 公里。
银河系的大小：1×105 光年。
化学
原子和分子大小:
氢原子的直径: 1×10−10 米.
阿伏伽德罗常数: 6.022×1023.
物理
光速:
3×108 米每秒.
普朗克常数:
6.626×10−34 焦耳-秒.
工程
电气工程:
电容值以微法拉为单位: 2.2×10−6 F.
机械工程:
涉及小变形的应力计算.
财务
国家债务:
表达大额货币值: 2.8×1013 美元.
科学记数法如何帮助比较数字?
示例: 比较 4.5×109 和 2.3×1011.
由于 1011>109,2.3×1011 更大.
示例: 比较 5.6×10−7 和 1.2×10−5.
由于 10−5>10−7,1.2×10−5 更大.
什么是工程记数法，它与科学记数法有何不同?
理解工程记数法
工程记数法的标准形式:
N×103n
N 是一个介于 1 和 1,000 之间的数字.
n 是一个整数.
示例: 将 4.7×105 转换为工程记数法
将指数调整为 3 的倍数:
105=103×1+2
拆分指数: 103×102
调整系数:
4.7×102=470
结果:
470×103
因此，在工程记数法中，4.7×105 是 470×103.
何时使用工程记数法?
电气工程: 表达千赫（kHz）、兆赫（MHz）等单位.
机械工程: 用公制前缀表示测量.
科学计算: 当与 SI 单位对齐时是有益的.
如何处理科学计数法中的有效数字？
理解有效数字
有效数字的规则
所有非零数字都是有效的：
示例：4.56 有三个有效数字。
非零数字之间的零是有效的：
示例：5.007 有四个有效数字。
前导零不是有效的：
示例：0.0025 有两个有效数字。
小数点后的尾随零是有效的：
示例：2.500 有四个有效数字。
在计算中应用有效数字
乘法和除法：
结果应具有与有效数字最少的值相同的有效数字数量。
加法和减法：
结果应具有与有效数字最少的小数位数相同的小数位数。
示例：乘法 (3.2×104)×(4.56×102)。
乘以系数：
3.2×4.56=14.592
确定有效数字：
3.2 有两个有效数字。
4.56 有三个有效数字。
结果应有两个有效数字。
四舍五入结果：
14.592 四舍五入到两个有效数字是 15 。
相加指数：
4+2=6。
最终答案：
1.5×107 （注意我们将 15 调整为 1.5×101 ）。
计算器如何处理科学计数法？
使用科学计算器
现代计算器，包括 Mathos AI 科学计数法计算器，可以轻松处理科学计数法。
输入数字：
使用 "EXP" 或 "EE" 按钮输入指数。
显示结果：
计算器会自动调整显示，以科学计数法显示非常大或非常小的结果。
示例：计算 (6.02×1023)×(1.67×10−27)
输入 6.02×1023 :
输入 6.02，按 "EXP/EE"，输入 23。
乘以 1.67×10−27 :
⋅ 按 "×"，输入 1.67，按 "EXP/EE"，输入 −27。
结果：
1.00534（计算器显示 1.00534×10−3 ）。
四舍五入到适当的有效数字：
1.00×10−3（因为两个输入都有三个有效数字）。
因此，乘积是 1.00×10−3。
避免科学计数法的常见错误
1. 小数位数计算错误：
始终仔细检查您移动小数点的位数。
2. 指数符号错误：
对于大于 1 的数字，使用正指数。
对于小于 1 的数字，使用负指数。
3. 系数调整不正确：
确保 N 在 1 和 10 之间。
4. 忽略有效数字：
在整个计算过程中保持正确的有效数字数量。
5. 在没有调整的情况下进行不同指数的加减：
在加法或减法之前，始终调整指数使其相同。
结论
记住，练习是掌握科学记数法的关键。利用像 Mathos AI 科学记数法计算器这样的工具来辅助计算，但要努力理解其基本原理。在你继续数学之旅的过程中，你会发现科学记数法不仅仅是一种书写数字的方法，而是理解宇宙的广阔和微小的门户。
常见问题
1. 什么是科学记数法，为什么要使用它？
科学记数法是一种以 N×10n 的形式表达非常大或非常小的数字的方法，其中 N 在 1 和 10 之间，n 是一个整数。它用于简化计算，使得阅读和书写这样的数字更容易。
2. 如何将一个数字转换为科学记数法？
移动小数点以创建一个在 1 和 10 之间的数字 N。
计算小数点移动的位数以确定指数 n。
如果你向左移动小数点，n 是正数；如果向右移动，n 是负数。
将数字写成 N×10n。
3. 我可以使用计算器进行科学记数法的数字运算吗？
可以，像 Mathos AI 科学记数法计算器这样的计算器被设计用来处理科学记数法，使得计算更加简单，并减少错误的风险。
4. 科学记数法和工程记数法有什么区别？
科学记数法：指数 n 可以是任何整数，系数 N 在 1 和 10 之间。
工程记数法：指数 n 是 3 的倍数，与公制前缀对齐，系数 N 在 1 和 1,000 之间。
5. 为什么有效数字在科学记数法中很重要？
输入数字：输入您想转换为科学计数法的数字。
点击‘计算’：按下‘计算’按钮立即转换数字。
逐步解释：Mathos AI 将显示数字如何转换为科学计数法。
最终表示：查看以标准科学计数法格式清晰显示的结果。
© 2025 Mathos. 保留所有权利
Mathos 可能会出错。请交叉验证关键步骤。
提问测试我PDF 作业助手AI 白板计算器函数画板
文章博客隐私政策服务条款定价下载
联系我们 |
14158 | https://social.hse.ru/mirror/pubs/share/986643225.pdf | Основные характеристики федерального бюджета на 2025 год и новые ориентиры бюджетной политики проф., д.э.н. М.П. Афанасьев (НИУ ВШЭ и ИНП РАН) проф., д.э.н. Н.Н. Шаш (РЭУ им. Плеханова) Москва 12 ноября 2024 года Научно-исследовательский семинар «Модернизация государственных финансов» ДПУ ФСН НИУ ВШЭ 1 1) Макроэкономические показатели формирования бюджета 2) Основные характеристики бюджета 3) Социальная направленность нового бюджета на 2025 год 4) Финансовое обеспечение национальных проектов и госпрограмм 5) Перспективы достижения технологического суверенитета Источник данных презентации: Вопросы для обсуждения: 2 Сохранение на протяжении всего прогнозного периода основного перечня ограничительных мер, принятых иностранными государствами в отношении России; Умеренное замедление роста мирового ВВП; Повышенные проинфляционные риски мировой экономики. ожидается, что жесткость денежно-кредитной политики сохранится, а период её нормализации будет более продолжительным, чем предполагалось ранее; Сдержанная динамика отечественного импорта товаров вследствие замедления внутреннего спроса (окончание фазы восстановления), а также переключения потребителей на отечественные товары: Постепенное ослабление курсовой динамики до уровней 96,5-103,2 рублей за доллар США в 2025-2027 годах.
Макроэкономический контекст проекта Федерального бюджета - 2025 3 Основные макроэкономические показатели на 2025 год и на период 2026 и 2027 годов Наименование 2023 год (отчет) 2024 год (оценка ) 2025 год 2026 год 2027 год Закон №540-ФЗ Законо-проект Δ к закону, % Закон №540-ФЗ Законо-проект Δ к закону, % Законо-проект Δ к законоп роекту на 2026 год, % 1 2 3 4 5 6=5/41 00 7 8 9=8/71 00 10 11=10/8 100 Экспортная цена на российскую нефть, долл./барр.
64,5 70,0 70,1 69,7 99,4 70,0 66,0 94,3 65,5 99,2 Цены на газ (среднеконтрактные включая страны СНГ), долл./тыс. куб. м 318,8 279,9 263,2 259,1 98,4 256,0 247,6 96,7 240,2 97,0 ВВП, млрд руб. 172 148 195 849 190 637 214 575 112,6 202 304 230 568 114,0 248 313 107,7 Рост ВВП, % 3,6 3,9 2,3 2,5 108,7 2,2 2,6 118,2 2,8 107,7 Инвестиции, млрд руб.
34 036 40 055 36 743 44 102 120,0 39 587 47 875 120,9 51 652 107,9 Объем импорта (по кругу товаров, учитываемых ФТС России), млрд долл. США 285 280 312 309 99,0 322 331 102,8 347 104,8 Объем экспорта (по кругу товаров, учитываемых ФТС России), млрд долл. США 424 429 485 446 92,0 501 457 91,2 479 104,8 Прибыль прибыльных организаций, млрд руб.
58 557 63 072 56 357 68 439 121,4 59 308 72 768 122,7 78 035 107,2 Инфляция (ИПЦ), % к декабрю пред. года 7,4 7,3 4,0 4,5 112,5 4,0 4,0 100,0 4,0 100,0 Курс доллара, рублей за доллар США 84,7 91,2 91,1 96,5 105,9 92,3 100,0 108,3 103,2 103,2 Фонд заработной платы, млрд руб.
38 541 46 115 45 459 52 291 115,0 48 755 57 796 118,5 62 612 108,3 4 .
Новые бюджетные ориентиры Gо итогам 2024 финансового года темпы роста российской экономики составят около 3,9% ВВП, в 2025–2027 годах экономическая рост оценивается в 2,5–2,8% ВВП, что в целом соответствует оценкам международных финансовых организация для России.
В 2025 году прогнозируется рост доходов федерального бюджета с 36,1 трлн. руб. в 2024 году до 40,29 трлн. руб. в 2025 году.
Предусматривается увеличение расходов федерального бюджета с 39,4 трлн. руб. в 2024 году до 41,46 трлн. руб. в 2025 году.
В 2025–2027 годах исполнение федерального бюджета ожидается с дефицитом, т.е. с превышением расходов над доходами, на уровне 0,5% ВВП в 2025 году, 0,9% ВВП в 2026 году и 1,1% ВВП в 2027 году.
За этот период к 2027 году ненефтегазовый дефицит будет сокращен до 5,0% ВВП.
5 Основные характеристики федерального бюджета на 2025 год и на плановый период 2026 и 2027 годов, млрд. руб.
Наименование 2024 год (оценка) 2025 год 2026 год 2027 год Закон №540-ФЗ Проект закона Δ к закону, % Закон №540-ФЗ Проект закона Δ к закону, % Бюджет прогноз Проект закона Δ к Бюджет-прогнозу, % 1 3 4 5 6=5/410 0 7 8 9=8/7100 10 11 12=11/10 100 Доходы, всего 36 110,7 33 552,4 40 296,1 120,1 34 051,0 41 840,9 122,9 34 378,9 43 154,2 125,5 %% к ВВП 18,4 17,6 18,8 16,8 18,1 16,0 17,4 Расходы, всего 39 406,6 34 382,8 41 469,5 120,6 35 587,4 44 022,2 123,7 36 820,8 45 915,6 124,7 %% к ВВП 20,1 18,0 19,3 17,6 19,1 17,1 18,5 в том числе условно утвержденные 859,6 1 779,4 1 100,6 1 841,0 2 295,8 %% к общему объему расходов 2,5 5,0 2,5 5,0 5,0 Дефицит (-) / Профицит (+) -3 296,0 -830,5 -1 173,4 141,3 -1 536,4 -2 181,2 142,0 -2 441,9 -2 761,4 113,1 %% к ВВП 1,7 0,4 0,5 0,8 0,9 1,1 1,1 Ненефтегазовый дефицит -14 605,4 -12 590,2 -12 109,9 96,2 -12 951,1 -12 745,6 98,4 -12 886,1 -12 527,5 97,2 %% к ВВП 7,5 6,6 5,6 6,4 5,5 6,0 5,0 6 Основные задачи бюджетной политики Главными задачами, которыми руководствовалось Правительство России при подготовки нового проекта Федерального бюджета были следующие важнейшие ориентиры.
Прежде всего, выполнение всех социальных обязательства перед российскими гражданами, включая поддержку участников спецоперации и их семей.
Обеспечение необходимого и достаточного уровня расходов на оборону и безопасность страны, принимая во внимание международную ситуацию, а также продолжение государственной политики, направленной на обеспечение технологический суверенитета России.
Основным инструментарием реализации целей национального развития и федеральной бюджетной политики на ближайшие годы продолжают оставаться национальные проекты. На запланированные по ним мероприятия предусматривается расходы в размере более 40 трлн. руб. в течение шести лет.
По сравнению с проектами 2019–2024 годов финансирование национальных проектов в части расходов федерального бюджета будет увеличено почти в 2 раза. В том числе прирост расходов на новые национальные проекты в 2025 году составит 5,7 трлн. рублей.
7 Доходы федерального бюджета на 2025 год и на период 2026 и 2027 годов, млрд. руб.
Показатель 2024 год (оценка) Законопроект 2025 год 2026 год 2027 год 1 2 3 4 5 Доходы, всего 36 110,7 40 296,1 41 840,9 43 154,2 в %% к ВВП 18,4 18,8 18,1 17,4 в том числе: Нефтегазовые доходы 11 309,5 10 936,4 10 564,3 9 766,1 в %% к ВВП 5,8 5,1 4,6 3,9 в том числе: Базовые нефтегазовые доходы 9 750,8 9 123,5 9 337,7 9 115,1 в %% к ВВП 5,0 4,3 4,0 3,7 Дополнительные нефтегазовые доходы 1 558,7 1 813,0 1 226,7 651,0 в % % к ВВП 0,8 0,8 0,5 0,3 Ненефтегазовые доходы 24 801,2 29 359,7 31 276,6 33 388,1 в %% к ВВП 12,7 13,7 13,6 13,4 Доля в общем объеме доходов, % 100,0 100,0 100,0 100,0 в том числе: Нефтегазовые доходы 31,3 27,1 25,2 22,6 Ненефтегазовые доходы 68,7 72,9 74,8 77,4 Темпы прироста доходов в номинальном выражении к предыдущему году, % 24,0 11,6 3,8 3,1 8 Динамика доходов федерального бюджета в 2023 - 2027 гг,. млрд. руб.
Показатель 2023 год 2024 год 2025 год 2026 год 2027 год Отчёт Оценка Прогноз Откло-нение Прогноз Откло-нение Прогноз Откло-нение (год к году) (год к году) (год к году) 1 2 3 4 5=4-3 6 7=6-4 8 9=8-6 Доходы, всего 29 124,0 36 110,7 40 296,1 4 185,4 41 840,9 1 544,8 43 154,2 1 313,2 в % к ВВП 16,9 18,4 18,8 0,3 18,1 -0,6 17,4 -0,8 в том числе: Нефтегазовые доходы 8 822,3 11 309,5 10 936,4 -373,0 10 564,3 -372,1 9 766,1 -798,3 в % к ВВП 5,1 5,8 5,1 -0,7 4,6 -0,5 3,9 -0,6 из них базовые нефтегазовые доходы 8 000,0 9 750,8 9 123,5 -627,3 9 337,7 214,2 9 115,1 -222,5 Ненефтегазовые доходы 20 301,8 24 801,2 29 359,7 4 558,5 31 276,6 1 916,9 33 388,1 2 111,5 в % к ВВП 11,8 12,7 13,7 1,0 13,6 -0,1 13,4 -0,1 Оборотные налоги и сборы 13 806,0 15 663,1 18 212,0 2 548,8 19 679,1 1 467,1 21 128,9 1 449,8 в % к ВВП 8,0 8,0 8,5 0,5 8,5 0,0 8,5 0,0 НДС 11 614,4 13 235,7 15 456,3 2 220,7 16 760,2 1 303,8 18 060,8 1 300,6 Акцизы внутренние / ввозные 1 1 081,2 1 235,0 1 371,6 136,7 1 375,4 3,8 1 407,8 32,4 Ввозные пошлины 1 110,4 1 192,5 1 384,0 191,5 1 543,5 159,5 1 660,4 116,8 Налоги на прибыль/ доходы 1 927,3 2 336,5 4 850,5 2 514,1 5 167,5 317,0 5 433,8 266,3 в % к ВВП 1,1 1,2 2,3 1,1 2,2 0,0 2,2 -0,1 Налог на прибыль 1 767,8 2 029,5 4 040,0 2 010,5 4 246,8 206,8 4 532,5 285,7 НДФЛ 159,5 307,0 810,5 503,5 920,7 110,2 901,3 -19,4 Прочие рентные доходы 1 014,0 950,9 984,6 33,7 999,7 15,0 1 018,2 18,6 НДПИ ГМК 2 235,9 232,1 262,0 29,9 268,0 6,1 269,9 1,8 СРП 3 361,8 306,8 289,0 -17,7 277,1 -11,9 271,4 -5,8 Прочие вывозные рентные пошлины 287,4 227,8 194,2 -33,6 206,1 11,9 221,5 15,3 Рентные акцизы 4 128,8 184,2 239,4 55,2 248,3 8,9 255,5 7,2 Прочие доходы 3 554,5 5 850,7 5 312,5 -538,2 5 430,3 117,8 5 807,2 376,9 9 Источники финансирования дефицита федерального бюджета, млрд руб.
Показатели 2023 год (отчет) 2024 год (оценка) 2025 год 2026 год 2027 год Закон №540-ФЗ Законо проект Δ к закону, % Закон №540-ФЗ Законо-проект Δ к закону, % Законо-проект Δ к законопр оекту на 2026 год, % 1 2 3 4 5 6=5/410 0 7 8 9=8/710 0 10 11=10/81 00 Всего источников 3 229,8 3 296,0 830,5 1 173,4 141,3 1 536,4 2 181,2 142,0 2 761,4 126,6 %% к ВВП 1,9 1,7 0,4 0,5 0,8 0,9 1,1 в том числе: Государственные заимствования 1 507,9 2 541,3 2 856,8 3 257,0 114,0 3 369,3 3 536,7 105,0 3 626,1 102,5 Средства ФНБ 3 460,7 1 300,2 1,7 0,6 35,3 0,0 0,0 -0,0 -Иные источники -1 738,8 -545,5 -2 028,0 -2 084,2 102,8 -1 832,9 -1 355,4 74,0 -864,7 63,8 %% к ВВП 1,0 0,3 1,1 1,0 0,9 0,6 0,3 в том числе: приватизация 27,3 49,7 1,2 5,5 458,3 1,2 5,6 466,7 25,5 455,4 прочие источники -1 766,1 -595,2 -2 029,2 -2 089,6 103,0 -1 834,1 -1 361,0 74,2 -890,1 65,4 10 Прогноз объема Фонда национального благосостояния 2025 – 2027, млрд. руб.
Показатели 2023 год (отчет) 2024 год (оценка) 2025 год 2026 год 2027 год Закон №540-ФЗ Законо-проект Δ к закону, % Закон №540-ФЗ Законо-проект Δ к закону, % Законо-проект Δ к законопроек ту на 2026 год, % 1 2 3 4 5 6=5/410 0 7 8 9=8/710 0 10 11=10/8100 Объем ФНБ на начало года 10 434,6 11 965,1 11 190,7 11 055,0 98,8 13 002,8 12 883,5 99,1 14 927,1 115,9 %% к ВВП 6,1 6,1 5,9 5,2 6,4 5,6 6,0 Пополнение ФНБ 1 333,0 38,8 1 821,1 1 638,7 90,0 1 835,7 1 894,6 103,2 1 274,8 67,3 в том числе: за счет нефтегазовых доходов 1 336,4 44,9 1 821,1 1 558,7 85,6 1 835,7 1 813,0 98,8 1 226,7 67,7 за счет курсовой разницы -3,5 -6,1 0,0 80,1 -0,0 81,7 -48,1 58,9 за счет иных источников 0,0 0,0 0,0 0,0 -0,0 0,0 -0,0 -Использование средств ФНБ 3 460,7 1 300,2 1,7 0,6 35,3 0,0 0,0 -0,0 -Курсовая разница и переоценка активов 3 658,2 351,3 -7,2 190,4 -33,6 148,9 443,2 295,3 198,3 Объем ФНБ на конец года 11 965,1 11 055,0 13 002,8 12 883,5 99,1 14 872,1 14 927,1 100,4 16 497,2 110,5 %% к ВВП 7,0 5,6 6,8 6,0 7,4 6,5 6,6 Объем средств ФНБ, размещенных на счетах в Банке России 5 011,8 3 691,5 6 756,2 5 522,2 81,7 8 655,7 7 597,9 87,8 9 309,5 122,5 Объем средств ФНБ, размещенных в иные (помимо счетов в Банке России) финансовые активы 6 953,3 7 363,5 6 246,6 7 361,3 117,8 6 216,4 7 329,3 117,9 7 187,7 98,1 11 Объем государственного долга Российской Федерации, млрд. руб.
Показатели 2023 год (отчет) 2024 год (оценка) 2025 год 2026 год 2027 год Закон №540-ФЗ Законо-проект Δ к закону, % Закон №540-ФЗ Законо-проект Δ к закону, % Законо-проект Δ к законоп роекту на 2026 год, % 1 2 3 4 5 6=5/4100 7 8 9=8/7100 10 11=10/8 100 Объем государственного долга РФ, всего 25 595,2 30 768,8 35 875,8 35 411,2 98,7 40 088,2 40 028,6 99,9 44 927,6 112,2 %% к ВВП 14,9 15,7 18,8 16,5 19,8 17,4 18,1 в том числе: Объем государственного внутреннего долга РФ 20 812,8 24 948,9 30 159,3 29 385,6 97,4 34 356,5 34 046,2 99,1 39 004,8 114,6 %% к общему объему 81,3 81,1 84,1 83,0 85,7 85,1 86,8 из них: по государствен-ным гарантиям РФ 700,4 1 736,2 3 626,4 2 060,2 56,8 3 727,4 2 128,3 57,1 2 196,4 103,2 %% к общему объему 2,7 5,6 10,1 5,8 9,3 5,3 4,9 Объем государственного внешнего долга РФ 4 782,4 5 819,8 5 716,5 6 025,6 105,4 5 731,7 5 982,3 104,4 5 922,8 99,0 %% к общему объему 18,7 18,9 15,9 17,0 14,3 14,9 13,2 из них: по государствен-ным гарантиям РФ 1 680,9 2 505,6 2 501,0 2 641,4 105,6 2 591,3 2 710,7 104,6 2 820,5 104,1 %% к общему объему 6,6 8,1 7,0 7,5 6,5 6,8 6,3 12 Общие подходы к формированию объема и структуры расходов федерального бюджета Формирование бюджетных ассигнований на 2025 и 2026 годы осуществляется на основе бюджетных ассигнований, утвержденных Законом № 540-ФЗ на соответствующие годы, бюджетные ассигнования на 2027 год сформированы на основе показателей Бюджетного прогноза Российской Федерации на период до 2036 года, утвержденного распоряжением Правительства Российской Федерации от 20 февраля 2024 г. № 380-рс.
Законодательно установленный объем бюджетных ассигнований уточнен на прогнозный уровень инфляции (индекс роста потребительских цен), в том числе, бюджетные ассигнования на финансовое обеспечение реализации национальных проектов в целом запланированы в 2025 году в объеме 5 765 488,0 млн рублей, в 2026 году - 6 302 894,1 млн рублей, в 2027 году -6 356 401,9 млн рублей.
13 14 Динамика расходов федерального бюджета 2024 и 2025 финансовый год.
Источник: ФЗ от 27 ноября 2023 № 540-ФЗ с учётом изменений ФЗ от 21 июля 2014 г. 175 -ФЗ № п/п Основные разделы классификации расходов Объем, трлн руб.
Доля в расходах, % Объем, трлн руб.
Доля в расходах, % 1 Национальная оборона 8,90 23,4 13,5 32,5 2 Социальная политика 9,00 23,7 6,5 15,6 3 Национальная экономика 4,80 12,6 4,3 10,1 4 Национальная безопасность 3,50 9,2 3,5 8,4 5 Обслуживание государственного долга 2,30 6,0 3,2 8,3 6 Общегосударственные вопросы 2,50 6,0 2,5 6,0 7 Здравоохранение 1,70 4,0 1,8 4,3 8 Образование 1,70 4,0 1,6 3,8 9 Межбюджетные отношения 1,40 4,0 1,4 3,4 10 Жилищно-коммунальное хозяйство 1,15 2,4 1,8 4,3 11 Охрана окружающей среды 0,48 1,2 0,9 2,7 12 Культура 0,23 0,5 0,2 0,5 13 Средства массовой информации 0,10 0,3 0,1 0,3 14 Физкультура и спорт 0,07 0,2 0,07 0,17 Всего: 38,01 100,0 41,5 100,0 15 .
Доходы и расходы государственного бюджета СССР 1940–1945 гг. (млрд. руб.).
Источник: Финансы ССР за ХХХ лет, - М.: Финиздат, 1947, - С.187, расчеты авторов Статья 1940 1941 1942 1943 1944 1945 Доходы 180 177 165 202,7 268,7 302 Расходы 174,3 191,4 182,8 210 264 298 Военные расходы 56,7 83 108,4 129 137,8 127,8 Доля военных расходов, % 32,5% 43% 59% 61% 52% 42% Дефицит/Профицит +3,3% -8% -10% -3% +2% +1,3% 16 Военные расходы СССР по десятилетиям, в % от общих расходов Государственного бюджета СССР.
Источник: Народное хозяйство ССР за 70 лет, - М.: Финстаиздат, 1987 – С.631 Год 1940 1960 1970 1980 1985 Доля, % 32,6 12,7 11,5 5,8 4,9 17 18 Поправки Правительства по предмету второго чтения в Государственной Думе проекта федерального закона № 727320-8 "О федеральном бюджете на 2025 год и на плановый период 2026 и 2027 гг." Поправки не предусматривают изменение общего объема расходов, предусмотренного законопроектом Всего к законопроекту предлагается (с учетом закрытой части) 890 поправок в объеме 1,8 трлн. рублей.
I.
поправки, предусматривающие уточнение положений текстовых статей законопроекта; II.
поправки, сформированные по предложениям главных распорядителей средств федерального бюджета, в части перераспределения бюджетных ассигнований по разделам, подразделам, целевым статьям (государственным программам Российской Федерации и непрограммным направлениям деятельности) и видам расходов; III.
поправки, предусматривающие уточнение приложений к законопроекту.
19 20 Пенсии и денежные выплаты в 2025 году 21 Расходы Французского бюджета на 2024 и 2025 гг.
(источник: www.economie.gouv.fr/LFI 2024 и PLF2025) № Миссия расходов (всего 33) Расходы 2024, млрд. евро (закон) % от всех расходов бюджета Расходы 2025, млрд. евро (план) % от всех расходов бюджета 1 Школьное образование 64,4 19,2 64,5 19,5 2 Финансовые обязательства (долг, кредиты, гарантии) 60,8 18,1 61,3 18,5 3 Оборона 47,2 14,1 50,5 15,2 4 Исследования и высшее образование 31,4 9,4 31,1 9,4 5 Работа и занятость 23,7 7,1 21,4 6,5 6 Помощь территориям 23,5 7,0 23,8 7,2 7 Экология, устойчивое развитие и мобильность 16,8 5,0 19,5 5,9 8 Национальная безопасность 16,7 4,9 17,3 5,2 9 Управление государственными финансами 8,3 2,5 8,2 2,5 10 Социальные и пенсионные режимы 6,2 1,8 6,0 1,8 11 Государственная помощь развитию 6,5 1,8 5,2 1,6 12 Сельское хозяйство, продовольствие, леса 4,5 1,3 4,2 1,3 13 Государственное и территориальное управление 3,8 1,1 4,1 1,2 14 Прочее 22,4 6,7 13,9 4,2 Всего 335 100 331,7 100 22 Заключительные замечания Проект федерального бюджета предусматривает безусловное выполнение социальных обязательств. Поэтому «детский бюджет» на горизонте бюджетной трехлетки превысит 10 трлн. руб., включая адресную поддержку семей с детьми.
Заработает целостная система социальной поддержки с охватом всех нуждающихся: от беременности матери до достижения ребенком 17 лет. Эта мера охватит более 10 млн человек.
На выплату единого пособия предусмотрено выделение более 4 трлн. руб. в течение трех лет. Около 1,7 трлн. руб. будут предоставлены на материнский капитал, размер которого ежегодно индексируется по уровню инфляции.
Предусмотрены необходимые ресурсы для развития программы льготной ипотеки. Начиная с 2025 года предусмотрено возобновление индексации пенсий работающим пенсионерам.
В сфере инфраструктуры федеральные ресурсы направляются на обеспечение комфортной и безопасной среды обитания, включая дорожное и транспортное развитие. На финансовую поддержку регионов будет направляться ежегодно около 3,3 трлн. руб., в том числе на реализацию национальных проектов – около 1 трлн.
рублей.
Таким образом, несмотря на сложности внешнего характера федеральный бюджет России сохранят социальную направленность, а также концертирует финансовые усилиям на технологичном и инфраструктурном прорыве российской экономики.
23 СПАСИБО ЗА ВНИМАНИЕ, УВАЖАЕМЫЕ КОЛЛЕГИ!
ПОЖАЛУЙСТА, ВАШИ ВОПРОСЫ И КОММЕНТАРИИ 24 |
14159 | https://www.quora.com/What-is-the-difference-between-3-2-and-3-2 | Something went wrong. Wait a moment and try again.
Basic Operations
The Exponent
Order of Operations (math...
Basic Algebra
Mathematical Calculations
Exponents (mathematics)
5
What is the difference between -3^2 and (-3) ^2?
·
Sep 6
Operator precedence and parentheses determine whether the negation is squared or the whole negative number is squared.
-3^2
Interpretation: unary minus applied after exponentiation. Exponentiation has higher precedence than unary minus.
Evaluation: compute 3^2 = 9, then apply the negative sign → -9.
Value: -9.
(-3)^2
Interpretation: parentheses force the base of the exponent to be -3; the exponent applies to the entire negative number.
Evaluation: compute (-3) × (-3) = 9.
Value: 9.
-3^2 = -(3^2) = -9.
(-3)^2 = (-3)·(-3) = +9.
Practical note:
Many calculators and programming languages follow the sa
Operator precedence and parentheses determine whether the negation is squared or the whole negative number is squared.
-3^2
Interpretation: unary minus applied after exponentiation. Exponentiation has higher precedence than unary minus.
Evaluation: compute 3^2 = 9, then apply the negative sign → -9.
Value: -9.
(-3)^2
Interpretation: parentheses force the base of the exponent to be -3; the exponent applies to the entire negative number.
Evaluation: compute (-3) × (-3) = 9.
Value: 9.
Summary:
-3^2 = -(3^2) = -9.
(-3)^2 = (-3)·(-3) = +9.
Practical note:
Many calculators and programming languages follow the same precedence; in code, use parentheses when you mean to square a negative number.
Related questions
What is the difference between (-3) ^2 and (-3) to the 2nd power?
How can one solve 2-2×3+3?
Is there any difference between the result of (-2) ^2 and -2^2?
What is (-3/2) ²+2 (-3/2)?
What is the difference between 2+3=5 and
2
+
3
=
5
?
Soumya Agarwal
8y
In case of -3^2, we are squaring only number, negative sign will not be included i.e. -3×3=-9
But in case of (-3)^2, we are squaring the whole digit included negative sign because power raise upto whole digit. So,we will write -3 two times i.e. -3×-3=9.
Promoted by Coverage.com
Johnny M
Master's Degree from Harvard University (Graduated 2011)
·
Updated Sep 9
Does switching car insurance really save you money, or is that just marketing hype?
This is one of those things that I didn’t expect to be worthwhile, but it was. You actually can save a solid chunk of money—if you use the right tool like this one. I ended up saving over $1,500/year, but I also insure four cars.
I tested several comparison tools and while some of them ended up spamming me with junk, there were a couple like Coverage.com and these alternatives that I now recommend to my friend.
Most insurance companies quietly raise your rate year after year. Nothing major, just enough that you don’t notice. They’re banking on you not shopping around—and to be honest, I didn’t.
This is one of those things that I didn’t expect to be worthwhile, but it was. You actually can save a solid chunk of money—if you use the right tool like this one. I ended up saving over $1,500/year, but I also insure four cars.
I tested several comparison tools and while some of them ended up spamming me with junk, there were a couple like Coverage.com and these alternatives that I now recommend to my friend.
Most insurance companies quietly raise your rate year after year. Nothing major, just enough that you don’t notice. They’re banking on you not shopping around—and to be honest, I didn’t. It always sounded like a hassle. Dozens of tabs, endless forms, phone calls I didn’t want to take.
But recently I decided to check so I used this quote tool, which compares everything in one place. It took maybe 2 minutes, tops. I just answered a few questions and it pulled up offers from multiple big-name providers, side by side. Prices, coverage details, even customer reviews—all laid out in a way that made the choice pretty obvious.
They claimed I could save over $1,000 per year. I ended up exceeding that number and I cut my monthly premium by over $100. That’s over $1200 a year. For the exact same coverage.
No phone tag. No junk emails. Just a better deal in less time than it takes to make coffee. Here’s the link to two comparison sites - the one I used and an alternative that I also tested.
If it’s been a while since you’ve checked your rate, do it. You might be surprised at how much you’re overpaying.
Zane Heyl
Former Actuarial Analyst (2017–2022)
·
Author has 275 answers and 768.6K answer views
·
8y
This goes back to the very fundamentals of arithmetic: BODMAS.
B rackets
O f
D ivision
M ultiplication
A ddition
S ubtraction
We perform arithmetic in this order. In the second expression (-3)^2, we use the bracketed number first which is -3 and then raise it to the power of 2: (-3)(-3) = 9.
In the first expression, remember that exponentiation is just extended multiplication. So all we’re doing here is the Multiplication part. We have a -1 in the front of the number, and then we have 3^2. So this answer will be (-1)(3^2) = -9. With the real number system, we can multiply any two numbers in any orde
This goes back to the very fundamentals of arithmetic: BODMAS.
B rackets
O f
D ivision
M ultiplication
A ddition
S ubtraction
We perform arithmetic in this order. In the second expression (-3)^2, we use the bracketed number first which is -3 and then raise it to the power of 2: (-3)(-3) = 9.
In the first expression, remember that exponentiation is just extended multiplication. So all we’re doing here is the Multiplication part. We have a -1 in the front of the number, and then we have 3^2. So this answer will be (-1)(3^2) = -9. With the real number system, we can multiply any two numbers in any order (we call this the commutative property of real numbers, sometimes we also say “because the underlying structure is a commutative ring”).
I hope this helps, and don’t be shy.
Kind regards,
Zane Heyl
Baltasar Dinis
Studied at IST - Instituto Superior Técnico (Graduated 2020)
·
8y
It’s a matter of precedence of operations.
Potentiation takes precedence over multiplication and sumation. Therefore, the order of operations in −32 is :
Square 3 (9)
Multiply by -1 (-9)
In the other case, parenthesis take precedence over potentiation. The order of operation is:
Multiply 3 by -1 (-3)
Square -3 (9)
In the end, it boils down to this: there is a need to differentiate the two situations, and using parenthesis is necessary since otherwise potentiation would have precedence.
Related questions
What is the answer of 5+3×2?
Which is bigger, 3^2^2 or (3^2) ^2?
Why is
3
2
3
different from
(
3
2
)
3
?
What is the value of 2+2-3+2×2+2-3+3-2+1=?
What does 2-23+3 equal?
Gale Ellis
Played competitively since summer 2019
·
Author has 302 answers and 697.3K answer views
·
8y
With -3^2, the “-” is the coefficient of 3. According to PEMDAS (or whatever else you might call it), exponents are done before multiplication. Since the negative sign means you multiply the three by -1 (or in this case 3^2), you do the exponent first. 3^2-1=-9
In (-3)^2, you do everything inside the parentheses first, so you first multiply the three by -1. You then square the resulting -3. -3-3=9.
Promoted by The Penny Hoarder
Lisa Dawson
Finance Writer at The Penny Hoarder
·
Updated Sep 16
What's some brutally honest advice that everyone should know?
Here’s the thing: I wish I had known these money secrets sooner. They’ve helped so many people save hundreds, secure their family’s future, and grow their bank accounts—myself included.
And honestly? Putting them to use was way easier than I expected. I bet you can knock out at least three or four of these right now—yes, even from your phone. Don’t wait like I did.
Cancel Your Car Insurance
You might not even realize it, but your car insurance company is probably overcharging you. In fact, they’re kind of counting on you not noticing. Luckily, this problem is easy to fix.
Don’t waste your time
Here’s the thing: I wish I had known these money secrets sooner. They’ve helped so many people save hundreds, secure their family’s future, and grow their bank accounts—myself included.
And honestly? Putting them to use was way easier than I expected. I bet you can knock out at least three or four of these right now—yes, even from your phone. Don’t wait like I did.
Cancel Your Car Insurance
You might not even realize it, but your car insurance company is probably overcharging you. In fact, they’re kind of counting on you not noticing. Luckily, this problem is easy to fix.
Don’t waste your time browsing insurance sites for a better deal. A company calledInsurify shows you all your options at once — people who do this save up to $996 per year.
If you tell them a bit about yourself and your vehicle, they’ll send you personalized quotes so you can compare them and find the best one for you.
Tired of overpaying for car insurance? It takes just five minutes to compare your options with Insurify andsee how much you could save on car insurance.
Ask This Company to Get a Big Chunk of Your Debt Forgiven
A company calledNational Debt Relief could convince your lenders to simply get rid of a big chunk of what you owe. No bankruptcy, no loans — you don’t even need to have good credit.
If you owe at least $10,000 in unsecured debt (credit card debt, personal loans, medical bills, etc.), National Debt Relief’s experts will build you a monthly payment plan. As your payments add up, they negotiate with your creditors to reduce the amount you owe. You then pay off the rest in a lump sum.
On average, you could become debt-free within 24 to 48 months. It takes less than a minute to sign up and see how much debt you could get rid of.
Set Up Direct Deposit — Pocket $300
When you set up direct deposit withSoFi Checking and Savings (Member FDIC), they’ll put up to $300 straight into your account. No… really. Just a nice little bonus for making a smart switch.
Why switch? With SoFi, you can earn up to 3.80% APY on savings and 0.50% on checking, plus a 0.20% APY boost for your first 6 months when you set up direct deposit or keep $5K in your account. That’s up to 4.00% APY total. Way better than letting your balance chill at 0.40% APY.
There’s no fees. No gotchas.Make the move to SoFi and get paid to upgrade your finances.
You Can Become a Real Estate Investor for as Little as $10
Take a look at some of the world’s wealthiest people. What do they have in common? Many invest in large private real estate deals. And here’s the thing: There’s no reason you can’t, too — for as little as $10.
An investment called the Fundrise Flagship Fund lets you get started in the world of real estate by giving you access to a low-cost, diversified portfolio of private real estate. The best part? You don’t have to be the landlord. The Flagship Fund does all the heavy lifting.
With an initial investment as low as $10, your money will be invested in the Fund, which already owns more than $1 billion worth of real estate around the country, from apartment complexes to the thriving housing rental market to larger last-mile e-commerce logistics centers.
Want to invest more? Many investors choose to invest $1,000 or more. This is a Fund that can fit any type of investor’s needs. Once invested, you can track your performance from your phone and watch as properties are acquired, improved, and operated. As properties generate cash flow, you could earn money through quarterly dividend payments. And over time, you could earn money off the potential appreciation of the properties.
So if you want to get started in the world of real-estate investing, it takes just a few minutes tosign up and create an account with the Fundrise Flagship Fund.
This is a paid advertisement. Carefully consider the investment objectives, risks, charges and expenses of the Fundrise Real Estate Fund before investing. This and other information can be found in the Fund’s prospectus. Read them carefully before investing.
Cut Your Phone Bill to $15/Month
Want a full year of doomscrolling, streaming, and “you still there?” texts, without the bloated price tag? Right now, Mint Mobile is offering unlimited talk, text, and data for just $15/month when you sign up for a 12-month plan.
Not ready for a whole year-long thing? Mint’s 3-month plans (including unlimited) are also just $15/month, so you can test the waters commitment-free.
It’s BYOE (bring your own everything), which means you keep your phone, your number, and your dignity. Plus, you’ll get perks like free mobile hotspot, scam call screening, and coverage on the nation’s largest 5G network.
Snag Mint Mobile’s $15 unlimited deal before it’s gone.
Get Up to $50,000 From This Company
Need a little extra cash to pay off credit card debt, remodel your house or to buy a big purchase?
We found a company willing to help.
Here’s how it works: If your credit score is at least 620, AmONE can help you borrow up to $50,000 (no collateral needed) with fixed rates starting at 6.40% and terms from 6 to 144 months.
AmONE won’t make you stand in line or call a bank. And if you’re worried you won’t qualify, it’s free tocheck online. It takes just two minutes, and it could save you thousands of dollars.
Totally worth it.
Get Paid $225/Month While Watching Movie Previews
If we told you that you could get paid while watching videos on your computer, you’d probably laugh.
It’s too good to be true, right?
But we’re serious. By signing up for a free account with InboxDollars, you could add up to $225 a month to your pocket. They’ll send you short surveys every day, which you can fill out while you watch someone bake brownies or catch up on the latest Kardashian drama.
No, InboxDollars won’t replace your full-time job, but it’s something easy you can do while you’re already on the couch tonight, wasting time on your phone.
Unlike other sites, InboxDollars pays you in cash — no points or gift cards. It’s already paid its users more than $56 million.
Signing up takes about one minute, and you’ll immediately receive a $5 bonus to get you started.
Earn $1000/Month by Reviewing Games and Products You Love
Okay, real talk—everything is crazy expensive right now, and let’s be honest, we could all use a little extra cash. But who has time for a second job?
Here’s the good news. You’re already playing games on your phone to kill time, relax, or just zone out. So why not make some extra cash while you’re at it?
WithKashKick, you can actually get paid to play. No weird surveys, no endless ads, just real money for playing games you’d probably be playing anyway. Some people are even making over $1,000 a month just doing this!
Oh, and here’s a little pro tip: If you wanna cash out even faster, spending $2 on an in-app purchase to skip levels can help you hit your first $50+ payout way quicker.
Once you’ve got $10, you can cash out instantly through PayPal—no waiting around, just straight-up money in your account.
Seriously, you’re already playing—might as well make some money while you’re at it.Sign up for KashKick and start earning now!
Satyen Dhamankar
BS in Chemical Engineering & Mathematics, Michigan Technological University (Graduated 2020)
·
Updated 8y
It's not the same thing…
Think of the minus sign as a vector which rotates a number by 180 degrees on the real axis.
−(32) is inverting 32 on the real axis by an angle of 180 degrees or pi radians.
(−3)2 is scaling 3 up by a factor of 3 and rotating the number by 180 degrees TWICE, which means the net result is 360 degrees, which is the number itself ie 9.
Note: when you rotate a number by nπ, where n is an integer, you get a real number. But for a number not equivalent to nπ would result in a complex number.
Ziyad Ziizoo
Studied at International Islamic University Malaysia
·
8y
-3^2= -13^2 witout brackets so the program will understand
but
(-3)^2=-3-3 coz we have brackets so the program will understand with brackets
Sponsored by Grammarly
Is your writing working as hard as your ideas?
Grammarly’s AI brings research, clarity, and structure—so your writing gets sharper with every step.
Muhammad Ahmed
Lives in Karachi, Sindh, Pakistan
·
8y
Nothing.
The bracket does not have an equation in it so it doesn't matter if there is a bracket or not.
Brent Boggs
B.S. in Mathematics & Physics, University of Michigan (Graduated 2012)
·
8y
-3^2 is really (-1)3^2 = (-1)9 = -9
(-3)^2 = -3-3 = 9
The key difference… -3 = -13
Sponsored by College Board
Did you know the SAT is only a two-hour test and has free prep?
More time per question. Shorter test. Free prep. If that sounds good, register for the SAT. Sign up today
Jay Cashen
Author has 740 answers and 1.7M answer views
·
8y
3^2 = = 3 x 3 by definition = 9
-3^2 = -(3^2) by definition, since you have to do powers before subtraction = - ( 9 ) = -9
(-3^)2 =(-3)(-3) by definition = 9 since like signs multiply to give plus
Veena
Being a bilingual
·
6y
Originally Answered: What is -(3) ^2?
·
It is actually -9. The fact that 3 is in a bracket means you are only squaring 3 which equals 9. Then you still have a negative to multiply which in turn makes everything negative.
So it’s more like
= -133
Now you multiply this expression as usual.
Note: if the negative was INSIDE the bracket. The answer would be 9.
Rianna Greene
High school diploma in Algebra & Solving Binomials, Stivers School for the Arts (Graduated 2018)
·
8y
What's the difference between (-4) ^2 and -4^2?
When do an opperation like this you must be careful with how you set up your problem:
By adding in parenthesis around the -4 you are saying basically “ I want to square both the 4 AND the negative sign”
But with out the parenthesis, it looks as if you want to only square the 4, leaving you with a “-” sign still there. You can test this out in your calculator. Do it once with and without the parenthesis and you will see what I am referring to.
Former Maths B.T.Asst Teacher (Retired) at P.S.G Sarvajana Hr.Sec School (1999–2010)
·
Author has 4K answers and 4.9M answer views
·
8y
−32=−9
(−3)2=+9
In the first one answer is - 3 x 3 = - 9
In the second one -3 x -3 = + 9
Related questions
What is the difference between (-3) ^2 and (-3) to the 2nd power?
How can one solve 2-2×3+3?
Is there any difference between the result of (-2) ^2 and -2^2?
What is (-3/2) ²+2 (-3/2)?
What is the difference between 2+3=5 and
2
+
3
=
5
?
What is the answer of 5+3×2?
Which is bigger, 3^2^2 or (3^2) ^2?
Why is
3
2
3
different from
(
3
2
)
3
?
What is the value of 2+2-3+2×2+2-3+3-2+1=?
What does 2-23+3 equal?
Whats 2 + 3 • 2 + 3?
How do I solve (3-3+3×3÷3) ×0× (2+2-2×2÷2)?
Why does 2-(-2) =4 in maths?
Why is 2 × (-3) = -6 ? Please don't just say that (+) × (-) = (-)
About
·
Careers
·
Privacy
·
Terms
·
Contact
·
Languages
·
Your Ad Choices
·
Press
·
© Quora, Inc. 2025 |
14160 | https://www.ahajournals.org/doi/10.1161/CIRCINTERVENTIONS.120.009622 | Fibrinolytic Strategy for ST-Segment–Elevation Myocardial Infarction | Circulation: Cardiovascular Interventions
Skip to main content
Advertisement
Become a member
Volunteer
Donate
Journals
BrowseCollectionsSubjectsAHA Journal PodcastsTrend Watch
ResourcesCMEAHA Journals @ MeetingsJournal MetricsEarly Career Resources
InformationFor AuthorsFor ReviewersFor SubscribersFor International Users
Alerts
0 Cart
Search
Sign inREGISTER
Quick Search in Journals
Enter search term
Quick Search anywhere
Enter search term
Quick search in Citations
Journal Year Volume Issue Page
Searching:
This Journal
This JournalAnywhereCitation
Advanced SearchSearch
navigate the sidebar menu
Sign inREGISTER
Quick Search anywhere
Enter search term
Publications
Arteriosclerosis, Thrombosis, and Vascular Biology
Circulation
Circulation Research
Hypertension
Stroke
Journal of the American Heart Association
Circulation: Arrhythmia and Electrophysiology
Circulation: Cardiovascular Imaging
Circulation: Cardiovascular Interventions
Current Issue
Archive
Journal Information
About Circulation: Cardiovascular Interventions
Author Instructions
Editorial Board
Information for Advertisers
Features
Assistant Editors
Special Issues
Contemporary Reviews
Circulation: Cardiovascular Quality & Outcomes
Circulation: Genomic and Precision Medicine
Circulation: Heart Failure
Stroke: Vascular and Interventional Neurology
Annals of Internal Medicine: Clinical Cases
Information
For Authors
For Reviewers
For Subscribers
For International Users
Submit & Publish
Submit to the AHA
Editorial Policies
Open Science
Value of Many Voices
Publishing with the AHA
Open Access Information
Resources
AHA Journals CME
AHA Journals @ Meetings
Metrics
AHA Journals Podcast Network
Early Career Resources
Trend Watch
Professional Heart Daily
AHA Newsroom
Current Issue
Archive
Journal Information
About Circulation: Cardiovascular Interventions
Author Instructions
Editorial Board
Information for Advertisers
Features
Assistant Editors
Special Issues
Contemporary Reviews
Submit
Reference #1
Review Article
Originally Published 4 September 2020
Free Access
Fibrinolytic Strategy for ST-Segment–Elevation Myocardial Infarction: A Contemporary Review in Context of the COVID-19 Pandemic
Pedro Engel Gonzalez, MD, Wally Omar, MD, Kunal V.Patel, MD, James A.de Lemos, MD Anthony A.Bavry, MD, MPH Thomas P.Koshy, MD, Ajit S.Mullasari, MD, Thomas Alexander, MD, Subhash Banerjee, MD and Dharam J.Kumbhani, MD, SM Info & Affiliations
Circulation: Cardiovascular Interventions
Volume 13, Number 9
59,105 10
Metrics
Total Downloads 59,105
Last 12 Months 22,129
Total Citations 10
Last 12 Months 4
View all metrics
Track CitationsAdd to favorites
PDF/EPUB
Contents
Abstract
Strategies Combining Up-Front Fibrinolysis With Selective or Routine PCI
Efficacy
Safety
Fibrinolytic Agents
Adjunctive Therapy
Patient Selection
Conclusions
Footnote
Supplemental Material
References
eLetters
Information & Authors
Metrics & Citations
View Options
References
Figures
Tables
Media
Share
Abstract
The ongoing coronavirus disease 2019 pandemic has resulted in additional challenges for systems designed to perform expeditious primary percutaneous coronary intervention for patients presenting with ST-segment–elevation myocardial infarction. There are 2 important considerations: the guideline-recommended time goals were difficult to achieve for many patients in high-income countries even before the pandemic, and there is a steep increase in mortality when primary percutaneous coronary intervention cannot be delivered in a timely fashion. Although the use of fibrinolytic therapy has progressively decreased over the last several decades in high-income countries, in circumstances when delays in timely delivery of primary percutaneous coronary intervention are expected, a modern fibrinolytic-based pharmacoinvasive strategy may need to be considered. The purpose of this review is to systematically discuss the contemporary role of an evidence-based fibrinolytic reperfusion strategy as part of a pharmacoinvasive approach, in the context of the emerging coronavirus disease 2019 pandemic.
The cornerstone of therapy for ST-segment–elevation myocardial infarction (STEMI) is to achieve early, complete epicardial, and microvascular reperfusion to minimize infarct size. European and US guidelines currently recommend primary percutaneous coronary intervention (pPCI) as the preferred reperfusion method1,2 when it is performed in a timely fashion and by an experienced team because it improves survival and lowers the rate of recurrent myocardial infarction and intracranial hemorrhage (ICH) compared with fibrinolytic therapy.3 However, there is a steep incremental increase in mortality when pPCI cannot be delivered promptly, particularly with delays in first-medical-contact to PCI longer than 60 minutes.4
In low and medium-income countries, nearly three-quarters of acute myocardial infarctions are still treated with fibrinolytic-based reperfusion.5,6 Even in high-income countries, the American College of Cardiology/American Heart Association and the European Society of Cardiology guideline-recommended time goals are often difficult to meet, with only 25% to 50% of patients with STEMI transferred for pPCI achieve the first medical contact-to-balloon time of ≤120 minutes.7–10 The value of fibrinolytic therapy, which can shorten the contact-to-reperfusion time, should not be overlooked in these situations where pPCI cannot be delivered promptly. In addition, a consideration of total ischemic time rather than door-to-balloon times alone is important for optimal outcomes.
The large-scale global pandemic due to the coronavirus disease 2019 (COVID-19) has created new challenges for emergency systems designed to perform expeditious pPCI for STEMI. Hence, there has been renewed interest in considering fibrinolysis for STEMI, as this may be the best compromise to ensure prompt reperfusion for selected patients while minimizing COVID-19 exposure to health care workers.11,12 However, this approach is not free from controversy.13,14 The purpose of this review is to systematically discuss the contemporary role of an evidence-based fibrinolytic reperfusion strategy within a pharmacoinvasive approach, in the context of the emerging COVID-19 pandemic.
Strategies Combining Up-Front Fibrinolysis With Selective or Routine PCI
Fibrinolysis Without Routine Transport for PCI
This approach utilizes full-dose fibrinolytics and reserves urgent angiography and PCI only if there is clinical evidence of primary failure of fibrinolysis. Primary failure of fibrinolysis is usually assessed clinically by persistent or worsening chest pain, hemodynamic or electrical instability, or electrocardiographic markers of failed reperfusion 60 to 90 minutes after administration of pharmacological reperfusion. ECG markers of failed reperfusion include <50% resolution of ST-segment elevation in the anterior leads or <70% in inferior leads (measured either from the lead with maximal baseline ST elevation or as the sum of ST-segment deviation across leads).15 Currently, rescue pPCI is still utilized in the context of a pharmacoinvasive strategy when indicated clinically.
Pharmacoinvasive Strategy
This strategy is generally initiated in a prehospital setting or at a non-PCI–capable hospital and differs from facilitated PCI in the timing of PCI after fibrinolytic administration and in that a second ECG has to be obtained on arrival in the PCI-capable hospital to evaluate the success of fibrinolytic therapy. It is sometimes referred to as a lyse and transfer or drip and ship strategy. The exact time frame for PCI is not well delineated but is thought to be between 2 hours and no later than 24 hours after fibrinolytic administration.1,2 In contrast, facilitated PCI refers to the administration of fibrinolytic therapy immediately before planned pPCI and is currently not recommended (see the Data Supplement).2 The pharmacoinvasive strategy has been studied in contemporary clinical trials in the era of drug-eluting and aggressive antiplatelet therapies and has been shown to be effective.16–18
As part of a pharmacoinvasive strategy, a reasonable approach is to perform rescue PCI emergently when there is suggestion of fibrinolytic failure. In contrast, when noninvasive evidence suggests successful reperfusion (ie, resolution of ST-segment elevation) then a delayed approach to PCI may be appropriate. In the current COVID pandemic, this delay may allow COVID testing to be performed before PCI since true and reliable point-of-care assays are not yet available. Additionally, COVID-19 frequently causes a prothrombotic state in its acute phase19 and a delay in performing PCI in this setting could be potentially beneficial, albeit this has not been proven.
Efficacy
For optimal results, fibrinolytic therapy should be administered as early as possible, preferably within the first 3 to 6 hours and potentially up to 12 hours after the onset of symptoms (Figure I in the Data Supplement).20,21 After 3 hours of symptom onset the clinical benefit of fibrinolysis markedly decreases.22 A lower benefit with treatment delays is also true for pPCI, but the importance of the timing of treatment for myocardial salvage may not be as great with PCI as it is with fibrinolysis.23–26 Fibrinolytic therapy should not be routinely administered in patients who present >12 hours after symptom onset, as efficacy has not been established.20,27 Fibrinolytic therapy may be reasonable after >12 hours in selected circumstances, such as a patient presenting with a STEMI, having stuttering chest pain, and continuing evidence of ischemia.
Randomized trials and a meta-analysis have shown that after fibrinolysis administration, routine early angiography, and PCI (2–24 hours) is associated with significantly better cardiovascular outcomes compared with conservative therapy.16,28–30 The rationale for performing routine angiography and PCI is that fibrinolysis alone achieves normalization of flow (define by TIMI [Thrombolysis in Myocardial Infarction] grade 3 flow at 90 minutes) in only 54% infarct-related arteries,31 versus 86% to 89% with pPCI.32,33 The clinical benefits of fibrinolytic therapy are more accentuated with restoration of TIMI grade 3 flow.34 Additionally, the risk for reocclusion after successful fibrinolysis is ≈13%, which is markedly lower after adjunctive PCI.16 These limitations are addressed with a pharmacoinvasive strategy; a pharmacoinvasive strategy also results in better ST-segment resolution compared with delayed primary PCI.35
The largest trial evaluating a pharmacoinvasive approach versus fibrinolysis was the TRANSFER-AMI (Trial of Routine Angioplasty and Stenting After Fibrinolysis to Enhance Reperfusion in Acute Myocardial Infarction). All patients with STEMI received intravenous TNK (tenecteplase), aspirin, clopidogrel, and either unfractionated heparin or enoxaparin at a non-PCI center.16 Patients were then randomized to a standard therapy arm (rescue PCI only if fibrinolytic therapy failed) or a pharmacoinvasive strategy arm, in which patients were transferred to a PCI-capable center immediately for urgent angiography (median time 2.8 hours). The pharmacoinvasive approach provided a significant benefit in the composite of major adverse cardiac events within 30 days compared with standard therapy (11.0% versus 17.2%, P=0.004). Notably, the difference in major adverse cardiac events was driven by reinfarction and recurrent ischemia, whereas the end points of death and cardiogenic shock were numerically more frequent in the pharmacoinvasive arm.36 There was no difference in TIMI major bleeding (7.4% versus 9.0%, P=0.36) or ICH (0.6% versus 1.1%, P=0.34) between pharmacoinvasive versus standard therapy.
The more recent STREAM trial (Strategic Reperfusion Early After Myocardial Infarction) compared a pharmacoinvasive strategy to pPCI.29 It randomized 1892 patients presenting with a STEMI within 3 hours of onset of symptoms who could not undergo timely PCI. The pharmacoinvasive group was treated with intravenous TNK, aspirin, clopidogrel, and enoxaparin, and routine angiography was performed at 6 to 24 hours (median time 17 hours). As part of a bailout strategy, rescue PCI was performed urgently when needed and was necessary for 36% of patients. Symptom onset to start of reperfusion was lower in the pharmacoinvasive arm versus pPCI (100 versus 178 minutes, P<0.0001). Thus, the opportunity cost (measured in time) of PCI (also called PCI-related delay, the difference between the door-to-balloon time in pPCI group, and door-to-needle time) was 78 minutes. There was no difference in major adverse cardiac events at 30 days (12.4% for pharmacoinvasive versus 14.3% for pPCI, P=0.21).29 The rate of ICH was higher with pharmacoinvasive (1.0% versus 0.2%, P=0.04). The trial protocol was amended after the first 400 patients by halving the TNK dose in patients older than 75 years given a signal of increased ICH. After this protocol amendment, no ICH was observed in patients ≥75 years, and the rates of ICH were similar between the 2 arms (0.5% versus 0.3%, P=0.45). These findings suggest that there is a role for fibrinolytic therapy in the current management of STEMIs when the PCI-related delay is anticipated to be long, and fibrinolysis can be given quickly. Another smaller trial from China with surrogate end points validated these findings by showing that in low-risk patients younger than 75 years, a pharmacoinvasive strategy with half-dose alteplase offered more complete epicardial and myocardial reperfusion when compared with pPCI.37 Real-world large observational studies38–41 with long-term follow-up have also noted similar efficacy and safety between a pharmacoinvasive and timely pPCI strategies (Table I in the Data Supplement).
A pharmacoinvasive strategy is currently recommended by the guidelines when there is anticipated delay in STEMI diagnosis to PCI-mediated reperfusion time of >120 minutes and would be applicable during this pandemic, as discussed earlier.1,2 For PUI patients, angiography can occur soon after COVID-19 has been effectively ruled out. For patients with confirmed COVID-19, angiography can be performed once the patient has convalesced from active infection, in light of the high mortality in hospitalized (particularly intubated) patients (Figure 1).42,43 When feasible, for patients with successful fibrinolysis, routine angiography should be performed within 24 hours.
Open in Viewer
Figure 1. Factors contributing to favorable outcomes and simplified main components of a contemporary pharmacoinvasive strategy in resource-limited circumstances like the coronavirus disease 2019 (COVID-19) pandemic. TIMI (Thrombolysis in Myocardial Infarction) score denotes TIMI risk score for STEMI. ACE indicates angiotensin-converting enzyme; ARB, angiotensin II receptor blockers; CAD, coronary artery disease; GP, glycoprotein; PCI, percutaneous coronary intervention; PUI, people under investigation for COVID-19; RF, risk factors; STEMI, ST-segment–elevation myocardial infarction; TNK, tenecteplase; UFH, unfractionated heparin; and WMA, wall motion abnormalities.
Safety
A detailed account of the safety profile of fibrinolytic agents in the context of a pharmacoinvasive strategy is described in the Data Supplement. Briefly, major bleeding requiring transfusion in fibrinolysis and pharmacoinvasive trials ranges from 1% to 12%, with higher risk in older patients, low body weight, women, and Black race.29,44–49 Trials utilizing modern-era standard of care for STEMI have used TNK which has major bleeding rates ranging from 1.1% to 8%.16,29,33,50–53 The rate of major cerebrovascular events ranges between 1.4% and 1.7%, with ICH consistently accounting for 0.4% to 1.0% of these events without significant variability between the common fibrinolytic agents.44 As discussed above, in the STREAM trial, there were no ICH in patients over 75 after adjustment of the protocol by halving the dose of TNK in this group.29
Fibrinolytic Agents
The fibrin-specific agents alteplase (accelerated infusion), reteplase, and TNK offer higher efficacy and an acceptable risk profile in comparison to streptokinase.44 The cheaper but less effective nonfibrin-specific streptokinase remains the most widely used fibrinolytic agent worldwide.54 Streptokinase is a nonspecific agent; hence, it activates both fibrin-bound and free plasminogen resulting in unopposed plasmin, inducing a systemic lytic state with degradation of fibrinogen and other clotting factors.55 Streptokinase use as part of a pharmacoinvasive strategy has been reported from observational studies56 but not as part of a randomized controlled trial; it may be more likely to active platelets compared with fibrin-specific agents.57 TNK was used in both TRANSFER-AMI and STREAM in the pharmacoinvasive arms. Comparison of the different fibrinolytic agents can be seen in Table II in the Data Supplement.
Adjunctive Therapy
A comprehensive discussion of the use of evidence-based antiplatelet therapy and intravenous anticoagulation is provided in the Data Supplement.
Patient Selection
Anticipated PCI-Related Delay
The exact time-related cutoff at which the PCI-related delay diminishes the advantage of pPCI over fibrinolysis has been controversial. No clinical trial has been conducted to address this specific question and studies have suggested different acceptable windows that could vary based on patient characteristics.21,22,58,59 The major guidelines have opted for simplicity and recommend fibrinolytic therapy when there is an anticipated delay in STEMI diagnosis to PCI-mediated reperfusion time of >120 minutes (Figure 2).1,2,22 This time goal has been difficult to meet in real-world practice in the United States, Europe, and other high-income countries.7–10
Open in Viewer
Figure 2. Relationship between percutaneous coronary intervention (PCI)–related delay (min) and in-hospital mortality. Red lines represent 95% CIs. Data from the National Registry of Myocardial Infarction. Multivariable analysis found no mortality advantage for primary PCI over a fibrinolytic-based strategy when the PCI-related delay exceeded 120 min. O-FT indicates fibrinolytic therapy; XDB-DN, transfer delay (transfer door-to-balloon-door-to-needle time); and X-PCI, primary PCI. Adapted from Pinto et al22 with permission. Copyright ©2011, Wolters Kluwer Health, Inc.
The COVID-19 pandemic has introduced a new set of challenges. Timely pPCI relies heavily on systems of care and significant delays are anticipated. All patients will need to be screened for COVID-19, cardiac catheterization laboratory staff will need additional time to don appropriate personal equipment, and the catheterization labs will require a terminal clean following each procedure involving patients with confirmed or possible COVID-19. Those presenting to hospitals without PCI capability are subject to transfer delays for pPCI due to an overtaxed health care system, and patients presenting by ambulance directly to hospitals with PCI capability are often not receiving the benefit of prehospital cardiac catheterization laboratory activation.12 A significant proportion of patients may present as walk-ins via private transport to avoid ambulance use during the COVID-19 era. Data from Hong Kong revealed that since the COVID-19 outbreak, door-to-balloon times have increased from 85 to 110 minutes,60 effectively increasing the PCI-related delay and potentially mitigating the benefit of pPCI over fibrinolytic-based therapy. In the United States, where pPCI is the routine reperfusion strategy for most STEMI, scientific societies have issued statements recommending that for patients with COVID-19 fibrinolysis can be considered an option for low-risk patients presenting with STEMI.61–63
Onset of Symptoms
The success of fibrinolytic strategy is incumbent on early administration and preferably should be within the first 3 hours after the onset of symptoms and no longer than 12 hours after onset.20–22 The COVID-19 pandemic again highlights the importance of this, as patients may present to the hospital later as it was seen in Hong Kong in which an almost 4-fold increase in median time from symptoms onset to first-medical contact was observed (from 82.5 to 318 minutes).60 In symptomatic patients presenting later than 12 hours after onset of symptoms, pPCI should generally be preferred.
Lower-Risk Patients Versus Cardiogenic Shock and High-Risk Patients
Given the robust benefits observed with pPCI in patients presenting with cardiogenic shock, pPCI should be the preferred strategy for these patients.64 The benefit of pPCI over fibrinolysis may be greater in patients that are at high risk of death based on models such as the TIMI risk score for STEMI.65,66 Conversely, the benefits of fibrinolysis seem especially consistent in lower-risk patients who make up a large number of patients with STEMI. In these latter patients, the benefit of pPCI seems to be attenuated in comparison to the early implementation of a modern pharmacoinvasive strategy, especially if longer PCI-related delays are anticipated.67 In the DANAMI-2 trial (Danish Trial in Acute Myocardial Infarction), there was no difference in 3-year outcomes between patients who received fibrinolytics or pPCI in patients with TIMI risk scores of 0 to 4 (≈75% of the total cohort), although in PCI-capable hospitals, the time to PCI was short and time to fibrinolytic therapy was relatively longer.68,69
Age
For a discussion of age as a factor for patient selection, see the Data Supplement. There is no absolute contraindication to fibrinolytic therapy based on age. Although age is a risk factor for ICH, the absolute incidence of this adverse event is generally low, and the use of a pharmacoinvasive strategy in older patients is still associated with significant cardiovascular benefits.40 The STREAM-2 trial,70 which will complete in 2022, will assess the efficacy of this modified regimen in all patients over 60 years old randomized to the pharmacoinvasive arm.
Diagnosis in Doubt
A challenge in the management of STEMIs with fibrinolysis is the risk of inadvertently treating a patient whose presentation is caused by other etiologies like myocarditis, pericarditis, acute neurological insult, Takotsubo cardiomyopathy, or coronary vasospasm. Some patients with known COVID-19 are presenting with chest pain and ST-segment elevation on EKG but subsequent angiography revealing no epicardial coronary artery disease or culprit lesions.71,72 In one case series of COVID-19 patients presenting with ST-segment elevations from New York City, NY, 9 out of 18 patients underwent coronary angiography, and of those, 6 had coronary occlusion on angiography.72 When diagnosis is in doubt, pPCI should be the main reperfusion strategy because the use of fibrinolytic therapy may be harmful, as it exposes them to risk with no benefit.
Conclusions
The use of fibrinolytic therapy has progressively decreased over the last several decades. However, a significant proportion of patients with STEMI in high-income countries are still treated with pPCI with delays longer than the 120 minutes stipulated by the guidelines, which are associated with worse outcomes.4,41 The COVID-19 pandemic has exacerbated this problem and likely will continue to be a pressing issue as it continues to expand throughout the globe and second-waves are expected. In circumstances when PCI-related delays are expected to be significant a fibrinolytic-based pharmacoinvasive strategy may be an attractive therapeutic option. Contemporary evidence suggests that fibrinolysis within a pharmacoinvasive framework is likely noninferior to pPCI when there is a long-anticipated PCI-related delay and should be considered given this strategy can lead to earlier reperfusion. The benefits of a pharmacoinvasive strategy are enhanced when it can be administered early, typically lower-risk presentation, absence of cardiogenic shock, and patient has no contraindication to fibrinolysis. The COVID-19 pandemic has shown that the promise of a blanket policy of pPCI for all patients with STEMI may be hard to deliver, and the role of fibrinolysis in the context of a pharmacoinvasive strategy may be especially important in overloaded health care systems where COVID-related logistical factors would be expected to lead to prolonged delays to pPCI. Moreover, even among centers that plan to continue a routine pPCI approach for STEMI during their COVID-19 surge, selective use of fibrinolysis due to a shortage of protective equipment or staff should be considered, particularly in patients likely to benefit from fibrinolysis.
Footnote
Nonstandard Abbreviation and Acronyms
COVID-19 coronavirus disease 2019
ICH intracranial hemorrhage
pPCI primary percutaneous coronary intervention
STEMI ST-segment–elevation myocardial infarction
STREAM Strategic Reperfusion Early After Myocardial Infarction
TIMI Thrombolysis in Myocardial Infarction
TNK tenecteplase
TRANSFER-AMI Trial of Routine Angioplasty and Stenting After Fibrinolysis to Enhance Reperfusion in Acute Myocardial Infarction
Supplemental Material
File(circinterventions_circcvint-2020-009622d_supp1.pdf)
Download
201.26 KB
References
1.
Ibanez B, James S, Agewall S, Antunes MJ, Bucciarelli-Ducci C, Bueno H, Caforio ALP, Crea F, Goudevenos JA, Halvorsen S, et al; ESC Scientific Document Group. 2017 ESC Guidelines for the management of acute myocardial infarction in patients presenting with ST-segment elevation: the Task Force for the management of acute myocardial infarction in patients presenting with ST-segment elevation of the European Society of Cardiology (ESC). Eur Heart J. 2018;39:119–177. doi: 10.1093/eurheartj/ehx393
Crossref
PubMed
Google Scholar
a [...] (pPCI) as the preferred reperfusion method
b [...] 24 hours after fibrinolytic administration.
c [...] during this pandemic, as discussed earlier.
d [...] Figure 2).
2.
O’Gara PT, Kushner FG, Ascheim DD, Casey DE, Chung MK, de Lemos JA, Ettinger SM, Fang JC, Fesmire FM, Franklin BA, et al; American College of Cardiology Foundation/American Heart Association Task Force on Practice Guidelines. 2013 ACCF/AHA guideline for the management of ST-elevation myocardial infarction: a report of the American College of Cardiology Foundation/American Heart Association Task Force on Practice Guidelines. Circulation. 2013;127:e362–e425. doi: 10.1161/CIR.0b013e3182742cf6
Crossref
PubMed
Google Scholar
a [...] (pPCI) as the preferred reperfusion method
b [...] 24 hours after fibrinolytic administration.
c [...] Data Supplement).
d [...] during this pandemic, as discussed earlier.
e [...] Figure 2).
3.
Keeley EC, Boura JA, Grines CL. Primary angioplasty versus intravenous thrombolytic therapy for acute myocardial infarction: a quantitative review of 23 randomised trials. Lancet. 2003;361:13–20. doi: 10.1016/S0140-6736(03)12113-7
Go to Citation
Crossref
PubMed
Google Scholar
4.
Scholz KH, Maier SKG, Maier LS, Lengenfelder B, Jacobshagen C, Jung J, Fleischmann C, Werner GS, Olbrich HG, Ott R, et al. Impact of treatment delay on mortality in ST-segment elevation myocardial infarction (STEMI) patients presenting with and without haemodynamic instability: results from the German prospective, multicentre FITT-STEMI trial. Eur Heart J. 2018;39:1065–1074. doi: 10.1093/eurheartj/ehy004
Crossref
PubMed
Google Scholar
a [...] to PCI longer than 60 minutes.
b [...] which are associated with worse outcomes.
5.
Chatterjee S, Giri J. Intravenous fibrinolytics in STEMI: a 25-year perspective. Lancet. 2017;390:718–720. doi: 10.1016/S0140-6736(17)32214-6
Go to Citation
Crossref
PubMed
Google Scholar
6.
Chandrashekhar Y, Alexander T, Mullasari A, Kumbhani DJ, Alam S, Alexanderson E, Bachani D, Wilhelmus Badenhorst JC, Baliga R, Bax JJ, et al. Resource and infrastructure-appropriate management of ST-segment elevation myocardial infarction in low- and middle-income countries. Circulation. 2020;141:2004–2025. doi: 10.1161/CIRCULATIONAHA.119.041297
Go to Citation
Crossref
PubMed
Google Scholar
7.
Vora AN, Holmes DN, Rokos I, Roe MT, Granger CB, French WJ, Antman E, Henry TD, Thomas L, Bates ER, et al. Fibrinolysis use among patients requiring interhospital transfer for ST-segment elevation myocardial infarction care: a report from the US National Cardiovascular Data Registry. JAMA Intern Med. 2015;175:207–215. doi: 10.1001/jamainternmed.2014.6573
Crossref
PubMed
Google Scholar
a [...] contact-to-balloon time of ≤120 minutes.
b [...] Europe, and other high-income countries.
8.
Aliprandi-Costa B, Morgan L, Snell LC, D Souza M, Kritharides L, French J, Brieger D, Ranasinghe I. ST-elevation acute myocardial infarction in Australia-temporal trends in patient management and outcomes 1999-2016. Heart Lung Circ. 2019;28:1000–1008. doi: 10.1016/j.hlc.2018.05.191
Crossref
PubMed
Google Scholar
a [...] contact-to-balloon time of ≤120 minutes.
b [...] Europe, and other high-income countries.
9.
Puymirat E, Battler A, Birkhead J, Bueno H, Clemmensen P, Cottin Y, Fox KA, Gorenek B, Hamm C, Huber K, et al; EHS 2009 snapshot participants. Euro heart survey 2009 snapshot: regional variations in presentation and management of patients with AMI in 47 countries. Eur Heart J Acute Cardiovasc Care. 2013;2:359–370. doi: 10.1177/2048872613497341
Crossref
PubMed
Google Scholar
a [...] contact-to-balloon time of ≤120 minutes.
b [...] Europe, and other high-income countries.
10.
Puymirat E, Simon T, Cayla G, Cottin Y, Elbaz M, Coste P, Lemesle G, Motreff P, Popovic B, Khalife K, et al; USIK, USIC 2000, and FAST-MI Investigators. Acute myocardial infarction: changes in patient characteristics, management, and 6-month outcomes over a period of 20 years in the FAST-MI program (French Registry of Acute ST-Elevation or Non-ST-Elevation Myocardial Infarction) 1995 to 2015. Circulation. 2017;136:1908–1919. doi: 10.1161/CIRCULATIONAHA.117.030798
Crossref
PubMed
Google Scholar
a [...] contact-to-balloon time of ≤120 minutes.
b [...] Europe, and other high-income countries.
11.
Daniels MJ, Cohen MG, Bavry AA, Kumbhani DJ. Reperfusion of ST-segment-elevation myocardial infarction in the COVID-19 era: business as usual? Circulation. 2020;141:1948–1950. doi: 10.1161/CIRCULATIONAHA.120.047122
Go to Citation
Crossref
PubMed
Google Scholar
12.
Bainey KR, Bates ER, Armstrong PW. STEMI care and COVID-19: the value proposition of pharmacoinvasive therapy. Circ Cardiovasc Qual Outcomes. 2020;13:e006834. doi: 10.1161/CIRCOUTCOMES.120.006834.
Crossref
PubMed
Google Scholar
a [...] COVID-19 exposure to health care workers.
b [...] catheterization laboratory activation.
13.
Kirtane AJ, Bangalore S. Why fibrinolytic therapy for ST-segment-elevation myocardial infarction in the COVID-19 pandemic is not your new best friend. Circ Cardiovasc Qual Outcomes. 2020;13:e006885. doi: 10.1161/CIRCOUTCOMES.120.006885
Go to Citation
Crossref
PubMed
Google Scholar
14.
Ranard LS, Ahmad Y, Masoumi A, Chuich T, Romney MS, Gavin N, Sayan OR, Kirtane AJ, Rabbani LE. Clinical pathway for management of suspected or positive novel coronavirus-19 patients with ST-segment elevation myocardial infarction. Crit Pathw Cardiol. 2020;19:49–54. doi: 10.1097/HPC.0000000000000223
Go to Citation
Crossref
PubMed
Google Scholar
15.
de Lemos JA, Braunwald E. ST segment resolution as a tool for assessing the efficacy of reperfusion therapy. J Am Coll Cardiol. 2001;38:1283–1294. doi: 10.1016/s0735-1097(01)01550-9
Go to Citation
Crossref
PubMed
Google Scholar
16.
Cantor WJ, Fitchett D, Borgundvaag B, Ducas J, Heffernan M, Cohen EA, Morrison LJ, Langer A, Dzavik V, Mehta SR, et al; TRANSFER-AMI Trial Investigators. Routine early angioplasty after fibrinolysis for acute myocardial infarction. N Engl J Med. 2009;360:2705–2718. doi: 10.1056/NEJMoa0808276
Crossref
PubMed
Google Scholar
a [...] and has been shown to be effective.
b [...] compared with conservative therapy.
c [...] is markedly lower after adjunctive PCI.
d [...] heparin or enoxaparin at a non-PCI center.
e [...] bleeding rates ranging from 1.1% to 8%.
17.
Di Mario C, Dudek D, Piscione F, Mielecki W, Savonitto S, Murena E, Dimopoulos K, Manari A, Gaspardone A, Ochala A, et al; CARESS-in-AMI (Combined Abciximab RE-teplase Stent Study in Acute Myocardial Infarction) Investigators. Immediate angioplasty versus standard therapy with rescue angioplasty after thrombolysis in the Combined Abciximab REteplase Stent Study in Acute Myocardial Infarction (CARESS-in-AMI): an open, prospective, randomised, multicentre trial. Lancet. 2008;371:559–568. doi: 10.1016/S0140-6736(08)60268-8
Go to Citation
Crossref
PubMed
Google Scholar
18.
Fazel R, Joseph TI, Sankardas MA, Pinto DS, Yeh RW, Kumbhani DJ, Nallamothu BK. Comparison of reperfusion strategies for ST-segment-elevation myocardial infarction: a Multivariate Network meta-analysis. J Am Heart Assoc. 2020;9:e015186. doi: 10.1161/JAHA.119.015186
Go to Citation
Crossref
PubMed
Google Scholar
19.
Connors JM, Levy JH. Thromboinflammation and the hypercoagulability of COVID-19. J Thromb Haemost. 2020;18:1559–1561. doi: 10.1111/jth.14849
Go to Citation
Crossref
PubMed
Google Scholar
20.
Fibrinolytic Therapy Trialists’ (FTT) Collaborative Group. Indications for fibrinolytic therapy in suspected acute myocardial infarction: collaborative overview of early mortality and major morbidity results from all randomised trials of more than 1000 patients. Lancet. 1994;343:311–322.
Crossref
PubMed
Google Scholar
a [...] Data Supplement).
b [...] as efficacy has not been established.
c [...] and no longer than 12 hours after onset.
21.
Boersma E, Maas AC, Deckers JW, Simoons ML. Early thrombolytic treatment in acute myocardial infarction: reappraisal of the golden hour. Lancet. 1996;348:771–775. doi: 10.1016/S0140-6736(96)02514-7
Crossref
PubMed
Google Scholar
a [...] Data Supplement).
b [...] vary based on patient characteristics.
c [...] and no longer than 12 hours after onset.
22.
Pinto DS, Frederick PD, Chakrabarti AK, Kirtane AJ, Ullman E, Dejam A, Miller DP, Henry TD, Gibson CM; National Registry of Myocardial Infarction Investigators. Benefit of transferring ST-segment-elevation myocardial infarction patients for percutaneous coronary intervention compared with administration of onsite fibrinolytic declines as delays increase. Circulation. 2011;124:2512–2521. doi: 10.1161/CIRCULATIONAHA.111.018549
Crossref
PubMed
Google Scholar
a [...] benefit of fibrinolysis markedly decreases.
b [...] vary based on patient characteristics.
c [...] Figure 2).
d [...] primary PCI. Adapted from Pinto et al
e [...] and no longer than 12 hours after onset.
23.
Schömig A, Mehilli J, Antoniucci D, Ndrepepa G, Markwardt C, Di Pede F, Nekolla SG, Schlotterbeck K, Schühlen H, Pache J, et al; Beyond 12 hours Reperfusion AlternatiVe Evaluation (BRAVE-2) Trial Investigators. Mechanical reperfusion in patients with acute myocardial infarction presenting more than 12 hours from symptom onset: a randomized controlled trial. JAMA. 2005;293:2865–2872. doi: 10.1001/jama.293.23.2865
Go to Citation
Crossref
PubMed
Google Scholar
24.
Brodie BR, Webb J, Cox DA, Qureshi M, Kalynych A, Turco M, Schultheiss HP, Dulas D, Rutherford B, Antoniucci D, et al; EMERALD Investigators. Impact of time to treatment on myocardial reperfusion and infarct size with primary percutaneous coronary intervention for acute myocardial infarction (from the EMERALD Trial). Am J Cardiol. 2007;99:1680–1686. doi: 10.1016/j.amjcard.2007.01.047
Go to Citation
Crossref
PubMed
Google Scholar
25.
Kastrati A, Mehilli J, Schlotterbeck K, Dotzer F, Dirschinger J, Schmitt C, Nekolla SG, Seyfarth M, Martinoff S, Markwardt C, et al; Bavarian Reperfusion Alternatives Evaluation (BRAVE) Study Investigators. Early administration of reteplase plus abciximab vs abciximab alone in patients with acute myocardial infarction referred for percutaneous coronary intervention: a randomized controlled trial. JAMA. 2004;291:947–954. doi: 10.1001/jama.291.8.947
Go to Citation
Crossref
PubMed
Google Scholar
26.
Pinto DS, Kirtane AJ, Nallamothu BK, Murphy SA, Cohen DJ, Laham RJ, Cutlip DE, Bates ER, Frederick PD, Miller DP, et al. Hospital delays in reperfusion for ST-elevation myocardial infarction: implications when selecting a reperfusion strategy. Circulation. 2006;114:2019–2025. doi: 10.1161/CIRCULATIONAHA.106.638353
Go to Citation
Crossref
PubMed
Google Scholar
27.
Langer A, Goodman SG, Topol EJ, Charlesworth A, Skene AM, Wilcox RG, Armstrong PW. Late assessment of thrombolytic efficacy (LATE) study: prognosis in patients with non-Q wave myocardial infarction. (LATE Study Investigators). J Am Coll Cardiol. 1996;27:1327–1332. doi: 10.1016/0735-1097(96)00012-5
Go to Citation
Crossref
PubMed
Google Scholar
28.
Abdel-Qadir H, Yan AT, Tan M, Borgia F, Piscione F, Di Mario C, Halvorsen S, Cantor WJ, Westerhout CM, Scheller B, et al. Consistency of benefit from an early invasive strategy after fibrinolysis: a patient-level meta-analysis. Heart. 2015;101:1554–1561. doi: 10.1136/heartjnl-2015-307815
Go to Citation
Crossref
PubMed
Google Scholar
29.
Armstrong PW, Gershlick AH, Goldstein P, Wilcox R, Danays T, Lambert Y, Sulimov V, Rosell Ortiz F, Ostojic M, Welsh RC, et al; STREAM Investigative Team. Fibrinolysis or primary PCI in ST-segment elevation myocardial infarction. N Engl J Med. 2013;368:1379–1387. doi: 10.1056/NEJMoa1301092
Crossref
PubMed
Google Scholar
a [...] compared with conservative therapy.
b [...] a pharmacoinvasive strategy to pPCI.
c [...] P=0.21).
d [...] low body weight, women, and Black race.
e [...] bleeding rates ranging from 1.1% to 8%.
f [...] by halving the dose of TNK in this group.
30.
Fernandez-Avilés F, Alonso JJ, Castro-Beiras A, Vázquez N, Blanco J, Alonso-Briales J, López-Mesa J, Fernández-Vazquez F, Calvo I, Martínez-Elbal L, et al; GRACIA (Grupo de Análisis de la Cardiopatía Isquémica Aguda) Group. Routine invasive strategy within 24 hours of thrombolysis versus ischaemia-guided conservative approach for acute myocardial infarction with ST-segment elevation (GRACIA-1): a randomised controlled trial. Lancet. 2004;364:1045–1053. doi: 10.1016/S0140-6736(04)17059-1
Go to Citation
Crossref
PubMed
Google Scholar
31.
Simes RJ, Topol EJ, Holmes DR, White HD, Rutsch WR, Vahanian A, Simoons ML, Morris D, Betriu A, Califf RM. Link between the angiographic substudy and mortality outcomes in a large randomized trial of myocardial reperfusion. Importance of early and complete infarct artery reperfusion. GUSTO-I Investigators. Circulation. 1995;91:1923–1928. doi: 10.1161/01.cir.91.7.1923
Go to Citation
Crossref
PubMed
Google Scholar
32.
Kammler J, Kypta A, Hofmann R, Kerschner K, Grund M, Sihorsch K, Steinwender C, Lambert T, Helml W, Leisch F. TIMI 3 flow after primary angioplasty is an important predictor for outcome in patients with acute myocardial infarction. Clin Res Cardiol. 2009;98:165–170. doi: 10.1007/s00392-008-0735-9
Go to Citation
Crossref
PubMed
Google Scholar
33.
Assessment of the S and Efficacy of a New Treatment Strategy with Percutaneous Coronary Intervention Investigators. Primary versus tenecteplase-facilitated percutaneous coronary intervention in patients with ST-segment elevation acute myocardial infarction (ASSENT-4 PCI): randomised trial. Lancet. 2006;367:569–578. doi: 10.1016/S0140-6736(06)68147-6
Crossref
PubMed
Google Scholar
a [...] versus 86% to 89% with pPCI.
b [...] bleeding rates ranging from 1.1% to 8%.
34.
Ross AM, Coyne KS, Moreyra E, Reiner JS, Greenhouse SW, Walker PL, Simoons ML, Draoui YC, Califf RM, Topol EJ, et al. Extended mortality benefit of early postinfarction reperfusion. GUSTO-I Angiographic Investigators. Global Utilization of Streptokinase and Tissue Plasminogen Activator for Occluded Coronary Arteries Trial. Circulation. 1998;97:1549–1556. doi: 10.1161/01.cir.97.16.1549
Go to Citation
Crossref
PubMed
Google Scholar
35.
Bainey KR, Armstrong PW, Zheng Y, Brass N, Tyrrell BD, Leung R, Westerhout CM, Welsh RC. Pharmacoinvasive strategy versus primary percutaneous coronary intervention in ST-elevation myocardial infarction in clinical practice: insights from the Vital Heart Response Registry. Circ Cardiovasc Interv. 2019;12:e008059. doi: 10.1161/CIRCINTERVENTIONS.119.008059
Go to Citation
Crossref
PubMed
Google Scholar
36.
Bakal JA, Westerhout CM, Cantor WJ, Fernández-Avilés F, Welsh RC, Fitchett D, Goodman SG, Armstrong PW. Evaluation of early percutaneous coronary intervention vs. standard therapy after fibrinolysis for ST-segment elevation myocardial infarction: contribution of weighting the composite endpoint. Eur Heart J. 2013;34:903–908. doi: 10.1093/eurheartj/ehs438
Go to Citation
Crossref
PubMed
Google Scholar
37.
Pu J, Ding S, Ge H, Han Y, Guo J, Lin R, Su X, Zhang H, Chen L, He B; EARLY-MYO Investigators. Efficacy and safety of a pharmaco-invasive strategy with half-dose alteplase versus primary angioplasty in ST-segment-elevation myocardial infarction: EARLY-MYO Trial (Early Routine Catheterization After Alteplase Fibrinolysis Versus Primary PCI in Acute ST-Segment-Elevation Myocardial Infarction). Circulation. 2017;136:1462–1473. doi: 10.1161/CIRCULATIONAHA.117.030582
Go to Citation
Crossref
PubMed
Google Scholar
38.
Danchin N, Puymirat E, Steg PG, Goldstein P, Schiele F, Belle L, Cottin Y, Fajadet J, Khalife K, Coste P, et al; FAST-MI 2005 Investigators. Five-year survival in patients with ST-segment-elevation myocardial infarction according to modalities of reperfusion therapy: the French Registry on Acute ST-Elevation and Non-ST-Elevation Myocardial Infarction (FAST-MI) 2005 Cohort. Circulation. 2014;129:1629–1636. doi: 10.1161/CIRCULATIONAHA.113.005874
Go to Citation
Crossref
PubMed
Google Scholar
39.
Sim DS, Jeong MH, Ahn Y, Kim YJ, Chae SC, Hong TJ, Seong IW, Chae JK, Kim CJ, Cho MC, et al; Korea Acute Myocardial Infarction Registry Investigators. Pharmacoinvasive strategy versus primary percutaneous coronary intervention in patients with ST-segment-elevation myocardial infarction: a propensity score-matched analysis. Circ Cardiovasc Interv. 2016;9:e003508. doi: 10.1161/CIRCINTERVENTIONS.115.003508
Go to Citation
Crossref
PubMed
Google Scholar
40.
Auffret V, Laurin C, Leurent G, Didier R, Filippi E, Hacot JP, Zabalawi A, Rouault G, Saouli D, Druelles P, et al. Pharmacoinvasive strategy versus primary percutaneous coronary intervention for ST-segment elevation myocardial infarction in patients ≥70 years of age. Am J Cardiol. 2020;125:1–10. doi: 10.1016/j.amjcard.2019.09.044
Crossref
PubMed
Google Scholar
a [...] Real-world large observational studies
b [...] with significant cardiovascular benefits.
41.
Danchin N, Popovic B, Puymirat E, Goldstein P, Belle L, Cayla G, Roubille F, Lemesle G, Ferrières J, Schiele F, et al; FAST-MI Investigators. Five-year outcomes following timely primary percutaneous intervention, late primary percutaneous intervention, or a pharmaco-invasive strategy in ST-segment elevation myocardial infarction: the FAST-MI programme. Eur Heart J. 2020;41:858–866. doi: 10.1093/eurheartj/ehz665
Crossref
PubMed
Google Scholar
a [...] Real-world large observational studies
b [...] which are associated with worse outcomes.
42.
Hendren NS, Drazner MH, Bozkurt B, Cooper LT Description and proposed management of the acute COVID-19 cardiovascular syndrome. Circulation. 2020;141:1903–1914. doi: 10.1161/CIRCULATIONAHA.120.047349
Go to Citation
Crossref
PubMed
Google Scholar
43.
Bhatraju PK, Ghassemieh BJ, Nichols M, Kim R, Jerome KR, Nalla AK, Greninger AL, Pipavath S, Wurfel MM, Evans L, et al. Covid-19 in critically ill patients in the Seattle Region - case series. N Engl J Med. 2020;382:2012–2022. doi: 10.1056/NEJMoa2004500
Go to Citation
Crossref
PubMed
Google Scholar
44.
Jinatongthai P, Kongwatcharapong J, Foo CY, Phrommintikul A, Nathisuwan S, Thakkinstian A, Reid CM, Chaiyakunapruk N. Comparative efficacy and safety of reperfusion therapy with fibrinolytic agents in patients with ST-segment elevation myocardial infarction: a systematic review and network meta-analysis. Lancet. 2017;390:747–759. doi: 10.1016/S0140-6736(17)31441-1
Crossref
PubMed
Google Scholar
a [...] low body weight, women, and Black race.
b [...] between the common fibrinolytic agents.
c [...] profile in comparison to streptokinase.
45.
Van De Werf F, Adgey J, Ardissino D, Armstrong PW, Aylward P, Barbash G, Betriu A, Binbrek AS, Califf R, Diaz R, et al; ASSENT-2 Investigators. Single-bolus tenecteplase compared with front-loaded alteplase in acute myocardial infarction: the ASSENT-2 double-blind randomised trial. Lancet. 1999;354:716–722. doi: 10.1016/s0140-6736(99)07403-6
Go to Citation
Crossref
PubMed
Google Scholar
46.
The GUSTO Investigators. An international randomized trial comparing four thrombolytic strategies for acute myocardial infarction. N Engl J Med. 1993;329:673–682. doi: 10.1056/NEJM199309023291001
Go to Citation
Crossref
PubMed
Google Scholar
47.
The Global Use of Strategies to Open Occluded Coronary Arteries (GUSTO III) Investigators. A comparison of reteplase with alteplase for acute myocardial infarction. N Engl J Med. 1997;337:1118–1123. doi: 10.1056/NEJM199710163371603
Go to Citation
Crossref
PubMed
Google Scholar
48.
GUSTO Angiographic Investigators. The effects of tissue plasminogen activator, streptokinase, or both on coronary-artery patency, ventricular function, and survival after acute myocardial infarction. N Engl J Med. 1993;329:1615–1622. doi: 10.1056/NEJM199311253292204
Go to Citation
Crossref
PubMed
Google Scholar
49.
Berkowitz SD, Granger CB, Pieper KS, Lee KL, Gore JM, Simoons M, Armstrong PW, Topol EJ, Califf RM. Incidence and predictors of bleeding after contemporary thrombolytic therapy for myocardial infarction. The Global Utilization of Streptokinase and Tissue Plasminogen activator for Occluded coronary arteries (GUSTO) I Investigators. Circulation. 1997;95:2508–2516. doi: 10.1161/01.cir.95.11.2508
Go to Citation
Crossref
PubMed
Google Scholar
50.
Armstrong PW; WEST Steering Committee. A comparison of pharmacologic therapy with/without timely coronary intervention vs. primary percutaneous intervention early after ST-elevation myocardial infarction: the WEST (Which Early ST-elevation myocardial infarction Therapy) study. Eur Heart J. 2006;27:1530–1538. doi: 10.1093/eurheartj/ehl088
Go to Citation
Crossref
PubMed
Google Scholar
51.
Le May MR, Wells GA, Labinaz M, Davies RF, Turek M, Leddy D, Maloney J, McKibbin T, Quinn B, Beanlands RS, et al. Combined angioplasty and pharmacological intervention versus thrombolysis alone in acute myocardial infarction (CAPITAL AMI study). J Am Coll Cardiol. 2005;46:417–424. doi: 10.1016/j.jacc.2005.04.042
Go to Citation
Crossref
PubMed
Google Scholar
52.
Fernández-Avilés F, Alonso JJ, Peña G, Blanco J, Alonso-Briales J, López-Mesa J, Fernández-Vázquez F, Moreu J, Hernández RA, Castro-Beiras A, et al; GRACIA-2 (Groupo de Análisis de Cardiopatía Isquémica Aguda) Investigators. Primary angioplasty vs. early routine post-fibrinolysis angioplasty for acute myocardial infarction with ST-segment elevation: the GRACIA-2 non-inferiority, randomized, controlled trial. Eur Heart J. 2007;28:949–960. doi: 10.1093/eurheartj/ehl461
Go to Citation
Crossref
PubMed
Google Scholar
53.
Sánchez PL, Gimeno F, Ancillo P, Sanz JJ, Alonso-Briales JH, Bosa F, Santos I, Sanchis J, Bethencourt A, López-Messa J, et al. Role of the paclitaxel-eluting stent and tirofiban in patients with ST-elevation myocardial infarction undergoing postfibrinolysis angioplasty: the GRACIA-3 randomized clinical trial. Circ Cardiovasc Interv. 2010;3:297–307. doi: 10.1161/CIRCINTERVENTIONS.109.920868
Go to Citation
Crossref
PubMed
Google Scholar
54.
Kumbhani DJ, Alexander T, Nallamothu BK, Menon V, Ayers C, Mullasari AS; TN-STEMI Investigators. Pharmacoinvasive approach with streptokinase in low to intermediate risk ST-elevation myocardial infarction patients: insights from the Tamil Nadu-STEMI initiative. Am J Cardiovasc Drugs. 2019;19:517–519. doi: 10.1007/s40256-019-00327-7
Go to Citation
Crossref
PubMed
Google Scholar
55.
Longstaff C, Kolev K. Basic mechanisms and regulation of fibrinolysis. J Thromb Haemost. 2015;13:S98–S105. doi: 10.1111/jth.12935
Go to Citation
Crossref
PubMed
Google Scholar
56.
Raja DC, Subban V, Victor SM, Joseph G, Thomson VS, Kannan K, Gnanaraj JP, Veerasekar G, Thenpally JG, Livingston N, et al. The impact of systems-of-care on pharmacoinvasive management with streptokinase: the subgroup analysis of the TN-STEMI programme. Indian Heart J. 2017;69:573–579. doi: 10.1016/j.ihj.2017.07.006
Go to Citation
Crossref
PubMed
Google Scholar
57.
Fitzgerald DJ, Catella F, Roy L, FitzGerald GA. Marked platelet activation in vivo after intravenous streptokinase in patients with acute myocardial infarction. Circulation. 1988;77:142–150. doi: 10.1161/01.cir.77.1.142
Go to Citation
Crossref
PubMed
Google Scholar
58.
Boersma E; Primary Coronary Angioplasty vs. Thrombolysis Group. Does time matter? A pooled analysis of randomized clinical trials comparing primary percutaneous coronary intervention and in-hospital fibrinolysis in acute myocardial infarction patients. Eur Heart J. 2006;27:779–788. doi: 10.1093/eurheartj/ehi810
Go to Citation
Crossref
PubMed
Google Scholar
59.
Nallamothu BK, Bates ER. Percutaneous coronary intervention versus fibrinolytic therapy in acute myocardial infarction: is timing (almost) everything? Am J Cardiol. 2003;92:824–826. doi: 10.1016/s0002-9149(03)00891-9
Go to Citation
Crossref
PubMed
Google Scholar
60.
Tam CF, Cheung KS, Lam S, Wong A, Yung A, Sze M, Lam YM, Chan C, Tsang TC, Tsui M, et al. Impact of coronavirus disease 2019 (COVID-19) outbreak on ST-segment-elevation myocardial infarction care in Hong Kong, China. Circ Cardiovasc Qual Outcomes. 2020;13:e006631. doi: 10.1161/CIRCOUTCOMES.120.006631
Crossref
PubMed
Google Scholar
a [...] have increased from 85 to 110 minutes,
b [...] was observed (from 82.5 to 318 minutes).
61.
Welt FGP, Shah PB, Aronow HD, Bortnick AE, Henry TD, Sherwood MW, Young MN, Davidson LJ, Kadavath S, Mahmud E, et al; American College of Cardiology’s Interventional Council and the Society for Cardiovascular Angiography and Interventions. Catheterization laboratory considerations during the coronavirus (COVID-19) pandemic: from the ACC’s Interventional Council and SCAI. J Am Coll Cardiol. 2020;75:2372–2375. doi: 10.1016/j.jacc.2020.03.021
Go to Citation
Crossref
PubMed
Google Scholar
62.
Mahmud E, Dauerman HL, Welt FG, Messenger JC, Rao SV, Grines C, Mattu A, Kirtane AJ, Jauhar R, Meraj P, et al. Management of acute myocardial infarction during the COVID-19 pandemic. J Am Coll Cardiol. 2020;S0735-1097:35026-9. doi: 10.1016/j.jacc.2020.04.039
Go to Citation
Crossref
Google Scholar
63.
Szerlip M, Anwaruddin S, Aronow HD, Cohen MG, Daniels MJ, Dehghani P, Drachman DE, Elmariah S, Feldman DN, Garcia S, et al. Considerations for cardiac catheterization laboratory procedures during the COVID-19 pandemic perspectives from the Society for Cardiovascular Angiography and Interventions Emerging Leader Mentorship (SCAI ELM) Members and Graduates [published online March 25, 2020]. Catheter Cardiovasc Interv. 2020. doi: 10.1002/ccd.28887
Go to Citation
Crossref
Google Scholar
64.
Hochman JS, Sleeper LA, Webb JG, Sanborn TA, White HD, Talley JD, Buller CE, Jacobs AK, Slater JN, Col J, et al. Early revascularization in acute myocardial infarction complicated by cardiogenic shock. SHOCK Investigators. Should we emergently revascularize occluded coronaries for cardiogenic shock. N Engl J Med. 1999;341:625–634. doi: 10.1056/NEJM199908263410901
Go to Citation
Crossref
PubMed
Google Scholar
65.
Tarantini G, Razzolini R, Napodano M, Bilato C, Ramondo A, Iliceto S. Acceptable reperfusion delay to prefer primary angioplasty over fibrin-specific thrombolytic therapy is affected (mainly) by the patient’s mortality risk: 1 h does not fit all. Eur Heart J. 2010;31:676–683. doi: 10.1093/eurheartj/ehp506
Go to Citation
Crossref
PubMed
Google Scholar
66.
Kent DM, Schmid CH, Lau J, Selker HP. Is primary angioplasty for some as good as primary angioplasty for all? J Gen Intern Med. 2002;17:887–894. doi: 10.1046/j.1525-1497.2002.11232.x
Go to Citation
Crossref
PubMed
Google Scholar
67.
Claeys MJ, de Meester A, Convens C, Dubois P, Boland J, De Raedt H, Vranckx P, Coussement P, Gevaert S, Sinnaeve P, et al. Contemporary mortality differences between primary percutaneous coronary intervention and thrombolysis in ST-segment elevation myocardial infarction. Arch Intern Med. 2011;171:544–549. doi: 10.1001/archinternmed.2011.57
Go to Citation
Crossref
PubMed
Google Scholar
68.
Andersen HR, Nielsen TT, Rasmussen K, Thuesen L, Kelbaek H, Thayssen P, Abildgaard U, Pedersen F, Madsen JK, Grande P, et al; DANAMI-2 Investigators. A comparison of coronary angioplasty with fibrinolytic therapy in acute myocardial infarction. N Engl J Med. 2003;349:733–742. doi: 10.1056/NEJMoa025142
Go to Citation
Crossref
PubMed
Google Scholar
69.
Thune JJ, Hoefsten DE, Lindholm MG, Mortensen LS, Andersen HR, Nielsen TT, Kober L, Kelbaek H; Danish Multicenter Randomized Study on Fibrinolytic Therapy Versus Acute Coronary Angioplasty in Acute Myocardial Infarction (DANAMI)-2 Investigators. Simple risk stratification at admission to identify patients with reduced mortality from primary angioplasty. Circulation. 2005;112:2017–2021. doi: 10.1161/CIRCULATIONAHA.105.558676
Go to Citation
Crossref
PubMed
Google Scholar
70.
Armstrong PW, Bogaerts K, Welsh R, Sinnaeve PR, Goldstein P, Pages A, Danays T, Van de Werf F; STREAM 2 Study Groups (appendix). The Second Strategic Reperfusion Early After Myocardial Infarction (STREAM-2) study optimizing pharmacoinvasive reperfusion strategy in older ST-elevation myocardial infarction patients. Am Heart J. 2020;226:140–146. doi: 10.1016/j.ahj.2020.04.029
Go to Citation
Crossref
PubMed
Google Scholar
71.
Stefanini GG, Montorfano M, Trabattoni D, Andreini D, Ferrante G, Ancona M, Metra M, Curello S, Maffeo D, Pero G, et al. ST-elevation myocardial infarction in patients with COVID-19: clinical and angiographic outcomes. Circulation. 2020;141:2113–2116. doi: 10.1161/CIRCULATIONAHA.120.047525
Go to Citation
Crossref
PubMed
Google Scholar
72.
Bangalore S, Sharma A, Slotwiner A, Yatskar L, Harari R, Shah B, Ibrahim H, Friedman GH, Thompson C, Alviar CL, et al. ST-segment elevation in patients with Covid-19 - a case series. N Engl J Med. 2020;382:2478–2480. doi: 10.1056/NEJMc2009020
Crossref
PubMed
Google Scholar
a [...] coronary artery disease or culprit lesions.
b [...] 6 had coronary occlusion on angiography.
Show all references
eLetters
eLetters should relate to an article recently published in the journal and are not a forum for providing unpublished data. Comments are reviewed for appropriate use of tone and language. Comments are not peer-reviewed. Acceptable comments are posted to the journal website only. Comments are not published in an issue and are not indexed in PubMed. Comments should be no longer than 500 words and will only be posted online. References are limited to 10. Authors of the article cited in the comment will be invited to reply, as appropriate.
Comments and feedback on AHA/ASA Scientific Statements and Guidelines should be directed to the AHA/ASA Manuscript Oversight Committee via its Correspondence page.
Sign In to Submit a Response to This Article
Information & Authors
Information Authors
Information
Published In
Circulation: Cardiovascular Interventions
Volume 13 • Number 9 • September 2020
PubMed: 32883106
Copyright
© 2020 American Heart Association, Inc.
Versions
You are viewing the most recent version of this article.
4 September 2020: Ahead of Print
History
Published in print: September 2020
Published online: 4 September 2020
Permissions
Request permissions for this article.
Request permissions
Keywords
coronavirus
fibrinolysis
myocardial infarction
pandemic
reperfusion
Authors
Affiliations Expand All
Pedro Engel Gonzalez, MD
Division of Cardiology, Department of Internal Medicine, University of Texas Southwestern Medical Center, Dallas (P.E.G., W.O., K.V.P., J.A.d.L., A.A.B., T.P.K., S.B., D.J.K.).
View all articles by this author
Wally Omar, MD
Division of Cardiology, Department of Internal Medicine, University of Texas Southwestern Medical Center, Dallas (P.E.G., W.O., K.V.P., J.A.d.L., A.A.B., T.P.K., S.B., D.J.K.).
View all articles by this author
Kunal V.Patel, MD
Division of Cardiology, Department of Internal Medicine, University of Texas Southwestern Medical Center, Dallas (P.E.G., W.O., K.V.P., J.A.d.L., A.A.B., T.P.K., S.B., D.J.K.).
View all articles by this author
James A.de Lemos, MD
Division of Cardiology, Department of Internal Medicine, University of Texas Southwestern Medical Center, Dallas (P.E.G., W.O., K.V.P., J.A.d.L., A.A.B., T.P.K., S.B., D.J.K.).
View all articles by this author
Anthony A.Bavry, MD, MPH
Division of Cardiology, Department of Internal Medicine, University of Texas Southwestern Medical Center, Dallas (P.E.G., W.O., K.V.P., J.A.d.L., A.A.B., T.P.K., S.B., D.J.K.).
View all articles by this author
Thomas P.Koshy, MD
Division of Cardiology, Department of Internal Medicine, University of Texas Southwestern Medical Center, Dallas (P.E.G., W.O., K.V.P., J.A.d.L., A.A.B., T.P.K., S.B., D.J.K.).
View all articles by this author
Ajit S.Mullasari, MD
The Institute of Cardio-Vascular Diseases, Madras Medical Mission, Chennai, India (A.S.M.).
View all articles by this author
Thomas Alexander, MD
Department of Cardiology, Kovai Medical Center and Hospital, Coimbatore, Tamil Nadu, India (T.A.).
View all articles by this author
Subhash Banerjee, MD
Division of Cardiology, Department of Internal Medicine, University of Texas Southwestern Medical Center, Dallas (P.E.G., W.O., K.V.P., J.A.d.L., A.A.B., T.P.K., S.B., D.J.K.).
VA North Texas Health Care System, Dallas (S.B.).
View all articles by this author
Dharam J.Kumbhani, MD, SM
Division of Cardiology, Department of Internal Medicine, University of Texas Southwestern Medical Center, Dallas (P.E.G., W.O., K.V.P., J.A.d.L., A.A.B., T.P.K., S.B., D.J.K.).
View all articles by this author
Notes
This manuscript was sent to Eric R. Bates, MD, Guest Editor, for review by expert referees, editorial decision, and final disposition.
The Data Supplement is available at Supplemental Material.
For Sources of Funding and Disclosures, see page 86.
Correspondence to: Dharam J. Kumbhani, MD, SM, UT Southwestern Medical Center, 2001 Inwood Rd, Suite WC05.852, Dallas, TX 75390-9254. Email dharam.kumbhani@utsouthwestern.edu
Disclosures
None.
Sources of Funding
None.
Metrics & Citations
Metrics Citations 10
Metrics
Article Metrics
View all metrics
Downloads
Citations
No data available.
59,105
10
Total
First 90 Days
6 Months
12 Months
Total number of downloads and citations
See more details
Blogged by 1
Posted by 36 X users
156 readers on Mendeley
Citations
Download Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Select your manager software from the list below and click Download.
Please select your download format:
[x] Direct Import
Tufan Gümüş,
Recep Temel,
Ebubekir Korucuk,
Sarp Tunalı,
Yiğit Türk,
Berk Göktepe,
Muhtar Sinan Ersin,
Utilizing of the Lymphocyte/CRP Ratio as a Predictor of Ischemia in Acute Incarcerated Hernias, The Anatolian Journal of General Medical Research, (2025).
Crossref
Brit Long,
William J. Brady,
Michael Gottlieb,
Fibrinolytic uses in the emergency department: a narrative review, The American Journal of Emergency Medicine, 89, (85-94), (2025).
Crossref
Carlos Diaz-Arocutipa,
Cynthia Vargas-Rivas,
Daniel Mendoza-Quispe,
Cesar Joel Benites-Moya,
Javier Torres-Valencia,
German Valenzuela-Rodriguez,
Norma Nicole Gamarra-Valverde,
Manuel Chacon-Diaz,
Juan Pablo Costabel,
Mamas A. Mamas,
Lourdes Vicent,
Pharmaco-Invasive Strategy Vs Primary Percutaneous Coronary Intervention for ST-Segment Elevation Myocardial Infarction in Latin America: A Meta-Analysis, CJC Open, 7, 1, (78-87), (2025).
Crossref
Jingyuan Hou,
Qiaoting Deng,
Xiaohong Qiu,
Sudong Liu,
Youqian Li,
Changjing Huang,
Xianfang Wang,
Qunji Zhang,
Xunwei Deng,
Zhixiong Zhong,
Wei Zhong,
Proteomic analysis of plasma proteins from patients with cardiac rupture after acute myocardial infarction using TMT-based quantitative proteomics approach, Clinical Proteomics, 21, 1, (2024).
Crossref
Dhairya Nanavaty,
Rishav Sinha,
Diksha Kaul,
Ankushi Sanghvi,
Vikash Kumar,
Bhavyakumar Vachhani,
Sohrab Singh,
Pradeepkumar Devarakonda,
Sarath Reddy,
Dhiran Verghese,
Impact of COVID-19 on Acute Myocardial Infarction: A National Inpatient Sample Analysis, Current Problems in Cardiology, 49, 1, (102030), (2024).
Crossref
Anwar Khedr,
Hussam Al Hennawi,
Muhammed Khuzzaim Khan,
Mostafa Elbanna,
Abbas B Jama,
Ekaterina Proskuriakova,
Hisham Mushtaq,
Mikael Mir,
Sydney Boike,
Ibtisam Rauf,
Aalaa Eissa,
Meritxell Urtecho,
Thoyaja Koritala,
Nitesh Jain,
Lokesh Goyal,
Salim Surani,
Syed A Khan,
Effect of fibrinolytic therapy on ST-elevation myocardial infarction clinical outcomes during the COVID-19 pandemic: A systematic review and meta-analysis, World Journal of Cardiology, 15, 6, (309-323), (2023).
Crossref
Konstantinos G Kyriakoulis,
Ioannis P Trontzas,
Ioannis G Kyriakoulis,
Dimitrios Terentes-Printzios,
Nikolaos-Georgios Papageorgiou,
Eleni Fyta,
Elias Kotteas,
Anastasios Kollias,
ST-Segment Elevation Myocardial Infarction (STEMI) Management in the Era of COVID-19: A Systematic and Critical Review of Published Guidance Reports, Reviews in Cardiovascular Medicine, 24, 2, (2023).
Crossref
Ching-Hui Sia,
Sock-Hwee Tan,
Siew-Pang Chan,
Stephanie Marchesseau,
Hui-Wen Sim,
Leonardo Carvalho,
Ruth Chen,
Nor Hanim Mohd Amin,
Alan Yean-Yip Fong,
Arthur Mark Richards,
Christina Yip,
Mark Y. Chan,
Enhanced Thrombin Generation Is Associated with Worse Left Ventricular Scarring after ST-Segment Elevation Myocardial Infarction: A Cohort Study, Pharmaceuticals, 15, 6, (718), (2022).
Crossref
Byomesh Tripathi,
Vikas Aggarwal,
Jinnette Dawn Abbott,
Dharam J Kumbhani,
Jay Giri,
Ankur Kalra,
Partha Sardar,
Saurav Chatterjee,
Mechanical Complications in ST-Elevation Myocardial Infarction (STEMI) Based on Different Reperfusion Strategies, The American Journal of Cardiology, 156, (79-84), (2021).
Crossref
Evangelia Vemmou,
Ilias Nikolakopoulos,
Emmanouil S. Brilakis,
Payam Dehghani,
Santiago Garcia,
Case Selection During the COVID-19 Pandemic: Who Should Go to the Cardiac Catheterization Laboratory?, Current Treatment Options in Cardiovascular Medicine, 23, 4, (2021).
Crossref
Loading...
View Options
View options
PDF and All Supplements
Download PDF and All Supplements
Download is in progress
PDF/EPUB
View PDF/EPUB
Figures
Open all in viewer
Figure 1. Factors contributing to favorable outcomes and simplified main components of a contemporary pharmacoinvasive strategy in resource-limited circumstances like the coronavirus disease 2019 (COVID-19) pandemic. TIMI (Thrombolysis in Myocardial Infarction) score denotes TIMI risk score for STEMI. ACE indicates angiotensin-converting enzyme; ARB, angiotensin II receptor blockers; CAD, coronary artery disease; GP, glycoprotein; PCI, percutaneous coronary intervention; PUI, people under investigation for COVID-19; RF, risk factors; STEMI, ST-segment–elevation myocardial infarction; TNK, tenecteplase; UFH, unfractionated heparin; and WMA, wall motion abnormalities.
Go to FigureOpen in Viewer
Figure 2. Relationship between percutaneous coronary intervention (PCI)–related delay (min) and in-hospital mortality. Red lines represent 95% CIs. Data from the National Registry of Myocardial Infarction. Multivariable analysis found no mortality advantage for primary PCI over a fibrinolytic-based strategy when the PCI-related delay exceeded 120 min. O-FT indicates fibrinolytic therapy; XDB-DN, transfer delay (transfer door-to-balloon-door-to-needle time); and X-PCI, primary PCI. Adapted from Pinto et al22 with permission. Copyright ©2011, Wolters Kluwer Health, Inc.
Go to FigureOpen in Viewer
Tables
Media
Share
Share
Share article link
Copy Link
Copied!
Copying failed.
Share
FacebookLinkedInX (formerly Twitter)emailWeChatBluesky
References
References
1.
Ibanez B, James S, Agewall S, Antunes MJ, Bucciarelli-Ducci C, Bueno H, Caforio ALP, Crea F, Goudevenos JA, Halvorsen S, et al; ESC Scientific Document Group. 2017 ESC Guidelines for the management of acute myocardial infarction in patients presenting with ST-segment elevation: the Task Force for the management of acute myocardial infarction in patients presenting with ST-segment elevation of the European Society of Cardiology (ESC). Eur Heart J. 2018;39:119–177. doi: 10.1093/eurheartj/ehx393
Crossref
PubMed
Google Scholar
a [...] (pPCI) as the preferred reperfusion method
b [...] 24 hours after fibrinolytic administration.
c [...] during this pandemic, as discussed earlier.
d [...] Figure 2).
2.
O’Gara PT, Kushner FG, Ascheim DD, Casey DE, Chung MK, de Lemos JA, Ettinger SM, Fang JC, Fesmire FM, Franklin BA, et al; American College of Cardiology Foundation/American Heart Association Task Force on Practice Guidelines. 2013 ACCF/AHA guideline for the management of ST-elevation myocardial infarction: a report of the American College of Cardiology Foundation/American Heart Association Task Force on Practice Guidelines. Circulation. 2013;127:e362–e425. doi: 10.1161/CIR.0b013e3182742cf6
Crossref
PubMed
Google Scholar
a [...] (pPCI) as the preferred reperfusion method
b [...] 24 hours after fibrinolytic administration.
c [...] Data Supplement).
d [...] during this pandemic, as discussed earlier.
e [...] Figure 2).
3.
Keeley EC, Boura JA, Grines CL. Primary angioplasty versus intravenous thrombolytic therapy for acute myocardial infarction: a quantitative review of 23 randomised trials. Lancet. 2003;361:13–20. doi: 10.1016/S0140-6736(03)12113-7
Go to Citation
Crossref
PubMed
Google Scholar
4.
Scholz KH, Maier SKG, Maier LS, Lengenfelder B, Jacobshagen C, Jung J, Fleischmann C, Werner GS, Olbrich HG, Ott R, et al. Impact of treatment delay on mortality in ST-segment elevation myocardial infarction (STEMI) patients presenting with and without haemodynamic instability: results from the German prospective, multicentre FITT-STEMI trial. Eur Heart J. 2018;39:1065–1074. doi: 10.1093/eurheartj/ehy004
Crossref
PubMed
Google Scholar
a [...] to PCI longer than 60 minutes.
b [...] which are associated with worse outcomes.
5.
Chatterjee S, Giri J. Intravenous fibrinolytics in STEMI: a 25-year perspective. Lancet. 2017;390:718–720. doi: 10.1016/S0140-6736(17)32214-6
Go to Citation
Crossref
PubMed
Google Scholar
6.
Chandrashekhar Y, Alexander T, Mullasari A, Kumbhani DJ, Alam S, Alexanderson E, Bachani D, Wilhelmus Badenhorst JC, Baliga R, Bax JJ, et al. Resource and infrastructure-appropriate management of ST-segment elevation myocardial infarction in low- and middle-income countries. Circulation. 2020;141:2004–2025. doi: 10.1161/CIRCULATIONAHA.119.041297
Go to Citation
Crossref
PubMed
Google Scholar
7.
Vora AN, Holmes DN, Rokos I, Roe MT, Granger CB, French WJ, Antman E, Henry TD, Thomas L, Bates ER, et al. Fibrinolysis use among patients requiring interhospital transfer for ST-segment elevation myocardial infarction care: a report from the US National Cardiovascular Data Registry. JAMA Intern Med. 2015;175:207–215. doi: 10.1001/jamainternmed.2014.6573
Crossref
PubMed
Google Scholar
a [...] contact-to-balloon time of ≤120 minutes.
b [...] Europe, and other high-income countries.
8.
Aliprandi-Costa B, Morgan L, Snell LC, D Souza M, Kritharides L, French J, Brieger D, Ranasinghe I. ST-elevation acute myocardial infarction in Australia-temporal trends in patient management and outcomes 1999-2016. Heart Lung Circ. 2019;28:1000–1008. doi: 10.1016/j.hlc.2018.05.191
Crossref
PubMed
Google Scholar
a [...] contact-to-balloon time of ≤120 minutes.
b [...] Europe, and other high-income countries.
9.
Puymirat E, Battler A, Birkhead J, Bueno H, Clemmensen P, Cottin Y, Fox KA, Gorenek B, Hamm C, Huber K, et al; EHS 2009 snapshot participants. Euro heart survey 2009 snapshot: regional variations in presentation and management of patients with AMI in 47 countries. Eur Heart J Acute Cardiovasc Care. 2013;2:359–370. doi: 10.1177/2048872613497341
Crossref
PubMed
Google Scholar
a [...] contact-to-balloon time of ≤120 minutes.
b [...] Europe, and other high-income countries.
10.
Puymirat E, Simon T, Cayla G, Cottin Y, Elbaz M, Coste P, Lemesle G, Motreff P, Popovic B, Khalife K, et al; USIK, USIC 2000, and FAST-MI Investigators. Acute myocardial infarction: changes in patient characteristics, management, and 6-month outcomes over a period of 20 years in the FAST-MI program (French Registry of Acute ST-Elevation or Non-ST-Elevation Myocardial Infarction) 1995 to 2015. Circulation. 2017;136:1908–1919. doi: 10.1161/CIRCULATIONAHA.117.030798
Crossref
PubMed
Google Scholar
a [...] contact-to-balloon time of ≤120 minutes.
b [...] Europe, and other high-income countries.
11.
Daniels MJ, Cohen MG, Bavry AA, Kumbhani DJ. Reperfusion of ST-segment-elevation myocardial infarction in the COVID-19 era: business as usual? Circulation. 2020;141:1948–1950. doi: 10.1161/CIRCULATIONAHA.120.047122
Go to Citation
Crossref
PubMed
Google Scholar
12.
Bainey KR, Bates ER, Armstrong PW. STEMI care and COVID-19: the value proposition of pharmacoinvasive therapy. Circ Cardiovasc Qual Outcomes. 2020;13:e006834. doi: 10.1161/CIRCOUTCOMES.120.006834.
Crossref
PubMed
Google Scholar
a [...] COVID-19 exposure to health care workers.
b [...] catheterization laboratory activation.
13.
Kirtane AJ, Bangalore S. Why fibrinolytic therapy for ST-segment-elevation myocardial infarction in the COVID-19 pandemic is not your new best friend. Circ Cardiovasc Qual Outcomes. 2020;13:e006885. doi: 10.1161/CIRCOUTCOMES.120.006885
Go to Citation
Crossref
PubMed
Google Scholar
14.
Ranard LS, Ahmad Y, Masoumi A, Chuich T, Romney MS, Gavin N, Sayan OR, Kirtane AJ, Rabbani LE. Clinical pathway for management of suspected or positive novel coronavirus-19 patients with ST-segment elevation myocardial infarction. Crit Pathw Cardiol. 2020;19:49–54. doi: 10.1097/HPC.0000000000000223
Go to Citation
Crossref
PubMed
Google Scholar
15.
de Lemos JA, Braunwald E. ST segment resolution as a tool for assessing the efficacy of reperfusion therapy. J Am Coll Cardiol. 2001;38:1283–1294. doi: 10.1016/s0735-1097(01)01550-9
Go to Citation
Crossref
PubMed
Google Scholar
16.
Cantor WJ, Fitchett D, Borgundvaag B, Ducas J, Heffernan M, Cohen EA, Morrison LJ, Langer A, Dzavik V, Mehta SR, et al; TRANSFER-AMI Trial Investigators. Routine early angioplasty after fibrinolysis for acute myocardial infarction. N Engl J Med. 2009;360:2705–2718. doi: 10.1056/NEJMoa0808276
Crossref
PubMed
Google Scholar
a [...] and has been shown to be effective.
b [...] compared with conservative therapy.
c [...] is markedly lower after adjunctive PCI.
d [...] heparin or enoxaparin at a non-PCI center.
e [...] bleeding rates ranging from 1.1% to 8%.
17.
Di Mario C, Dudek D, Piscione F, Mielecki W, Savonitto S, Murena E, Dimopoulos K, Manari A, Gaspardone A, Ochala A, et al; CARESS-in-AMI (Combined Abciximab RE-teplase Stent Study in Acute Myocardial Infarction) Investigators. Immediate angioplasty versus standard therapy with rescue angioplasty after thrombolysis in the Combined Abciximab REteplase Stent Study in Acute Myocardial Infarction (CARESS-in-AMI): an open, prospective, randomised, multicentre trial. Lancet. 2008;371:559–568. doi: 10.1016/S0140-6736(08)60268-8
Go to Citation
Crossref
PubMed
Google Scholar
18.
Fazel R, Joseph TI, Sankardas MA, Pinto DS, Yeh RW, Kumbhani DJ, Nallamothu BK. Comparison of reperfusion strategies for ST-segment-elevation myocardial infarction: a Multivariate Network meta-analysis. J Am Heart Assoc. 2020;9:e015186. doi: 10.1161/JAHA.119.015186
Go to Citation
Crossref
PubMed
Google Scholar
19.
Connors JM, Levy JH. Thromboinflammation and the hypercoagulability of COVID-19. J Thromb Haemost. 2020;18:1559–1561. doi: 10.1111/jth.14849
Go to Citation
Crossref
PubMed
Google Scholar
20.
Fibrinolytic Therapy Trialists’ (FTT) Collaborative Group. Indications for fibrinolytic therapy in suspected acute myocardial infarction: collaborative overview of early mortality and major morbidity results from all randomised trials of more than 1000 patients. Lancet. 1994;343:311–322.
Crossref
PubMed
Google Scholar
a [...] Data Supplement).
b [...] as efficacy has not been established.
c [...] and no longer than 12 hours after onset.
21.
Boersma E, Maas AC, Deckers JW, Simoons ML. Early thrombolytic treatment in acute myocardial infarction: reappraisal of the golden hour. Lancet. 1996;348:771–775. doi: 10.1016/S0140-6736(96)02514-7
Crossref
PubMed
Google Scholar
a [...] Data Supplement).
b [...] vary based on patient characteristics.
c [...] and no longer than 12 hours after onset.
22.
Pinto DS, Frederick PD, Chakrabarti AK, Kirtane AJ, Ullman E, Dejam A, Miller DP, Henry TD, Gibson CM; National Registry of Myocardial Infarction Investigators. Benefit of transferring ST-segment-elevation myocardial infarction patients for percutaneous coronary intervention compared with administration of onsite fibrinolytic declines as delays increase. Circulation. 2011;124:2512–2521. doi: 10.1161/CIRCULATIONAHA.111.018549
Crossref
PubMed
Google Scholar
a [...] benefit of fibrinolysis markedly decreases.
b [...] vary based on patient characteristics.
c [...] Figure 2).
d [...] primary PCI. Adapted from Pinto et al
e [...] and no longer than 12 hours after onset.
23.
Schömig A, Mehilli J, Antoniucci D, Ndrepepa G, Markwardt C, Di Pede F, Nekolla SG, Schlotterbeck K, Schühlen H, Pache J, et al; Beyond 12 hours Reperfusion AlternatiVe Evaluation (BRAVE-2) Trial Investigators. Mechanical reperfusion in patients with acute myocardial infarction presenting more than 12 hours from symptom onset: a randomized controlled trial. JAMA. 2005;293:2865–2872. doi: 10.1001/jama.293.23.2865
Go to Citation
Crossref
PubMed
Google Scholar
24.
Brodie BR, Webb J, Cox DA, Qureshi M, Kalynych A, Turco M, Schultheiss HP, Dulas D, Rutherford B, Antoniucci D, et al; EMERALD Investigators. Impact of time to treatment on myocardial reperfusion and infarct size with primary percutaneous coronary intervention for acute myocardial infarction (from the EMERALD Trial). Am J Cardiol. 2007;99:1680–1686. doi: 10.1016/j.amjcard.2007.01.047
Go to Citation
Crossref
PubMed
Google Scholar
25.
Kastrati A, Mehilli J, Schlotterbeck K, Dotzer F, Dirschinger J, Schmitt C, Nekolla SG, Seyfarth M, Martinoff S, Markwardt C, et al; Bavarian Reperfusion Alternatives Evaluation (BRAVE) Study Investigators. Early administration of reteplase plus abciximab vs abciximab alone in patients with acute myocardial infarction referred for percutaneous coronary intervention: a randomized controlled trial. JAMA. 2004;291:947–954. doi: 10.1001/jama.291.8.947
Go to Citation
Crossref
PubMed
Google Scholar
26.
Pinto DS, Kirtane AJ, Nallamothu BK, Murphy SA, Cohen DJ, Laham RJ, Cutlip DE, Bates ER, Frederick PD, Miller DP, et al. Hospital delays in reperfusion for ST-elevation myocardial infarction: implications when selecting a reperfusion strategy. Circulation. 2006;114:2019–2025. doi: 10.1161/CIRCULATIONAHA.106.638353
Go to Citation
Crossref
PubMed
Google Scholar
27.
Langer A, Goodman SG, Topol EJ, Charlesworth A, Skene AM, Wilcox RG, Armstrong PW. Late assessment of thrombolytic efficacy (LATE) study: prognosis in patients with non-Q wave myocardial infarction. (LATE Study Investigators). J Am Coll Cardiol. 1996;27:1327–1332. doi: 10.1016/0735-1097(96)00012-5
Go to Citation
Crossref
PubMed
Google Scholar
28.
Abdel-Qadir H, Yan AT, Tan M, Borgia F, Piscione F, Di Mario C, Halvorsen S, Cantor WJ, Westerhout CM, Scheller B, et al. Consistency of benefit from an early invasive strategy after fibrinolysis: a patient-level meta-analysis. Heart. 2015;101:1554–1561. doi: 10.1136/heartjnl-2015-307815
Go to Citation
Crossref
PubMed
Google Scholar
29.
Armstrong PW, Gershlick AH, Goldstein P, Wilcox R, Danays T, Lambert Y, Sulimov V, Rosell Ortiz F, Ostojic M, Welsh RC, et al; STREAM Investigative Team. Fibrinolysis or primary PCI in ST-segment elevation myocardial infarction. N Engl J Med. 2013;368:1379–1387. doi: 10.1056/NEJMoa1301092
Crossref
PubMed
Google Scholar
a [...] compared with conservative therapy.
b [...] a pharmacoinvasive strategy to pPCI.
c [...] P=0.21).
d [...] low body weight, women, and Black race.
e [...] bleeding rates ranging from 1.1% to 8%.
f [...] by halving the dose of TNK in this group.
30.
Fernandez-Avilés F, Alonso JJ, Castro-Beiras A, Vázquez N, Blanco J, Alonso-Briales J, López-Mesa J, Fernández-Vazquez F, Calvo I, Martínez-Elbal L, et al; GRACIA (Grupo de Análisis de la Cardiopatía Isquémica Aguda) Group. Routine invasive strategy within 24 hours of thrombolysis versus ischaemia-guided conservative approach for acute myocardial infarction with ST-segment elevation (GRACIA-1): a randomised controlled trial. Lancet. 2004;364:1045–1053. doi: 10.1016/S0140-6736(04)17059-1
Go to Citation
Crossref
PubMed
Google Scholar
31.
Simes RJ, Topol EJ, Holmes DR, White HD, Rutsch WR, Vahanian A, Simoons ML, Morris D, Betriu A, Califf RM. Link between the angiographic substudy and mortality outcomes in a large randomized trial of myocardial reperfusion. Importance of early and complete infarct artery reperfusion. GUSTO-I Investigators. Circulation. 1995;91:1923–1928. doi: 10.1161/01.cir.91.7.1923
Go to Citation
Crossref
PubMed
Google Scholar
32.
Kammler J, Kypta A, Hofmann R, Kerschner K, Grund M, Sihorsch K, Steinwender C, Lambert T, Helml W, Leisch F. TIMI 3 flow after primary angioplasty is an important predictor for outcome in patients with acute myocardial infarction. Clin Res Cardiol. 2009;98:165–170. doi: 10.1007/s00392-008-0735-9
Go to Citation
Crossref
PubMed
Google Scholar
33.
Assessment of the S and Efficacy of a New Treatment Strategy with Percutaneous Coronary Intervention Investigators. Primary versus tenecteplase-facilitated percutaneous coronary intervention in patients with ST-segment elevation acute myocardial infarction (ASSENT-4 PCI): randomised trial. Lancet. 2006;367:569–578. doi: 10.1016/S0140-6736(06)68147-6
Crossref
PubMed
Google Scholar
a [...] versus 86% to 89% with pPCI.
b [...] bleeding rates ranging from 1.1% to 8%.
34.
Ross AM, Coyne KS, Moreyra E, Reiner JS, Greenhouse SW, Walker PL, Simoons ML, Draoui YC, Califf RM, Topol EJ, et al. Extended mortality benefit of early postinfarction reperfusion. GUSTO-I Angiographic Investigators. Global Utilization of Streptokinase and Tissue Plasminogen Activator for Occluded Coronary Arteries Trial. Circulation. 1998;97:1549–1556. doi: 10.1161/01.cir.97.16.1549
Go to Citation
Crossref
PubMed
Google Scholar
35.
Bainey KR, Armstrong PW, Zheng Y, Brass N, Tyrrell BD, Leung R, Westerhout CM, Welsh RC. Pharmacoinvasive strategy versus primary percutaneous coronary intervention in ST-elevation myocardial infarction in clinical practice: insights from the Vital Heart Response Registry. Circ Cardiovasc Interv. 2019;12:e008059. doi: 10.1161/CIRCINTERVENTIONS.119.008059
Go to Citation
Crossref
PubMed
Google Scholar
36.
Bakal JA, Westerhout CM, Cantor WJ, Fernández-Avilés F, Welsh RC, Fitchett D, Goodman SG, Armstrong PW. Evaluation of early percutaneous coronary intervention vs. standard therapy after fibrinolysis for ST-segment elevation myocardial infarction: contribution of weighting the composite endpoint. Eur Heart J. 2013;34:903–908. doi: 10.1093/eurheartj/ehs438
Go to Citation
Crossref
PubMed
Google Scholar
37.
Pu J, Ding S, Ge H, Han Y, Guo J, Lin R, Su X, Zhang H, Chen L, He B; EARLY-MYO Investigators. Efficacy and safety of a pharmaco-invasive strategy with half-dose alteplase versus primary angioplasty in ST-segment-elevation myocardial infarction: EARLY-MYO Trial (Early Routine Catheterization After Alteplase Fibrinolysis Versus Primary PCI in Acute ST-Segment-Elevation Myocardial Infarction). Circulation. 2017;136:1462–1473. doi: 10.1161/CIRCULATIONAHA.117.030582
Go to Citation
Crossref
PubMed
Google Scholar
38.
Danchin N, Puymirat E, Steg PG, Goldstein P, Schiele F, Belle L, Cottin Y, Fajadet J, Khalife K, Coste P, et al; FAST-MI 2005 Investigators. Five-year survival in patients with ST-segment-elevation myocardial infarction according to modalities of reperfusion therapy: the French Registry on Acute ST-Elevation and Non-ST-Elevation Myocardial Infarction (FAST-MI) 2005 Cohort. Circulation. 2014;129:1629–1636. doi: 10.1161/CIRCULATIONAHA.113.005874
Go to Citation
Crossref
PubMed
Google Scholar
39.
Sim DS, Jeong MH, Ahn Y, Kim YJ, Chae SC, Hong TJ, Seong IW, Chae JK, Kim CJ, Cho MC, et al; Korea Acute Myocardial Infarction Registry Investigators. Pharmacoinvasive strategy versus primary percutaneous coronary intervention in patients with ST-segment-elevation myocardial infarction: a propensity score-matched analysis. Circ Cardiovasc Interv. 2016;9:e003508. doi: 10.1161/CIRCINTERVENTIONS.115.003508
Go to Citation
Crossref
PubMed
Google Scholar
40.
Auffret V, Laurin C, Leurent G, Didier R, Filippi E, Hacot JP, Zabalawi A, Rouault G, Saouli D, Druelles P, et al. Pharmacoinvasive strategy versus primary percutaneous coronary intervention for ST-segment elevation myocardial infarction in patients ≥70 years of age. Am J Cardiol. 2020;125:1–10. doi: 10.1016/j.amjcard.2019.09.044
Crossref
PubMed
Google Scholar
a [...] Real-world large observational studies
b [...] with significant cardiovascular benefits.
41.
Danchin N, Popovic B, Puymirat E, Goldstein P, Belle L, Cayla G, Roubille F, Lemesle G, Ferrières J, Schiele F, et al; FAST-MI Investigators. Five-year outcomes following timely primary percutaneous intervention, late primary percutaneous intervention, or a pharmaco-invasive strategy in ST-segment elevation myocardial infarction: the FAST-MI programme. Eur Heart J. 2020;41:858–866. doi: 10.1093/eurheartj/ehz665
Crossref
PubMed
Google Scholar
a [...] Real-world large observational studies
b [...] which are associated with worse outcomes.
42.
Hendren NS, Drazner MH, Bozkurt B, Cooper LT Description and proposed management of the acute COVID-19 cardiovascular syndrome. Circulation. 2020;141:1903–1914. doi: 10.1161/CIRCULATIONAHA.120.047349
Go to Citation
Crossref
PubMed
Google Scholar
43.
Bhatraju PK, Ghassemieh BJ, Nichols M, Kim R, Jerome KR, Nalla AK, Greninger AL, Pipavath S, Wurfel MM, Evans L, et al. Covid-19 in critically ill patients in the Seattle Region - case series. N Engl J Med. 2020;382:2012–2022. doi: 10.1056/NEJMoa2004500
Go to Citation
Crossref
PubMed
Google Scholar
44.
Jinatongthai P, Kongwatcharapong J, Foo CY, Phrommintikul A, Nathisuwan S, Thakkinstian A, Reid CM, Chaiyakunapruk N. Comparative efficacy and safety of reperfusion therapy with fibrinolytic agents in patients with ST-segment elevation myocardial infarction: a systematic review and network meta-analysis. Lancet. 2017;390:747–759. doi: 10.1016/S0140-6736(17)31441-1
Crossref
PubMed
Google Scholar
a [...] low body weight, women, and Black race.
b [...] between the common fibrinolytic agents.
c [...] profile in comparison to streptokinase.
45.
Van De Werf F, Adgey J, Ardissino D, Armstrong PW, Aylward P, Barbash G, Betriu A, Binbrek AS, Califf R, Diaz R, et al; ASSENT-2 Investigators. Single-bolus tenecteplase compared with front-loaded alteplase in acute myocardial infarction: the ASSENT-2 double-blind randomised trial. Lancet. 1999;354:716–722. doi: 10.1016/s0140-6736(99)07403-6
Go to Citation
Crossref
PubMed
Google Scholar
46.
The GUSTO Investigators. An international randomized trial comparing four thrombolytic strategies for acute myocardial infarction. N Engl J Med. 1993;329:673–682. doi: 10.1056/NEJM199309023291001
Go to Citation
Crossref
PubMed
Google Scholar
47.
The Global Use of Strategies to Open Occluded Coronary Arteries (GUSTO III) Investigators. A comparison of reteplase with alteplase for acute myocardial infarction. N Engl J Med. 1997;337:1118–1123. doi: 10.1056/NEJM199710163371603
Go to Citation
Crossref
PubMed
Google Scholar
48.
GUSTO Angiographic Investigators. The effects of tissue plasminogen activator, streptokinase, or both on coronary-artery patency, ventricular function, and survival after acute myocardial infarction. N Engl J Med. 1993;329:1615–1622. doi: 10.1056/NEJM199311253292204
Go to Citation
Crossref
PubMed
Google Scholar
49.
Berkowitz SD, Granger CB, Pieper KS, Lee KL, Gore JM, Simoons M, Armstrong PW, Topol EJ, Califf RM. Incidence and predictors of bleeding after contemporary thrombolytic therapy for myocardial infarction. The Global Utilization of Streptokinase and Tissue Plasminogen activator for Occluded coronary arteries (GUSTO) I Investigators. Circulation. 1997;95:2508–2516. doi: 10.1161/01.cir.95.11.2508
Go to Citation
Crossref
PubMed
Google Scholar
50.
Armstrong PW; WEST Steering Committee. A comparison of pharmacologic therapy with/without timely coronary intervention vs. primary percutaneous intervention early after ST-elevation myocardial infarction: the WEST (Which Early ST-elevation myocardial infarction Therapy) study. Eur Heart J. 2006;27:1530–1538. doi: 10.1093/eurheartj/ehl088
Go to Citation
Crossref
PubMed
Google Scholar
51.
Le May MR, Wells GA, Labinaz M, Davies RF, Turek M, Leddy D, Maloney J, McKibbin T, Quinn B, Beanlands RS, et al. Combined angioplasty and pharmacological intervention versus thrombolysis alone in acute myocardial infarction (CAPITAL AMI study). J Am Coll Cardiol. 2005;46:417–424. doi: 10.1016/j.jacc.2005.04.042
Go to Citation
Crossref
PubMed
Google Scholar
52.
Fernández-Avilés F, Alonso JJ, Peña G, Blanco J, Alonso-Briales J, López-Mesa J, Fernández-Vázquez F, Moreu J, Hernández RA, Castro-Beiras A, et al; GRACIA-2 (Groupo de Análisis de Cardiopatía Isquémica Aguda) Investigators. Primary angioplasty vs. early routine post-fibrinolysis angioplasty for acute myocardial infarction with ST-segment elevation: the GRACIA-2 non-inferiority, randomized, controlled trial. Eur Heart J. 2007;28:949–960. doi: 10.1093/eurheartj/ehl461
Go to Citation
Crossref
PubMed
Google Scholar
53.
Sánchez PL, Gimeno F, Ancillo P, Sanz JJ, Alonso-Briales JH, Bosa F, Santos I, Sanchis J, Bethencourt A, López-Messa J, et al. Role of the paclitaxel-eluting stent and tirofiban in patients with ST-elevation myocardial infarction undergoing postfibrinolysis angioplasty: the GRACIA-3 randomized clinical trial. Circ Cardiovasc Interv. 2010;3:297–307. doi: 10.1161/CIRCINTERVENTIONS.109.920868
Go to Citation
Crossref
PubMed
Google Scholar
54.
Kumbhani DJ, Alexander T, Nallamothu BK, Menon V, Ayers C, Mullasari AS; TN-STEMI Investigators. Pharmacoinvasive approach with streptokinase in low to intermediate risk ST-elevation myocardial infarction patients: insights from the Tamil Nadu-STEMI initiative. Am J Cardiovasc Drugs. 2019;19:517–519. doi: 10.1007/s40256-019-00327-7
Go to Citation
Crossref
PubMed
Google Scholar
55.
Longstaff C, Kolev K. Basic mechanisms and regulation of fibrinolysis. J Thromb Haemost. 2015;13:S98–S105. doi: 10.1111/jth.12935
Go to Citation
Crossref
PubMed
Google Scholar
56.
Raja DC, Subban V, Victor SM, Joseph G, Thomson VS, Kannan K, Gnanaraj JP, Veerasekar G, Thenpally JG, Livingston N, et al. The impact of systems-of-care on pharmacoinvasive management with streptokinase: the subgroup analysis of the TN-STEMI programme. Indian Heart J. 2017;69:573–579. doi: 10.1016/j.ihj.2017.07.006
Go to Citation
Crossref
PubMed
Google Scholar
57.
Fitzgerald DJ, Catella F, Roy L, FitzGerald GA. Marked platelet activation in vivo after intravenous streptokinase in patients with acute myocardial infarction. Circulation. 1988;77:142–150. doi: 10.1161/01.cir.77.1.142
Go to Citation
Crossref
PubMed
Google Scholar
58.
Boersma E; Primary Coronary Angioplasty vs. Thrombolysis Group. Does time matter? A pooled analysis of randomized clinical trials comparing primary percutaneous coronary intervention and in-hospital fibrinolysis in acute myocardial infarction patients. Eur Heart J. 2006;27:779–788. doi: 10.1093/eurheartj/ehi810
Go to Citation
Crossref
PubMed
Google Scholar
59.
Nallamothu BK, Bates ER. Percutaneous coronary intervention versus fibrinolytic therapy in acute myocardial infarction: is timing (almost) everything? Am J Cardiol. 2003;92:824–826. doi: 10.1016/s0002-9149(03)00891-9
Go to Citation
Crossref
PubMed
Google Scholar
60.
Tam CF, Cheung KS, Lam S, Wong A, Yung A, Sze M, Lam YM, Chan C, Tsang TC, Tsui M, et al. Impact of coronavirus disease 2019 (COVID-19) outbreak on ST-segment-elevation myocardial infarction care in Hong Kong, China. Circ Cardiovasc Qual Outcomes. 2020;13:e006631. doi: 10.1161/CIRCOUTCOMES.120.006631
Crossref
PubMed
Google Scholar
a [...] have increased from 85 to 110 minutes,
b [...] was observed (from 82.5 to 318 minutes).
61.
Welt FGP, Shah PB, Aronow HD, Bortnick AE, Henry TD, Sherwood MW, Young MN, Davidson LJ, Kadavath S, Mahmud E, et al; American College of Cardiology’s Interventional Council and the Society for Cardiovascular Angiography and Interventions. Catheterization laboratory considerations during the coronavirus (COVID-19) pandemic: from the ACC’s Interventional Council and SCAI. J Am Coll Cardiol. 2020;75:2372–2375. doi: 10.1016/j.jacc.2020.03.021
Go to Citation
Crossref
PubMed
Google Scholar
62.
Mahmud E, Dauerman HL, Welt FG, Messenger JC, Rao SV, Grines C, Mattu A, Kirtane AJ, Jauhar R, Meraj P, et al. Management of acute myocardial infarction during the COVID-19 pandemic. J Am Coll Cardiol. 2020;S0735-1097:35026-9. doi: 10.1016/j.jacc.2020.04.039
Go to Citation
Crossref
Google Scholar
63.
Szerlip M, Anwaruddin S, Aronow HD, Cohen MG, Daniels MJ, Dehghani P, Drachman DE, Elmariah S, Feldman DN, Garcia S, et al. Considerations for cardiac catheterization laboratory procedures during the COVID-19 pandemic perspectives from the Society for Cardiovascular Angiography and Interventions Emerging Leader Mentorship (SCAI ELM) Members and Graduates [published online March 25, 2020]. Catheter Cardiovasc Interv. 2020. doi: 10.1002/ccd.28887
Go to Citation
Crossref
Google Scholar
64.
Hochman JS, Sleeper LA, Webb JG, Sanborn TA, White HD, Talley JD, Buller CE, Jacobs AK, Slater JN, Col J, et al. Early revascularization in acute myocardial infarction complicated by cardiogenic shock. SHOCK Investigators. Should we emergently revascularize occluded coronaries for cardiogenic shock. N Engl J Med. 1999;341:625–634. doi: 10.1056/NEJM199908263410901
Go to Citation
Crossref
PubMed
Google Scholar
65.
Tarantini G, Razzolini R, Napodano M, Bilato C, Ramondo A, Iliceto S. Acceptable reperfusion delay to prefer primary angioplasty over fibrin-specific thrombolytic therapy is affected (mainly) by the patient’s mortality risk: 1 h does not fit all. Eur Heart J. 2010;31:676–683. doi: 10.1093/eurheartj/ehp506
Go to Citation
Crossref
PubMed
Google Scholar
66.
Kent DM, Schmid CH, Lau J, Selker HP. Is primary angioplasty for some as good as primary angioplasty for all? J Gen Intern Med. 2002;17:887–894. doi: 10.1046/j.1525-1497.2002.11232.x
Go to Citation
Crossref
PubMed
Google Scholar
67.
Claeys MJ, de Meester A, Convens C, Dubois P, Boland J, De Raedt H, Vranckx P, Coussement P, Gevaert S, Sinnaeve P, et al. Contemporary mortality differences between primary percutaneous coronary intervention and thrombolysis in ST-segment elevation myocardial infarction. Arch Intern Med. 2011;171:544–549. doi: 10.1001/archinternmed.2011.57
Go to Citation
Crossref
PubMed
Google Scholar
68.
Andersen HR, Nielsen TT, Rasmussen K, Thuesen L, Kelbaek H, Thayssen P, Abildgaard U, Pedersen F, Madsen JK, Grande P, et al; DANAMI-2 Investigators. A comparison of coronary angioplasty with fibrinolytic therapy in acute myocardial infarction. N Engl J Med. 2003;349:733–742. doi: 10.1056/NEJMoa025142
Go to Citation
Crossref
PubMed
Google Scholar
69.
Thune JJ, Hoefsten DE, Lindholm MG, Mortensen LS, Andersen HR, Nielsen TT, Kober L, Kelbaek H; Danish Multicenter Randomized Study on Fibrinolytic Therapy Versus Acute Coronary Angioplasty in Acute Myocardial Infarction (DANAMI)-2 Investigators. Simple risk stratification at admission to identify patients with reduced mortality from primary angioplasty. Circulation. 2005;112:2017–2021. doi: 10.1161/CIRCULATIONAHA.105.558676
Go to Citation
Crossref
PubMed
Google Scholar
70.
Armstrong PW, Bogaerts K, Welsh R, Sinnaeve PR, Goldstein P, Pages A, Danays T, Van de Werf F; STREAM 2 Study Groups (appendix). The Second Strategic Reperfusion Early After Myocardial Infarction (STREAM-2) study optimizing pharmacoinvasive reperfusion strategy in older ST-elevation myocardial infarction patients. Am Heart J. 2020;226:140–146. doi: 10.1016/j.ahj.2020.04.029
Go to Citation
Crossref
PubMed
Google Scholar
71.
Stefanini GG, Montorfano M, Trabattoni D, Andreini D, Ferrante G, Ancona M, Metra M, Curello S, Maffeo D, Pero G, et al. ST-elevation myocardial infarction in patients with COVID-19: clinical and angiographic outcomes. Circulation. 2020;141:2113–2116. doi: 10.1161/CIRCULATIONAHA.120.047525
Go to Citation
Crossref
PubMed
Google Scholar
72.
Bangalore S, Sharma A, Slotwiner A, Yatskar L, Harari R, Shah B, Ibrahim H, Friedman GH, Thompson C, Alviar CL, et al. ST-segment elevation in patients with Covid-19 - a case series. N Engl J Med. 2020;382:2478–2480. doi: 10.1056/NEJMc2009020
Crossref
PubMed
Google Scholar
a [...] coronary artery disease or culprit lesions.
b [...] 6 had coronary occlusion on angiography.
Advertisement
Recommended
August 2014
Evolution From Fibrinolytic Therapy to a Fibrinolytic Strategy for Patients With ST-Segment–Elevation Myocardial Infarction
[...]
Eric R. Bates
+0 authors
August 2016
Pharmacoinvasive Strategy Versus Primary Percutaneous Coronary Intervention in Patients With ST-Segment–Elevation Myocardial Infarction
Doo Sun Sim,
Myung Ho Jeong,
Youngkeun Ahn,
Young Jo Kim,
Shung Chull Chae,
Taek Jong Hong,
In Whan Seong,
Jei Keon Chae,
Chong Jin Kim,
Myeong Chan Cho,
Seung-Woon Rha,
Jang Ho Bae,
Ki Bae Seung, and
[...]
Seung Jung Park
+10 authors
November 2011
Benefit of Transferring ST-Segment–Elevation Myocardial Infarction Patients for Percutaneous Coronary Intervention Compared With Administration of Onsite Fibrinolytic Declines as Delays Increase
Duane S. Pinto,
Paul D. Frederick,
Anjan K. Chakrabarti,
Ajay J. Kirtane,
Edward Ullman,
Andre Dejam,
Dave P. Miller,
Timothy D. Henry, and
[...]
C. Michael Gibson
+5 authors
Advertisement
Submit a Response to This Article
Close
Compose eLetter
Title:
Comment text:
Contributors
(all fields are required)
Remove Contributor
First Name:
Last Name:
Email:
Affiliation:
Add Another Contributor
Statement of Competing Interests
Competing Interests?
YES
NO
Please describe the competing interests
Cancel Submit
View full text|Download PDF
Figures Tables
Close figure viewer
Back to article
Figure title goes here
Change zoom level
Go to figure location within the article
Toggle download panel
Toggle download panel
Download figure
Toggle share panel
Toggle share panel
Share
Toggle information panel
Toggle information panel
All figures All tables
View all material
View all material
xrefBack.goTo
xrefBack.goTo
Request permissions Expand All
Collapse
Expand Table
Show all references
SHOW ALL BOOKS
Authors Info & Affiliations
Comment Response
Now Reading:
Fibrinolytic Strategy for ST-Segment–Elevation Myocardial Infarction: A Contemporary Review in Context of the COVID-19 Pandemic
Track Citations
Add to favorites
Share
PDF/EPUB
###### PREVIOUS ARTICLE Effects of ON-Hours Versus OFF-Hours Admission on Outcome in Patients With Myocardial Infarction and Cardiogenic Shock Previous###### NEXT ARTICLE Revascularization Strategies for the Treatment of Multivessel Coronary Artery Disease in Patients With Diabetes Mellitus Next
Circulation: Cardiovascular Interventions
Submit
BrowseBrowse
Collections
Subject Terms
AHA Journal Podcasts
Trend Watch
ResourcesResources
CME
Journal Metrics
Early Career Resources
AHA Journals @ Meetings
InformationInformation
For Authors
For Reviewers
For Subscribers
For International Users
Arteriosclerosis, Thrombosis, and Vascular Biology
Circulation
Circulation Research
Hypertension
Stroke
Journal of the American Heart Association
Circulation: Arrhythmia and Electrophysiology
Circulation: Cardiovascular Imaging
Circulation: Cardiovascular Interventions
Circulation: Cardiovascular Quality & Outcomes
Circulation: Genomic and Precision Medicine
Circulation: Heart Failure
Stroke: Vascular and Interventional Neurology
Annals of Internal Medicine: Clinical Cases
This page is managed by Wolters Kluwer Health, Inc. and/or its affiliates or subsidiaries.Wolters Kluwer Privacy Policy
Your California Privacy Choices
Manage Cookie Preferences
Back to top
National Center
7272 Greenville Ave.Dallas, TX 75231
Customer Service
1-800-AHA-USA-1
1-800-242-8721
Hours
Monday - Friday: 7 a.m. – 7 p.m. CT
Saturday: 9 a.m. - 5 p.m. CT
Closed on Sundays
Tax Identification Number
13-5613797
ABOUT US
About the AHA/ASA
Annual report
AHA Financial Information
Careers
International Programs
Latest Heart and Stroke News
AHA/ASA Media Newsroom
GET INVOLVED
Donate
Advocate
Volunteer
ShopHeart
ShopCPR
OUR SITES
American Heart Association
American Stroke Association
CPR & ECC
Go Red For Women
More Sites
AHA Careers
AHA Privacy Policy
Medical Advice Disclaimer
Copyright Policy
Accessibility Statement
Ethics Policy
Conflict of Interes Policy
Linking Policy
Whistleblower Policy
Content Editorial Guidelines
Diversity
Suppliers & Providers
State Fundraising Notices
©2025 American Heart Association, Inc. All rights reserved. Unauthorized use prohibited.
The American Heart Association is a qualified 501(c)(3) tax-exempt organization.
Red Dress ™ DHHS, Go Red ™ AHA ; National Wear Red Day® is a registered trademark.
✓
Thanks for sharing!
AddToAny
More…
__("articleCrossmark.closePopup")
Your Privacy
To give you the best possible experience we use cookies and similar technologies. We use data collected through these technologies for various purposes, including to enhance website functionality, remember your preferences, show the most relevant content, and show the most useful ads. You can select your preferences by clicking the link. For more information, please review ourPrivacy & Cookie Notice
Manage Cookie Preferences Accept All Cookies
Privacy Preference Center
When you visit any website, it may store or retrieve information on your browser, mostly in the form of cookies. This information might be about you, your preferences or your device. Because we respect your right to privacy, you can choose not to allow certain types of cookies on our website. Click on the different category headings to find out more and manage your cookie preferences. However, blocking some types of cookies may impact your experience on the site and the services we are able to offer.
Privacy & Cookie Notice
Manage Consent Preferences
Strictly Necessary Cookies
Always Active
These cookies are necessary for the website to function. They are usually set in response to actions made by you which amount to a request for services, such as setting your privacy preferences, logging in or filling in forms. You can set your browser to block or alert you about these cookies, this may have an effect on the proper functioning of (parts of) the site.
View Vendor Details
Functional Cookies
[x] Functional Cookies
These cookies enable the website to provide enhanced functionality, user experience and personalization, and may be set by us or by third party providers whose services we have added to our pages. If you do not allow these cookies, then some or all of these services may not function properly.
View Vendor Details
Performance Cookies
[x] Performance Cookies
These cookies support analytic services that measure and improve the performance of our site. They help us know which pages are the most and least popular and see how visitors move around the site.
View Vendor Details
Advertising Cookies
[x] Advertising Cookies
These cookies may collect insights to issue personalized content and advertising on our own and other websites, and may be set through our site by third party providers. If you do not allow these cookies, you may still see basic advertising on your browser that is generic and not based on your interests.
View Vendor Details
Vendors List
Clear
[x] checkbox label label
Apply Cancel
Consent Leg.Interest
[x] checkbox label label
[x] checkbox label label
[x] checkbox label label
Allow All Reject All Confirm My Choices |
14161 | https://math.stackexchange.com/questions/4951951/proving-projection-bound-using-cauchy-schwarz-inequality | linear algebra - Proving projection bound using Cauchy-Schwarz inequality - Mathematics Stack Exchange
Join Mathematics
By clicking “Sign up”, you agree to our terms of service and acknowledge you have read our privacy policy.
Sign up with Google
OR
Email
Password
Sign up
Already have an account? Log in
Skip to main content
Stack Exchange Network
Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Visit Stack Exchange
Loading…
Tour Start here for a quick overview of the site
Help Center Detailed answers to any questions you might have
Meta Discuss the workings and policies of this site
About Us Learn more about Stack Overflow the company, and our products
current community
Mathematics helpchat
Mathematics Meta
your communities
Sign up or log in to customize your list.
more stack exchange communities
company blog
Log in
Sign up
Home
Questions
Unanswered
AI Assist Labs
Tags
Chat
Users
Teams
Ask questions, find answers and collaborate at work with Stack Overflow for Teams.
Try Teams for freeExplore Teams
3. Teams
4. Ask questions, find answers and collaborate at work with Stack Overflow for Teams. Explore Teams
Teams
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
Learn more about Teams
Hang on, you can't upvote just yet.
You'll need to complete a few actions and gain 15 reputation points before being able to upvote. Upvoting indicates when questions and answers are useful. What's reputation and how do I get it?
Instead, you can save this post to reference later.
Save this post for later Not now
Thanks for your vote!
You now have 5 free votes weekly.
Free votes
count toward the total vote score
does not give reputation to the author
Continue to help good content that is interesting, well-researched, and useful, rise to the top! To gain full voting privileges, earn reputation.
Got it!Go to help center to learn more
Proving projection bound using Cauchy-Schwarz inequality
Ask Question
Asked 1 year, 2 months ago
Modified1 year, 2 months ago
Viewed 124 times
This question shows research effort; it is useful and clear
2
Save this question.
Show activity on this post.
I'm reading a book The Cauchy-Schwarz Master Class Book by J. Michael Steele. And on page 59 (first paragraph), I found the assertion that we can prove the projection formula
P(v)=t x=⟨v,x⟩⟨x,x⟩x P(v)=t x=⟨v,x⟩⟨x,x⟩x
of v v onto x x by guessing t t. Specifically, from the assumption that vector x x must be orthogonal to v−t x v−t x, i.e., ⟨x,v−t x⟩=0⟨x,v−t x⟩=0, we infer that
t=⟨v,x⟩⟨x,x⟩.t=⟨v,x⟩⟨x,x⟩.
Then, the author suggests to use Cauchy-Schwarz inequality that this choice of t t is optimal.
I tried different ways but I don't find how Cauchy–Schwarz inequality can be applied to prove optimality of t t. Could you help me to find out the solution?
Thank you.
linear-algebra
vectors
cauchy-schwarz-inequality
projection
Share
Share a link to this question
Copy linkCC BY-SA 4.0
Cite
Follow
Follow this question to receive notifications
edited Jul 29, 2024 at 15:30
Sammy Black
28.8k 3 3 gold badges 39 39 silver badges 65 65 bronze badges
asked Jul 29, 2024 at 12:30
rbtrhtrbtrht
143 5 5 bronze badges
Add a comment|
2 Answers 2
Sorted by: Reset to default
This answer is useful
0
Save this answer.
Show activity on this post.
I suppose that the author understands optimality in the following sense: a real scalar t∗t∗ is optimal if for any real scalar t t it holds that
∥v−t∗x∥2≤∥v−t x∥2‖v−t∗x‖2≤‖v−t x‖2
for all x x.
Indeed, let t t be an arbitrary real scalar. Then
∥v−t x∥2=∥v∥2−2 t⟨v,x⟩+t 2∥x∥2=∥x∥2(∥v∥2∥x∥2−2 t⟨v,x⟩∥x∥2+t 2−⟨v,x⟩2∥x∥4+⟨v,x⟩2∥x∥4)=(t−⟨v,x⟩∥x∥2)2+∥v∥2∥x∥2−⟨v,x⟩2∥x∥4.‖v−t x‖2=‖v‖2−2 t⟨v,x⟩+t 2‖x‖2=‖x‖2(‖v‖2‖x‖2−2 t⟨v,x⟩‖x‖2+t 2−⟨v,x⟩2‖x‖4+⟨v,x⟩2‖x‖4)⏟=(t−⟨v,x⟩‖x‖2)2+‖v‖2‖x‖2−⟨v,x⟩2‖x‖4.
For t=t∗=⟨v,x⟩∥x∥2 t=t∗=⟨v,x⟩‖x‖2 we can make the whole term smaller as one non-negative term vanishes. However, for that argument to hold true, we have to make sure that indeed
∥v∥2∥x∥2−⟨v,x⟩2≥0.‖v‖2‖x‖2−⟨v,x⟩2≥0.
But this follows from Cauchy-Schwarz:
∥v∥2∥x∥2−⟨v,x⟩2≥∥v∥2∥x∥2−∥v∥2∥x∥2=0.‖v‖2‖x‖2−⟨v,x⟩2≥‖v‖2‖x‖2−‖v‖2‖x‖2=0.
Share
Share a link to this answer
Copy linkCC BY-SA 4.0
Cite
Follow
Follow this answer to receive notifications
answered Jul 29, 2024 at 22:56
Syd AmerikanerSyd Amerikaner
717 1 1 gold badge 8 8 silver badges 24 24 bronze badges
1
∥v∥2∥x∥2−⟨v,x⟩2≥0‖v‖2‖x‖2−⟨v,x⟩2≥0 follows form the fact that ∥v−t x∥2≥0‖v−t x‖2≥0. So we don't need here CS bound. Actually, the author also presents these method as another proof but without using CS bound. On the opposite, we can prove CS using this approach.rbtrht –rbtrht 2024-07-30 11:17:46 +00:00 Commented Jul 30, 2024 at 11:17
Add a comment|
This answer is useful
0
Save this answer.
Show activity on this post.
I was able to prove it.
Let's consider difference
⟨v−t′x,v−t′x⟩−⟨v−t x,v−t x⟩=⟨t′x,t′x⟩−2 t′⟨v,x⟩+⟨t′x,t′x⟩−(⟨v,v⟩−2⟨v,x⟩2⟨x,x⟩+⟨v,x⟩2⟨x,x⟩)=⟨t′x,t′x⟩−2 t′⟨v,x⟩+⟨v,x⟩2⟨x,x⟩.⟨v−t′x,v−t′x⟩−⟨v−t x,v−t x⟩=⟨t′x,t′x⟩−2 t′⟨v,x⟩+⟨t′x,t′x⟩−(⟨v,v⟩−2⟨v,x⟩2⟨x,x⟩+⟨v,x⟩2⟨x,x⟩)=⟨t′x,t′x⟩−2 t′⟨v,x⟩+⟨v,x⟩2⟨x,x⟩.
We want to show that this expression is ≥0≥0. I think here author suggested actually to apply not Cauchy-Schwarz but 2 a b≤a 2+b 2 2 a b≤a 2+b 2. If we do so with a=∥t′x∥a=‖t′x‖ and b=||∥x∥b=||‖x‖, we get:
⟨t′x,t′x⟩−2 t′⟨v,x⟩+⟨v,x⟩2⟨x,x⟩≥2∥t′x∥||∥x∥−2 t′⟨v,x⟩=2|t′|⋅|⟨v,x⟩|−2 t′⟨v,x⟩≥0.⟨t′x,t′x⟩−2 t′⟨v,x⟩+⟨v,x⟩2⟨x,x⟩≥2‖t′x‖||‖x‖−2 t′⟨v,x⟩=2|t′|⋅|⟨v,x⟩|−2 t′⟨v,x⟩≥0.
Share
Share a link to this answer
Copy linkCC BY-SA 4.0
Cite
Follow
Follow this answer to receive notifications
edited Jul 30, 2024 at 11:25
answered Jul 29, 2024 at 18:41
rbtrhtrbtrht
143 5 5 bronze badges
Add a comment|
You must log in to answer this question.
Start asking to get answers
Find the answer to your question by asking.
Ask question
Explore related questions
linear-algebra
vectors
cauchy-schwarz-inequality
projection
See similar questions with these tags.
Featured on Meta
Introducing a new proactive anti-spam measure
Spevacus has joined us as a Community Manager
stackoverflow.ai - rebuilt for attribution
Community Asks Sprint Announcement - September 2025
Report this ad
Related
13Proving an inequality with Cauchy-Schwarz
5Cauchy-Schwarz inequality and angle between vectors
1Cauchy - Schwarz inequality (proof verification)
15Does Cauchy-Schwarz Inequality depend on positive definiteness?
1Finding equality of inequality via Cauchy-Schwarz
0Friedman's approach of proving Cauchy-Schwarz inequality
0Applying Cauchy-Schwarz inequality
5Cauchy-Schwarz inequality for nonsymmetric matrices
Hot Network Questions
Why are LDS temple garments secret?
Is direct sum of finite spectra cancellative?
Non-degeneracy of wedge product in cohomology
Is existence always locational?
в ответе meaning in context
Can peaty/boggy/wet/soggy/marshy ground be solid enough to support several tonnes of foot traffic per minute but NOT support a road?
Implications of using a stream cipher as KDF
How can blood fuel space travel?
For every second-order formula, is there a first-order formula equivalent to it by reification?
What is this chess h4 sac known as?
How do you emphasize the verb "to be" with do/does?
alignment in a table with custom separator
I have a lot of PTO to take, which will make the deadline impossible
Why do universities push for high impact journal publications?
Overfilled my oil
ICC in Hague not prosecuting an individual brought before them in a questionable manner?
An odd question
What’s the usual way to apply for a Saudi business visa from the UAE?
Proof of every Highly Abundant Number greater than 3 is Even
Is it ok to place components "inside" the PCB
Identifying a movie where a man relives the same day
How to locate a leak in an irrigation system?
Is encrypting the login keyring necessary if you have full disk encryption?
What is the meaning of 率 in this report?
Question feed
Subscribe to RSS
Question feed
To subscribe to this RSS feed, copy and paste this URL into your RSS reader.
Why are you flagging this comment?
It contains harassment, bigotry or abuse.
This comment attacks a person or group. Learn more in our Code of Conduct.
It's unfriendly or unkind.
This comment is rude or condescending. Learn more in our Code of Conduct.
Not needed.
This comment is not relevant to the post.
Enter at least 6 characters
Something else.
A problem not listed above. Try to be as specific as possible.
Enter at least 6 characters
Flag comment Cancel
You have 0 flags left today
Mathematics
Tour
Help
Chat
Contact
Feedback
Company
Stack Overflow
Teams
Advertising
Talent
About
Press
Legal
Privacy Policy
Terms of Service
Your Privacy Choices
Cookie Policy
Stack Exchange Network
Technology
Culture & recreation
Life & arts
Science
Professional
Business
API
Data
Blog
Facebook
Twitter
LinkedIn
Instagram
Site design / logo © 2025 Stack Exchange Inc; user contributions licensed under CC BY-SA. rev 2025.9.26.34547
By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.
Accept all cookies Necessary cookies only
Customize settings
Cookie Consent Preference Center
When you visit any of our websites, it may store or retrieve information on your browser, mostly in the form of cookies. This information might be about you, your preferences, or your device and is mostly used to make the site work as you expect it to. The information does not usually directly identify you, but it can give you a more personalized experience. Because we respect your right to privacy, you can choose not to allow some types of cookies. Click on the different category headings to find out more and manage your preferences. Please note, blocking some types of cookies may impact your experience of the site and the services we are able to offer.
Cookie Policy
Accept all cookies
Manage Consent Preferences
Strictly Necessary Cookies
Always Active
These cookies are necessary for the website to function and cannot be switched off in our systems. They are usually only set in response to actions made by you which amount to a request for services, such as setting your privacy preferences, logging in or filling in forms. You can set your browser to block or alert you about these cookies, but some parts of the site will not then work. These cookies do not store any personally identifiable information.
Cookies Details
Performance Cookies
[x] Performance Cookies
These cookies allow us to count visits and traffic sources so we can measure and improve the performance of our site. They help us to know which pages are the most and least popular and see how visitors move around the site. All information these cookies collect is aggregated and therefore anonymous. If you do not allow these cookies we will not know when you have visited our site, and will not be able to monitor its performance.
Cookies Details
Functional Cookies
[x] Functional Cookies
These cookies enable the website to provide enhanced functionality and personalisation. They may be set by us or by third party providers whose services we have added to our pages. If you do not allow these cookies then some or all of these services may not function properly.
Cookies Details
Targeting Cookies
[x] Targeting Cookies
These cookies are used to make advertising messages more relevant to you and may be set through our site by us or by our advertising partners. They may be used to build a profile of your interests and show you relevant advertising on our site or on other sites. They do not store directly personal information, but are based on uniquely identifying your browser and internet device.
Cookies Details
Cookie List
Clear
[x] checkbox label label
Apply Cancel
Consent Leg.Interest
[x] checkbox label label
[x] checkbox label label
[x] checkbox label label
Necessary cookies only Confirm my choices |
14162 | https://www.linkedin.com/advice/0/what-some-common-problems-titration-techniques-bxcge | How to Troubleshoot Common Titration Problems
Agree & Join LinkedIn
By clicking Continue to join or sign in, you agree to LinkedIn’s User Agreement, Privacy Policy, and Cookie Policy.
Skip to main contentLinkedIn
Top Content
People
Learning
Jobs
Games
Join nowSign in
All
Laboratory Techniques
What are some common problems with titration techniques and how can you troubleshoot them?
Powered by AI and the LinkedIn community
1
Human errors
2
Equipment errors
3
Chemical errors
4
Here’s what else to consider
Titration is a common laboratory technique that involves measuring the volume of a solution of known concentration (the titrant) that is required to react completely with a solution of unknown concentration (the analyte). Titration can be used to determine the concentration, purity, or pH of various substances, such as acids, bases, redox agents, or complexing agents. However, titration is not always a straightforward or error-free process. There are many factors that can affect the accuracy and precision of titration results, such as human errors, equipment errors, or chemical errors. In this article, we will discuss some of the most common problems with titration techniques and how you can troubleshoot them to improve your laboratory management skills.
Find expert answers in this collaborative article
Selected by the community from 4 contributions. Learn more
See what others are saying
1 Human errors
Human errors are mistakes that occur due to the lack of attention, care, or skill of the person performing the titration. Some examples of human errors are: reading the wrong scale or units on the burette, misreading the color change or endpoint of the indicator, adding too much or too little titrant, spilling or contaminating the solutions, or recording the data incorrectly. Human errors can be minimized by following the standard operating procedures, using the appropriate equipment and reagents, practicing the technique, and checking the calculations.
Add your perspective
Help others by sharing more (125 characters min.) Cancel Add Save
Kuldeep M. Senior Technical Research Associate @ Flavin Labs | Driving Innovative Research Solutions in Agriculture & Biotechnology
Copy link to contribution
Report contribution
Thanks for letting us know! You'll no longer see this contribution
One time at work, I encountered a titration technique that went awry due to human errors. In my experience, common problems with titration techniques include inaccurate measurements, insufficient mixing, and equipment malfunctions. One thing I've found helpful is to double-check all measurements and ensure proper calibration of equipment before starting the titration. Additionally, carefully following the procedure and staying organized can help prevent errors.
…see more
Like
Like
Celebrate
Support
Love
Insightful
Funny
2 Equipment errors
Equipment errors are errors that arise from the malfunction, calibration, or maintenance of the equipment used for titration. Some examples of equipment errors are: using a dirty or broken burette, pipette, or flask, using a wrong or expired indicator, using a faulty or misaligned pH meter or electrode, or using a wrong or unbalanced stoichiometric equation. Equipment errors can be detected by performing a blank titration, using a standard solution as a check, comparing the results with other methods, or verifying the equipment specifications.
Add your perspective
Help others by sharing more (125 characters min.) Cancel Add Save
Kuldeep M. Senior Technical Research Associate @ Flavin Labs | Driving Innovative Research Solutions in Agriculture & Biotechnology
Copy link to contribution
Report contribution
Thanks for letting us know! You'll no longer see this contribution
One time at work, I encountered some common problems with titration techniques. In my experience, equipment errors can be a big issue. One thing I've found helpful is to regularly calibrate and maintain equipment to ensure accuracy.
Like
Like
Celebrate
Support
Love
Insightful
Funny
3 Chemical errors
Chemical errors are errors that result from the chemical properties or reactions of the solutions involved in the titration. Some examples of chemical errors are: using an incompatible or unstable titrant or analyte, using an indicator that does not match the equivalence point, having an incomplete or side reaction, or having an interference from other substances. Chemical errors can be avoided by selecting the appropriate titration method, indicator, and reagents, preparing and storing the solutions properly, controlling the temperature and pressure, or removing or masking the interfering substances.
Titration is a useful and versatile technique for laboratory analysis, but it requires careful planning, execution, and evaluation to ensure reliable and accurate results. By identifying and troubleshooting the common problems with titration techniques, you can improve your laboratory management skills and enhance your scientific knowledge.
Add your perspective
Help others by sharing more (125 characters min.) Cancel Add Save
Kuldeep M. Senior Technical Research Associate @ Flavin Labs | Driving Innovative Research Solutions in Agriculture & Biotechnology
Copy link to contribution
Report contribution
Thanks for letting us know! You'll no longer see this contribution
One time at work, I encountered some common problems with titration techniques. In my experience, chemical errors are a major issue. One thing I've found helpful is to double-check the concentration of the solutions used in the titration. This can help troubleshoot errors caused by inaccurate concentrations. Additionally, ensuring proper mixing and avoiding contamination can also prevent errors in titration results.
…see more
Like
Like
Celebrate
Support
Love
Insightful
Funny
4 Here’s what else to consider
This is a space to share examples, stories, or insights that don’t fit into any of the previous sections. What else would you like to add?
Add your perspective
Help others by sharing more (125 characters min.) Cancel Add Save
Kuldeep M. Senior Technical Research Associate @ Flavin Labs | Driving Innovative Research Solutions in Agriculture & Biotechnology
Copy link to contribution
Report contribution
Thanks for letting us know! You'll no longer see this contribution
One time at work, I encountered issues with titration techniques. In my experience, common problems include inaccurate measurements due to improper calibration, air bubbles in the burette, and endpoint detection errors. One thing I've found helpful is to double-check equipment calibration before starting, ensure thorough mixing of reagents, and use proper endpoint indicators. Additionally, consider using alternative titration methods or adjusting experimental conditions if problems persist.
…see more
Like
Like
Celebrate
Support
Love
Insightful
Funny
Laboratory Management
Laboratory Management
+ Follow
Rate this article
We created this article with the help of AI. What do you think of it?
It’s greatIt’s not so great
Thanks for your feedback
Your feedback is private. Like or react to bring the conversation to your network.
Tell us more
Tell us why you didn’t like this article.
It’s not on a professional topic
It contains inaccuracies
It has offensive language
It has harmful advice
It contains stereotypes or bias
It’s redundant and unclear
Translation quality is poor
It’s not relevant in my country, region or culture
If you think something in this article goes against our Professional Community Policies, please let us know.
Report this article
We appreciate you letting us know. Though we’re unable to respond directly, your feedback helps us improve this experience for everyone.
If you think this goes against our Professional Community Policies, please let us know.
Report this article
Cancel Submit Done
Report this article
More articles on Laboratory Management
No more previous content
You're facing staffing shortages in the lab. How can you ensure timely test results? 7 contributions
You're facing resistance from senior lab technicians. How can you win them over to new training methods?
Your lab's communication protocols are causing confusion. How can you make them clearer? 2 contributions
No more next content
See all
More relevant reading
Laboratory Management How can you manage the costs of sample preparation in a laboratory?
Laboratory Management How can you maintain and calibrate laboratory equipment as a project leader?
Laboratory Management What are the best strategies for maximizing the lifespan of laboratory tools?
Laboratory Management Here's how you can effectively manage both small and large laboratories.
Are you sure you want to delete your contribution?
Are you sure you want to delete your reply?
Cancel Delete
LinkedIn© 2025
About
Accessibility
User Agreement
Privacy Policy
Your California Privacy Choices
Cookie Policy
Copyright Policy
Brand Policy
Guest Controls
Community Guidelines
العربية (Arabic)
বাংলা (Bangla)
Čeština (Czech)
Dansk (Danish)
Deutsch (German)
Ελληνικά (Greek)
English (English)
Español (Spanish)
فارسی (Persian)
Suomi (Finnish)
Français (French)
हिंदी (Hindi)
Magyar (Hungarian)
Bahasa Indonesia (Indonesian)
Italiano (Italian)
עברית (Hebrew)
日本語 (Japanese)
한국어 (Korean)
मराठी (Marathi)
Bahasa Malaysia (Malay)
Nederlands (Dutch)
Norsk (Norwegian)
ਪੰਜਾਬੀ (Punjabi)
Polski (Polish)
Português (Portuguese)
Română (Romanian)
Русский (Russian)
Svenska (Swedish)
తెలుగు (Telugu)
ภาษาไทย (Thai)
Tagalog (Tagalog)
Türkçe (Turkish)
Українська (Ukrainian)
Tiếng Việt (Vietnamese)
简体中文 (Chinese (Simplified))
正體中文 (Chinese (Traditional))
Language
Like
Like
Celebrate
Support
Love
Insightful
Funny
Copy
LinkedIn
Facebook
Twitter
Share
4 Contributions
Sign in to view more content
Create your free account or sign in to continue your search
Continue with Google Continue with Google
Sign in
Welcome back
Email or phone
Password
Show
Forgot password? Sign in
or
By clicking Continue to join or sign in, you agree to LinkedIn’s User Agreement, Privacy Policy, and Cookie Policy.
Continue with Google Continue with Google
New to LinkedIn? Join now
or
New to LinkedIn? Join now
By clicking Continue to join or sign in, you agree to LinkedIn’s User Agreement, Privacy Policy, and Cookie Policy. |
14163 | https://books.google.com/books/about/Convex_Polytopes.html?id=5iV75P9gIUgC | Convex Polytopes - Branko Grünbaum - Google Books
Sign in
Hidden fields
Try the new Google Books
Books
View sample
Add to my library
Try the new Google Books
Check out the new look and enjoy easier access to your favorite features
Try it now
No thanks
Try the new Google Books
My library
Help
Advanced Book Search
Get print book
No eBook available
Springer Shop
Amazon.com
Barnes&Noble.com
Books-A-Million
IndieBound
Find in a library
All sellers»
My library
My History
Convex Polytopes ================ Branko Grünbaum Springer Science & Business Media, 2003 - Mathematics - 466 pages "The appearance of Grünbaum's book Convex Polytopes in 1967 was a moment of grace to geometers and combinatorialists. The special spirit of the book is very much alive even in those chapters where the book's immense influence made them quickly obsolete. Some other chapters promise beautiful unexplored land for future research. The appearance of the new edition is going to be another moment of grace. Kaibel, Klee and Ziegler were able to update the convex polytope saga in a clear, accurate, lively, and inspired way." (Gil Kalai, The Hebrew University of Jerusalem) "The original book of Grünbaum has provided the central reference for work in this active area of mathematics for the past 35 years...I first consulted this book as a graduate student in 1967; yet, even today, I am surprised again and again by what I find there. It is an amazingly complete reference for work on this subject up to that time and continues to be a major influence on research to this day." (Louis J. Billera, Cornell University) "The original edition of Convex Polytopes inspired a whole generation of grateful workers in polytope theory. Without it, it is doubtful whether many of the subsequent advances in the subject would have been made. The many seeds it sowed have since grown into healthy trees, with vigorous branches and luxuriant foliage. It is good to see it in print once again." (Peter McMullen, University College London) More » Preview this book »
Selected pages
Title Page
Index
References
Contents
Notation and prerequisites 1
12 Topology 5
13 Additional notes and comments 5
Convex sets 6
22 Support and separation 8
23 Convex hulls 12
24 Extreme and exposed points faces and poonems 15
25 Unbounded convex sets 21
Extremal Problems Concerning Numbers of Faces 170
102 Lower Bounds for f i 1 in Terms of f₀ 179
104 The Set fP⁴ 187
105 Exercises 193
106 Additional notes and comments 195
Properties of boundary complexes 198
111 Skeletons of simplices contained in FP 198
112 A proof of the van KampenFlores theorem 206
More
26 Polyhedral sets 24
27 Remarks 26
28 Additional notes and comments 29
Polytopes 30
32 Combinatorial types of polytopes complexes 36
33 Diagrams and Schlegel diagrams 40
34 Duality of polytopes 44
35 Remarks 49
36 Additional notes and comments 51
Examples 52
42 Pyramids 52
43 Bipyramids 53
44 Prisms 54
45 Simplicial and simple polytopes 55
46 Cubical polytopes 57
47 Cyclic polytopes 59
48 Exercises 61
49 Additional notes and comments 68
Fundamental Properties and Constructions 69
51 Representations of polytopes as sections or projections 69
52 The inductive construction of polytopes 76
53 Lower semicontinuity of the functions fkP 81
54 Galetransforms and Galediagrams 83
55 Existence of combinatorial types 88
56 Additional notes and comments 95
Polytopes with few vertices 96
62 dPolytopes with d + 3 vertices 100
63 Gale diagrams of polytopes with few vertices 106
64 Centrally symmetric polytopes 112
65 Exercises 117
66 Remarks 119
67 Additional notes and comments 120
Neighborly polytopes 121
72 dNeighborly dpolytopes 121
73 Exercises 123
74 Remarks 125
75 Additional notes and comments 127
Eulers Relation 128
82 Proof of Eulers theorem 130
83 A generalization of Eulers relation 133
84 The Euler characteristic of complexes 134
85 Exercises 135
86 Remarks 137
87 Additional notes and comments 139
Analogues of Eulers Relation 141
92 The DehnSommerville equations 142
93 Quasisimplicial polytopes 149
94 Cubical polytopes 151
95 Solutions of the DehnSommerville equations 156
96 The fvectors of neighborly dpolytopes 158
97 Exercises 164
98 Remarks 166
99 Additional notes and comments 168
113 dConnectedness of the Graphs of dPolytopes 208
114 Degree of total separability 213
115 dDiagrams 214
116 Additional notes and comments 221
kEquivalence of polytopes 223
122 Dimensional ambiguity 224
123 Strong and weak ambiguity 224
124 Additional notes and comments 231
3Polytopes 233
132 Consequences and analogues of Steinitzs theorem 240
133 Eberhards theorem 249
134 Additional results on 3realizable sequences 267
135 3Polytopes with circumspheres and circumcircles 280
136 Remarks 284
137 Additional notes and comments 293
Anglesums relations the Steiner point 296
142 Anglesums relations for simplicial polytopes 300
143 The Steiner point of a polytope 303
144 Remarks 308
145 Additional notes and comments 312
Addition and decomposition of polytopes 314
152 Approximation of polytopes by vector sums 320
153 Blaschke addition 327
154 Remarks 333
155 Additional notes and comments 337
Diameters of polytopes 340
161 Extremal diameters of dpolytopes 340
162 The functions and b 343
163 W Paths 350
164 Additional notes and comments 352
Long paths and circuits on polytopes 354
171 Hamiltonian paths and circuits 355
172 Extremal pathlengths of polytopes 362
173 Heights of polytopes 371
174 Circuit codes 377
175 Additional notes and comments 386
Arrangements of hyperplanes 388
182 2Arrangements 393
183 Generalizations 403
184 Additional notes and comments 407
Concluding remarks 409
192 kContent of polytopes 412
193 Antipodality and related notions 414
194 Additional notes and comments 420
Tables 423
Addendum 423
Errata for the 1967 edition 425
Bibliography 427
Additional Bibliography445
Index of Terms471
Index of Symbols463
Copyright
Less
Other editions - View all
Convex Polytopes
Branko Grünbaum
Limited preview - 2013
Convex Polytopes
Branko Grünbaum
Limited preview - 2003
Convex Polytopes
Branko Grünbaum
No preview available - 1967
View all »
Common terms and phrases
2-complex3-diagramsa₁additionalaffine hullaffinely independentAlgebraicanalogouscentrally symmetricchaptercombinatorial typescombinatorially equivalentcompletes the proofconecontainsconvconvex hullconvex polytopesconvex setcorrespondingcyclic polytopesd-arrangementd-complexd-dimensionald-pyramidd-simplexdefinedDehn-Sommerville equationsdenotedetermineddimensiondualedgesEuler's equationexampleexerciseexistsf-vectorsF₁F₂facet Ffigurefinitefo(PfunctionGale-diagramsgraphGrünbaumH₁halfspacesHamiltonian circuitHamiltonian pathHirsch conjecturehomeomorphichyperplaneincidentintegerintersectionisomorphick-facesK₁Kleelinearlower boundMathneighborly polytopesnodesnumber of facesobtainedoriented matroidsP₁pathplanarplanar graphpolyhedral setproblemprojectiveproof of theorempropertiesprovedrelintsatisfiesSchlegel diagramsequencesimple 3-polytopesimplexsimplicial d-polytopesskelSteiner pointSteinitzTheorytrianglesupper boundV₁vectorvertvertexx₁
References to this book
Stochastische Geometrie
Rolf Schneider,Wolfgang Weil
No preview available - 2000
Excursions into Combinatorial Geometry
Vladimir Boltyanski,Horst Martini,P.S. Soltan
Limited preview - 1996
All Book Search results »
Bibliographic information
Title Convex Polytopes
Volume 221 of Graduate Texts in Mathematics, ISSN 0072-5285
AuthorBranko Grünbaum
EditorsVolker Kaibel, Victor Klee, Günter M. Ziegler
Compiled by Volker Kaibel, Victor Klee, Günter M. Ziegler
Edition illustrated
Publisher Springer Science & Business Media, 2003
ISBN 0387404090, 9780387404097
Length 466 pages
SubjectsMathematics
›
Geometry
›
General
Mathematics / Discrete Mathematics
Mathematics / Geometry / Algebraic
Mathematics / Geometry / Analytic
Mathematics / Geometry / General
Mathematics / Topology
Export CitationBiBTeXEndNoteRefMan
About Google Books - Privacy Policy - Terms of Service - Information for Publishers - Report an issue - Help - Google Home |
14164 | https://zhuanlan.zhihu.com/p/489168382 | 直答
判断推理-逻辑判断：组合排列
首发于
上岸
切换模式
判断推理-逻辑判断：组合排列
丹丹
大龄算法的待业重修之路
收录于 · 上岸
18 人赞同了该文章
目录
收起
考点一：排除法、代入法
排除法
代入法
考点一总结
考点二：辅助技巧
最大信息
符号
画表格
基本组合排列方法总结
考点三：特殊题型-材料题
考点识别
解题思路
例一
例二
例三
考点一：排除法、代入法
排除法
读一句，排一句
思路总结：
判断题型
读一句排一句
关注点：比较大小的题中，”最大“与”最小“往往是破题点
代入法
假设选项正确，带入题干验证是否符合题意，考虑带入的情况如下：
题干条件确定，优先用排除，题干条件不确定，尝试带入
设问中有”可能“，”不可能“考虑带入
设问中有”补充以下哪项条件可以推出“
考点一总结
考点二：辅助技巧
最大信息
题干条件中出现次数最多的词，以此作为推理的起点
符号
”>“，”<“，往往涉及年龄，成绩，收入，身高等大小比较
画表格
几个对象，三个以上信息
一维表(排序，排名)，二维表(人+其他信息量)
列表之后，优先填入确定信息
基本组合排列方法总结
考点三：特殊题型-材料题
国考地市级连续考察
考点识别
一则材料，多个设问
解题思路
分析材料
与非题材解题方法一致-一则材料，多种技巧
通过材料直接推出来的结论，可以直接应用于所有题目
例一
整个解题思路告诉我们
基于题干推出的信息，可以用于整篇材料
推理起点：确定信息
小技巧：逆向思维
例二
例三
编辑于 2022-04-11 05:35
公务员考试
判断推理
写下你的评论...
还没有评论，发表第一个评论吧
关于作者
丹丹
大龄算法的待业重修之路
回答
1
文章
47
关注者
489
推荐阅读
# 判断推理-逻辑判断-组合排列
题目特征 题干中给出一组对象和相关信息，要求把对象和信息进行匹配 常用方法： 带入法、排除法 题干条件确定，考虑排除法 题干条件不确定（真假未知），考虑代入法 最大信息 最大信息…
于志
发表于行测-判断...
# 逻辑判断-组合排列💗秒杀
1.排除法：题干条件确定，给选项让选择（根据题干选答案） 2.代入法：题干条件不确定，提问为补充哪个条件 可能/不可能 符合/不符合（补充哪个选项题干为真） 3.条件为“每人说两句，都只说…
哦哦哦
# 2019行测类比推理满分技巧分享
汪清华图教育
# 公务员必看的知识热点！13种行测数字推理技巧总结！
山西同风公考
想来知乎工作？请发送邮件到 jobs@zhihu.com
打开知乎App
未注册手机验证后自动登录，注册即代表同意《知乎协议》《隐私保护指引》
扫码下载知乎 App |
14165 | https://calcworkshop.com/quadrilaterals/trapezoid-properties/ | Trapezoid Properties (Visually Explained w/ 7+ Examples!)
Calcworkshop
Login
Home
Reviews
Courses
Algebra I & II
Intro Algebra
Solving Equations
Exponents
Polynomials
Factoring
Rationals
Graphing Linear Equations
Systems of Equations
Radicals
Functions & Statistics
Geometry
Basic Geometry
Reasoning & Proofs
Congruent Triangles
Quadrilaterals
Similarity
Triangles & Trig
Circles
Polygons & Circles
Volume & Surface Area
Transformations
Pre-Calculus
Trigonometry
Trigonometric Functions
Radian Measure
Graphing Trig Functions
Trig Identities
Trig Equations
Law of Sines and Cosines
Vector Applications
Polar Equations
Complex Numbers
Math Analysis
Intro to Math Analysis
Functions and Graphs
Expos and Logs
Polynomial Functions
Rational Functions
Conic Sections
Series & Sequences
Calculus 1, 2, & 3
Business Calculus
Calculus 1
PreCalc Review
Limits
Derivatives
Application of Derivatives
Integrals
Final Exam
Calculus 2
Integrals
Applications of Integrals
Diff-EQs
Polar Functions
Parametric and Vector Functions
Sequences and Series
Final Exam
Calculus 3
Vectors and The Geometry of Space
Vector Functions
Partial Derivatives
Multiple Integrals
Vector Calculus
Final Exam
Statistics & Prob
Exploring Data
Probability
Discrete Distribution
Continuous Distribution
Joint Distribution
Confidence Interval
Hypothesis Testing
Linear Regression
Discrete Math
Logic
Proofs
Sets
Number Theory
Functions
Combinatorics
Relations
Trees & Graphs
Linear Algebra
Linear Equations
Matrix Algebra
Determinants
Vector Spaces
Eigenvalues and Eigenvectors
Orthogonality and Least Squares
Symmetric Matrices
Final Exam
Diff-EQs
Intro to DiffEqs
First Order Differential Equations
Second Order Differential Equations
Series Solutions
Laplace Transform
Systems of Differential Equations
Final Exam
Praxis
FAQs
About
Contact
Login
Home » Quadrilaterals » Trapezoid Properties
Trapezoid Properties
Visually Explained w/ 7+ Detailed Examples!
// Last Updated: January 21, 2020 - Watch Video //
In today’s geometry lesson, we’re concluding our study of quadrilaterals, by looking at the properties of trapezoids and kites.
Jenn, Founder Calcworkshop®, 15+ Years Experience (Licensed & Certified Teacher)
You’ll learn all the trapezoidal properties needed to find missing sides, angles, and perimeters.
In addition, we’ll explore kites and discuss their associated properties.
Let’s get started!
What Is A Trapezoid?
A trapezoid is a quadrilateral with exactly one pair of parallel sides. The parallel sides are called bases, and the other two sides are called legs.
Bases and Legs of a Trapezoid
And because the bases are parallel, we know that if a transversal cuts two parallel lines, then the consecutive interior angles are supplementary. This means that the lower base angles are supplementary to upper base angles.
Midsegment of a Trapezoid
Additionally, the midsegment of a trapezoid is the segment joining the midpoints of the legs, and it is always parallel to the bases. But even more importantly, the midsegment measures one-half the sum of the measure of the bases.
And since we know that the sum of all interior angles in a quadrilateral is 360 degrees, we can use our properties of trapezoids to find missing angles and sides of trapezoids.
Cool!
Now, if a trapezoid is isosceles, then the legs are congruent, and each pair of base angles are congruent. In other words, the lower base angles are congruent, and the upper base angles are also congruent. Likewise, because of same-side interior angles, a lower base angle is supplementary to any upper base angle.
Properties of an Isosceles Trapezoid
But there’s one more distinguishing element regarding an isosceles trapezoid.
A trapezoid is isosceles if and only if its diagonals are congruent. So if we can prove that the bases are parallel and the diagonals are congruent, then we know the quadrilateral is an isosceles trapezoid, as Cool Math accurately states.
In the video below, we’re going to work through several examples including:
Using these properties of trapezoids to find missing side lengths, angles, and perimeter.
Determining if the given quadrilateral is a trapezoid, and if so, is the trapezoid isosceles?
What Are The Properties Of Kites?
The first thing that pops into everyone’s mind is the toy that flies in the wind at the end of a long string.
But have you ever stopped to wonder why a kite flies so well?
The way a toy kite is made has everything to do with mathematics!
In fact, a kite is a special type of polygon.
A kite is a quadrilateral that has two pairs of consecutive congruent sides. And while the opposite sides are not congruent, the opposite angles formed are congruent.
Congruent Sides and Angles of a Kite
This means that one pair of opposite angles in a kite are congruent (equal in measure) and the angles formed between the unequal sides of a kite are equal.
Moreover, the diagonals of a kite are perpendicular to each other. This tells us that the diagonals intersect at a right angle such that the longer diagonal bisects (cuts in half) the shorter diagonal.
Perpendicular Diagonals of a Kite
And if the diagonals intersect at a 90-degree angle, we can use our knowledge of the Pythagorean Theorem to find the missing side lengths of a kite and then, in turn, find the perimeter of this special polygon.
This framework of two pairs of consecutive congruent sides, opposite angles congruent, and perpendicular diagonals is what allows for the toy kite to fly so well.
Gosh, doesn’t it make you want to get outside and play?
Trapezoid Properties – Lesson & Examples (Video)
41 min
Introduction to trapezoids and kites
00:00:31 – What are the properties of a trapezoid
Exclusive Content for Member’s Only
00:05:28 – Use the properties of a trapezoid to find sides, angles, midsegments, or determine if the trapezoid is isosceles (Examples #1-4)
00:25:45 – Properties of kites (Example #5)
00:32:37 – Find the kites perimeter (Example #6)
00:36:17 – Find all angles in a kite (Examples #7-8)
Practice Problems with Step-by-Step Solutions
Chapter Tests with Video Solutions
Get access to all the courses and over 450 HD videos with your subscription
Monthly and Yearly Plans Available
Get My Subscription Now
Still wondering if CalcWorkshop is right for you?
Take a Tour and find out how a membership can take the struggle out of learning math.
4.9 / 51,202 Reviews
slide 5 to 8 of 50
Rich 04-27-25 - PA, United States
I am a teacher who had not done anything with Calculus for over 10 years. This was a great resource for me to review some content that I did not remember. The videos and examples were so well explained that I used some of those concepts and examples when I presented the topics to my students. I would strongly recommend this to students who are looking for additional help or teachers that need to brush up on specific topics.
Chris 04-27-25 - NV, United States
Jen is the best.I struggled with the provided material given to me at ASU and resorted to YouTube videos and google.I caught wind of Jen and her website from a few classmates and I've been using her since.I have now completed calculus for Engineers: 1,2,3; DiffEq, and Linear Algebra and Jen helped me from calc2 forward. Subscribing to her was just 'another tool in my toolbox' and definitely added more confidence when doing my homework.I highly recommend.
Keshav 04-24-25 - United Kingdom
I loved it and it helped me get a better understanding of the topics. The ample amount of examples was really helpful to make sure that I understand what I am doing and how to solve various types of problems
Syniah N.04-24-25 - CA, United States
Jen is an exceptional math teacher and a rare find. In a university setting where many instructors prioritize research over teaching, Jen stands out for her ability to explain complex topics in a clear, approachable way.Before discovering this resource, I often felt lost in math classes where instructors wouldn't simplify formal equations for beginners. Jen changed that completely. Thanks to her, I passed Calculus II with an A.I'm truly grateful and highly recommend this resource to anyone struggling with math
Stephanie B.09-23-25 - FL, United States
As a homeschool mom to a math savvy teenager, I needed a strong resource for a subject that strikes fear in the hearts of most people - Calculus. Jenn's videos were exactly what I was looking for: thorough explanations, notes, and tons of example problems. Not only that, this is one of the few formats where you can actually see the person doing the teaching and she uses a real whiteboard, so taking notes feels like you are in a classroom. I can confidently say my daughter has a rock solid foundation after learning through these videos. On the occasion where she had a question I could not begin to answer, I was delighted to learn we could email Jenn and receive a prompt reply within a detailed explanation. I don't know any other instructional platform with such exceptional customer service. We cannot recommend Calcworkshop enough.
Gray A.09-23-25 - TN, United States
I had no idea what was happening in my calculus class before I started using CalcWorkshop. Within 1 lesson I learned more than my professor taught in 3 weeks. CalcWorkshop works.
Ali M.09-15-25 - NM, United States
It was amazing from start to finish of my usage of it. Great teaching style, relatable and great practice problems and setup. Genuinely such a great tool. Step-by-step instructions and effortless after a couple problems.
Autobrian20 09-14-25 - CA, United States
All videos are very clear and informative, so easy to learn complex concepts. Hardest thing was figuring out what chapters to learn alongside what I'm learning in class but that depends on your class. Wish I could just take these as my classes. Would not have made it without these videos.
Johnny I.09-11-25 - WA, United States
I am a retired businessman with background in stock brokerage and electronics manufacturing. I have always felt there was a gap in my mathematics education, and that I really needed to learn higher math, especially calculus! I saw the Calcworkshop ad on YouTube when watching a video of Carl Sagan, the famous scientist. I thought the monthly price was very reasonable and decided to subscribe. It is the best bargain I've run into lately! Jenn is the kind of teacher that I needed in high school growing up in Alabama. I have completed the first three 1-hour lessons in Algebra, which I find that I REALLY needed. My plan is to progress slowly at my own pace and learn more and more mathematics day by day(it's only $1/day...what a bargain!). I am filling in the gaps in my education that have always haunted me, and just learning these lessons gives me confidence that I'm not 'on the outside looking in' any longer! I am running with the 'big dogs' now! I will not stop until I have a good understanding of higher math! I would urge everyone: If you wish to learn or supplement your math education, you have come to the right place! Just jump in and DO IT!
Eric J.09-04-25 - NY, United States
I've decided to start relearning math as a way to keep my mind sharp as I get older. I can say, with no reserve that Calcworkshop is without a doubt, the most valuable, thorough, comprehensive resource anyone can find for all of their math needs. Jenn is incredibly thorough, never skips steps, and alleviates any guesswork. This is going to be a long journey, but I'm confident that I can learn these concepts with the aid of Calcworkshop. Math has even become fun! Thanks, Jenn. You've got a customer for life!
Johemil R.09-01-25 - NC, United States
Calcworkshop is a great learning platform and experience. Jenn is a great explainer; she provides step by step solutions and good tips for students to remember the relevant tricks and techniques. She makes it so easy for students to learn math. I wish I had professors like her at the university, with a genuine desire to share knowledge and see their students succeed in math. I truly recommend the Calcworkshop course to anyone who wants to learn math from zero or just brush up on forgotten skills/topics.
NB 08-18-25 - ID, United States
Very good courses with detailed videos and practice problems. It was helpful to have extra resources in calculus.
Sabrina 08-18-25 - CA, United States
This course help prepare me for Calculus 2!
Daily 08-18-25 - OR, United States
Calcworkshop.com for the win. I used this as a supplement for college level Pre-Calculus II, Calculus I, and Calculus II courses. The Calculus courses were during an accelerated 4-week summer term, which made them that much more difficult. Jenn's teaching ability is amazing! I was regularly able to impress my professors with my grasp of the content. They regularly commented on how much I was improving. For every topic that was covered in each class, Calcworkshop.com has the same content in an easy to digest video. U-Sub, Trig Sub, Diff-Equations, the list goes on. Best money I've spent in a very long time. Three classes supplemented with Calcworkshop.com so far, and three A letter grades!
Austin 08-08-25 - AZ, United States
I was lost in an AP Calculus class and Jenn's explanations of things like limits and dedicates helped me out tremendously! The break downs of every lesson made it seem like I was learning basic algebra again, and allowed me to do so much better in Calculus.
A Reviewer 08-07-25 - CT, United States
I have been so super confident ever since I encountered the Calcworksop. This platform was so convenient for me it enabled me to study effectively. Jenn is an absolute guru, I love her so much. She gets it! I do feel I come to tears with the amount of progress I've made with calculus. If anyone ever has any struggle with calculus, Calcworkshop will rescue you. And in a brief amount of time will you start to make progress. This website is a miracle TRUST ME. Calculus 1,2 and 3 can all be courses that you can get great grades out of from this website. And there are more courses you can do well in for mathematics. Again this website saved my life! Jenn Forever!
A Reviewer 08-04-25 - GA, United States
Great online videos and super helpful prep for an 8 week college Calculus class. I felt well prepared and did very well in my course overall.
Clara 08-01-25 - United States
CalcWorkshop was wonderful! My Honors Calculus IV professor was a wonderful personality to be around but was incredibly smart and only taught about the theory of the math... rather than with example problems. I would end up spending hours upon hours trying to complete three problems and I knew that I needed more examples to show different workflows. With the Jenns help, I ended up pulling through with a high B in this course, which is honestly my most prized grade that I worked so hard for in undergrad studies so far.
Rosie T.07-30-25 - United States
I was struggling with my online calculus class and was watching YouTube videos when I saw an ad for calcworkshop and was able to watch a couple videos and decided to get the subscription for the remainder of the semester. Jenn explains everything so well and is very thorough, easy to follow and I would remember some of the little phrases she would say that really helped. I highly recommend the site for your math classes.
A Reviewer 07-28-25 - CA, United States
Outstanding... keep up the high quality content.
Kerry K.07-22-25 - United States
This program and Jenn especially are the ONLY reason I got through calc 1,2,3 and Differential equations. Better than any professor I've ever had
Tom 07-15-25 - VA, United States
Extremely helpful! In the age of online classes this website delivers classic style lectures that really helped me.
Zoe R.07-14-25 - NC, United States
Calcworkshop really helped me gain a deeper understanding of my calculus curriculum. I kept feeling like I was 'almost there' with every unit we did in class but something was missing. Jenn really breaks down every topic in a way that makes sense and doesn't skip any steps. Calcworkshop definitely played a huge role in improving my calculus scores this year. I would highly recommend it to anyone who feels like they need a little extra help to be successful.
Sean P.07-14-25 - SC, United States
This is a great service for anyone who struggles with math. Jenn breaks everything down to basic levels so you can understand the whole process. For me I chose to go back to school in my 40's and many of the simple basic fundamentals had been forgotten and with her workshop I was able to recall them without taking a step back and losing traction in the process.
Mike 07-02-25 - FL, United States
It's a great service working through example problems is a great way to learn.
Dana 06-29-25 - MN, United States
Math is hard and math can be boring, so I really appreciate Jenn's enthusiasm in ALL of her videos. She explains concepts so well, points out the common mistakes, and goes through many examples. I am retired and learning math, which I didn't take in my adult years, so it's been really hard to learn on my own. But I want to learn physics and I will need calculus for that. I love how Jenn has organized her courses to focus on what will be needed for calculus and then the calculus courses, as well as linear algebra and differential equations.
Julian 06-27-25 - NC, United States
Jenn and Calcworkshop are one of the best resources outside of school for mastering any math course. I went from failing Pre-Calculus to getting an A in Calculus 2. There's nowhere else you need to go.
Nika 06-26-25 - CA, United States
Excellent explanations on every topic of precalculus and calculus. Great examples. Easy to understand. Thank you!
A Reviewer 06-23-25 - United States
Literally taught me calc because my actual teacher didn't. Jen explains in a way that is simple and just makes sense. My calc teacher in high school taught super vaguely and just expected us to understand how to make connections right away. This website actually saved me from failing and helped a lot with studying for the AP test!!
Lottie 06-17-25 - AL, United States
It was very helpful to have videos where the instructor did not assume that part of process was already known by the person watching.
Maureen S.06-13-25 - NE, United States
I used CalcWorkshop because I needed help with college calculus I required for entrance to a grad program I am pursuing. The instruction provided through my university was vague at best. As a full-time professional, wife, and mother of 5, it was difficult for me to go in for the tutoring sessions offered by my university. I love how Jenn provided the repetition I needed to solidify the processes in my brain and reviewed the algebra tricks while going through the comprehensive variety of problems in detail. I believe that anything can be learned if enough time is spent trying. The one-stop-shop in CalcWorkshop saved me the frustration of searching YouTube for examples and helped me make more efficient use of my time. In the course evaluation for my university, I mentioned that I used CalcWorkshop for support. I am likely to re-subscribe for myself and for my children. Thanks, again.
Kevin M.06-09-25 - FL, United States
This has been the best resource I have used in my whole academic career. I was struggling in my courses and this helped me go from barely passing my college classes to getting As. I highly recommend this to everyone. The calc workshop is a game changer and is just absolutely amazing. Thank you so much!
Jacqueline 06-06-25 - WA, United States
My son used the Calculus videos as a supplement to his high school class. The explanations were clear, and helped him get over some of the hurdles he experienced in the class.
Lindsay 06-03-25 - FL, United States
I have only been using this for about a week, and I have already greatly benefited from this resource. The videos are clear and straightforward, with just the right amount of background information and explanation. I love that I am able to access any course that I need in order to fill in any gaps in skill. I am not just granted access to one particular course. I also love that when I contacted Jenn about a question that I had, she reached out with clarity and specific videos that would help my situation. This was an amazing help!! I would not have known where to find them on my own, and they really helped me to understand concepts that I needed.I highly recommend this resource:)
Joann L.06-03-25 - TX, United States
I am very satisfied with format Calcworkshop has to offer. I highly recommend this site. After six months of reviewing sites and texts I decided to try Calcworkshop.I stopped searching because it met all my needs.I will take my grandchildren from PreAgebra to Calculus 1 through Calcworkshop. Joann from Salado, TX
Andrea A.05-30-25 - United States
Thanks to all of the support offered on your website, I as able to save a lot of tears. Truly one of the best sources for calculus aid. I ended up finished Calc 1-3 with A's. I thank you and your team for the amazing website you have put together!
A Reviewer 05-28-25 - United States
This website has helped me understand the concepts better of step by step.
Grace 05-24-25 - MD, United States
As a college student and math major, CalcWorkshop was the perfect resource for me as it cleared up what I didn't understand in lectures or even taught me the whole topic! Jenn really does go through every step and understands where students may be confused during lessons. I totally would recommend CalcWorkshop to ANYONE, no matter what math class their taking.
Jenna 05-24-25 - KS, United States
I abolsutely love Jenn! She made calc easier to understand and I genuinely enjoyed her videos. Without Jenn, I never would have made it through calc II. I wish I had her for Calc I!
CJ 05-21-25 - NC, United States
I was way out of my element in Calc II in college, and my professor was no help, and I was unsuccessfully trying to teach myself calculus from a textbook. I had failed my first test and was looking for tutors, but all of the ones I tried just gave me help on homework and did not teach the content to me. I fully credit CalcWorkshop for being able to pass Calc II and not having to retake it. The way things are explained is so clear and simple, and can even help someone who is self-proclaimed "bad at math". I would recommend this site to anyone struggling in calc!!
Maya 05-19-25 - United States
I just passed the Calc 2 course at my local collage with an A as a junior in high school and couldn't have done it without Calcworkshop! Jenn gives tons of great examples and explains things so clearly and calmly without skipping over the "little unimportant steps" that would continuously trip me up while trying to learn the new material. The website is also very well designed and makes it very easy to find exactly what you are looking for. 10/10
RetiredMD 05-15-25 - FL, United States
My overall experience has been excellent. I am a retired physician now teaching. Mathematics has always been important to me. I have needed review from time to time and to have this as a source was extremely helpful. Jenn shows you the thinking done in solving problems and not just the mechanics. I most likely will renew in the future but I am pleased with the quality.
WeezyMathGirl 05-15-25 - GA, United States
These videos are amazing. She explains everything so well and this was a lifesaver for Calculus BC for my daughter!
Brenda 05-12-25 - KY, United States
absolutely amazing!
Jose C.05-12-25 - FL, United States
I am very grateful to have found this site and above all I am grateful for Jen's work. It is notorious the passion for teaching and doing good to the community that continues with the hope and dream of dedicating themselves to mathematics despite the fact that the educational system or teachers that we may encounter along the way are not the most cooperative. As a personal experience, I had a terrible year academically in terms of mathematics, actually no one in my class understood the teacher, I thought that this was no longer my thing, but this online course made me regain confidence in me and knowing that from now on I will have a tool that can accompany me if I have any doubt is a great relief.
John 05-10-25 - NM, United States
Being in my thirties and returning to school to pursue a degree in Mechanical Engineering and hadn't taken a math class in over 25 years, Calc Workshop was the only reason I survived pre calc/trig, calc 1, and calc 2. Jenn breaks down every step of every type of problem into a logical and easy to remember process. This subscription has been worth every penny and I have recommended it to everyone I know taking math. I will be re-subscribing for calc 3 and differential equations next year. Thank you Jenn for such an amazing tool and helping me achieve success in these challenging courses, I couldn't have done it without you!
Deathbyintegrals 05-09-25 - United States
Overall it served my intended purpose which was to get me through double, triple, and line integrals. I like how the site is organized and I absolutely appreciate the clear and concise video lessons. Should I need a math refresher or assistance in a future course I will absolutely be back.
Dillan 05-06-25 - UT, United States
Her videos are very well made, you can tell she put a lot of work into how she introduces and walks you through all the material. I used her videos to help me with calculus 3. I just canceled my subscription because I wasn't in need of the information anymore and 30$ is a lot to pay if your not gonna watch the videos. I will probably re subscribe for my future math classes. Her videos are super good!Her website is well organized and easy to get around. I did not use any of her other features on her website I just used her posted videos from the website and I found that plenty sufficient for me to learn the material. Overall, I felt like 30$ a month was a little expensive but this is such a great product that I would 100% subscribe again!
Amanda M.05-02-25 - AZ, United States
Calcworkshop is an outstanding resource for anyone looking to strengthen their understanding of calculus. Jen's clear and approachable teaching style made even the most complex topics feel manageable. As a math teacher, I found her step-by-step explanations incredibly helpful in breaking down difficult concepts for my own students. The scaffolding she provides is thoughtfully designed, building confidence and deepening comprehension at every stage. Whether you're looking for a refresher or a fresh perspective on solving problems, I highly recommend Calcworkshop as a go-to tool for mastering calculus.
A Reviewer 04-28-25 - United States
It was everything u needed to know simplifed in one video. Love it.
Rich 04-27-25 - PA, United States
I am a teacher who had not done anything with Calculus for over 10 years. This was a great resource for me to review some content that I did not remember. The videos and examples were so well explained that I used some of those concepts and examples when I presented the topics to my students. I would strongly recommend this to students who are looking for additional help or teachers that need to brush up on specific topics.
Chris 04-27-25 - NV, United States
Jen is the best.I struggled with the provided material given to me at ASU and resorted to YouTube videos and google.I caught wind of Jen and her website from a few classmates and I've been using her since.I have now completed calculus for Engineers: 1,2,3; DiffEq, and Linear Algebra and Jen helped me from calc2 forward. Subscribing to her was just 'another tool in my toolbox' and definitely added more confidence when doing my homework.I highly recommend.
Keshav 04-24-25 - United Kingdom
I loved it and it helped me get a better understanding of the topics. The ample amount of examples was really helpful to make sure that I understand what I am doing and how to solve various types of problems
Syniah N.04-24-25 - CA, United States
Jen is an exceptional math teacher and a rare find. In a university setting where many instructors prioritize research over teaching, Jen stands out for her ability to explain complex topics in a clear, approachable way.Before discovering this resource, I often felt lost in math classes where instructors wouldn't simplify formal equations for beginners. Jen changed that completely. Thanks to her, I passed Calculus II with an A.I'm truly grateful and highly recommend this resource to anyone struggling with math
Stephanie B.09-23-25 - FL, United States
As a homeschool mom to a math savvy teenager, I needed a strong resource for a subject that strikes fear in the hearts of most people - Calculus. Jenn's videos were exactly what I was looking for: thorough explanations, notes, and tons of example problems. Not only that, this is one of the few formats where you can actually see the person doing the teaching and she uses a real whiteboard, so taking notes feels like you are in a classroom. I can confidently say my daughter has a rock solid foundation after learning through these videos. On the occasion where she had a question I could not begin to answer, I was delighted to learn we could email Jenn and receive a prompt reply within a detailed explanation. I don't know any other instructional platform with such exceptional customer service. We cannot recommend Calcworkshop enough.
Gray A.09-23-25 - TN, United States
I had no idea what was happening in my calculus class before I started using CalcWorkshop. Within 1 lesson I learned more than my professor taught in 3 weeks. CalcWorkshop works.
Ali M.09-15-25 - NM, United States
It was amazing from start to finish of my usage of it. Great teaching style, relatable and great practice problems and setup. Genuinely such a great tool. Step-by-step instructions and effortless after a couple problems.
Autobrian20 09-14-25 - CA, United States
All videos are very clear and informative, so easy to learn complex concepts. Hardest thing was figuring out what chapters to learn alongside what I'm learning in class but that depends on your class. Wish I could just take these as my classes. Would not have made it without these videos.
See more reviews on Shopper Approved
Calcworkshop
© 2025 Calcworkshop LLC / Privacy Policy / Terms of Service
About
Reviews
Courses
Plans & Pricing
Login
Home
Reviews
Courses
Algebra I & II
Intro Algebra
Solving Equations
Exponents
Polynomials
Factoring
Rationals
Graphing Linear Equations
Systems of Equations
Radicals
Functions & Statistics
Geometry
Basic Geometry
Reasoning & Proofs
Congruent Triangles
Quadrilaterals
Similarity
Triangles & Trig
Circles
Polygons & Circles
Volume & Surface Area
Transformations
Pre-Calculus
Trigonometry
Trigonometric Functions
Radian Measure
Graphing Trig Functions
Trig Identities
Trig Equations
Law of Sines and Cosines
Vector Applications
Polar Equations
Complex Numbers
Math Analysis
Intro to Math Analysis
Functions and Graphs
Expos and Logs
Polynomial Functions
Rational Functions
Conic Sections
Series & Sequences
Calculus 1, 2, & 3
Business Calculus
Calculus 1
PreCalc Review
Limits
Derivatives
Application of Derivatives
Integrals
Final Exam
Calculus 2
Integrals
Applications of Integrals
Diff-EQs
Polar Functions
Parametric and Vector Functions
Sequences and Series
Final Exam
Calculus 3
Vectors and The Geometry of Space
Vector Functions
Partial Derivatives
Multiple Integrals
Vector Calculus
Final Exam
Statistics & Prob
Exploring Data
Probability
Discrete Distribution
Continuous Distribution
Joint Distribution
Confidence Interval
Hypothesis Testing
Linear Regression
Discrete Math
Logic
Proofs
Sets
Number Theory
Functions
Combinatorics
Relations
Trees & Graphs
Linear Algebra
Linear Equations
Matrix Algebra
Determinants
Vector Spaces
Eigenvalues and Eigenvectors
Orthogonality and Least Squares
Symmetric Matrices
Final Exam
Diff-EQs
Intro to DiffEqs
First Order Differential Equations
Second Order Differential Equations
Series Solutions
Laplace Transform
Systems of Differential Equations
Final Exam
Praxis
FAQs
About
Contact |
14166 | https://www.youtube.com/watch?v=RFFh4BYLr5s | Place Value Relationships- Ten Times the Digit To The Right or Left- TEK 4.2B-CCSS 4.NBT.1
Fabie Lozano
4720 subscribers
1034 likes
Description
179488 views
Posted: 30 Jun 2018
This math video is intended for 3rd-5th graders. This video discusses how to interpret each place value position as you move to the left of a digit (10 times greater), and to the right of a digit (10 times less). This video offers opportunities to answer questions over large numbers that represent this rule. Thank you for watching!
If you are interested in any of the resources used in the video, please visit my Teachers Pay Teachers store. Check out my Year Long Homework Bundle. This video answers questions from Homework 8 and Homework 34.
For more practice on this math skill, check out my Place Value Relationships activity for upper elementary students from my TPT store:
4th Grade Math Homework-Entire Year
Fonts used in this video are from KG Fonts.
Transcript:
hello and thank you for watching today's video is going to be over the x 10 rule of place value before we get into the rule we do need to talk about multiplying by 10 and 100 here are some examples here now in these examples you see 10 times 2 and I know that that equals 20 now 10 ends in a zero so that means my answer when I multiply by 10 will end in a 0 10 times 4 is 40 10 ends in a 0 my answer ends in a 0 10 times 6 is 60 and the same rule applies let's look at some other examples you have 3 times 4 3 times 40 and 3 times 400 well the basic fact here is 3 times 4 and I know that that's 12 3 times 40 is going to be 120 now one of my factors ends in a zero so my answer will end in a zero and three times 400 is 1200 I see that 400 ends in two zeroes and so my answer will end in two zeroes let's look at one more example now this one five times eight the answer to that actually is 40 and 40 ends in a zero but it's not because one of my factors ended in a zero that's just the answer to that multiplication fact 5 times 80 is 400 and that zero is at the end of your answer and five times 800 is 4000 so these are some examples of multiplying by 10 and 100 and some of the patterns you'll see when multiplying times numbers that end in a zero and a hundred ending in two zeroes so let's get into this x 10 rule of place value so you have to pay attention to two things whenever you're looking at numbers to see if they follow the x 10 rule you have to have two digits that are the same and those two digits have to be next to each other let me give you an example of what I mean let's take the number 520 - I have two digits that are the same - and - and those two digits are next to each other so this number would follow the x 10 rule of place value now let's look at this rule a little more the two in the ones place is worth two the tens place is worth 20 and the hundredths place is worth 500 so here's where the rule comes into play when I'm moving in this direction I am multiplying the ones place by 10 so 2 times 10 gives me 20 and I would read this description like this the 2 in the tens place is 10 times greater than the 2 in the ones place and that is the times 10 rule of place value let's look at another example here I have 4431 and as you can see I have my two digits they are the same and they are next to each other so the times 10 rule applies to this number now the ones place is worth 1 tens place is worth 30 hundredths place is worth 400 and the thousands place is worth 4,000 here's where the x 10 rule plays in if I move in this direction I take the 4 in the hundreds place 400 and I multiply it by 10 and that gives me 4,000 so when I'm talking about this relationship I can say that the 4 in the thousands place is 10 times greater than the 4 in the hundreds place and that is the times 10 rule of place value now if we go in this direction to get 10 times greater then if I moved in the opposite direction I would be finding numbers that are 10 times less and let's talk about that because you're going to see numbers like that as well now moving in this direction I would take my 20 I would divide it by 10 and I would get 2 so I would say that the two in the ones place is ten times less than the two in the tens place and I can also say that the two in the ones place is one-tenth the value of the two in the tens place let's look at it with our 4431 number again moving in this direction I can say that four thousand if I divide it by ten I would get four hundred and so I would say that the four in the hundreds place is ten times less than the four in the thousands place I can also say that the four in the hundreds place is one-tenth the value of the four in the thousands place and that is the times ten rule of place value so here you really see the rule of place value play out here's how you read this number four hundred forty four thousand four hundred forty four and all the digits are the same and all of the digits are next to each other so the times ten rule really plays out on this number so if I'm going in this direction the four in the ones place and I go here times ten I get 40 and then 40 times 10 gives me four hundred 400 times 10 gives me four thousand and I could keep going in this direction multiplying each digit by ten to get the next greatest number going to the left now the place value rule also applies if I'm going towards the right 400,000 divided by 10 gives me 40,000 40,000 divided by 10 gives me 4,000 and I could keep going in this direction in the same way and my number would get smaller the value would get smaller so let's answer a question using the times 10 rule here you have the question in the number 2 million 500 ninety-eight the seven in the ten thousands place is blank times blank than the seven in the thousands place well here is the seven in the ten thousands place here's the seven in the thousands place and the seven in the ten thousandths place is ten times greater than the seven in the thousandths place because if I go in this direction and I multiply times ten I get a number that's ten times greater so I would write in the seven in the tens ten thousands place is ten times greater than the seven in the thousands place let's answer one more question over the x 10 rule of place value which number below has a digit in the thousands place that is ten times greater than the digit in the hundreds place so you need to look at your answer choices and look at the thousands place and the hundreds place I see an a that the thousands place is a seven and the hundreds place is a seven so the times ten rule does apply to that number because I have two digits that are the same and they're next to each other in the places that they're asking me about in this case here's the thousands place I have a seven and a zero in the hundreds place this one will not work because it's not the same digit see I have a seven in the thousands place but I have a six in the hundreds place that one will not work either and D I have a seven in the thousands place but I have a one in the hundreds place so I do not have two digits that are the same and next to each other so is it true that the seven in the thousands place is ten times greater than the seven in the hundreds place yes this is true of a five million four hundred fifty-seven thousand seven hundred ninety eight I hope this video helped you understand the times ten rule of place value a little better if you'd like to see more helpful math videos in the future please like and subscribe to my channel and if you're interested in any of the resources featured in this video please read the description below thank you for watching |
14167 | https://www.youtube.com/watch?v=bP1rf2859aA | BINOMIAL: FIND COEFFICIENT OF x^r IN (1-x)^(-n)
A_B_C
847 subscribers
2 likes
Description
138 views
Posted: 8 Jan 2024
full derivation
Transcript:
Hello friends discuss coefficient of x power R in 1 - x to the power minus n where n for any index sh coefficient of x power R in 1 + xial upon R factorial n minus r factorial or x r right n n-1 n- 2 like n - r + 1 into N - R factorial divided by r factori n r factorial X power [Music] r 1 + x 1 + x^ minus n is n should replaced by Min - n in p r + 1 +- n - n -1 - n - 2 likewise - n - r + 1 upon R factorial or X power R factorial n + r - 1 upon r factori nus 1 factorial Factor n + r - 1 1 factorial upon r- 1 factorial or r factus r 1 c r r + n -1 -1 the power r x the power r n 1 + x to the power - n now in 1 - x - n p r + 1 on a term can be obtained by replacing xus r + n -1 cr r -1 power r - x power r r + nus1 CR r + nus1 CR X the power R this coefficient of x^ R in 1 - xus n is this is cr r nus1 x power R is 1 - x -1 series -1 x r simply start is 1 ² 2 - 1 x^ R summation r + 1 C1 X power R this is basically r + 1 x power R of r value 2 + 3x² + 4xq infite R start r + nus 1 thank you |
14168 | https://www.gauthmath.com/solution/1985581123626244/48-MODELING-WITH-MATHEMATICS-The-recommended-weight-of-a-soccer-ball-is-430-gram | Question
Solution
contact@gauthmath.com |
14169 | https://www.seekfind.net/Evolution_Berkeley_Evolution_101.html | Evolution Berkeley: Evolution 101
Search
Choose a Page Type:
FoundationsHomeMeaningBibleDictionaryHistoryQuotations
Berkeley: Evolution 101
You are here:Meaning>Christian Witness>Answers for Witness>Stories Versus Revelation>Creation, Flood, Etc.>Creation v. Evolution>Berkeley: Evolution 101
This page is an analysis of a very deceptive and convincing online mini-class on evolution that is offered by Berkeley. "Biological evolution, simply put, is descent with modification" No one would disagree with either descent or modification. One wonders why such and obvious point would be made, and, if this is all the evolutionism is, then why the controversy? Why is it rejected by so many? There is a reason. The word, evolution, is used in this nebulous way on purpose, for use in equivocation later. This entire course is a lesson in hypnotic pacing and leading. The page then mentions the non-controversial fact of "the descent of different species from a common ancestor over many generations." Species are within kinds/families of living things. This actually can be observed. "The central idea of biological evolution is that all life on Earth shares a common ancestor"For this there is no evidence. None. Of course, this is the first introduction of the logical fallacy of equivocation on the word, evolution. It gets worse. Small changes we can observe in living things and in fossils are evolution. Big changes from molecules to people are things we cannot observe either in fossils or in living things. There is not one example of one family of animal or plant turning into another. This is discussed in the literature as a mystery that will eventually be solved. Despite such romantic language and hopeful prophecy, this is not science. "Through the process of descent with modification, the common ancestor of life on Earth gave rise to the fantastic diversity that we see documented in the fossil record and around us today."There is no evidence to support this statement. "For example, evidence discovered in the last 50 years suggests that birds are dinosaurs" This is fantasy. Words like, "suggests," are often used. They tell the lie without actually being a bold-faced lie. These kinds of words indicate that we are beginning to enter into the never-never land of story telling. Most of the time, these softer phrases are the set up. They are the hypnotic pacing and leading to be followed by absolute statements, bold-faced lies. God angels demons man animals plants minerals The Berkeley course then goes into a lot of "tree structure" for their story of the supposed evolutionary tree of life. The supposed trees only have evidence below the family level. Yet the trees contain made-up data that goes well beyond what the evidence supports. No evidence is found for transitions between the families of living things, (Actually families are probably not exactly the same as the created kinds, but they are fairly close.) "Several times in the past, biologists have committed themselves to the erroneous idea that life can be organized on a ladder of lower to higher organisms. This idea lies at the heart of Aristotle's Great Chain of Being (see right). Similarly, it's easy to misinterpret phylogenies as implying that some organisms are more "advanced" than others; however, phylogenies don't imply this at all." The word, phylogeny, is introduced, a word which, by definition, presupposes molecules-to-man. The entire concept is not science but a dogma of the atheist religion as illustrated by their comment about the chart on the right. Note that the tree structure assumes transitional forms. There is only imagination and no evidence to support the tree structures, but the lack of evidence is never mentioned. There are no undisputed transitional forms. At any moment, there are several claimed transitional forms. When those have to finally be discarded because they have been debunked, new ones take their place. The fact is that evolution would require billions upon billions of transitional forms and not one exists. There is a boat load of unnecessary jargon that is used for talking about evolution, so we have included the following chart if you are interested Word Definition Presupposition Phylogenetics a discipline of evolutionistic biology that classifies the supposed molecules-to-man evolutionary relationships among living and non-living catagories/taxa molecules-to-man Homology similarity (It is automatically assumed that similarities are due to shared ancestry and molecules-to-man.)molecules-to-man Synapomorphy a trait derived by common ancestry/molecules-to-man evolution molecules-to-man Analogy similarities due to convergent molecules-to-man evolution, that is, the traits were not inherited from a common ancestor molecules-to-man Convergent evolutiona rescuing device to save the story of molecules-to-man so that they can still call it a theory molecules-to-man Taxa general term for a taxonomic group, such as species, genera, or families Sister taxa the most-closely related in a phylogeny.molecules-to-man Node an ancestory in the phylogenetic tree molecules-to-man Clade a group in a phylogenetic tree which begins with a node (ancestor) and includes all descendents of the ancestor molecules-to-man Monophyletic a proper clade molecules-to-man Proper clad a group that contains a common ancestor and all descendents of that ancestor, but no non-descendents molecules-to-man Paraphyletic group a group which contains a common ancestor and some, but not all, descendents of that ancestor molecules-to-man Phylogenetic relationships relationships based on similarities of traits molecules-to-man Bill Nye made a statement about the separation of fossils from each other in this geologic column. He said that one specific fossil was never found with this other one and if it were found, then he would give up the theory. When it is found, he would not. He would make up a story to explain it when it happens. These boundaries are becoming more fuzzy over time. Evolution scientists are finding an increasing number of fossils in the wrong place. History tells us that evolution scientists just ignore the evidence, make excuses, or finally modify the model to accommodate these fossils if the evidence is overwhelming. The theory cannot be falsified by any information, since stories are endless. Creation scientists have discovered is that when fossils are found in the wrong place, they are routinely ignored, put off to the side, not reported, or named a new name to avoid flagging the fact that they are in the wrong place. Just a note here: any story about history cannot be falsified if two criteria are met: it can be changed and someone has the motivation to change it. Anything that falsifies the story of molecules-to-man is against Atheism, so there is ample motivation. It isn't that Atheists are so prevalent, but ungodly people are willing to do what it takes, where Christians generally are constrained. The teachings of Christ do not include coercion of message control. Theologies generally are difficult to falsify because they can be changed and adapted. Evolution's story is constantly changing and adapting as is Big Bang and Old Earth. None of these stories are science. The Bible cannot be changed and still have credibility. We have what we have. The theories of how the flood might have happened or what the introduction of sin did to change "natural" laws or not change "natural" laws, are pure speculation and can be changed. The word, natural, in the previous sentence, has been put in quotes for a purpose. When we say natural laws, we are simply referring to the way that God is working to maintain everything faithfully. Miracles are unexpected by us but fully within the nature of the God Who created and Who maintains nature. You will not that this revealed truth is the opposite of the arbitrary assumption of Naturalism that is so dogmatically held by the ungodly. "Humans and chimpanzees are evolutionary cousins and share a recent common ancestor that was neither chimpanzee nor human."There is no evidence at all of this. It was once claimed that the DNA was nearly the same. The human-chimp DNA similarity tale is being uncovered as a story that is unraveling and untrue. It should be noted that it is possible to line up fossils and living skeletons by similarity. It has been said that the similarities of design are caused by evolution, but a better explanation is that there was a common designer with an intent in His design. By the way, if you take any group of objects, you can line them up according to similarity. You can do this with nuts and bolts, screws, nails, lumber, houses, vehicles, or anything you like. It never proves that one evolved into the other. "Bird and bat wings are analogous — that is, they have separate evolutionary origins, but are superficially similar because they have both experienced natural selection that shaped them to play a key role in flight."No one observed this. This a purely a made-up story. Then there is a section on time. Time is important to evolution. > "However improbable we regard this event, or any of the steps it involves, given enough time, it will almost certainly happen at least once. And for life as we know it, once may be enough. Time is the hero of the plot.... Given so much time, the impossible becomes possible, the possible becomes probable, and the probable becomes virtually certain. One has only to wait; time itself performs miracles" 1954, George Wald, Scientific American concerning the origin of life on Earth. Of course, Wald was speaking of an older definition of evolution, yet another definition, molecules-to-man, and the beginning of life in particular. But the same idea applies to the supposed changes leading to the development of families of living things. However, time doesn't actually help evolutionism (It is merely magician's patter.) because of the Laws of Universal Information and the Laws of Thermodynamics. The Second Law of Thermodynamics, though developed using a theoretical close system, applies to all systems closed and open. Adding energy to a system from outside simply speeds the process along. Consider that car that is kept in the garage compared to the car that is kept in sunlight. The Urey-Miller experiment showed that adding energy to a caustic environment could produce amino acids, but not the kind of amino acids that life is made of (Creating the correct amino acids has never been accomplished by anyone). It also proved that a special device would be needed to get any of the amino acids that were created away from the energy source since the energy source is much more efficient at destroying amino acids than creating them. Such a device is not found in nature. As a side note, it must be mentioned that an amino acid is so far from a self-replicating life form that there is no comparison. "Life began 3.8 billion years ago, and insects diversified 290 million years ago, but the human and chimpanzee lineages diverged only five million years ago. How have scientists figured out the dates of long past evolutionary events? Here are some of the methods and evidence that scientists use to put dates on events:" It then lists Radiometric dating, Statigraphy, and Molecular Clocks, all of which depend on arbitrary assumptions. There are other problems with these methods such as cherry-picking data to make sure that they agree with the dates needed to feed the theory. These estimates are based on arbitrary assumptions, so all the millions of years are arbitrary. If you change the assumptions, the date changes. The entire idea is worthless. "A timeline can provide additional information about life's history not visible on an evolutionary tree." So, the model is used as evidence when no evidence exists. "Evolution is the process by which modern organisms have descended from ancient ancestors."Now, how many pages later, the equivocation triggered the bold-faced lie. Remember that evolution is merely "descent with modification." So, now the definition has changed? No. This was the intent of the first phony definition. It is a bait and switch tactic. It is equivocation. "Evolution is responsible for both the remarkable similarities we see across all life and the amazing diversity of that life" This has no evidence to back it up. It is a story. It is an alternate story to what God says happened. God says that He created the Heavens and the Earth and everything in them in six days and the seventh day He rested, so we ought to rest on the seventh day as well. Then, the site goes into how evolution supposedly works: Decent. Well, no one argues that there is decent. Genetic differences, with not explanation about that. The fact is that the genetic differences that have been observed are always loss of information, distortion of information, duplication of information, or rearrangement of information. Then mutation, migration (gene flow), genetic drift, and natural selection are mentioned as the mechanisms of change. Mutation is loss of information, so that won't work. Gene flow is a factor in adaptation, but is not shown to be a mechanism to drive molecules-to-man-type evolution. Genetic drift is the loss of information, so that won't work. Natural selection simply eliminates those that won't survive. It is the elimination of those that don't make it, so that only preserves stasis. There is no evidence that any of these could produce macro-evolution, that is, evolution of one kind/family of living thing into another kind of living thing. So, molecules-to-man evolutionism is left without a method of happening or evidence that it did happen. Genetic variation is mentioned, and no one disagrees that genetic variation happens--just that those variations don't amount to the creation of new, innovative Universal Information in any sense. Coevolution is mentioned. It is actually a story to explain one of the problems with evolution. It proves nothing except that people can make up stories. This is followed by a page that just does into elimination of those who don't survive. This page does nothing to prove that molecules to man evolution happened or that it even could have happened. The next page is more of the same. The next page doesn't prove anything either. The next page is a page on mutations. It doesn't mention that mutations have never been observed to add universal information and that new, beneficial, universal information must be added for even the smallest supposed molecules-to-man step in supposed molecules-to-man evolution. It does mention that mutations can be beneficial, and they can. It can be beneficial for beetles on a small, windy island to lose the information to make wings, since flying would take them out to sea to die. DDT resistence, another loss of information by mutation, is mentioned. Two types of mutations, but neither one produces new universal information. "It is not necessarily easy to 'see' macroevolutionary history."That is an understatement. "Once we've figured out what evolutionary events have taken place, we try to figure out how they happened." Note that there is no questioning whether or not the story of evolution actually took place. That is a given. All observations must be force-fitted into the story, whether or not they make any sense. "The basic evolutionary mechanisms — mutation, migration, genetic drift, and natural selection — can produce major evolutionary change if given enough time." As pointed out previously, this is an untrue statement. "Life on Earth has been accumulating mutations and passing them through the filter of natural selection for 3.8 billion years — more than enough time for evolutionary processes to produce its grand history." Ah. The magic ingredient of time. "Many lineages on the tree of life exhibit stasis, which just means that they don't change much for a long time, as shown in the figure to the right." This is talking about supposed macro-evolution, but the reality is that every kind of animal exhibits stasis from a macroevolution standpoint. "Trilobites, animals in the same clade as modern insects and crustaceans, lived over 300 million years ago." This age is determined using a combination of arbitrary assumptions and science. A thought chain is as strong as its weakest link, so this is just an assumed age. Speciation and extinction are mentioned, neither of which is helpful to the story of molecules-to-man evolution. "All available evidence supports the central conclusions of evolutionary theory, that life on Earth has evolved and that species share common ancestors."That statement is the logical fallacy known as Triumphalism or Declaring Victory. This is the crux of the whole matter. The point was not proven. In fact, all the evidence is really against it. None of the problems of the violations of the various scientific laws in mentioned. If they are ever mentioned, they are brushed away with lies or other tactic. Bill Nye gives a perfect example as he states that the Second Law of Thermodynamics only operates in a closed system. That is not true. The details of the theory were worked out with the assumption of a closed system, but if the Second Law of Thermodynamics didn't operate on the Earth because the Sun's energy comes to the Earth, then we would not see rotting or decay. Our digestive systems would not work. The Second Law kills molecules-to-man evolution. The First Law of Thermodynamics kills the Big Bang. Then there is some speculative writing on the pace of something (molecules-to-man) that has not been shown to have happened. How can we know anything about anything? That’s the real question ### Other Pages in this section Which Is Science: Creation or Evolution? Evolution Observed?? Ask for Proof of Evolution Arguments Against Evolution 12 Arguments Evolutionists Should Avoid Fake Science The Problems with Evolution Unanswered Evolution Questions Follow the Evidence Ptolemy & Evolution Evidence for Creation The Creator IS Obvious Natural Selection and Mutation Evolution is Flim-flam Evolutionism is Anti-Bible Theistic Evolution Unproven Evolution The Founder Principle Birds to Dinos Similarities Prove Evolution? God Created Explains Nothing? The Cult, Evolutionism Natural Selection & Mutation Tactics Whim Science SSWAAFT Question & Answer: Butterfly Evolution? Links ### Recently Viewed Home Answer to Critic Insignificant Cause Appeal to Possibility Circular Reasoning |
14170 | https://allen.in/dn/qna/1339329 | Derive the Formula of inradius (i) Delta / s (ii) (s-a) tan (A/2) (iii) 4R sin (A/2) sin (B/2 )sin (C/2)
To view this video, please enable JavaScript and consider upgrading to a web browser thatsupports HTML5 video
Answer
Step by step text solution for Derive the Formula of inradius (i) Delta / s (ii) (s-a) tan (A/2) (iii) 4R sin (A/2) sin (B/2 )sin (C/2) by MATHS experts to help you in doubts & scoring excellent marks in Class 11 exams.
Similar Questions
Explore conceptually related problems
Find the Radius of escribed circle (i) r1= Delta /(s-a)=s tan A/2=4R sin A/2cos B/2cos C/2
Show that: sin A + sin B +sin C - sin(A+B+C)=4 sin ((A+B)/2)sin ((B+C)/2)sin ((C+A)/2)
Knowledge Check
In a triangle ABC, abc s sin "" A/2 sin ""B/2 sin "" C/2=
If sides a,b,c of Delta ABC are in A.P., then : sin (A/2) cdot sin (C/2)/(sin (B/2) =
In Delta ABC , if : sin(A/2) .sin (C/2) = sin (B/2) then : semiperimeter s =
Similar Questions
Explore conceptually related problems
Verify area of triangle is (i) abc/4R (ii) 2R^(^^)2 sinA sin B sin C
In Delta ABC,2R^(2)sin A sin B sin C is equal to
Consider the following statements concerning a DeltaABc (i) The sides a,b,c and area of triangle are rational. (ii) a, "tan"(B)/(2),"tan"(C)/(2) are rational (iii) a, sin A sin B, sin C are rational . Prove that (i) rArr(ii) rArr(iii)rArr(i)
If A, B, C are angle of a triangle ABC, then the value of the determinant |(sin (A/2), sin (B/2), sin (C/2)), (sin(A+B+C), sin(B/2), cos(A/2)), (cos((A+B+C)/2), tan(A+B+C), sin (C/2))| is less than or equal to
In a Delta ABC, show that 2R^(2) sin A sin B sin C=Delta.
Recommended Questions
07:18
|
03:20
|
09:01
|
04:45
|
07:18
|
07:38
|
04:12
|
Text Solution
|
03:49
| |
14171 | https://www.endocrinesurgery.org/practice-guidelines-tools | Menu
Home
About Us
Governance
Officers
Committees
Past Presidents
AAES History
AAES Legends
AAES Awards
AAES Prior Award Recipients
Bylaws
List Rental
Research Survey Policy
Association Policies
Contact Us
Meetings
Past Meetings
Competition Awards
2026 Annual Meeting
Future Meetings
Membership
Member Login
AAES Membership
Member Benefits
Become a Member
Medical Students
Annual Dues
Fellowships
Programs
Curriculum
Match Program
Fellowship Login
Research
Collaborative Research
Society Grants – LoGerfo and ThyCa
Clinical Trials
CESQIP
AAES Research Survey Policy
Resources
Patient Education Site
Practice Guidelines & Tools
Course/Meetings of Interest
Articles of Interest
Journal Club Reviews
Endocrine Surgery EPAs
Solórzano Travel Awards and Observerships
Job Board
Other Societies of Interest
Learn About FPD
Find A Surgeon
Member Login
Search
Home
About Us
Governance
Officers
Committees
Past Presidents
AAES History
AAES Legends
AAES Awards
AAES Prior Award Recipients
Bylaws
List Rental
Research Survey Policy
Association Policies
Contact Us
Meetings
Past Meetings
Competition Awards
2026 Annual Meeting
Future Meetings
Membership
Member Login
AAES Membership
Member Benefits
Become a Member
Medical Students
Annual Dues
Fellowships
Programs
Curriculum
Match Program
Fellowship Login
Research
Collaborative Research
Society Grants – LoGerfo and ThyCa
Clinical Trials
CESQIP
AAES Research Survey Policy
Resources
Patient Education Site
Practice Guidelines & Tools
Course/Meetings of Interest
Articles of Interest
Journal Club Reviews
Endocrine Surgery EPAs
Solórzano Travel Awards and Observerships
Job Board
Other Societies of Interest
Learn About FPD
Find A Surgeon
| |
| Practice Guidelines & Tools Endocrine Surgery Toolbox Thyroid cancer staging calculator Doubling time and progression calculator Calcitonin and CEA doubling calculator Change in thyroid nodule volume calculator ACS NSQIP Surgical Risk Calculator University of Wisconsin Endocrine Surgery thyroid hormone calculator Aldosterone Renin Ratio calculator - available at the Apple Store - search for 'Aldosterone'. Or, go to www.eshonline.org and click on ESH Care Free Download which takes the reader to a page with a QR code. A calculator for just about anything we would need to calculate Practice Guidelines Guidelines from the American Association of Endocrine Surgeons: AAES Guidelines for the Definitive Surgical Management of Thyroid Disease in Adults AAES Guidelines for Definitive Management of Primary Hyperparathyroidism AAES Guidelines for the Definitive Surgical Management of Secondary and Tertiary Renal Hyperparathyroidism + PowerPoint slides Renal Hyperparathyroidism AAES Guidelines for Adrenalectomy + PowerPoint slides Adrenalectomy Guidelines from the American Thyroid Association(www.thyroid.org) 2017 Guidelines of the American Thyroid Association for the Diagnosis and Management of Thyroid Disease during Pregnancy and the PostpartumAlexander, Pearce, et al., Thyroid. March 2017, 27(3): 315-389. doi:10.1089/thy.2016.0457 2016 American Thyroid Association Guidelines for Diagnosis and Management of Hyperthyroidism and other causes of ThyrotoxicosisRoss, Burch, et al., Thyroid. Oct 2016, 26(10): 1343-1421 2015 American Thyroid Association Management Guidelines for Adult Patients with Thyroid Nodules and Differentiated Thyroid CancerPrepared by the American Thyroid Association Guidelines Task Force on Thyroid Nodules and Differentiated Thyroid CancerHaugen, Alexander, et al., Thyroid. Jan 2016, 26(1): 1-133 Management Guidelines for Children with Thyroid Nodules and Differentiated Thyroid CancerPrepared by the American Thyroid Association Guidelines Task Force on Pediatric Thyroid CancerFrancis, Waguespack, et al., Thyroid 25(7): 716–759, 2015 Revised American Thyroid Association Guidelines for the Management of Medullary Thyroid Carcinoma Prepared by the American Thyroid Association Guidelines Task Force on Medullary Thyroid CarcinomaWells, Asa, et al., Thyroid 25(6):, 567–610, 2015 Guidelines for the Treatment of HypothyroidismPrepared by the American Thyroid Association Task Force on Thyroid Hormone Replacement (2014)Jonklaas, Bianco, et al., Thyroid 24(12): 1670-1751, 2014 Statement on Surgical Application of Molecular Profiling for Thyroid Nodules: Current Impact on Perioperative Decision MakingPrepared by the American Thyroid Association Surgical Affairs CommitteeFerris, Baloch, et al., Thyroid 25(7): 760-768, 2015 See all guidelines from the American Thyroid Association Pathology and Cytology: The 2017 Bethesda System for Reporting Thyroid CytopathologyCibas ES, Ali SZ. Thyroid. 2017 Nov;27(11):1341-1346 Guidelines from the American Association of Clinical Endocrinologists (www.aace.com) AACE/ACE/AME Medical Guidelines for Clinical Practice for the Diagnosis and Management of Thyroid Nodules – 2016 Update - © 2016 American Association of Clinical Endocrinologists and American Association of Endocrine Surgeons Medical Guidelines for the Management of Adrenal Incidentalomas © 2009 See all guidelines from the American Association of Clinical Endocrinologists Guidelines from the Endocrine Society(www.endocrine.org) The Management of Primary Aldosteronism: Case Detection, Diagnosis, and Treatment 2016 Diagnosis and Treatment of Primary Adrenal Insufficiency 2016 Treatment of Cushing’s Syndrome 2015 Diagnosis and Treatment of Pheochromocytoma and Paraganglioma 2014 Congenital Adrenal Hyperplasia Due to Steroid 21-hydroxylase Deficiency 2010 Diagnosis of Cushing's Syndrome 2008 Hormonal Replacement in Hypopituitarism in Adults 2016 Guidelines on Primary Hyperparathyroidism Guidelines for the Management of Asymptomatic Primary Hyperparathyroidism: Summary Statement from the Fourth International Workshop AAES Guidelines for Definitive Management of Primary Hyperparathyroidism The 2017 Bethesda System for Reporting Thyroid CytopathologyCibas ES, Ali SZ. Thyroid. 2017 Nov;27(11):1341-1346 British Association of Endocrine and Thyroid Surgeons(www.baets.org.uk) 2014 British Thyroid Association guidelines on the management of thyroid cancer Paediatric Endocrine Tumour Guidelines Multiple Endocrine Neoplasia Type 1 Clinical Practice Guidelines for Multiple Endocrine Neoplasia Type 1 (MEN1)Rajesh V. Thakker Paul J. Newey Gerard V. Walls John Bilezikian Henning Dralle Peter R. Ebeling Shlomo Melmed Akihiro Sakurai Francesco Tonelli Maria Luisa BrandiThe Journal of Clinical Endocrinology & Metabolism, Volume 97, Issue 9, 1 September 2012, Pages 2990–3011 Multiple Endocrine Neoplasia Type 2 and Familial Medullary Thyroid Carcinoma Multiple Endocrine Neoplasia Type 2 and Familial Medullary Thyroid Carcinoma: An UpdateSamuel A. Wells, Jr Furio Pacini Bruce G. Robinson Massimo SantoroThe Journal of Clinical Endocrinology & Metabolism, Volume 98, Issue 8, 1 August 2013, Pages 3149–3164 Adrenal Management of adrenal incidentalomas: European Society of Endocrinology Clinical Practice Guideline in collaboration with the European Network for the Study of Adrenal Tumors European Society of Endocrine Surgeons (ESES) and European Network for the Study of Adrenal Tumours (ENSAT) recommendations for the surgical management of adrenocortical carcinomaGaujoux S, Mihai R; joint working group of ESES and ENSAT.Br J Surg. 2017 Mar;104(4):358-376. Neuroendocrine Tumors The Surgical Management of Small Bowel Neuroendocrine Tumors: Consensus Guidelines of the North American Neuroendocrine Tumor SocietyHowe JR, Cardona K, Fraker DL, Kebebew E, Untch BR, Wang YZ, Law CH, Liu EH, Kim MK, Menda Y, Morse BG, Bergsland EK, Strosberg JR, Nakakura EK, Pommier RF.Pancreas. 2017 Jul;46(6):715-731 The North American Neuroendocrine Tumor Society Consensus Guidelines for Surveillance and Medical Management of Midgut Neuroendocrine TumorsStrosberg JR, Halfdanarson TR, Bellizzi AM, Chan JA, Dillon JS, Heaney AP, Kunz PL, O'Dorisio TM, Salem R, Segelov E, Howe JR, Pommier RF, Brendtro K, Bashir MA, Singh S, Soulen MC, Tang L, Zacks JS, Yao JC, Bergsland EK.Pancreas. 2017 Jul;46(6):707-714 National Guideline Clearinghouse National Guideline Clearinghouse from the Agency for Healthcare Research and Quality National Comprehensive Cancer Network (NCCN) Guidelines |
Submit a Job
Quick Links
Find A Surgeon
Become A Member
Manage My Membership
Member Education Portal
Information for Patients
Donate to the Foundation
Learn About CESQIP
Learn More About FPD
Upcoming Events
| |
| No events |
View Full Calendar
© Copyright 2025 AAES. All rights reserved.
Facebook
Twitter
YouTube
Back to top
powered by MemberClicks |
14172 | https://sima.sintef.no/doc/4.8.0/vivana/theory/dimensionless_parameters.html | Dimensionless Parameters :: SIMA Documentation
SIMA Documentation
Search VIVANA only:- [x]
Toggle checkbox to restrict the search to the current module( such as RIFLEX,SIMO,etc.).
You can control the search by using the following operators:
Wildcards:
node (Words ending with node)
node (Words starting with node)
node (Words containing node)
Title heading:
title:node (Word node in title)
Keyword ranking:
sand^10 material (sand is 10 times more important than material)
Keyword exclusion and inclusion:
node +fixed -parameters (must contain fixed, might contain node and must not contain parameters)
VIVANA
User Guide
Abstract
Introduction
Initial RIFLEX Analysis
Analysis Procedure
How to Run the Program
Input to VIVANA
References
Appendix A: Typical VIVANA Input File
Appendix B: Format of Time Series File
VIVANA Release Notes
Theory
Introduction
Dimensionless Parameters
Initial Calculations
Method Overview
The Global Geometry Definition
The Frequency Response Method
Calculation of Response Frequencies
Multi Frequency Response
Excitation Force Model
Structural and Hydrodynamic Damping
Fatigue Analysis
Drag Coefficient Modification
References
Appendix A: Correction of Non-Dimensional Frequency for Actual Strouhal Number
Appendix B: Numerical Values for Excitation Coefficients
VIVANA
Bibliography
Conditions
Metocean
New and Noteworthy
Optimization
Post Processor
Report Generator
RIFLEX
SIMA Documentation
SIMA How-tos
SIMO
User guide
VIVANA
WAMIT
Wind Field
Workflow
VIVANA
Theory
Dimensionless Parameters
Contents
1. Reynolds number
2. Strouhal number
3. Non-dimensional frequency
Dimensionless Parameters
Contents
1. Reynolds number
2. Strouhal number
3. Non-dimensional frequency
1. Reynolds number
The Reynolds number classifies dynamically similar flows, i.e.flows that have geometrically similar streamlines around bodies of identical shapes when the incoming flow direction is the same. The condition for similarity is that the ratio of inertia force to friction force is constant at all corresponding points. The Reynolds number at a position s s along the structure is defined as
R e(s,T)=U N(s)D H(s)v(T)(1)(1)R e(s,T)=U N(s)D H(s)v(T)
where v(T)v(T) is the temperature dependant kinematic viscosity, found from Faltinsen (1990), see Figure 1. The s s coordinate follows the length of the structure in its deformed position.
Figure 1. Kinematic viscosity as function of temperature.
2. Strouhal number
The Strouhal number is related to the vortex shedding frequency f v f v for a fixed cylinder, and defined by
S t=f v D H U N(2)(2)S t=f v D H U N
Note that the vortex shedding frequency in the general case will change when VIV occurs, but the Strouhal number should not be referred to a vibrating cylinder. The Strouhal number is used for an initial evaluation and identification of a preliminary list of possible response frequencies.
Figure 2. Strouhal number as function of Reynolds number in VIVANA.
Figure 2 shows the built-in curve for S t(R e)S t(R e) in VIVANA. The curve is valid for a circular cylinder with some roughness and is taken from Faltinsen (1990). The user may specify another curve or keep the Strouhal number independent of the Reynolds number.
The selected curve for S t(R e)S t(R e) (see Figure 2) is assumed to be the best possible alternative for the present use of the Strouhal number, namely to find an initial value for the response frequency in an iteration. Experience shows that even if the vortex shedding frequency for a fixed, smooth cylinder might be significantly higher in the critical flow regime than what is indicated on the curve, the response frequency will drop to a level more like the rough cylinder case.
The vortex shedding frequency along a non-vibrating structure can be found from
f v(s)=U(s)D H(s)⋅S t(s)(3)(3)f v(s)=U(s)D H(s)⋅S t(s)
Note that the Strouhal number is used to correct the non-dimensional frequency in order to apply the built-in or user given curves for hydrodynamic coefficients for vibrating cylinders correctly.
3. Non-dimensional frequency
The non-dimensional frequency f^f^ is used as a controlling parameter for added mass and excitation force coefficients. The non-dimensional frequency is defined by
f^=f o s c D H U N(4)(4)f^=f o s c D H U N
The built-in data for added mass and excitation force are given as function of the non-dimensional frequency. These data are found from experiments at a given Reynolds number, and hence also for a given Strouhal number. The data will, however, be applied for other flow conditions, which means that they must be corrected. This correction is automatically performed in VIVANA by correcting the non-dimensional frequency according to change of Strouhal number:
f^c=f o s c D H U N S t E S t(5)(5)f^c=f o s c D H U N S t E S t
S t E S t E is the Strouhal number valid for the experiments from which the applied coefficients are found, and S t S t is the actual Strouhal number (see Section 2). This correction will ensure that the ratio between the oscillation frequency and vortex shedding frequency for the fixed cylinder is the same for the actual application as for the empirical basis. If the built-in data are used, S t E S t E is defined as 0.2 0.2, and the correction will be performed accordingly. See also Appendix A.
Note that:
Both built-in and user specified parameters for added mass and excitation coefficients are assumed to be valid for S t E=0.2 S t E=0.2 and corrected accordingly.
The non-dimensional frequency for CF and IL components is referred to the respective oscillation frequencies. Hence, f^I L=2 f^C F f^I L=2 f^C F for the same flow condition since the IL response frequency always is assumed to be two times the CF frequency.
IntroductionInitial Calculations
This page was built using the Antora default UI.
The source code for this UI is licensed under the terms of the MPL-2.0 license. |
14173 | https://goldbook.iupac.org/pages/about | About the IUPAC Compendium of Chemical Terminology (Gold Book)
The Compendium is popularly referred to as the "Gold Book", in recognition of the contribution
of the late Victor Gold, who initiated work on the first edition. It is one of the series of IUPAC "Colour Books"
on chemical nomenclature, terminology, symbols and units (see the list of source documents), and collects together
terminology definitions from IUPAC recommendations already published in
Pure and Applied Chemistry and in the other Colour Books.
Terminology definitions published by IUPAC are drafted by international committees
of experts in the appropriate chemistry sub-disciplines, and ratified by IUPAC's Interdivisional Committee on
Terminology, Nomenclature and Symbols (ICTNS). In this edition of the Compendium these IUPAC-approved definitions
are supplemented with some definitions from ISO and from the International Vocabulary of Basic and General Terms
in Metrology; both these sources are recognised by IUPAC as authoritative. The result is a collection of nearly
7000 terms, with authoritative definitions, spanning the whole range of chemistry.
Some minor editorial changes were made to the originally published definitions, to harmonise
the presentation and to clarify their applicability, if this is limited to a particular sub-discipline. Verbal
definitions of terms from Quantities, Units and Symbols in Physical Chemistry (the IUPAC Green Book, in which
definitions are generally given as mathematical expressions) were developed specially for this Compendium by
the Physical Chemistry Division of IUPAC. Definitions of a few physicochemical terms not mentioned in the
Green Book were added at the same time (referred to here as Physical Chemistry Division, unpublished).
The first reference given at the end of each definition is to the page of Pure Appl. Chem.
or other source where the original definition appears; other references given designate other places where compatible
definitions of the same term or additional information may be found, in other IUPAC documents. The complete reference
citations are given in the appended list of source documents. Highlighted terms within individual definitions
link to other entries where additional information is available.
About the Web 2.0 Version of the Gold Book (2019)
Developed through IUPAC Project 2016-046-1-024, the new
version of the website was built to using modern technology (dynamic pages from a SQL database), provides content
for both humans and machines (via the API), and anticipates Web 3.0 (the semantic web).
The project was developed with ongoing maintainence of this important digital IUPAC asset in mind, with code
stored on GitHub and the database perpetually backed up in multiple
locations. While the content of the entries in the Gold Book is the same as previous editions, the site will
continue to evolve as requests from users and new technologies dictate.
Direct questions and comments to Stuart Chalk (Task Group Chair).
About the Advanced XML Version of the Gold Book (2006-2014)
Authors of the electronic XML version
Miloslav Nic
Jiri Jirat
Bedrich Kosata
from the Laboratory of Informatics and Chemistry of the Institute of Chemical Technology, Prague.
Graphic design
Ladislav Hovorka
Jiri Znamenacek
from ICT Press.
Content
The XML version was created as part of IUPAC project 2002-022-1-024:
Standard XML data dictionaries for chemistry and new content
and features are added as part of IUPAC project Enhancement of
the electronic version of the IUPAC Compendium of Chemical Terminology.
The content is based on the online PDF version of the IUPAC Gold Book that was hosted
by the Royal Society of Chemistry and mostly corresponded to the second edition, compiled
by Alan D. McNaught and Andrew Wilkinson (Royal Society of Chemistry, Cambridge, UK) and
published in print form by Blackwell Science in 1997. In the process of conversion
to XML format, many errors and inconsistencies were fixed. The XML version of the Gold Book also contains
more than 500 new entries added by Aubrey Jenkins after the publication of the last
printed version.
Main improvements from the previous versions
XML format enables generation of several different presentational outputs tailored to particular needs
improved indexes
navigational maps of dependence between terms
number of internal links increased by about 65%
both chemistry and mathematics captured in computer readable form
extensibility to further additions and/or incorporation of other materials
Status
The online version of the Gold Book is considered to be stable and of production quality.
We are well aware that no project of the size and complexity of the Gold Book can
ever be perfect, however, we are constantly working on improving it. Please don't hesitate
to send any comments or suggestions to the maintainer, Stuart Chalk.
Version history
2017-03-27: Release 2.3.3b.
This release is a stabilized version of the pages in 2.3.3.
No entries have been change, however page updates that have been made include
HTML 5 encoding on all pages
Removal of broken links/image references
New search function written in JavaScript
Google Analytics tracking has been added
Removal of the structure search, goldify and RSS feed functions
(these will be added back in the next revision)
The next revision will be a completely new version of the Gold Book website, with dynamically generated pages and new features,
see IUPAC Project 2016-046-1-024 for details.
The complete version history of releases and preview releases is available on a separate page.
Related software tools
In the most recent version, the Gold Book is accompanied by a suite of software tools
that enable the users to simply add links to the Gold Book to their online materials,
especially HTML. These tools are based on tools that are used internally in production of
the Gold Book.
The software tools are placed separately on SourceForge which allows for easier collaboration on the software. Please see the above page
for full documentation and download options. Any comment and/or improvements to
the code are most welcome.
Additional resources
In relation to the software tools described above, we release additional resource
files as part of the Gold Book.
The first one is a list of Gold Book terms and their corresponding IDs in XML format.
It is available under the name goldbook_terms.xml. This file can
be used either by the provided software tools or by users own tools.
Compatibility
All main features were tested and work in the following browsers: Firefox 3.0.8, Internet
Explorer 6.0, 7.0 and 8.0, Opera 9.22, Epiphany 2.24.3.
All pages on the IUPAC Gold Book website are valid XHTML 1.0 documents .
Software used in the Gold Book
The structure search (currently unavailable) page used the MarvinSketch applet by ChemAxon for drawing. The applet was provided under
the terms of the FreeWeb license (at the time of implementation).
On the server side, the structure search is implemented in a small custom module on
top of the OpenBabel library.
The following software was used to convert the PDF sources of IUPAC Gold Book to the
HTML form and the authors would therefore like to acknowledge their respective authors:
| | |
--- |
| SVGMath | Conversion of MathML to SVG |
| BKChem | Chemical drawing and generation of chemical indexes |
| Graphviz | Link analysis graphics |
| Cairo | Conversion of mathematical SVG to PNG |
| Batik | Conversion of general SVG to PNG |
| Saxon | XSLT processing |
| Python | General programming |
Please note that the software listed above is not in any way related to or endorsed by IUPAC.
Acknowledgements
The authors would like to acknowledge the help of Cheryl Wurzbacher, production editor
for Pure and Applied Chemistry,
who made the second release possible by very thoroughly going through the whole
Gold Book and reporting to us all the mistakes and errors that we made in the
first release. We would also like to acknowledge the help of Eva Dibuszova, the
head of ICT Press, with typographic and editorial issues.
Copyright
Copyright © 2005–2021 International Union of Pure and Applied Chemistry |
14174 | https://www.azom.com/article.aspx?ArticleID=18334 | Published Time: 2019-08-14T01:19:00-04:00
How Eddy Current Brakes Work
Skip to content
About
News
Articles
Directory
Equipment
Videos
Webinars
Interviews
More...
Metals Store
Journals
Software
Market Reports
Books
eBooks
Advertise
Contact
Newsletters
Search
Become a Member
Metals Store
Journals
Software
Market Reports
Books
eBooks
Advertise
Contact
Newsletters
Search
Become a Member
LinkedIn
Facebook
X
Instagram
Ask our AI Assistant
Search
Menu
Editorial Feature
How Eddy Current Brakes Work
Download PDF Copy
By Brett SmithAug 14 2019
Image Credits: Fouad A. Saad/shutterstock.com
Unlike mechanical brakes, which are based on friction and kinetic energy, eddy current brakes rely on electromagnetism to stop objects from moving.
Eddy currents are created when a conductor passes through a magnetic field, which creates opposing forces that spin inside the conductor. According to Lenz’s law, an eddy current produces a magnetic field that is in opposition to the magnetic field that produced it, and therefore eddy currents are an inverse response to the source magnetic field. This reaction between electromagnetic forces happens to be ideal for clean deceleration.
As a modern kind of technology, eddy current braking has numerous benefits over mechanical brakes. It is ideal for many kinds of machinery due to a lack of physical contact between components, which makes eddy current brakes very low-maintenance. The physical and economic advantages associated with eddy current brakes have made them a popular option among mechanical engineers.
Related Stories
Cold Work vs Hot Work in Steel: Understanding the Differences
Eddy Current Array (ECA) Theory, Practice and Application
What are the Applications of Eddy Currents?
The Advanced Materials Show - Highlights from 2022 eBook
Compilation of the top interviews, articles, and news in the last year.
Download a free copy
In one basic design for an eddy current brake, a non-ferromagnetic conductive disc rotates perpendicularly through a toroidal magnetic field. As the disc rotates, it induces eddy currents. Power is then dissipated throughout the disk to produce a braking torque force.
Electromagnets are commonly used for eddy current brakes, rather than permanent magnets, because the power of the magnetic field can be changed, and thus the braking effect as well. One major issue with eddy current brakes is that they cannot offer a “holding” torque. Therefore, they are often used in conjunction with standard mechanical brakes.
Eddy current brakes have numerous applications, a few examples of which are listed below.
Exercise Equipment
Probably the most typical eddy current brakes can be seen is in the gym. A lot of modern exercise equipment uses these low-maintenance brakes to vary resistance levels and eliminate potentially-harmful abrupt shifts in pace. The result is a safer, more enjoyable exercise experience.
Power Tools and Industrial Equipment
One of the main uses of eddy current breaks is for emergency shut-off purposes in industrial equipment and power tools. When triggered, eddy current brakes can safely bring a high-powered machine to a rapid stop.
Eddy current braking is also used in these types of machine even non-emergency situation, just to stop them from running.
Amusement Park Rides
Often seen in roller coasters and other amusement park rides, eddy current brakes are now essential to the modern amusement park experience.
The high-speed nature amusement park rides make for a lot of fun, but big heavy machines moving at high velocities need a very secure and safe braking system. In addition to providing a high level of safety, eddy currents also allow rides to switch direction and speed rapidly while maintaining safety for everybody on board.
By making use of the force generated of eddy currents, a roller coaster can automatically slow down over certain designated spots on the track. This braking system is normally used after a rollercoaster run or after the train goes through a big jump in speed. Because of the nature of eddy current brakes, the more rapidly a roller coaster is moving, the faster the brakes can slow it down.
Eddy current brakes are also great for amusement parks because they are not affected by weather and need very little maintenance.
High-Speed Trains
Eddy currents are a safe and sound method to slowing down a speeding train while delivering comfort and ease for riders. Through the use of this technology, commuter and even streetcar trains can safely achieve faster speeds and while maintaining higher safety levels.
Given that countries are increasingly seeking to address issues related to commuting and urban life, high-speed train travel is being seen as a way to accommodate greater demands on public transit systems.
Sources and Further Reading
Disclaimer: The views expressed here are those of the author expressed in their private capacity and do not necessarily represent the views of AZoM.com Limited T/A AZoNetwork the owner and operator of this website. This disclaimer forms part of the Terms and conditions of use of this website.
Written by
Brett Smith
Brett Smith is an American freelance writer with a bachelor’s degree in journalism from Buffalo State College and has 8 years of experience working in a professional laboratory.
Download PDF Copy
Citations
Please use one of the following formats to cite this article in your essay, paper or report:
APA
Smith, Brett. (2022, December 06). How Eddy Current Brakes Work. AZoM. Retrieved on August 24, 2025 from
MLA
Smith, Brett. "How Eddy Current Brakes Work". AZoM. 24 August 2025.
Chicago
Smith, Brett. "How Eddy Current Brakes Work". AZoM. (accessed August 24, 2025).
Harvard
Smith, Brett. 2022. How Eddy Current Brakes Work. AZoM, viewed 24 August 2025,
Comments
Tell Us What You Think
Do you have a review, update or anything you would like to add to this article?
Cancel reply to comment
Leave your feedback
Login
(Logout)
Your comment type
Public Comment
Private Feedback to AZoM.com
Submit
Latest interviews
Featured equipment
Trending stories
### Innovations in Battery Technology: From Failure Analysis to Vibrational Spectroscopy Dr. Sudhir Dahal and Hernan Sanchez This interview explores innovative battery technology advancements, highlighting vibrational spectroscopy's impact on performance, reliability, and safety. ### Expert Insights into Thin Film Metrology: Techniques & Best Practices Dr. Lyle Gordon and Dr. Max Junda Advances in thin film metrology are discussed by Dr. Max Junda and Dr. Lyle Gordon, highlighting measurement challenges and innovative characterization methods. ### Archaeometry: Unveiling the Past with Future-Ready Tools Mary Kate Donais Mary Kate Donais discusses the evolution of portable analytical devices in archaeometry, enhancing our understanding of cultural heritage through chemistry.
KLA-7 low-temperature flow tester for petroleum products
The Koehler KLA7 low-temperature flow tester enables precise low temperature flow testing of lubricants and fuels.
From LABEQUIP LTD
In-situ Nanomechanical Testing with Hysitron PI Envision
Discover Brukers's Hysitron PI Envision for all your nanomechanical testing needs.
From Bruker Nano Surfaces and Metrology
Verification for Measurement Devices with the ABB Ability™
ABB Ability™ Verification for measurement devices is an extensible application that connects with field devices over their applicable protocols.
From ABB
1New Smart Plastic to Revolutionize Aerospace and Automotive Industries
2EV NMC Battery Market to Reach USD 70.8 Billion by 2030, Driven by Rapid Electrification and High-Energy Density Demand | Valuates Reports
3Chill Without the Spill: UC Davis' Reusable 'Jelly Ice'
4New “Breathing” Crystal Could Advance Clean Energy and Smart Tech
5Novel Li-ion Additives Paving the Way for PFAS-Free Batteries
6Geologists Unlock Hidden Information Using Raman Spectroscopy and AI
Sponsored Content
Understanding Fugitive Emissions and Why They Matter
From Thermo Fisher Scientific – Environmental and Process Monitoring Instruments 22 Aug 2025
Replacing a Chart Recorder With Digital Data Logging Solutions
From AMETEK - Crystal Engineering 22 Aug 2025
Selecting Analytical Technologies for Polymer Testing and Recycling
From PerkinElmer 20 Aug 2025
Why Nondestructive Fruit Quality Testing Matters for Growers
From Avantes 18 Aug 2025
Editorial Highlights
The Current State of the Global Semiconductor Market
The global semiconductor market has entered an exciting period. Demand for chip technology is both driving the industry as well as hindering it, with current chip shortages predicted to last for some time. Current trends will likely shape the future of the industry, which is set to continue to show
How are Graphene Batteries Made?
The primary distinction between graphene-based batteries and solid-state batteries lies in the composition of either electrode. Although the cathode is commonly changed, carbon allotropes can also be employed in fabricating anodes.
What Role Will The IoT Play In The Electric Vehicle Industry?
In recent years, the IoT is rapidly being introduced into almost all sectors, but it has particular importance in the EV industry.
Newsletters you may be interested in
Additive Manufacturing (Subscribe or Preview)
Automotive (Subscribe or Preview)
Non-Destructive Testing (Subscribe or Preview)
See all Newsletters »
Your AI Powered Scientific Assistant
Hi, I'm Azthena, you can trust me to find commercial scientific answers from AZoNetwork.com.
To start a conversation, please log into your AZoProfile account first, or create a new account.
Registered members can chat with Azthena, request quotations, download pdf's, brochures and subscribe to our related newsletter content.
Log in
A few things you need to know before we start. Please read and accept to continue.
Use of “Azthena” is subject to the terms and conditions of use as set out by OpenAI.
Content provided on any AZoNetwork sites are subject to the site Terms & Conditions and Privacy Policy.
Large Language Models can make mistakes. Consider checking important information.
[x] I understand, and agree to receive occasional emails about Azthena such as usage tips and new feature announcements.
Please check the box above to proceed.
Start Chat
Great. Ask your question.
Clear Chat
Azthena may occasionally provide inaccurate responses.
Read the full terms.
Terms
While we only use edited and approved content for Azthena answers, it may on occasions provide incorrect responses. Please confirm any data provided with the related suppliers or authors. We do not provide medical advice, if you search for medical information you must always consult a medical professional before acting on any information provided.
Your questions, but not your email details will be shared with OpenAI and retained for 30 days in accordance with their privacy principles.
Please do not ask questions that use sensitive or confidential information.
Read the full Terms & Conditions.
Provide Feedback
Submit Cancel
Other Sites from AZoNetwork
AZoNano
AZoRobotics
AZoCleantech
AZoOptics
AZoBuild
AZoMining
AZoSensors
AZoQuantum
AZoAi
News Medical
AZoLifeSciences
Useful Links
News
Articles
Directory
Equipment
Books
eBooks
Videos
Events
Metals Store
Journals
Software
Webinars
Interviews
Market Reports
Materials
Applications
Industries
AZojomo
Podcasts
Experts
Help/FAQs
The Team
About
Search
Become a Member
Newsletters
Contact
Advertise
Terms & Conditions
Privacy & Cookie Policy
Sitemap
Content Policy
Ownership & Funding Information
back to top
LinkedIn
Facebook
X
Instagram
AZoM.com - An AZoNetwork Site
Owned and operated by AZoNetwork, © 2000-2025
Update Your Privacy Preferences |
14175 | https://www.quora.com/How-do-I-find-the-limiting-reagent-if-Im-given-the-molarity-mol-L-of-one-of-the-reactants-i-e-where-does-the-molarity-come-into-question | How to find the limiting reagent if I'm given the molarity (mol/L) of one of the reactants (i.e. where does the molarity come into question) - Quora
Something went wrong. Wait a moment and try again.
Try again
Skip to content
Skip to search
Sign In
Chemistry
Limiting Reactant
Stichometry
Molarity and Molality
Chemical Process Calculat...
Chemical Reactions
Reactants
Excess and Limiting Reage...
Stoichiometric Calculatio...
5
How do I find the limiting reagent if I'm given the molarity (mol/L) of one of the reactants (i.e. where does the molarity come into question)?
7 Answers
Sort
Recommended
Eric Ressner
Ph.D. in Medicinal Chemistry, University of Kansas (Graduated 1974) · Author has 6K answers and 7.8M answer views
·4y
How do I find the limiting reagent if I'm given the molarity (mol/L) of one of the reactants (i.e. where does the molarity come into question)?
While I fully agree with both Trevor Hodgson and Jaleel Ali that Quora questioners all too often omit details that are essential for rendering aid …
I can bring myself to applaud the original questioner here for — if I understand the motivation — asking for minimal assistance when they already understand most of the path to a solution.
So here, I am assuming that OP Magne Smith knows in general how to handle limiting-reactant problems, but was just thrown
Continue Reading
How do I find the limiting reagent if I'm given the molarity (mol/L) of one of the reactants (i.e. where does the molarity come into question)?
While I fully agree with both Trevor Hodgson and Jaleel Ali that Quora questioners all too often omit details that are essential for rendering aid …
I can bring myself to applaud the original questioner here for — if I understand the motivation — asking for minimal assistance when they already understand most of the path to a solution.
So here, I am assuming that OP Magne Smith knows in general how to handle limiting-reactant problems, but was just thrown by the molarity in the question. And on that assumption, I would reply…
There are many ways the data in a stoichiometry problem can be provided. You must keep in mind that it is always the aim to convert all given quantities to moles. So…
if you are given mass of a pure reactant, you convert to moles using molar mass
if you are given density and volume of a pure liquid, you get mass by multiplying density x volume, and then #1
if you are given volume of a gaseous reactant, and have hints to both pressure and temperature, you use the ideal gas equation to find moles
if you are given concentration (molarity) and volume of a reactant in solution, you multiply volume (in L) by molarity to find moles
if you are given the concentration in some other units (e.g., % by mass — which can be stated as a purity percentage — % by volume, ppm, molality), there are too many possibilities here to address them all in detail, but you should still understand: from here, you must find moles of the indicated reactant, and you may need additional information, such as the density of the solution, to get there
Yes, that is how I would have answered, if I had chosen to answer the question.
Upvote ·
9 1
Promoted by HP
HP Tech Takes
Tech Enthusiast | Insights, Tips & Guidance
·Updated Sep 18
What are the pros and cons of getting an expensive laser printer like HP versus a cheap but good quality inkjet/multi-function machine like Canon Pixma MX490?
Choosing between an expensive laser printer and a more affordable inkjet or multi-function machine ultimately depends on your printing habits, the type of documents you produce, and your long-term budget. Laser printers and inkjet printers serve different purposes, and understanding their strengths and limitations can help you make a more informed decision. Laser printers are typically designed for speed and efficiency, making them ideal for office environments or users who print frequently. Inkjet and ink tank printers are slower but they offer excellent colour reproduction and are often more
Continue Reading
Choosing between an expensive laser printer and a more affordable inkjet or multi-function machine ultimately depends on your printing habits, the type of documents you produce, and your long-term budget. Laser printers and inkjet printers serve different purposes, and understanding their strengths and limitations can help you make a more informed decision. Laser printers are typically designed for speed and efficiency, making them ideal for office environments or users who print frequently. Inkjet and ink tank printers are slower but they offer excellent colour reproduction and are often more compact and affordable upfront.
If your printing needs are frequent and primarily text-based, a laser printer such as the HP Color Laser 179fnw or the HP LaserJet M234sdw would be a strong choice. These models deliver fast print speeds and sharp text output. Toner cartridges used in these printers last significantly longer than ink cartridges, resulting in a lower cost per page over time. Although the initial investment is higher, the long-term savings and reliability could make them well-suited for your business use or heavy personal workloads.
LaserJet Printers - Black & White or Color Document Printers
Alternatively, if your printing volume is low to moderate and you value colour accuracy for photos or creative projects, an ink-based solution like the HP Smart Tank 7605 or HP Smart Tank 5105 may be more convenient. These printers offer refillable ink tanks that reduce running costs compared to traditional cartridge-based inkjets. They are also compact and versatile, supporting scanning and copying functions in addition to printing. However, they require occasional maintenance to prevent ink from drying out or clogging, and their print speed is generally slower than laser models.
HP Smart Tank Printers – Refillable Ink Tank Printers
So to break it down, if you prioritise speed, durability, and cost-efficiency for high-volume printing, a laser printer from HP’s 200 or 3000 series is the better investment. On the other hand, if your needs include occasional printing with a focus on colour and photo output, HP’s Smart Tank series provides a more economical and flexible alternative. The right choice will depend on how often you print and what kind of documents you’re producing.
Check out the blog linked below to learn more about the different models and which is best for your printing needs, hope this helps!
Inkjet vs LaserJet vs OfficeJet: HP Printer Buying Guide
By Lizzie - HP Tech Expert
Upvote ·
999 112
99 33
9 4
Related questions
More answers below
40 cm 3 of a solution of sodium hydroxide is exactly neutralised by 25 cm 3 of 0.40 mol L –1 sulfuric acid. 2NaOH + H 2 SO 4 → Na 2 SO 4 + 2H 2 O What is the concentration, in g /L of NaOH?
What are orthodontic molar tubes?
How do I prepare 0.1 molar solution in 1000ml?
How do you make a one-molar acid solution from a half-molar acid solution?
What is 1 molar NaOH?
Trevor Hodgson
Knows English · Author has 11.8K answers and 12.3M answer views
·4y
Jaleel Ali is totally correct .
The second response from the anonymous author illustrates so well the constant problem in Quora and other similar fora. Those subscribers wanting help seem unable to submit the data sufficient to enable others to help them . I have failed - over many years of subscribing to Quora and other sites - to understand why there is this reluctance to provide the complete original question . If only , at the first submission - the asker had submitted :
Can somebody help me with this problem :
2HCl(aq) + CaCO3(s) → CO2(g) + H2O(l) + CaCl2(aq)
If the student used 40cm3 of 2.5
Continue Reading
Jaleel Ali is totally correct .
The second response from the anonymous author illustrates so well the constant problem in Quora and other similar fora. Those subscribers wanting help seem unable to submit the data sufficient to enable others to help them . I have failed - over many years of subscribing to Quora and other sites - to understand why there is this reluctance to provide the complete original question . If only , at the first submission - the asker had submitted :
Can somebody help me with this problem :
2HCl(aq) + CaCO3(s) → CO2(g) + H2O(l) + CaCl2(aq)
If the student used 40cm3 of 2.5 mol dm-3 HCl and 5.67g of CaCO3, determine which was the limiting reagent and thus how much CO2(g) that could be theoretically produced in this reaction.
Instead of submitting one isolated value of the problem completely out of context.
Now the problem is solvable
From the balanced equation :
2 mol HCl react with 1 mol CaCO3
Molar mass CaCO3 = 100 g/mol
Mol CaCO3 in 5.67 g = 5.67 g / 100 g/mol = 0.0567 mol
This will react with 0.05672 = 0.1134 mol HCl
Mol HCl in 40 cm³ of 2.5 M HCl solution
Mol HCl = 40 cm³ / 1000 cm³/dm³ 2.5 mol /dm³ = 0.10 mol HCl
You have insufficient HCl to react with all the CaCO3 .
The HCl is limiting
How much CO2 produced ?
I have to assume that you want mass of CO2
From the equation:
2 mol HCl produce 1 mol CO2
0.1 mol HCl will produce 0.1 mol / 2 = 0.05 mol CO2
Molar mass CO2 = 44 g/mol
Mass of 0.05 mol CO2 = 0.05 mol 44 g/mol = 2.2 g CO2 produced.
Upvote ·
9 1
9 2
Assistant
Bot
·
1y
To find the limiting reagent in a chemical reaction when you are given the molarity of one of the reactants, follow these steps:
Steps to Determine the Limiting Reagent
Write the Balanced Chemical Equation: Ensure you have the balanced equation for the reaction. This will provide the stoichiometric ratios of the reactants.
Example:
a A+b B→c C+d D a A+b B→c C+d D
2. Convert Molarity to Moles: If you have the molarity (M) of one of the reactants, you need to convert it to moles. You can do this using the formula:
moles=molarity×volume (L)moles=molarity×volume (L)
Make sure to use the vo
Continue Reading
To find the limiting reagent in a chemical reaction when you are given the molarity of one of the reactants, follow these steps:
Steps to Determine the Limiting Reagent
Write the Balanced Chemical Equation: Ensure you have the balanced equation for the reaction. This will provide the stoichiometric ratios of the reactants.
Example:
a A+b B→c C+d D a A+b B→c C+d D
2. Convert Molarity to Moles: If you have the molarity (M) of one of the reactants, you need to convert it to moles. You can do this using the formula:
moles=molarity×volume (L)moles=molarity×volume (L)
Make sure to use the volume of the solution in liters.
3. Calculate Moles of All Reactants: If you have the molarity and volume for one reactant, do the same for the other reactants if their concentrations or volumes are given. Use the same formula for each reactant.
4. Use Stoichiometry to Compare Moles: Using the balanced equation, compare the moles of each reactant based on their stoichiometric coefficients.
For example, if the balanced equation shows that 1 mole of A reacts with 2 moles of B, then for every mole of A, you need 2 moles of B.
Identify the Limiting Reagent:
Calculate how many moles of each reactant are required to completely react with the available amount of the other reactants.
The limiting reagent is the reactant that will be completely consumed first, thus limiting the amount of product formed.
Example Calculation
Given:
Reaction: 2 H 2+O 2→2 H 2 O 2 H 2+O 2→2 H 2 O
Molarity of H 2 H 2: 3.0 M
Volume of H 2 H 2: 2.0 L
Molarity of O 2 O 2: 1.5 M
Volume of O 2 O 2: 1.0 L
Steps:
Find moles of H 2 H 2:
moles of H 2=3.0 mol/L×2.0 L=6.0 moles moles of H 2=3.0 mol/L×2.0 L=6.0 moles
2. Find moles of O 2 O 2:
moles of O 2=1.5 mol/L×1.0 L=1.5 moles moles of O 2=1.5 mol/L×1.0 L=1.5 moles
3. Use stoichiometry:
From the balanced equation, 2 2 moles of H 2 H 2 react with 1 1 mole of O 2 O 2.
For 6.0 6.0 moles of H 2 H 2, you need:
6.0 moles H 2 2=3.0 moles O 2 6.0 moles H 2 2=3.0 moles O 2
You only have 1.5 1.5 moles of O 2 O 2.
Identify the limiting reagent:
Since you need 3.0 3.0 moles of O 2 O 2 but only have 1.5 1.5 moles, O 2 O 2 is the limiting reagent.
Conclusion
To summarize, use molarity and volume to find moles, then apply stoichiometry from the balanced equation to determine the limiting reagent.
Upvote ·
Gloria Dumaliang
Chemistry/Physics Professor (2016–present) · Author has 1.2K answers and 735.4K answer views
·1y
What is the mole ratio and how do you calculate the limiting reagent from it?
Originally Answered: What is the mole ratio and how do you calculate the limiting reagent from it? ·
To get the Mole ratio of the reactants and products the first step is o balance first the chemical equation of the chemical reaction given.
The next step get the mole ratio based from the coefficients from the reactants and products .
ex. 2Al + 3S → Al2 S3
Mole ratio: 2 moles Al + 3 moles S —-> 1 mole Al2S3
Limiting reactant - is the reactant in short supply. It determines the amount of the product.
To calculate the limiting reactant there should be given masses or number of moles from the two reactants, then solve the amount of each reactant from the masses/moles given. The limiting reactant is
Continue Reading
To get the Mole ratio of the reactants and products the first step is o balance first the chemical equation of the chemical reaction given.
The next step get the mole ratio based from the coefficients from the reactants and products .
ex. 2Al + 3S → Al2 S3
Mole ratio: 2 moles Al + 3 moles S —-> 1 mole Al2S3
Limiting reactant - is the reactant in short supply. It determines the amount of the product.
To calculate the limiting reactant there should be given masses or number of moles from the two reactants, then solve the amount of each reactant from the masses/moles given. The limiting reactant is determined if the mass or mole obtained from the computation is greater than the given mass or mole.
Upvote ·
Related questions
More answers below
How do we prepare 0.5 molar of 1000 ml from a 1 molar solution?
What is the molarity of 40g NaOH dissolved in a 250ml solution?
When 10ml of 1 molar NaOH reacts with 100ml of 10 molar H2SO4, is the resultant solution acidic or basic?
How do molar crowns work?
What is the molarity of a concentrated NaOH solution?
Jaleel Ali
Author has 684 answers and 366.9K answer views
·4y
You can’t find a limiting reactant with only one reactant, unless you assume that the one quantity you are given is the LR. The information you provide is insuffient to solve the problem. Given the molarity you also need its volume in order to calculate the moles.
Upvote ·
9 1
9 1
Sponsored by Avnet Silica
We're at the Pulse of the Market.
Tap into emerging tech and market insights to stay informed, reduce risk, and make better decisions.
Learn More
Anonymous
4y
Here is the problem since my question is so vague:
2HCl(aq) + CaCO3(s) → CO2(g) + H2O(l) + CaCl2(aq)
If the student used 40cm3 of 2.5 mol dm-3 HCl and 5.67g of CaCO3, determine which was the limiting reagent and thus how much CO2(g) that could be theoretically produced in this reaction.
Upvote ·
Guy Clentsmith
Inorganic chemist ...M. Sc., Ph. D., PGCE · Author has 26.5K answers and 19.7M answer views
·3y
How do I find a limiting reagent with moles?
Originally Answered: How do I find a limiting reagent with moles? ·
Well, you write a stoichiometric equation that represents the reaction under study…say the combustion of hexanes in the internal combustion engine…
C 6 H 14(l)+19 2 O 2(g)⟶6 C O 2(g)+7 H 2 O(l)+Δ C 6 H 14(l)+19 2 O 2(g)⟶6 C O 2(g)+7 H 2 O(l)+Δ
(INCOMPLETE combustion to C O(g)C O(g) and carbon as soot is also possible….)
Now in the scenario, CLEARLY, the hexanes is the limiting reagent …. i.e. it is limited by the amount of hexanes in the fuel tank … on the other hand, dioxygen is present in LARGE quantities in the air…
We assess the limiting reagent limiting reagent on a case by case basis…and note that the energy produced
Continue Reading
Well, you write a stoichiometric equation that represents the reaction under study…say the combustion of hexanes in the internal combustion engine…
C 6 H 14(l)+19 2 O 2(g)⟶6 C O 2(g)+7 H 2 O(l)+Δ C 6 H 14(l)+19 2 O 2(g)⟶6 C O 2(g)+7 H 2 O(l)+Δ
(INCOMPLETE combustion to C O(g)C O(g) and carbon as soot is also possible….)
Now in the scenario, CLEARLY, the hexanes is the limiting reagent …. i.e. it is limited by the amount of hexanes in the fuel tank … on the other hand, dioxygen is present in LARGE quantities in the air…
We assess the limiting reagent limiting reagent on a case by case basis…and note that the energy produced by the reaction is ALSO a stoichiometry quantity, and is quoted with units of k J∙m o l−1 k J•m o l−1, i.e. moles of reaction as written moles of reaction as written ….
Upvote ·
Sponsored by Grammarly
92% of professionals who use Grammarly say it has saved them time
Work faster with AI, while ensuring your writing always makes the right impression.
Download
999 209
Related questions
40 cm 3 of a solution of sodium hydroxide is exactly neutralised by 25 cm 3 of 0.40 mol L –1 sulfuric acid. 2NaOH + H 2 SO 4 → Na 2 SO 4 + 2H 2 O What is the concentration, in g /L of NaOH?
What are orthodontic molar tubes?
How do I prepare 0.1 molar solution in 1000ml?
How do you make a one-molar acid solution from a half-molar acid solution?
What is 1 molar NaOH?
How do we prepare 0.5 molar of 1000 ml from a 1 molar solution?
What is the molarity of 40g NaOH dissolved in a 250ml solution?
When 10ml of 1 molar NaOH reacts with 100ml of 10 molar H2SO4, is the resultant solution acidic or basic?
How do molar crowns work?
What is the molarity of a concentrated NaOH solution?
What is the molar analytical concentration of solute when 2.500g of K2Cr207 as primary standard reagents is dissolved and diluted to 500.0 mL?
How does one calculate the amount of 1.o molar NaOH solution required to prepare 200ml of 0.2 molar solution?
Which is the limiting reactant if given 6 mol of Cl2 and 3 mol of H2?
What will be the concentration of OH- ions in molar if 185 mg Ca(OH) 2 molar mass 74g/mol and 200 mg of NaOH molar mass 40g/mol are present in 500 ml of aqueous solution?
What is the preparation of a standard molar solution?
Related questions
40 cm 3 of a solution of sodium hydroxide is exactly neutralised by 25 cm 3 of 0.40 mol L –1 sulfuric acid. 2NaOH + H 2 SO 4 → Na 2 SO 4 + 2H 2 O What is the concentration, in g /L of NaOH?
What are orthodontic molar tubes?
How do I prepare 0.1 molar solution in 1000ml?
How do you make a one-molar acid solution from a half-molar acid solution?
What is 1 molar NaOH?
How do we prepare 0.5 molar of 1000 ml from a 1 molar solution?
Advertisement
About · Careers · Privacy · Terms · Contact · Languages · Your Ad Choices · Press ·
© Quora, Inc. 2025
Privacy Preference Center
When you visit any website, it may store or retrieve information on your browser, mostly in the form of cookies. This information might be about you, your preferences or your device and is mostly used to make the site work as you expect it to. The information does not usually directly identify you, but it can give you a more personalized web experience. Because we respect your right to privacy, you can choose not to allow some types of cookies. Click on the different category headings to find out more and change our default settings. However, blocking some types of cookies may impact your experience of the site and the services we are able to offer.
More information
Allow All
Manage Consent Preferences
Strictly Necessary Cookies
Always Active
These cookies are necessary for the website to function and cannot be switched off in our systems. They are usually only set in response to actions made by you which amount to a request for services, such as setting your privacy preferences, logging in or filling in forms. You can set your browser to block or alert you about these cookies, but some parts of the site will not then work. These cookies do not store any personally identifiable information.
Performance Cookies
Always Active
These cookies allow us to count visits and traffic sources so we can measure and improve the performance of our site. They help us to know which pages are the most and least popular and see how visitors move around the site. All information these cookies collect is aggregated and therefore anonymous. If you do not allow these cookies we will not know when you have visited our site, and will not be able to monitor its performance.
Functional Cookies
Always Active
These cookies enable the website to provide enhanced functionality and personalisation. They may be set by us or by third party providers whose services we have added to our pages. If you do not allow these cookies then some or all of these services may not function properly.
Targeting Cookies
Always Active
These cookies may be set through our site by our advertising partners. They may be used by those companies to build a profile of your interests and show you relevant adverts on other sites. They do not store directly personal information, but are based on uniquely identifying your browser and internet device. If you do not allow these cookies, you will experience less targeted advertising.
Cookie List
Clear
[x] checkbox label label
Apply Cancel
Consent Leg.Interest
[x] checkbox label label
[x] checkbox label label
[x] checkbox label label
Reject All Confirm My Choices |
14176 | http://ganitcharcha.com/view-article-The-Hidden-Power-of-Componendo-Dividendo-in-Solving-Ratio-and-Proportion-Problems.html | The Hidden Power of Componendo-Dividendo in Solving Ratio and Proportion Problems
Loading [MathJax]/extensions/MathZoom.js
info@ganitcharcha.com
Toggle navigation
Home
About
Event
Magazine
Magazine Info
Subscribe Magazine
Book A Class
Preparing Math Mind
Ask For A Solution
Quiz
Gallery
Review
Offering
Book A Class
Preparing Math Mind
Ask For A Solution
Publication
All
Math Articles
Math News
Digital Magazine
Advanced Math Articles
Maths and Technology
Mathematics and Computation
Math Events
Middle School Math Topics
High School Math Topics
Contact
The Hidden Power of Componendo-Dividendo in Solving Ratio and Proportion Problems
Published by Ganit Charcha | Category - High School Math Topics | 2025-08-19 01:09:09
0 0
Rate this
Introduction:
In the world of algebraic shortcuts, Componendo and Dividendo stands out as a powerful tool for simplifying complex ratios and solving problems efficiently. Whether you're preparing for competitive exams or just brushing up your math skills, mastering this concept can give you a real edge. To refresh your understanding before diving into the solved problems below, we highly recommend watching this quick and clear explainer video: It’s a great way to revisit the fundamentals and build confidence before tackling the examples!
Selected Problems on Ratio-Proportion with Solutions
Problem 1
If , then show that
(i)
(ii)
(iii)
Solutions:
(i) Let .
Then . [Multiplying both sides by a b]
Using componendo-dividendo, we then get
a 2+b 2 a 2−b 2=a c+b d a c−b d
(ii) Again,
Componendo gives,
a 2+b 2 b 2=c 2+d 2 d 2 (1)
Also,
Multiplying (1) and (2), we get
a 2+b 2 a b=c 2+d 2 c d
Thus, by componendo and dividendo, we have
a 2+a b+b 2 a 2−a b+b 2=c 2+c d+d 2 c 2−c d+d 2
(iii) Let
Then,
a 2+c 2√b 2+d 2√=b 2 k 2+d 2 k 2√b 2+d 2√=k b 2+d 2√b 2+d 2√=k
And,
p a+q c p b+q d=p(b k)+q(d k)p b+q d=k
Hence proven.
Problem 2
If , then prove that,}
(i)
(ii)
(iii)
Solutions:
Let
(i)
x 3 a 3+y 3 b 3+z 3 c 3=a 3 k 3 a 3+b 3 k 3 b 3+c 3 k 3 c 3=k 3
(x+y+z a+b+c)3=(a k+b k+c k a+b+c)3=(k(a+b+c)a+b+c)3=k 3
Hence, LHS = RHS.
(ii)
x 3+y 3+z 3 a 3+b 3+c 3=k 3(a 3+b 3+c 3)a 3+b 3+c 3=k 3
x y z a b c=(a k)(b k)(c k)a b c=k 3 a b c a b c=k 3
Hence, LHS = RHS.
(iii)
Since , we have:
x 2=a 2 k 2,y 2=b 2 k 2,z 2=c 2 k 2
So,
x 2+y 2+z 2=k 2(a 2+b 2+c 2)
Also,
a x+b y+c z=a(a k)+b(b k)+c(c k)=k(a 2+b 2+c 2)
Thus,
(a x+b y+c z)2=k 2(a 2+b 2+c 2)2
And,
(a 2+b 2+c 2)(x 2+y 2+z 2)=k 2(a 2+b 2+c 2)2
Hence, LHS = RHS.
Problem 3
If , prove the following:
(i)
(ii)
(iii)
Solutions:
Let
(i)
LHS =(a+b b+c)2=(b k+c k c k+c)2=((b+c)k b+c)2=k 2
RHS = a 2+b 2 b 2+c 2=(c k 2)2+(c k)2(c k)2+c 2=c 2 k 2(k 2+1)c 2(k 2+1)=k 2
Hence, LHS = RHS.
(ii)}
LHS = a 2 b 2 c 2(1 a 3+1 b 3+1 c 3)=(c k 2)2(c k)2 c 2(1(c k 2)3+1(c k)3+1 c 3)
= c 6 k 6(1 c 3 k 6+1 c 3 k 3+1 c 3)=c 3+c 3 k 3+c 3 k 6=(c k 2)3+(c k)3+c 3
And this simplifies to:
=a 3+b 3+c 3
(iii)
Given
Then, we have
a b c=b k⋅c k⋅c=c 3 k 3
a+b+c=b k+c k+c=c(k 2+k+1)⇒(a+b+c)3=c 3(k 2+k+1)3
a b+b c+c a=b k⋅c k+c k⋅c+c⋅b k=c 2 k 3+c 2 k+c 2 k=c 2 k(k 2+1+k)=c 2 k(k 2+k+1)
⇒(a b+b c+c a)3=c 6 k 3(k 2+k+1)3
Hence,
a b c(a+b+c)3 a b+b c+c a)3=c 3 k 3⋅c 3((k 2+k+1)3 c 6 k 3(k 2+k+1)3=1
Problem 4
If x l m−n 2=y m n−l 2=z n l−m 2, then prove that l x+m y+n z=0.
Solution:
Since, x l m−n 2=y m n−l 2=z n l−m 2 then,
Denominator of the last ratio is 0, so, multiplying this denominator with any other ratio, we have
l x+m y+n z=0⋅n z n 2 l−n m 2⇒l x+m y+n z=0.
Problem 5
If x b+c−a=y c+a−b=z a+b−c, then prove that (b−c)x+(c−a)y+(a−b)z=0.
Solution:
Let the common ratio be . This implies,
Then, we have
(b−c)x=k(b−c)(b+c−a)=k(b 2−c 2)−k(a b−a c)
(c−a)y=k(c−a)(c+a−b)=k(c 2−a 2)−k(b c−a b)
(a−b)z=k(a−b)(a+b−c)=k(a 2−b 2)−k(a c−b c)
Add all the three eualities, we get
(b−c)x+(c−a)y+(a−b)z=k(b 2−c 2+c 2−a 2+a 2−b 2)−k(a b−a c+b c−a b+a c−b c)=0
Problem 6
If , then prove that
.
Solution:
Given,
[This happens because,
]
[Applying Addendo successively on the pairs (1st, 2nd)-terms, then (3rd, 4th)-terms and (5th, 6th)-terms]
Problem 7
If , then find the value of .
Solution:
Since, , this implies .
Applying, componendo-dividendo, we get
.
Similarly, , implies .
Applying, componendo-dividendo, we get
.
Adding, we get
Problem 8If , then prove that.
Solution:Given, x+y 3 a−b=y+z 3 b−c=z+x 3 c−a
Implies x+y 3 a−b=y+z 3 b−c=z+x 3 c−a= x+y+z a+b+c [By Applying Addendo]
Similarly, x+y 3 a−b=y+z 3 b−c=z+x 3 c−a implies
x+y 3 a−b=y+z 3 b−c=z+x 3 c−a=(x+y)+(y+z)−(z+x)(3 a−b)+(3 b−c)−(−3 c−a)=(y+z)+(z+x)−(x+y)(3 b−c)+(3 c−a)−(−3 a−b)=(z+x)+(x+y)−(y+z)(3 c−a)+(3 a−b)−(−3 b−c)
This further implies,
x+y 3 a−b=y+z 3 b−c=z+x 3 c−a=y 2 a+b−2 c=z 2 b+c−2 a=x 2 c+a−2 b
=>x+y 3 a−b=y+z 3 b−c=z+x 3 c−a=b y 2 a b+b 2−2 b c=c z 2 b c+c 2−2 a c=a x 2 a c+a 2−2 a b=a x+b y+c z a 2+b 2+c 2 [Applying Addendo on on last 3 ratios]
Therefore, each ratio given in the problem is equal to both x+y+z a+b+c and a x+b y+c z a 2+b 2+c 2.
Therfore, x+y+z a+b+c=a x+b y+c z a 2+b 2+c 2.
Publication Pages
All
Math Articles
Math News
Digital Magazine
Advanced Math Articles
Maths and Technology
Mathematics and Computation
Math Events
Middle School Math Topics
High School Math Topics
Publication Archive
Discover more
mathematics
GanitCharcha
Ganit Charcha
mathematical
Mathematics
math
Math
Subscribe GanitCharcha Magazine
Subscribe Now
Join us
© GanitCharcha 2025 Design and Developed by Xzen
EnquireWhatsappCall
Call Enquire Whatsapp |
14177 | https://artofproblemsolving.com/wiki/index.php/Miquel%27s_point?srsltid=AfmBOopZ9qrpKjKaxi2CrLo0quQMvh5zN06jpFNkRJ3U00B9sujn6tHj | Art of Problem Solving
Miquel's point - AoPS Wiki
Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical CampusVisit the Virtual Campus
Sign In
Register
online school
Class ScheduleRecommendationsOlympiad CoursesFree Sessions
books tore
AoPS CurriculumBeast AcademyOnline BooksRecommendationsOther Books & GearAll ProductsGift Certificates
community
ForumsContestsSearchHelp
resources
math training & toolsAlcumusVideosFor the Win!MATHCOUNTS TrainerAoPS Practice ContestsAoPS WikiLaTeX TeXeRMIT PRIMES/CrowdMathKeep LearningAll Ten
contests on aopsPractice Math ContestsUSABO
newsAoPS BlogWebinars
view all 0
Sign In
Register
AoPS Wiki
ResourcesAops Wiki Miquel's point
Page
ArticleDiscussionView sourceHistory
Toolbox
Recent changesRandom pageHelpWhat links hereSpecial pages
Search
Miquel's point
Contents
[hide]
1 Miquel and Steiner's quadrilateral theorem
2 Circle of circumcenters
3 Triangle of circumcenters
4 Analogue of Miquel's point
5 Six circles crossing point
Miquel and Steiner's quadrilateral theorem
Let four lines made four triangles of a complete quadrilateral. In the diagram these are
Prove that the circumcircles of all four triangles meet at a single point.
Proof
Let circumcircle of circle cross the circumcircle of circle at point
Let cross second time in the point
is cyclic
is cyclic
is cyclic
is cyclic and circumcircle of contain the point
Similarly circumcircle of contain the point as desired.
vladimir.shelomovskii@gmail.com, vvsss
Circle of circumcenters
Let four lines made four triangles of a complete quadrilateral. In the diagram these are
Prove that the circumcenters of all four triangles and point are concyclic.
Proof
Let and be the circumcircles of and respectively.
In
In
is the common chord of and
Similarly, is the common chord of and
Similarly, is the common chord of and
points and are concyclic as desired.
vladimir.shelomovskii@gmail.com, vvsss
Triangle of circumcenters
Let four lines made four triangles of a complete quadrilateral.
In the diagram these are
Let points and be the circumcenters of and respectively.
Prove that and perspector of these triangles point is the second (different from ) point of intersection where is circumcircle of and is circumcircle of
Proof
Quadrungle is cyclic
Spiral similarity sentered at point with rotation angle and the coefficient of homothety mapping to , to , to
are triangles in double perspective at point
These triangles are in triple perspective are concurrent at the point
The rotation angle to is for sides and or angle between and which is is cyclic is cyclic.
Therefore is cyclic as desired.
Similarly, one can prove that
Double perspective triangles
vladimir.shelomovskii@gmail.com, vvsss
Analogue of Miquel's point
Let inscribed quadrilateral and
points be given.
Prove that points and are concyclic.
Proof
Corollary
The points and are concyclic.
The points and are concyclic.
vladimir.shelomovskii@gmail.com, vvsss
Six circles crossing point
Let point point be given.
Denote tangent to tangent to
Prove that the circles and have the common point.
Proof
Let points and are concyclic, Similarly is the Miquel point of quadrungle is tangent to Similarly, is tangent to
vladimir.shelomovskii@gmail.com, vvsss
Retrieved from "
Art of Problem Solving is an
ACS WASC Accredited School
aops programs
AoPS Online
Beast Academy
AoPS Academy
About
About AoPS
Our Team
Our History
Jobs
AoPS Blog
Site Info
Terms
Privacy
Contact Us
follow us
Subscribe for news and updates
© 2025 AoPS Incorporated
© 2025 Art of Problem Solving
About Us•Contact Us•Terms•Privacy
Copyright © 2025 Art of Problem Solving
Something appears to not have loaded correctly.
Click to refresh. |
14178 | https://flexbooks.ck12.org/cbook/ck-12-algebra-i-concepts-honors/section/10.14/related/lesson/composition-of-transformations-bsc-geom/ | Composition of Transformations | CK-12 Foundation
AI Teacher Tools – Save Hours on Planning & Prep.
Try it out!
Skip to content
What are you looking for? Search
Math
Grade 6
Grade 7
Grade 8
Algebra 1
Geometry
Algebra 2
PreCalculus
Science
Earth Science
Life Science
Physical Science
Biology
Chemistry
Physics
Social Studies
Economics
Geography
Government
Philosophy
Sociology
Subject
Math
Elementary Math
Grade 1
Grade 2
Grade 3
Grade 4
Grade 5
Interactive
Math 6
Math 7
Math 8
Algebra I
Geometry
Algebra II
Conventional
Math 6
Math 7
Math 8
Algebra I
Geometry
Algebra II
Probability & Statistics
Trigonometry
Math Analysis
Precalculus
Calculus
What's the difference?
Science
Grade K to 5
Earth Science
Life Science
Physical Science
Biology
Chemistry
Physics
Advanced Biology
FlexLets
Math FlexLets
Science FlexLets
English
Writing
Spelling
Social Studies
Economics
Geography
Government
History
World History
Philosophy
Sociology
More
Astronomy
Engineering
Health
Photography
Technology
College
College Algebra
College Precalculus
Linear Algebra
College Human Biology
The Universe
Adult Education
Basic Education
High School Diploma
High School Equivalency
Career Technical Ed
English as 2nd Language
Country
Bhutan
Brasil
Chile
Georgia
India
Translations
Spanish
Korean
Deutsch
Chinese
Greek
Polski
Explore
EXPLORE
Flexi A FREE Digital Tutor for Every Student
FlexBooks 2.0 Customizable, digital textbooks in a new, interactive platform
FlexBooks Customizable, digital textbooks
Schools FlexBooks from schools and districts near you
Study Guides Quick review with key information for each concept
Adaptive Practice Building knowledge at each student’s skill level
Simulations Interactive Physics & Chemistry Simulations
PLIX Play. Learn. Interact. eXplore.
CCSS Math Concepts and FlexBooks aligned to Common Core
NGSS Concepts aligned to Next Generation Science Standards
Certified Educator Stand out as an educator. Become CK-12 Certified.
Webinars Live and archived sessions to learn about CK-12
Other Resources
CK-12 Resources
Concept Map
Testimonials
CK-12 Mission
Meet the Team
CK-12 Helpdesk
FlexLets
Know the essentials.
Pick a Subject
Donate
Sign InSign Up
Back To Order of Composite TransformationsBack
10.14
Composition of Transformations
Written by:Dan Greenberg |Lori Jordan | +4 more
Fact-checked by:The CK-12 Editorial Team
Last Modified: Sep 01, 2025
Transformations Summary
A transformation is an operation that moves, flips, or otherwise changes a figure to create a new figure. A rigid transformation (also known as an isometry or congruence transformation) is a transformation that does not change the size or shape of a figure. The new figure created by a transformation is called the image. The original figure is called the preimage.
There are three rigid transformations: translations, rotations and reflections. A translation is a transformation that moves every point in a figure the same distance in the same direction. A rotation is a transformation where a figure is turned around a fixed point to create an image. A reflection is a transformation that turns a figure into its mirror image by flipping it over a line.
Composition of Transformations
A composition (of transformations) is when more than one transformation is performed on a figure. Compositions can always be written as one rule. You can compose any transformations, but here are some of the most common compositions:
A glide reflection is a composition of a reflection and a translation. The translation is in a direction parallel to the line of reflection.
The composition of two reflections over parallel lines that are h units apart is the same as a translation of 2 h units (Reflections over Parallel Lines Theorem).
If you compose two reflections over each axis, then the final image is a rotation of 180∘ around the origin of the original (Reflection over the Axes Theorem).
A composition of two reflections over lines that intersect at x∘ is the same as a rotation of 2 x∘. The center of rotation is the point of intersection of the two lines of reflection (Reflection over Intersecting Lines Theorem).
What if you were given the coordinates of a quadrilateral and you were asked to reflect the quadrilateral and then translate it? What would its new coordinates be?
Examples
Example 1
Reflect △A B C over the y−axis and then translate the image 8 units down.
The green image to the left is the final answer.
A(8,8)→A″(−8,0)B(2,4)→B″(−2,−4)C(10,2)→C″(−10,−6)
Example 2
Write a single rule for △A B C to △A″B″C″ from Example 1.
Looking at the coordinates of A to A″, the x−value is the opposite sign and the y−value is y−8. Therefore the rule would be (x,y)→(−x,y−8).
Example 3
Reflect △A B C over y=3 and then reflect the image over y=−5.
Order matters, so you would reflect over y=3 first, (red triangle) then reflect it over y=−5 (green triangle).
Example 4
A square is reflected over two lines that intersect at a 79∘angle. What one transformation will this be the same as?
From the Reflection over Intersecting Lines Theorem, this is the same as a rotation of 2⋅79∘=178∘.
Example 5
△D E F has vertices D(3,−1),E(8,−3), and F(6,4). Reflect △D E F over x=−5 and then x=1. Determine which one translation this double reflection would be the same as.
From the Reflections over Parallel Lines Theorem, we know that this double reflection is going to be the same as a single translation of 2(1−(−5)) or 12 units.
Example 6
Reflect △D E F from Question 2 over the x−axis, followed by the y−axis. Find the coordinates of △D″E″F″ and the one transformation this double reflection is the same as.
△D″E″F″ is the green triangle in the graph to the left. If we compare the coordinates of it to △D E F, we have:
D(3,−1)→D″(−3,1)E(8,−3)→E″(−8,3)F(6,4)→F″(−6,−4)
Review
Explain why the composition of two or more isometries must also be an isometry.
What one transformation is the same as a reflection over two parallel lines?
What one transformation is the same as a reflection over two intersecting lines?
Use the graph of the square to the left to answer questions 4-6.
Perform a glide reflection over the x−axis and to the right 6 units. Write the new coordinates.
What is the rule for this glide reflection?
What glide reflection would move the image back to the preimage?
Use the graph of the square to the left to answer questions 7-9.
Perform a glide reflection to the right 6 units, then over the x−axis. Write the new coordinates.
What is the rule for this glide reflection?
Is the rule in #8 different than the rule in #5? Why or why not?
Use the graph of the triangle to the left to answer questions 10-12.
Perform a glide reflection over the y−axis and down 5 units. Write the new coordinates.
What is the rule for this glide reflection?
What glide reflection would move the image back to the preimage?
Use the graph of the triangle to the left to answer questions 13-15.
Reflect the preimage over y=−1 followed by y=−7. Write the new coordinates of the reflected image.
What one transformation is this double reflection the same as?
Write the rule.
Use the graph of the triangle to the left to answer questions 16-18.
Reflect the preimage over y=−7 followed by y=−1. Write the new coordinates of the reflected image.
What one transformation is this double reflection the same as?
Write the rule.
How do the final triangles in #13 and #16 differ?
Use the trapezoid in the graph to the left to answer questions 20-22.
Reflect the preimage over the x−axis then the y−axis. Write the new coordinates of the reflected image.
Now, start over. Reflect the trapezoid over the y−axis then the x−axis. Draw this trapezoid.
Are the final trapezoids from #20 and #21 different? Why do you think that is?
Answer the questions below. Be as specific as you can.
Two parallel lines are 7 units apart. If you reflect a figure over both how far apart with the preimage and final image be?
After a double reflection over parallel lines, a preimage and its image are 28 units apart. How far apart are the parallel lines?
Two lines intersect at a 165∘ angle. If a figure is reflected over both lines, what is the measure of the angle between the image and the preimage?
What is the center of rotation for #25?
Two lines intersect at an 83∘ angle. If a figure is reflected over both lines, what is the measure of the angle between the image and the preimage?
A preimage and its image are 244∘ apart. If the preimage was reflected over two intersecting lines, at what angle did they intersect?
A preimage and its image are 98∘ apart. If the preimage was reflected over two intersecting lines, at what angle did they intersect?
After a double reflection over parallel lines, a preimage and its image are 62 units apart. How far apart are the parallel lines?
Review (Answers)
Click HERE to see the answer key or go to the Table of Contents and click on the Answer Key under the 'Other Versions' option.
Image Attributions
Back to Composition of Transformations
| Image | Reference | Attributions |
---
| | [Figure 17] [Figure 19] | License:CC BY-NC |
| | [Figure 18] | License:CC BY-NC |
| | [Figure 20] | Credit:Melissa Sanders |
| | [Figure 21] | License:CC BY-NC |
| | [Figure 22] [Figure 23] | License:CC BY-NC |
| | [Figure 25] | License:CC BY-NC |
| | [Figure 26] | Credit:D Coetzee Source: |
| | [Figure 27] | License:CC BY-NC |
| | [Figure 28] | License:CC BY-NC |
| | [Figure 29] | License:CC BY-NC |
| | [Figure 30] | License:CC BY-NC |
Ask me anything!
CK-12 Foundation is a non-profit organization that provides free educational materials and resources.
FLEXIAPPS
ABOUT
Our missionMeet the teamPartnersPressCareersSecurityBlogCK-12 usage mapTestimonials
SUPPORT
Certified Educator ProgramCK-12 trainersWebinarsCK-12 resourcesHelpContact us
BYCK-12
Common Core MathK-12 FlexBooksCollege FlexBooksTools and apps
CONNECT
TikTokInstagramYouTubeTwitterMediumFacebookLinkedIn
v2.11.10.20250923073248-4b84c670be
© CK-12 Foundation 2025 | FlexBook Platform®, FlexBook®, FlexLet® and FlexCard™ are registered trademarks of CK-12 Foundation.
Terms of usePrivacyAttribution guide
Curriculum Materials License
Student Sign Up
Are you a teacher? Sign up here
Sign in with Google
Having issues? Click here
Sign in with Microsoft Sign in with Apple
or
Sign up using email
By signing up, I confirm that I have read and agree to the Terms of use and Privacy Policy
Already have an account? Sign In
Adaptive Practice
I’m Ready to Practice!
Get 10 correct to reach your goal
Estimated time to complete: 11 min
Start Practice
Save this section to your Library in order to add a Practice or Quiz to it.
Title
(Edit Title)34/ 100
Save Go Back
This lesson has been added to your library.
Got It
No Results Found
Your search did not match anything in .
Got It
Searching in:
CK-12
Looks like this FlexBook 2.0 has changed since you visited it last time. We found the following sections in the book that match the one you are looking for:
Go to the Table of Contents
Ok
Are you sure you want to restart this practice? Restarting will reset your practice score and skill level. |
14179 | https://www.mathworks.com/videos/getting-started-with-s-parameters-part-4-s-parameters-to-impulse-response-1633696821069.html | S-Parameters to Impulse Response | Getting Started with S-Parameters, Part 4 - MATLAB
Skip to content
Products
Solutions
Learn
Training
Self-Paced Online Courses
Instructor-Led Training
MathWorks Certification Program
Events
MATLAB and Simulink Events
Event Proceedings
On-Demand Webinars
Learning Resources
Teach with MATLAB
Research with MATLAB
Student Programs
Books
Contact Us
Visit the Help Center to explore product documentation, engage with community forums, check release notes, and more.
MATLAB and Simulink Videos
Learn about products, watch demonstrations, and explore what's new.
Explore videos
Company
Company
About MathWorks
Mission and Values
Social Mission
Decarbonizing MathWorks
Customer Stories
Careers
Careers Overview
Job Search
Teams and Roles
Office Locations
Contact Us
Decarbonizing MathWorks
See how MathWorks is protecting and restoring Earth's resources.
Learn more
Help Center
Get MATLABMATLAB
Sign In
My Account
My Community Profile
Link License
Sign Out
Get MATLABMATLABContact Us
Search Search MathWorks.com
Videos
Videos Home
Search
Video Player is loading.
Play Video
Play Skip Backward Skip Forward
Mute
Current Time 0:00
/
Duration 10:41
Loaded: 1.55%
00:00
Stream Type LIVE
Seek to live, currently behind live LIVE
Remaining Time-10:41
1x
Playback Rate
2x
1.5x
1.25x
1x, selected
0.75x
0.5x
0.25x
Chapters
Chapters
Descriptions
descriptions off, selected
Captions
captions settings, opens captions settings dialog
captions off, selected
English
Audio Track
en (Main), selected
Quality Levels
Picture-in-Picture Fullscreen
This is a modal window.
Beginning of dialog window. Escape will cancel and close the window.
Text Color Opacity Text Background Color Opacity Caption Area Background Color Opacity
Font Size Text Edge Style Font Family
Reset Done
Close Modal Dialog
End of dialog window.
Close Modal Dialog
This is a modal window. This modal can be closed by pressing the Escape key or activating the close button.
10:41 Video length is 10:41
Description
Full Transcript
Related Resources
Description
S-Parameters to Impulse Response | Getting Started with S-Parameters, Part 4
From the series: Getting Started with S-Parameters
Learn how to use rational fitting on S-parameter data to identify an equivalent Laplace domain transfer function. See how to check and enforce the passivity of S-parameter data and visualize the frequency response of the derived transfer function and the associated group delay. Learn how to calculate the step and impulse response, both used for time-domain analysis.
Show more
Published: 7 Oct 2021
Full Transcript
Loading your interactive content...
Welcome back to the ongoing MathWorks technical series on the use of RF Toolbox.In this installment,we are going to use RF Toolbox to generate an impulse response for a single-ended channel characterized by S-parameters.We will go over the key functions used for generating the response,as well as documenting the workflow that will be followed.Then,a demonstration will be given that shows the process being used with a backplane S-parameter data set.
Let's begin by outlining the principal functions that are going to be used today.S-parameters,ispassive,makepassive,snp2smp,s2sdd,rational,freqresp,timeresp.Again,help for each of these RF Toolbox functions can be found by typing in"help"and the function name at the MATLAB command prompt,or typing in the function name in the help browser.
One RF Toolbox product example that I find particularly useful for demonstrating this workflow is modeling a high speed backplane.This example shows the user how to convert a single-ended set of S-parameters used to define the frequency response of a channel to a time domain representation by using the RF Toolbox function,rational.In order to convert a channel model or a set of S-parameters into the time domain using RF Toolbox,a structured workflow needs to be adhered.The workflow contains eight unique steps and should be followed each time that you are looking to generate a time domain representation of a backplane or channel model using RF Toolbox.
Let's briefly go through the workflow.First,you will need to import S-parameters into MATLAB.This will be done by using the RF Toolbox function,S-parameters.Once the S-parameters are imported for the backplane or the channel,you will need to check if the S-parameters are passive and,if necessary,enforce passivity.The passivity check helps determine the quality of the S-parameter measurement process and,more specifically,the calibration of the network analyzer used for measuring the backplane.It is likely that the S-parameter data set that you are analyzing has multiple transmission paths,and you are likely interested in analysis of a single differential channel.As such,you will need to isolate a single differential channel from the overall multi-channel single ended S-parameter network.
Before transforming the S-parameters into a time domain representation,it is a good idea to do an informal check of data causality.An informal causality check can be done by visualizing the phase and group delay response of the differential channel.Ascending phase behavior implies a negative group delay or a non-causal response in which a left half plane Laplace domain representation of the data can't be realized.Once you have determined that the S-parameter data is indeed passive and causal,you can then fit a Laplace domain model to the data that can be subsequently used for time domain analysis.The RF Toolbox function used for this process is called rational.The rational fit function has several user-controlled settings which include fitting tolerance and behavior at high frequency.
Once the parameters for the Laplace domain model have been determined,you will then need to compare the frequency response of the model to that of the original data.This can be readily accomplished using the freqresp function from RF Toolbox.Once the frequency response is verified,time domain analysis can then be performed.A time domain response of interest is the impulse response.The method that will be used to generate the impulse response will be to take the time derivative of the unit step response.
One of the advantages of using this process to generate impulse response is that the user can control the size of the time step that will be used subsequently for SI analysis and SerDes lane simulation.This differs from use of the inverse fast Fourier transform methodology where the time step is set by the frequency bandwidth of the S-parameter data file.
Now,let us look at an example that demonstrates this workflow.The example that we will follow will closely resemble the RF Toolbox product example modeling a high speed backplane.We will use a pre-constructed MATLAB script to document and execute the workflow.To begin with,we will use the RF Toolbox S-parameters function to import a 16 port backplane model.Once the data is imported,we will check the passivity of the data and,if necessary,enforce passivity on the data set.It is useful to plot the results of the passivity test.This provides you with a better feel for the passivity test applied.You will notice that for this case,the eigenvalues for the passivity test are between zero and one.If the passivity test were to fail,you would see eigenvalues that lie between zero and negative one.
The next step of the workflow will have us reduce the 16 port multichannel representation and select an individual channel.In this case,the near N channel characterized by ports 1,2,15,and 16,will be selected for analysis.Via the snp2smp function,the 16 port single-ended representation is reduced to a four port single-ended equivalent for a single forward channel.
At this point,we will convert the single ended S-parameters into differential mode representation.We will do this by using the s2sdd function and setting the appropriate differential impedance for the calculated differential S-parameters.With the forward channel selected,we will do an informal check on its causality by plotting the phase and group delay response to the transmission path.You will notice that the phase response for the differential forward transmission path is monotonically descending with frequency and that the group delay response is around 6.75 nanoseconds,up to around 10 gigahertz.Above 12 gigahertz,the transmission response is dominated by the noise floor of the measurement device.
As we can see,the behavior of the differential forward channel path passes our informal causality test.Now that the S-parameters have been converted into a differential format,and the test for passivity and causality have been performed,we can generate a model that can be used for time domain analysis.We will use the RF Toolbox function,rational,to generate a rational function fit of the forward channel differential response.Before we execute the function rational,we will adjust some of the function parameters,namely,the tolerance.The tolerance parameter is manually selected to provide a trade off between the frequency domain fit and the model order,or the number of poles found for the rational solution.
With the rational function model now determined,we may want to verify the fate visually.This can be accomplished by plotting the magnitude and phase responses for each of the original data,and the derived rational model.You can see from the plotted responses that there is a good correlation between the model and the original data set.
Now,we can turn our attention to analyzing the time domain response of the calculated model.My personal preference is to always start with calculating the step response of a rational model,and then determine subsequent responses,such as the channel's impulse response.To generate the time response,we first need to define some parameters for the input signal to the channel.Namely,the time step and the number of time points that will be used for calculating the step response.In this case,we are going to use time step that is based off oversampling a 10 gigabit per second data rate by a factor of 64.We will analyze the step response up to just over 100 nanoseconds and validate that the step response has achieved a steady state condition.
With a well-behaved step response,we can use the mathematical relationship that exists between the heavy side Unit Step function and the Dirac Delta function,namely that the Dirac Delta function is the time derivative of the unit step function.In our case,we are going to determine the impulse response by using discrete time differential calculus properties,namely,determining the difference representation of the Unite Step response,and then plotting the result as a function of time.Here,we can see that the resulting impulse response follows an expected behavior.
One thing that I should note is that when you use the rational modeling approach,you can select an arbitrary time step size for the channel's time response.This is an advantage over discrete time methods,where if you want to get around the frequency range limitations that this method imposes,you will need to do a combination of windowing and data padding to be able to generate step sizes conducive to signal integrity analysis.
Related Resources
Related Products
RF Toolbox
Learn More
Model and Analyze High-Speed Backplanes
sparameters
rfplot
Design and simulate with RF Blockset
Learn more
Related Information
Discover RF Toolbox
Feedback
Featured Product
RF Toolbox
Request Trial
Get Pricing
Up Next:
4:00 Video length is 4:00
Transmission Line S-Parameter Generation
View full series (5 Videos)
Related Videos:
S-Parameter Import, Plotting, and Writing | Getting Started with S-Parameters, Part 1
S-Parameter Import, Plotting, and Writing | Getting Started with S-Parameters, Part 1 (5:12)
Transmission Line S-Parameter Generation | Getting Started with S-Parameters, Part 5
Transmission Line S-Parameter Generation | Getting Started with S-Parameters, Part 5 (4:00)
Concatenation of S-Parameter and Networks | Getting Started with S-Parameters, Part 2
Concatenation of S-Parameter and Networks | Getting Started with S-Parameters, Part 2 (5:04)
Termination of S-Parameter Networks | Getting Started with S-Parameters, Part 3
Termination of S-Parameter Networks | Getting Started with S-Parameters, Part 3 (4:16)
Introducing the Modelithics SELECT+ Library for MATLAB
Introducing the Modelithics SELECT+ Library for MATLAB (23:18)
View more related videos
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: United States.
United States
United States (English)
United States (Deutsch)
United States (Français)
United States（简体中文）
United States (English)
You can also select a web site from the following list
How to Get Best Site Performance
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Americas
América Latina (Español)
Canada (English)
United States (English)
Europe
Belgium (English)
Denmark (English)
Deutschland (Deutsch)
España (Español)
Finland (English)
France (Français)
Ireland (English)
Italia (Italiano)
Luxembourg (English)
Netherlands (English)
Norway (English)
Österreich (Deutsch)
Portugal (English)
Sweden (English)
Switzerland
Deutsch
English
Français
United Kingdom (English)
Asia Pacific
Australia (English)
India (English)
New Zealand (English)
中国
简体中文
English
日本 (日本語)
한국 (한국어)
Contact your local office
MathWorks
Accelerating the pace of engineering and science
MathWorks is the leading developer of mathematical computing software for engineers and scientists.
Discover…
Explore Products
MATLAB
Simulink
Student Software
Hardware Support
File Exchange
Try or Buy
Downloads
Trial Software
Contact Sales
Pricing and Licensing
How to Buy
Learn to Use
Documentation
Tutorials
Examples
Videos and Webinars
Training
Get Support
Installation Help
MATLAB Answers
Consulting
License Center
Contact Support
About MathWorks
Careers
Newsroom
Social Mission
Customer Stories
About MathWorks
Select a Web Site United States
Trust Center
Trademarks
Privacy Policy
Preventing Piracy
Application Status
Contact Us
© 1994-2025 The MathWorks, Inc. |
14180 | https://brighterly.com/math/area-and-perimeter-of-triangle/ | Math tutors
/
Knowledge Base
/
Area and Perimeter of Triangle – Definition with Examples
Area and Perimeter of Triangle – Definition with Examples
Jo-ann Caballes
Updated on January 27, 2025
Table of Contents
Hello, math enthusiasts! Welcome to another exciting exploration into the captivating world of geometry with Brighterly. Our mission at Brighterly is to illuminate the path of learning, making complex mathematical concepts easy and enjoyable. And today, we’re focusing on the Area and Perimeter of a Triangle, integral aspects of understanding the world of shapes around us.
In this comprehensive guide, we’ll embark on a journey through definitions, properties, and formulas. And to ensure we can put theory into practice, we’ve also included step-by-step examples and stimulating practice problems. So, put on your thinking caps and let’s plunge into this fascinating mathematical adventure together!
What Are Area and Perimeter of a Triangle?
The area and perimeter of a triangle are fundamental concepts in geometry. But what do these words mean? Simply put, they represent two distinct aspects of a triangle.
The Area of a triangle refers to the amount of ‘space’ that the triangle covers or takes up. Imagine you’ve got a triangular piece of paper. The ‘area’ is all the space that piece of paper covers.
On the other hand, the Perimeter of a triangle refers to the total length of its boundaries. If you were to walk around the edges of your triangular piece of paper, the distance you would cover is the ‘perimeter’.
Definition of Area of a Triangle
In mathematical terms, the Area of a Triangle is defined as half the product of its base (any one of its sides) and the corresponding height (the shortest distance from the chosen base to the opposite vertex). In essence, it represents the ‘space’ enclosed by the three sides of a triangle.
Definition of Perimeter of a Triangle
The Perimeter of a Triangle is calculated by adding up the lengths of all its three sides. If you think of a triangle as a piece of wire bent into three connected straight parts, the perimeter is the total length of that wire.
Properties of Area and Perimeter of a Triangle
Triangles are a special class of shapes with their unique set of properties. Their area and perimeter, too, abide by certain rules and principles.
Properties of Area of a Triangle
The area of a triangle is always positive. It cannot be negative or zero unless the triangle itself doesn’t exist!
If two triangles have equal bases and equal heights, they have equal areas, regardless of the shape or size of the angles.
The larger the base or the height of a triangle, the larger will be its area, keeping the other dimension constant.
Properties of Perimeter of a Triangle
Like the area, the perimeter of a triangle is always positive.
Among triangles with the same perimeter, the equilateral triangle (where all sides are equal) has the largest area.
Conversely, among triangles with the same area, the one with the smallest perimeter is the equilateral triangle.
Difference Between Area and Perimeter of a Triangle
While both area and perimeter are fundamental properties of a triangle, they represent different aspects and have different units of measurement.
The Area measures the space enclosed by the triangle and is measured in square units (like square centimeters or square inches). On the other hand, the Perimeter is a measure of the total distance around the triangle and is measured in linear units (like centimeters or inches).
Formulas for Area and Perimeter of a Triangle
Understanding the formulas for the area and perimeter of a triangle can simplify calculations and deepen your understanding of triangles.
Formulas for Area of a Triangle
Base times Height formula: The simplest formula is Area = 1/2 x Base x Height. It’s easy to remember and works for any type of triangle as long as you know the base and height.
Heron’s Formula: This formula is handy when you know the lengths of all three sides of the triangle but not the height.
Formulas for Perimeter of a Triangle
Calculating the perimeter of a triangle is straightforward. The formula is Perimeter = Side1 + Side2 + Side3. Just add up the lengths of all the sides!
Calculating the Area and Perimeter of a Triangle
Applying these formulas is simpler than it seems.
Calculating the Area of a Triangle
To find the area of a triangle using the base and height, simply substitute these values into the formula Area = 1/2 x Base x Height. If you’re using Heron’s formula, it’s a bit more complex, but still manageable with some basic arithmetic.
Conclusion
We’ve now come to the end of our journey, and we hope you’ve enjoyed every step! At Brighterly, we believe that every child is a potential mathematician, and our aim is to unlock that potential. Understanding the Area and Perimeter of a Triangle is not just about memorizing definitions and formulas; it’s about appreciating the beauty and complexity of the world around us. The world is full of shapes, and the better we understand them, the better we can understand the world.
But remember, just like any journey, mastering math is not about reaching a destination, it’s about the journey itself. It’s about the curiosity, the questions, the challenges, and the triumphs. So keep questioning, keep exploring, and most importantly, keep enjoying math with Brighterly!
Frequently Asked Questions on Area and Perimeter of a Triangle
At Brighterly, we understand that new learning can sometimes lead to questions. Here are some of the most commonly asked questions about the area and perimeter of a triangle:
Can the area of a triangle be negative?
No, the area of a triangle cannot be negative. Area represents a physical space, which cannot have a negative value.
Can a triangle have a perimeter of zero?
A triangle cannot have a zero perimeter. A triangle with zero perimeter does not exist because it means all its sides have zero lengths, which contradicts the definition of a triangle.
What if I know the lengths of the sides of the triangle, but not the height?
You can use Heron’s formula to calculate the area of a triangle when the lengths of all three sides are known. This formula doesn’t require the height.
Is the perimeter of a triangle always greater than its area?
Not necessarily. The relationship between a triangle’s area and its perimeter depends on the unit of measurement and the size of the triangle.
Information Sources
Wolfram Alpha
U.S. Department of Education
National Council of Teachers of Mathematics
Jo-ann Caballes
14 articles
As a seasoned educator with a Bachelor’s in Secondary Education and over three years of experience, I specialize in making mathematics accessible to students of all backgrounds through Brighterly. My expertise extends beyond teaching; I blog about innovative educational strategies and have a keen interest in child psychology and curriculum development. My approach is shaped by a belief in practical, real-life application of math, making learning both impactful and enjoyable.
Table of Contents
What Are Area and Perimeter of a Triangle?
Definition of Area of a Triangle
Definition of Perimeter of a Triangle
Properties of Area and Perimeter of a Triangle
Properties of Area of a Triangle
Properties of Perimeter of a Triangle
Difference Between Area and Perimeter of a Triangle
Formulas for Area and Perimeter of a Triangle
Formulas for Area of a Triangle
Formulas for Perimeter of a Triangle
Calculating the Area and Perimeter of a Triangle
Calculating the Area of a Triangle
Conclusion
Frequently Asked Questions on Area and Perimeter of a Triangle
Can the area of a triangle be negative?
Can a triangle have a perimeter of zero?
What if I know the lengths of the sides of the triangle, but not the height?
Is the perimeter of a triangle always greater than its area?
Math & reading from 1st to 9th grade
Looking for homework support for your child?
Choose kid's grade
Grade 1
Grade 2
Grade 3
Grade 4
Grade 5
Grade 6
Grade 7
Grade 8
Math & reading from 1st to 9th grade
Looking for homework support for your child?
Book free lesson
Related math
Comparing Fractions – Methods, Definition With Examples
Welcome to our comprehensive guide on Comparing Fractions, a key concept in math for kids. This guide, designed for young learners, aims to simplify and demystify the process of comparing fractions. As a reliable math tutor for kids, we understand the importance of foundational math skills. Through this article, children will learn effective methods to […]
Read more
Irrational Numbers – Definition with Examples
Welcome to Brighterly’s comprehensive guide on the Irrational Numbers! In this blog post, we will embark on an exciting journey through the captivating world of mathematics. We will uncover the secrets of the Irrational Numbers, delve into the intriguing properties of irrational numbers, and master the art of multiplication and division of numbers. By the […]
Read more
Quarter – Definition with Examples
Mathematics is a magical kingdom full of interesting ideas, where every single concept carries its own unique charm. One such enchanting concept is the idea of a ‘quarter’. Often, this concept becomes a child’s first encounter with the world of fractions. As educators at Brighterly, we believe in illuminating the pathways of learning with fun-filled […]
Read more
Close a child’s math gaps with a tutor!
Book a free demo lesson with our math tutor and see your kid fill math gaps with interactive lessons
Book demo lesson
Get full test results
See Your Child’s Test Results
Enter your name and email to view your child’s test results now!
Parent’s name
Child’s grade
Choose kid's grade
Grade 1
Grade 2
Grade 3
Grade 4
Grade 5
Grade 6
Grade 7
Grade 8
Parent’s email
Submit & View results |
14181 | https://drops.dagstuhl.de/storage/00lipics/lipics-vol144-esa2019/LIPIcs.ESA.2019.36/LIPIcs.ESA.2019.36.pdf | Robustness of Randomized Rumour Spreading Rami Daknama Department of Mathematics, Ludwig-Maximilians-Universität München, Germany Konstantinos Panagiotou Department of Mathematics, Ludwig-Maximilians-Universität München, Germany Simon Reisser Department of Mathematics, Ludwig-Maximilians-Universität München, Germany Abstract In this work we consider three well-studied broadcast protocols: push, pull and push&pull. A key property of all these models, which is also an important reason for their popularity, is that they are presumed to be very robust, since they are simple, randomized, and, crucially, do not utilize explicitly the global structure of the underlying graph. While sporadic results exist, there has been no systematic theoretical treatment quantifying the robustness of these models. Here we investigate this question with respect to two orthogonal aspects: (adversarial) modifications of the underlying graph and message transmission failures.
We explore in particular the following notion of local resilience: beginning with a graph, we investigate up to which fraction of the edges an adversary may delete at each vertex, so that the protocols need significantly more rounds to broadcast the information. Our main findings establish a separation among the three models. On one hand pull is robust with respect to all parameters that we consider. On the other hand, push may slow down significantly, even if the adversary is allowed to modify the degrees of the vertices by an arbitrarily small positive fraction only. Finally, push&pull is robust when no message transmission failures are considered, otherwise it may be slowed down.
On the technical side, we develop two novel methods for the analysis of randomized rumour spreading protocols. First, we exploit the notion of self-bounding functions to facilitate significantly the round-based analysis: we show that for any graph the variance of the growth of informed vertices is bounded by its expectation, so that concentration results follow immediately. Second, in order to control adversarial modifications of the graph we make use of a powerful tool from extremal graph theory, namely Szemerédi’s Regularity Lemma.
2012 ACM Subject Classification Mathematics of computing →Probabilistic algorithms; Theory of computation →Graph algorithms analysis Keywords and phrases Rumour Spreading, Local Resilience, Robustness, Self-bounding Functions, Szemerédi’s Regularity Lemma Digital Object Identifier 10.4230/LIPIcs.ESA.2019.36 Related Version A full version of the paper is available at
1 Introduction Randomized broadcast protocols are highly relevant for data distribution in large networks of various kinds, including technological, social and biological networks. Among many others there are three basic models in the literature, introduced in [19, 9, 24], namely push, pull and push&pull (or short pp). Consider a connected graph in which some vertex holds a piece of information; we call this vertex (initially) informed. All three models have the common characteristic that they proceed in rounds. In the push model, in every round every informed vertex chooses a neighbour independently and uniformly at random (iuar) and informs it; this of course has only an effect if the target vertex was previously uninformed. Contrary, in the pull model every round every uninformed vertex chooses a neighbour iuar and asks for the information. If the asked vertex has the information, then the asking vertex becomes © Rami Daknama, Konstantinos Panagiotou, and Simon Reisser; licensed under Creative Commons License CC-BY 27th Annual European Symposium on Algorithms (ESA 2019).
Editors: Michael A. Bender, Ola Svensson, and Grzegorz Herman; Article No. 36; pp. 36:1–36:15 Leibniz International Proceedings in Informatics Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany 36:2 Robustness of Randomized Rumour Spreading informed as well. The third model push&pull combines both worlds: in each round, each vertex chooses a neighbour iuar, and if one of both vertices is informed, then afterwards both become so. We additionally assume that each message transmission succeeds independently with probability q ∈(0, 1]. For these algorithms, the main parameter that we consider is the random variable that counts how many rounds are needed until all vertices are informed, and we call these quantities the runtimes of the respective algorithms.
In the remainder we will denote the runtime of push by Tpush(G, v, q) where G is the underlying graph, initially the vertex v is informed and we have a transmission success probability of q ∈(0, 1]. Analogously we denote the runtimes of pull and push&pull by Tpull(G, v, q) and Tpp(G, v, q) respectively. If the choice of v does not matter we will omit it in our notation. The most basic case is when G is the complete graph Kn with n vertices.
Then, see for example Doerr and Kostrygin , it is known that for P ∈{push, pull, pp} and q ∈(0, 1] in expectation and with probability tending to 1 as n →∞ TP(Kn, q) = cP(q) log n + o(log n), where, for q ∈(0, 1), cpush(q) := 1 log(1 + q) + 1 q , cpull(q) := 1 log(1 + q) − 1 log(1 −q), cpp(q) := 1 log(1 + 2q) + 1 q −log(1 −q), and where we set cP(1) := limq→1 cP(q). If q is clear from the context, we write cP instead of cP(q). Actually, the results in and also are much more precise, but the stated forms will be sufficient for what follows.
Contribution & Related Work In this article our focus is on quantifying the robustness of all three models. Indeed, robustness is a key property that is often attributed to them, since they are simple, randomized, and, crucially, do not exploit explicitly the structure of the underlying graph (apart, of course, from considering the neighborhoods of the vertices). Clearly, the runtime can vary tremendously between different graphs with the same number of vertices. Hence it is essential to understand which structural characteristics of a graph influence in what way the runtime of rumour spreading algorithms.
One result in this spirit for the push model was shown in . Roughly speaking, in that paper it is shown that even on graphs with low density, if the edges are distributed rather uniformly, then push is as fast as on the complete graph. This can be interpreted as a robustness result: starting with a complete graph, one can delete a vast amount of edges and as long as this is done rather uniformly, the runtime of push is affected insignificantly. To state the result more precisely, we need the following notion.
▶Definition 1 ((n, δ, ∆, λ)-graph). Let G be a connected graph with n vertices that has minimum degree δ and maximum degree ∆. Let µ1 ≥µ2 ≥· · · ≥µn be the eigenvalues of the adjacency matrix of G, and set λ = max2≤i≤n |µi| = max{|µ2|, |µn|}. We will call G an (n, δ, ∆, λ)-graph.
In this paper we are interested in the case where G gets large, that is, when n →∞. Hence all asymptotic notation in this paper is with respect to n; in particular “with high probability”, or short whp, means with probability 1 −o(1) when n →∞.
R. Daknama, K. Panagiotou, and S. Reisser 36:3 ▶Definition 2 (Expander Sequence). Let G = (Gn)n∈N be a sequence of graphs, where Gn is a (n, δn, ∆n, λn)-graph for each n ∈N. We say that G is an expander sequence if ∆n/δn = 1 + o(1) and λn = o(∆n).
Note that if we consider any sequence G = (Gn)n∈N of graphs this always implicitly defines δn, ∆n and λn as in Definition 2. Expander graphs have found numerous applications in computer science and mathematics, see for example the survey . If G is an expander sequence, then intuitively this means that for n large enough, the edges of Gn are rather uniformly distributed. For a more formal statement see Lemma 16. Moreover, note that our definition of expander sequences excludes the case when ∆n is bounded; this is actually a necessary condition for our robustness results to hold, see . With all these definitions at hand we can state the result from that quantifies the robustness of push with respect to the network topology, that is, the runtime is asymptotically the same as on the complete graph Kn.
▶Theorem 3. Let G = (Gn)n∈N be an expander sequence. Then whp Tpush(Gn) = cpush(1) log n + o(log n).
Apart from expander sequences, results in the form of Theorem 3 (where the asymptotic runtimes of one or more of these algorithms are determined) were also shown for sufficiently dense Erdös-Renyi random graphs , random regular graphs as well as hypercubes .
Moreover, the order of the runtime on various models that describe social networks was investigated. In the Chung-Lu model was studied, explored preferential attachment graphs and examined geometric graphs. A somewhat different approach is to derive general runtime bounds that hold for all graphs and depend only on some graph parameter, e.g. conductance [20, 6], vertex expansion or diameter [14, 5, 22]. Furthermore, several variants of push,pull and push&pull were studied. These include vertices being restricted to answer only one pull request per round , vertices being allowed to contact multiple neighbours per round [25, 11], vertices not calling the same neighbour twice and asynchronous versions [4, 26, 1, 2]. Finally, besides , robustness of these rumor spreading algorithms with respect to message transmission failures was also studied by Elsässer and Sauerwald in . It was shown for any graph that if a message fails with probability 1 −p, then the runtime of push increases at most by a factor of 6/p.
In this work our focus is on three subjects concerning the robustness of rumour spreading.
Our first (and not unexpected) result extends Theorem 3 to the runtimes of pull and push&pull. In particular, we show that none of the three protocols slows down or speeds up on graphs with good expansion properties compared to its runtime on the complete graph.
This motivates to investigate how severely a graph with good expansion properties has to be modified to increase the respective runtimes.
In our second contribution, which is also the main result and which differs from what was treated in previous works, we propose and study a novel approach to quantifying robustness.
In particular, we investigate the impact of adversarial edge deletions, where we use the well-known concept of local resilience, see e.g. [28, 8]. To be specific, we explore up to which fraction of edges an adversary may delete at each vertex to slow down the process by a significant amount of time, i.e., by Ω(log n) rounds. Here we discover a surprising dichotomy in the following sense. On the one hand, we show that both pull and push&pull cannot be slowed down by such adversarial edge deletions – in essentially all but trivial cases, where the fraction is so large that the graph may become (almost) disconnected. On the other hand, we demonstrate that even a small number of edge deletions is sufficient to slow down ESA 2019 36:4 Robustness of Randomized Rumour Spreading push by Ω(log n) rounds. In other words, we find that in contrast to pull and push&pull, the push protocol is not resilient to adversarial deletions and lacks (in this specific sense) the robustness of the other two protocols.
As our third subject, we generalise the previous results by additionally considering message transmission failures that occur independently with probability 1−q ∈[0, 1). On the positive side, we show that for arbitrary q ∈(0, 1] all three algorithms inform almost all vertices at least as fast as when run on expander sequence in spite of adversarial edge deletions.
However, if we want to inform all vertices, only pull is not slowed down by adversarial edge deletions for all values of q; push can be slowed down as before; and push&pull is a mixed bag, for q = 1 it cannot be slowed down, for q < 1 it can. Furthermore, in general it is also possible to speed push&pull up by deleting edges, which is however not surprising as the star-graph deterministically finishes in at most 2 rounds.
Summarizing, this work expands previous (robustness) results, particularly the ones concerning precise asymptotic runtimes and random transmission failures. Crucially, we introduce and study the concept of local resilience as a method to investigate robustness.
However, apart from that, in this paper we develop two new general methods for the analysis of rumour spreading algorithms.
The most common approach in the current literature for the study of the runtime is to determine the expected number of newly informed vertices in one or more rounds and to show concentration, for example by bounding the variance. Achieving this, however, is often quite complex and makes laborious and lengthy technical arguments necessary. Here we use the theory of self-bounding functions, see Section 2, that allows us to cleanly upper bound the variance by the expected value. The argument works for all three investigated algorithms and the bound is valid for all graphs. We are certain that this method will also facilitate future work on the analysis of rumour spreading algorithms.
Studying the robustness of the protocols is a challenging task, as the adversary (as described previously) has various options to modify the graph, for example by introducing a high variance in the degrees of the vertices; this turns out to be particularly problematic in the case of push&pull. Here we demonstrate that such types of irregularities can be handled universally by applying a powerful tool from a completely different area, namely extremal graph theory. In particular, we use Szemerédi’s regularity lemma (see e.g. ), which allows us to partition the vertex set of a graph such that nearly all pairs of sets in the partition behave nearly like perfect regular bipartite graphs. This allows us to apply our methods on these regular pairs; eventually we obtain a linear recursion that can be solved by analysing the maximal eigenvalue of the underlying matrix.
1.1 Results Our first result addresses the question about how fast rumours spread on expander graphs; in order to obtain a concise statement also the occurrence of independent message transmission failures is considered.
▶Theorem 4. Let G = (Gn)n∈N be an expander sequence and let q ∈(0, 1]. Then whp (a) Tpush(Gn, q) = cpush(q) log n + o(log(n)), (b) Tpull(Gn, q) = cpull(q) log n + o(log(n)), (c) Tpp(Gn, q) = cpp(q) log n + o(log(n)).
The first statement is an extension of Theorem 3 and its proof is a straigthforward adaptation of the proof in . We omit it. The contribution here is the proof of (b) and (c). Next we consider the case with edge deletions in addition to the message transmission failures.
R. Daknama, K. Panagiotou, and S. Reisser 36:5 ▶Theorem 5. Let 0 < ε < 1/2, q ∈(0, 1] and G = (Gn)n∈N be an expander sequence. Let ˜ G = ( ˜ Gn)n∈N be such that each ˜ Gn is obtained by deleting edges of Gn such that each vertex keeps at least a (1/2 + ε) fraction of its edges. Then whp (a) Tpull( ˜ Gn, q) = cpull(q) log n + o(log n).
(b) Tpp( ˜ Gn, 1) ≤cpp(1) log n + o(log n), when additionally assuming that δ(Gn) ≥αn for some constant 0 < α ≤1.
This result demonstrates uncoditionally the robustness of pull, and conditionally on q = 1 the robustness of push&pull on dense graphs, in the case of edge deletions, that is, the runtime is asymptotically the same as in the complete graph. It even shows that push&pull may potentially profit from edge deletions in contrast to being slowed down. The proof of this result, especially the statement about push&pull, is rather involved, since the original graph may become quite irregular after the edge deletions. Here we use, among many other ingredients, the aforementioned decomposition of the graph given by Szemeredi’s regularity lemma.
Note that Theorem 5 does not consider push and push&pull (when q ̸= 1) at all. Indeed, our next result states that in these cases the behaviour is rather different and that the algorithms may be slowed down.
▶Theorem 6. Let ε > 0 and q ∈(0, 1]. Then there is an expander sequence G = (Gn)n∈N and a sequence of graphs ˜ G = ( ˜ Gn)n∈N with the following properties. Each ˜ Gn is obtained by deleting edges of Gn such that each vertex keeps at least a (1 −ε) fraction of its edges.
Moreover, whp (a) Tpush( ˜ Gn, q) ≥cpush(q) log n + ε/(2q) log n + o(log n).
(b) Tpp( ˜ Gn, q) ≥cpp(q) log n + ε/(8q) −εq3/5 log n + o(log n).
Nevertheless, not all hope is lost. On the positive side, the next result states that push and push&pull are able to inform almost all vertices as fast as on the complete graph in spite of adversarial edge deletions. In this sense, we obtain an almost-robustness result for these cases.
▶Theorem 7. Let 0 < ε < 1/2, q ∈(0, 1] and G = (Gn)n∈N be an expander sequence. Let ˜ G = ( ˜ Gn)n∈N be such that each ˜ Gn is obtained by deleting edges of Gn such that each vertex keeps at least a (1/2 + ε) fraction of its edges. For P ∈{push, pp} let ˜ TP denote the number of rounds needed to inform at least n −n/ log n vertices. Then whp (a) ˜ Tpush( ˜ Gn) = log1+q(n) + o(log n).
(b) ˜ Tpp( ˜ Gn) ≤log1+2q(n) + o(log n), when additionally assuming that δ(Gn) ≥αn for some constant 0 < α ≤1.
We conjecture that there is also a version of Theorem 7b that is true for push&pull on sparse graphs; to be precise we conjecture that in the setting of Theorem 7b it is ˜ Tpp( ˜ Gn) ≤ log1+2q(n)+o(log n), without further restrictions on Gn, i.e. that push&pull cannot be slowed down informing almost all vertices.
As a final remark note that Theorems 5 and 7 are tight in the sense that if an adversary may delete up to half of the edges at each vertex, then there are expander graphs that become disconnected. On those graphs a linear fraction of the vertices will remain uninformed forever.
Outline The rest of this paper is structured as follows. The first part of Section 2 contains our technical contribution concerning the analysis through self-bounding functions. In the second part we state the Expander Mixing Lemma and give some applications to our setting with ESA 2019 36:6 Robustness of Randomized Rumour Spreading deleted edges. The remaining sections contain the proofs to the main theorems. The proof of Theorem 4 has two steps: determining the expected growth rates of the number of informed vertices after performing one round, then concluding the proof for the runtime by using the tools developed in Section 2. This proof is not included in this version, here instead we focus on the case with edge deletions, where for every protocol we use a different method to show the claimed results. In Subsection 3.1 we show that edge deletions do not slow down pull, by analysing the number of edges between informed and uninformed vertices. Showing that adversarial edge deletions cannot slow down the time until push has informed almost all vertices will be archived in Section 3.2 by giving a coupling to the case without edge deletions. Then, in Subsection 3.3 we show that push&pull informs almost all vertices of dense graphs fast in spite of adversarial edge deletions. We utilize a version of Szemerédis Regularity Lemma to get a well-behaved partition of the vertex set that is suitable for performing a round based analysis. However, if q < 1, adversarial edge deletions can slow down the time until push&pull has informed all vertices for nearly all values of q; we show this in Section 3.4. The same example as given there also yields Theorem a. Finally, an unabridged version of this paper, that contains any proofs that are omitted here, is available at
Further Notation Let G = (V, E) denote a graph with vertex set V and edge set E ⊆ V 2 . Consider v ∈V and U, W ⊆V with U∩W = ∅. We will denote the set of neighbours of v in G by NG(v) or by N(v) and we will denote its degree by dG(v) := |NG(v)| or by d(v); δG or δ and ∆G or ∆denote minimum and maximum degree of G. Similarly the neighbourhood of any set of vertices S ⊆V is defined by NG(S) := ∪v∈SNG(v). Furthermore let E(U, W) = EG(U, W) denote the set of edges with one vertex in U and one vertex in W and let e(U, W) := eG(U, W) := |EG(U, W)|.
With EG(U) we denote the set of edges with both vertices in U; eG(U) = |EG(U)|. For any round t ∈N and P ∈{push, pull, pp}, we denote by I(P) t (G) the set of vertices of G informed by push, pull and push&pull respectively at the beginning of round t and |I(P) 1 | = 1; if the underlying graph is clear from the context we will omit it; if we consider a sequence of graphs G = (Gn)n∈N and a sequence of times t = (t(n))n∈N, then I(P) t (G) = (I(P) t(n)(Gn))n∈N is also a sequence. Similarly, U (P) t := V \I(P) t denotes the set of uninformed vertices. With log we refer to the natural logarithm. For any event A we will write Et[A] instead of E[A It] for the conditional expectation and Pt[A] instead of P[A It] for the conditional probability.
Finally we want to clarify our use of Landau symbols. Let a, b ∈R and f be a function. The terms a ≤b + o(f) and a ≥b −o(f) mean that there exist positive functions g, h ∈o(f) such that a ≤b + g and a ≥b −h. Consequently a = b + o(f) means that there exists a positive function g ∈o(f) such that a ∈[b −g, b + g] 2 Tools & Techniques In this section we collect and prove statements about our protocols and properties of expander sequences. We begin with applying the previously mentioned notion of self-bounding functions to derive universal and simple-to-apply concentration results for our random variables, i.e., the number of informed vertices after a particular round. Then we extend the concentration results to more than one round. In the last part we recall the well known Expander Mixing Lemma and utilize it to derive properties (weak expansion, path enumeration) for the case where we delete edges from our graphs.
R. Daknama, K. Panagiotou, and S. Reisser 36:7 Self-bounding functions Our main technical new result in this section is the following bound on the variance for the number of informed vertices in any given round; it is true for any graph and any set of informed vertices.
▶Lemma 8. Let G be a graph, t ∈N and It = I(P) t (G) for P ∈{push, pull, pp}. Then Var |It+1| It ≤E |It+1| It .
Lemma 8 follows directly from Lemmas 10 and 11. Before stating them we introduce the notion of self-bounding functions.
▶Definition 9 (Self-bounding function). Let X be a set and m ∈N. A non-negative function f : Xm →R is self-bounding, if there exist functions fi : Xm−1 →R such that for all x1, ..., xm ∈X and all i = 1, ..., m 0 ≤f(x1, ..., xm) −fi(x1, ..., xi−1, xi+1, ..., xm) ≤1 and X 1≤i≤m (f(x1, ..., xm) −fi(x1, ..., xi−1, xi+1, ..., xm)) ≤f(x1, ..., xm).
A striking property of self-bounding function is the following bound on the variance.
▶Lemma 10 (). For a self-bounding function f and independent random variables X1, ..., Xm, m ∈N Var [f(X1, ..., Xm)] ≤E [f(X1, ..., Xm)] .
▶Lemma 11. Let G be a graph, t ∈N, and let It = I(P) t (G) for P ∈{push, pull, pp}.
Then, conditional on It, there exist m ∈N, independent random variables X1, ..., Xm and a self-bounding function f = f (P) such that |It+1| = f(X1, ..., Xm).
▶Remark 12. Let G = (V, E) be a graph. Lemma 11 also applies to subsets of It+1, i.e for any U ⊂V and conditioned on It we have that |It+1 ∩U| and |(It+1 ∩U) \ It| are self-bounding.
The following lemma gives a tool that we will use in order to extend our round-wise analysis to longer phases.
▶Proposition 13. Let P ∈{push, pull, pp}, It = I(P) t and t1 ≥t0 ≥1 such that |It0| ≥ √log n. Let further (Ai)i∈N be a sequence of events, c > 1, and δ > 0 such that Pt0[At | At0, . . . , At−1] ≥1 −δ ct−t0|It0| −1/3 for all t0 ≤t ≤t1.
Then Pt0 " t1 \ t=t0 At # ≥1 −O(|It0|−1/3) We give two typical example applications of this lemma below. The first example addresses the case where we have a lower bound for the expected number of informed vertices after one round.
ESA 2019 36:8 Robustness of Randomized Rumour Spreading ▶Example 14.
Let P ∈{push, pull, pp}, It = I(P) t . Assume that there is some c > 1 such that Et [|It+1|] ≥c |It| for all t as long as n/f(n) ≤|It| ≤n/g(n) for some functions 1 ≤f, g ≤n, f = o(n). Let t0 be such that |It0| ≥n/f(n). Then according to Lemma 8 we have that Vart [|It+1|] ≤Et [|It+1|] and applying Chebychev’s inequality gives Pt h |It+1| −Et [|It+1|] ≤Et [|It+1|]2/3i ≥1 −Et [|It+1|]−1/3 ≥1 −|It|−1/3.
(1) Consider the events At = “|It| ≥Et−1 [|It|] −Et−1 [|It|]2/3 or |It| ≥n/g(n)” The intersection of At0+1, . . . , At implies inductively that either |It| ≥n/g(n) or |It| ≥ 1 −Et−1[|It|]−1/3 Et−1[|It|] ≥ 1 −(c|It0|)−1/3 c t−t0 |It0|.
We obtain with (1) Pt0[At+1 | At0+1, . . . , At, |It| < n/g(n)] ≥1 − 1 −(c|It0|)−1/3 c −(t−t0)/3 |It0|−1/3, and otherwise Pt0[At+1 | At0+1, . . . , At, |It| ≥n/g(n)] = 1.
Choose τ := t −t0 = logc(f(n)/g(n)) + o(log n) as small as possible such that this lower bound for |It+1| is ≥n/g(n), that is, this lower bound is < n/g(n) for t = t0 +τ. Combining the two conditional probabilities we obtain for all t0 ≤t ≤t0 + τ Pt0[At+1 | At0+1, . . . , At] ≥1 − 1 −(c|It0|)−1/3 c −(t−t0)/3 |It0|−1/3.
Applying Proposition 13 then yields whp |It0+τ+1| ≥n/g(n).
In the second example we make the stronger assumption that we can determine asymptotically the expected number of informed vertices after one round. Here we assume that we begin with a “small” set of informed vertices, say of size √log n, and want to reach a set of size nearly linear in n.
▶Example 15. Assume that there is some c > 1 such that Et [|It+1|] = (1 + o(1))c |It| for all t as long as √log n ≤|It| ≤n/log n. Let At be the event “||It| −Et−1 [|It|]| ≤Et−1 [|It|]2/3” and let t0 be such that |It0| ≥√log n. There is h(n) ∈o(1) such that for c−:= (1 −h(n))c and c+ := (1 + h(n))c we have that Et [|It+1|] ≤c+ |It| and Et [|It+1|] ≥c−|It|. Using this notation, the events At0+1, . . . , At+1 imply together inductively that |It+1| ≤ 1 + Et[|It+1|]−1/3 Et[|It+1|] ≤ 1 + (c−|It0|)−1/3 c+t−t0 |It0| for all t such that the right-hand side is bounded by n/ log n. Moreover, for all such t |It+1| ≥ 1 −Et[|It+1|]−1/3 Et[|It+1|] ≥ 1 −(c−|It0|)−1/3 c−t−t0 |It0|.
Thus, as At only depends on It it follows with (1) Pt0[At+1 | At0+1, . . . , At] ≥1 − 1 −(c−|It0|)−1/3 c−−(t−t0)/3 |It0|−1/3.
Applying Proposition 13 then immediately gives that there is τ1 = logc(n/|It0|) + o(log n) such that whp |It0+τ1| ≤n/ log n. Example 14, setting f = n/√log n and g = log n, gives an additional τ2 = logc(n/|It0|) + o(log n) such that |τ1 −τ2| = o(log n) and whp |It0+τ1| ≤ n log n ≤|It0+τ2|.
R. Daknama, K. Panagiotou, and S. Reisser 36:9 Expander Sequences In this section we collect some important properties of expander sequences that we are going to use later. We start by stating a version of the well-known expander mixing lemma applied to our setting of expander sequences.
▶Lemma 16 ([25, Cor. 2.4]). Let G = (Gn)n∈N = ((Vn, En))n∈N be an expander sequence.
Then for Sn ⊆Vn such that 1 ≤|Sn| ≤n/2 it is e(Sn, Vn\Sn) −∆n|Sn|(n −|Sn|) n = o(∆n)|Sn|.
The following result is a consequence of the Expander Mixing Lemma that applies to graphs in which some edges were removed. It seems very simple but it turns out to be surprisingly useful.
▶Lemma 17. Let G = (Gn)n∈N = ((Vn, En))n∈N be an expander sequence. Let ε > 0 and set ˜ G = ( ˜ Gn)n∈N, where each ˜ Gn it is obtained from Gn by deleting edges such that each vertex keeps at least a (1/2 + ε) fraction of its edges. For each n ∈N let further Sn ⊆Vn, then there is n0 ∈N such that for all n ≥n0 e ˜ Gn(Sn, Vn\Sn) ≥εeGn(Sn, Vn\Sn).
3 Proofs 3.1 Proof of Theorems 4b, 5a – edge deletions do not slow down pull Let 0 < ε ≤1/2. In this section we study the runtime of pull in the case in which the input graph is an expander, and where at each vertex at most an (1/2 −ε) fraction of the edges is deleted. The runtime on expander sequences without edge deletions, that is, the setting in Theorem 4b, is included as the special case where we set ε = 1/2. In contrast to previous proofs, in the analysis of pull the “standard” approach that consists of showing, for example, that Et[|It+1 \ It|] ≈|It| fails. The main reason is that the graph between It and Ut might be quite irregular, so that, depending on the actual state, Et[|It+1 \ It|] ≈c|It| for some c < 1. However, we discover a different invariant that is preserved, namely that the number of edges between It and Ut behaves in an exponential way. With Lemmas 16 and 17 we can then relate this to the number of informed vertices.
▶Lemma 18. Consider the setting of Theorem 5a and let It = I(pull) t .
(a) Let √log n ≤|It| ≤n/ log n. Then |e(Ut+1, It+1) −(1 + q)e(Ut, It)| ≤|It|−1/3e(Ut, It) with probability at least 1 −O(|It|−1/3).
(b) Let |Ut| ≤n/ log n. Then Et[|Ut+1|] = (1 −q + o(1))|Ut|.
Lemma 19 gives a lower bound, that together with an upper bound provided by Lemma 20 imply Theorems 4b and 5a.
▶Lemma 19 (Upper bound in Theorem 5a). Consider the setting of Theorem 5a and let It = I(pull) t , then the following statements hold whp.
(a) Let √log n ≤|It| ≤n/ log n. Then there are τ1, τ2 = log1+q(n/|It|) + o(log n) such that |It+τ2| < n/ log n < |It+τ1|.
(b) Let n/ log n ≤|It| ≤n −n/ log n.
Then there is τ = o(log n) such that |It+τ| > n −n/ log n.
(c) Let |It| ≥n −n/ log n.
1. Case q = 1: Then there is τ = o(log n) such that |It+τ| = n.
2. Case q ̸= 1: Then there is τ ≤−log n/ log (1 −q) + o(log n) such that |It+τ| = n.
ESA 2019 36:10 Robustness of Randomized Rumour Spreading Note that for q = 1 this already implies Theorems 4b and 5a. This leaves the case for q ̸= 1.
▶Lemma 20. Let 0 < ε ≤1/2, q ∈(0, 1] and G = (Gn)n∈N be an expander sequence. Let ˜ G = ( ˜ Gn)n∈N be such that each ˜ Gn is obtained by deleting edges of Gn such that each vertex keeps at least a (1/2+ε) fraction of its edges and abbreviate It = I(pull) t . Let further q ∈(0, 1) and |It| ≤n/2. Then for τ = −log n/ log (1 −q) and all c < 1 whp |It+cτ| < n.
3.2 Proof of Theorem 7a – push informs almost all vertices fast in spite of edge deletions To shorten the notation let us call the setting with deleted edges “new model” and the setting without “old model”, that is, the term new model corresponds to the graphs in ˜ G, while old model refers to the (original) graphs in G. We prove Lemma 21 that directly implies Theorem a. We write It = I(push) t throughout.
▶Lemma 21. Under the assumptions of Theorem 7a the following holds for the new model: (a) There are τ, ˜ τ = log1+q(n) + o(log n) such that whp |I˜ τ| < n/ log n < |Iτ|.
(b) Assume |It| ≥n/ log n. Then there is a τ = o(log n) such that whp |It+τ| ≥n −n/ log n.
For the proof of Lemma 21 we will need the following statements, the first one taken from .
▶Lemma 22 (Proof of Lemma 2.5 in ). Consider the old model. Assume |It| < n/ log n and q = 1. Then Pt |It+1| = |It| + (1 −o(1))|It| = 1 −o(1).
(2) ▶Lemma 23. Consider push on a sequence of graphs (Gn)n∈N, where Gn has n vertices.
Assume that |It| = ω(1) and that (2) holds for q = 1, that is, assume that Pt |It+1| = |It| + (1 −o(1))|It| = 1 −o(1) for q = 1. Then for q ∈(0, 1] Pt |It+1| = |It| + (q −o(1))|It| = 1 −o(1).
(3) Moreover, assume that whenever |It| < n/ log n, for q = 1, (2) holds.
Then there are τ, ˜ τ = log1+q(n) + o(log n) such that whp |I˜ τ| < n/ log n < |Iτ|.
(4) 3.3 Proof of Theorems 5b, 7b – push&pull informs almost all vertices fast in spite of edge deletions Before we show the actual proof we will first present an informal argument that contains all relevant ideas and important observations. Let √log n ≤|It| ≤n/ log n and assume q = 1.
In Section 3.2 we proved that for push the informed vertices nearly double in every round for an arbitrary expander sequence with edge deletions and an otherwise arbitrary set It. For pull this is not true; however, we proved in Section 3.1 that the number of edges between the informed and the uninformed vertices nearly doubles in every round. The first attempt towards the proof of Theorems b, b then seems obvious: one would try to show that either the vertices triple every round, or the the edges do so, or for example that the product of the two quantities increases by a factor of 9. As it turns out, this is in general not the case; indeed, it is possible to choose an expander sequence, to delete edges such that each vertex keeps at least an (1/2 + ε)-fraction of its neighbors, and to choose a (large) set of informed vertices It such that after one round whp either |It+1| < c|It| or e(It+1, Ut+1) < ce(It, Ut) or R. Daknama, K. Panagiotou, and S. Reisser 36:11 |It+1|e(It+1, Ut+1) < c2|It|e(It, Ut) for some c < 3. On the other hand and although we have no explicit description of these “malicious” sets, it seems rather unlikely that such sets will occur several times during the execution of push&pull.
In order to show the claimed running time of push&pull we will impose some additional structure. Let ε > 0. In the subsequent exposition we assume that our graph G – obtained from an expander by deleting edges such that each vertex keeps at least an (1/2 + ε) fraction of the edges – has a very special structure. In particular, we assume that there is a partition Π = (Vi)i∈[k] of the vertex set of G into a bounded number k of equal parts such that EG(Vi) = ∅for all 1 ≤i ≤k and such that the induced subgraph (Vi, Vj) looks like a random regular bipartite graph for all 1 ≤i < j ≤k. Of course, not every relevant G admits such a partition; however, Szemeredi’s regularity lemma guarantees that every sufficiently large graph has a partition that is in a well-defined sense almost like the one described previously, and a substantial part of our proof is concerned with showing that being “almost special” does not hurt significantly.
Assuming that G is very special let us collect some easy facts. Denote the degree of u ∈Vi in the induced subgraph (Vi, Vj) with dij; this immediately gives that dG(u) = Pk ℓ=1 diℓ, and note that dii = 0 as there are no edges in Vi. Moreover, regular bipartite random graphs satisfy an expander property, that is, for all Wi ⊆Vi, Wj ⊆Vj, 1 ≤i < j ≤k we have e(Wi, Wj) = di,j|Wi||Wj|/|Vj| + o(di,j)|Wi| ≈|Wi||Wj|dijk/n where we used that all |Vi|’s are of equal size. This is quite similar to the property that we used in our preceding analysis on expander sequences, see Lemma 16. As a pair in Π behaves like a bipartite expander sequence we can easily compute the expected number of informed vertices. We do so now for pull. Let Ii,j t+1 be the number of vertices in Vi informed after round t + 1 by pull from vertices only in Vj and set Ii t := It ∩Vi, U i t := Ut ∩Vi ∀1 ≤i ≤k.
Thus, as long as Ii t is much smaller than Vi (and thus also U i t ≈|Vi| = n/k) we get Et h I(pull),i,j t+1 \It i = X u∈U i t |N(u) ∩Ij t | d(u) = e(U i t, Ij t ) P 1≤ℓ≤k diℓ ≈ dij P 1≤ℓ≤k diℓ |Ij t |.
A similar calculation, which we don’t perform in detail, yields for push Et h I(push),i,j t+1 \It i ≈ dij P 1≤ℓ≤k dℓj |Ij t |.
Moreover, as in previous proofs it turns out that the number of vertices informed simultan-eously by push as well as pull is negligible. Thus we obtain that more or less Et h I(pp),i,j t+1 i ≈|Ii t| + dij P 1≤ℓ≤k diℓ + dij P 1≤ℓ≤k dℓj !
|Ij t | and by linearity of expectation Et h I(pp),i t+1 i ≈|Ii t| + X 1≤j≤k dij P 1≤ℓ≤k diℓ + dij P 1≤ℓ≤k dℓj !
|Ij t |.
Set Xt = (|Ii t|)i∈[k] and A = (Aij)1≤i,j≤k, the matrix with entries Aij = dij P 1≤ℓ≤k diℓ + dij P 1≤ℓ≤k dℓj for 1 ≤i ̸= j ≤k ESA 2019 36:12 Robustness of Randomized Rumour Spreading and Aii = 1 for 1 ≤i ≤k. With this notation we obtain the recursive relation Et[Xt+1] ≈A · Xt, (5) that is, we may expect that Xt ≈Et[Xt] ≈AtX0. If we then denote by λmax the greatest eigenvalue of A, then we obtain that in leading order |It| ≈λt max.
Our aim is to show that push&pull is (at least) as fast as on the complete graph, that is, |It| ≾3t, and so we take a closer look at the eigenvalues of A. By construction A is symmetric, so that the largest eigenvalue equals sup∥x∥=1 ∥xT Ax∥, and the simple choice x = k−1/21 yields λmax ≥ P (i,j) Ai,j k = Pk j=1 1 + Pk i=1 Pk j=1 dij/ Pk ℓ=1 diℓ + Pk j=1 Pk i=1 dij/ Pk ℓ=1 dℓj k = 3.
This neat property leads us to the expected result Tpp(G) = (1 + o(1)) logλmax n ≤(1 + o(1)) log3 n, and it also completes the informal argument that justifies the claim made in Theorems 5b and 7b. In the unabridged version we turn this argument step by step into a formal proof by filling in all missing pieces.
3.4 Proof of Theorem 6b – edge deletions may slow down push&pull For any 0 < ε < 1/2, q ∈(0, 1) we consider a sequence of graphs (Gn(ε))n∈N = ((Vn, En))n∈N.
Let Vn = An ∪Bn with An := {1, . . . , ⌊n/2⌋}, Bn := {⌊n/2⌋+ 1, . . . , n} and deg(v) = n −1 for all v ∈An. Let the induced subgraph of Bn be a random graph in which each edge is included independently with probability p = 1 −2ε. We know and it is easy to show, see for example [15, Section IV], that whp this subgraph is almost regular, i.e., dBn(v) = (1 + o(1))(1 −2ε)n/2 for all v ∈Bn, (6) and is an expander, which means that for every Sn ⊆Bn, 1 ≤|Sn| ≤n/4 and dBn := (1 −2ε)n/2 we have e(Sn, Bn\Sn) = (1 + o(1))dBn|Sn||Bn \ Sn| |Bn| = (1 −2ε + o(1))|Sn||Bn \ Sn|.
(7) At first we give a statement that describes the expected number of informed vertices after performing one round of push&pull.
▶Lemma 24. Let Gn(ε) = (An ∪Bn, En) be as above.
(a) Let √log n ≤|It| ≤n/ log n and set Xt = I(pp),(A) t , I(pp),(B) t := I(pp) t ∩An , I(pp) t ∩Bn .
Then Et[Xt+1] = (1 + o(1))MXt, where M = 1 + q q 1 + ε/(2 −2ε) q 1 + ε/(2 −2ε) 1 + q 1 −2ε/(2 −2ε) .
(b) Let |U (pp) t | ≤n/ log n. Then Et[|U (pp) t+1 |] ≤(1 + o(1))e−q(1/2+(1/2−ε)/(1−ε)) (1 −q) |Ut|.
R. Daknama, K. Panagiotou, and S. Reisser 36:13 ▶Remark 25. Let λmax be the greatest eigenvalue of M as defined in Lemma 24a. Then λmax = 1 + 2q + (2q( p (ε2/2 −ε + 1) −1) + qε)/(2 −2ε) > 1 + 2q.
Next comes a lemma that bounds the runtime of push&pull on Gn(ε). In particular, Lemma 26 a) and c) provide a lower bound on the runtime and Lemma 26 a), b) and d) provides an upper bound.
▶Lemma 26. Let It = I(pp) t , ε > 0 and λ = λmax(M) be the greatest eigenvalue of M as given in Lemma 24a. Consider Gn(ε).
(a) Let √log n ≤|It| ≤n/ log n. Then there are τ1, τ2 = logλ(n/|It|) + o(log n) such that |It+τ1| < n/ log n < |It+τ1|.
(b) Let n/ log n ≤|It| ≤n −n/ log n.
Then there is τ = o(log n) such that |It+τ| > n −n/ log n.
(c) Let |It| ≤n/ log n. Then there is τ ≥log n/ log((1 −q)−1 exp(q(1/2 + (1/2 −ε)/(1 − ε)))) −o(log n) such that |It+τ| < n.
(d) Let |It| ≥n −n/ log n and q ∈(0, 1). Then there is τ ≤log n/ log((1 −q)−1 exp(q(1/2 + (1/2 −ε)/(1 −ε)))) + o(log n) such that |It+τ| = n.
Lemma 26 gives that Tpp(Gn(ε), q) = logλ n + 1 q(1 −1.5ε)/(1 −ε) −log (1 −q) log n + o(log n) where λ = 1 + 2q + (2q( p (ε2/2 −ε + 1) −1) + qε)/(2 −2ε) > 1 + 2q. To see whether push&pull actually slowed down (in terms of order log n) one has to compare the runtime on this sequence of graphs to cpp(q) log n; the runtime on expander sequences. In the Figure 1 we can see that it slows down for nearly all values of ε and q in question; however, there are admissible values of ε and q such that the process even speeds up.
0.9 0.92 0.94 0.96 0.98 1 0 0.2 0.4 −2 0 2 q ε 100 · ∆ Figure 1 Plotted values of ∆in Tpp(Gn(ε), q) −cpp log n = ∆log n + o(log n), for 0.9 < q < 1 and 0 < ε < 1/2.
ESA 2019 36:14 Robustness of Randomized Rumour Spreading References 1 Hüseyin Acan, Andrea Collevecchio, Abbas Mehrabian, and Nick Wormald. On the push&pull protocol for rumour spreading. In Extended Abstracts Summer 2015, pages 3–10. Springer, 2017.
2 Omer Angel, Abbas Mehrabian, and Yuval Peres. The string of diamonds is tight for rumor spreading. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2017.
3 Stéphane Boucheron, Gábor Lugosi, and Olivier Bousquet. Concentration inequalities. In Advanced Lectures on Machine Learning, pages 208–240. Springer, 2004.
4 Stephen Boyd, Arpita Ghosh, Balaji Prabhakar, and Devavrat Shah. Randomized gossip algorithms. IEEE/ACM Transactions on Networking (TON), 14(SI):2508–2530, 2006.
5 Keren Censor-Hillel, Bernhard Haeupler, Jonathan Kelner, and Petar Maymounkov. Global computation in a poorly connected world: fast rumor spreading with no dependence on con-ductance. In Proceedings of the forty-fourth annual ACM symposium on Theory of computing, pages 961–970. ACM, 2012.
6 Flavio Chierichetti, George Giakkoupis, Silvio Lattanzi, and Alessandro Panconesi. Rumor Spreading and Conductance. Journal of the ACM (JACM), 65(4):17, 2018.
7 Sebastian Daum, Fabian Kuhn, and Yannic Maus. Rumor Spreading with Bounded In-Degree.
In Structural Information and Communication Complexity - 23rd International Colloquium, SIROCCO 2016, Helsinki, Finland, July 19-21, 2016, Revised Selected Papers, pages 323–339, 2016. doi:10.1007/978-3-319-48314-6_21.
8 Domingos Dellamonica, Yoshiharu Kohayakawa, Martin Marciniszyn, and Angelika Steger.
On the Resilience of Long Cycles in Random Graphs. Electr. J. Comb., 15(1), 2008. URL:
9 Alan Demers, Dan Greene, Carl Houser, Wes Irish, John Larson, Scott Shenker, Howard Sturgis, Dan Swinehart, and Doug Terry. Epidemic algorithms for replicated database maintenance.
ACM SIGOPS Operating Systems Review, 22(1):8–32, 1988.
10 Benjamin Doerr, Mahmoud Fouz, and Tobias Friedrich. Social networks spread rumors in sublogarithmic time. In Proceedings of the forty-third annual ACM symposium on Theory of computing, pages 21–30. ACM, 2011.
11 Benjamin Doerr and Anatolii Kostrygin. Randomized Rumor Spreading Revisited. In 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, pages 138:1–138:14, 2017. doi:10.4230/LIPIcs.ICALP.2017.138.
12 Benjamin Doerr and Marvin Künnemann. Tight analysis of randomized rumor spreading in complete graphs. In Proceedings of the Meeting on Analytic Algorithmics and Combinatorics, pages 82–91. Society for Industrial and Applied Mathematics, 2014.
13 Robert Elsässer and Thomas Sauerwald. On the runtime and robustness of randomized broadcasting. Theoretical Computer Science, 410(36):3414–3427, 2009.
14 Uriel Feige, David Peleg, Prabhakar Raghavan, and Eli Upfal. Randomized broadcast in networks. Random Structures & Algorithms, 1(4):447–460, 1990.
15 Nikolaos Fountoulakis, Anna Huber, and Konstantinos Panagiotou. Reliable broadcasting in random networks and the effect of density. In 2010 Proceedings IEEE INFOCOM, pages 1–9.
IEEE, 2010.
16 Nikolaos Fountoulakis and Konstantinos Panagiotou. Rumor spreading on random regular graphs and expanders. In Approximation, Randomization, and Combinatorial Optimization.
Algorithms and Techniques, pages 560–573. Springer, 2010.
17 Nikolaos Fountoulakis, Konstantinos Panagiotou, and Thomas Sauerwald. Ultra-fast rumor spreading in social networks. In Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms, pages 1642–1660. SIAM, 2012.
R. Daknama, K. Panagiotou, and S. Reisser 36:15 18 Tobias Friedrich, Thomas Sauerwald, and Alexandre Stauffer. Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions. Algorithmica, 67(1):65–88, September 2013. doi:10.1007/s00453-012-9710-y.
19 Alan M Frieze and Geoffrey R Grimmett. The shortest-path problem for graphs with random arc-lengths. Discrete Applied Mathematics, 10(1):57–77, 1985.
20 George Giakkoupis. Tight bounds for rumor spreading in graphs of a given conductance. In 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, pages 57–68, 2011. doi:10.4230/LIPIcs.STACS.2011.57.
21 George Giakkoupis.
Tight Bounds for Rumor Spreading with Vertex Expansion.
In Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014, pages 801–815, 2014.
doi: 10.1137/1.9781611973402.59.
22 Bernhard Haeupler. Simple, fast and deterministic gossip and rumor spreading. Journal of the ACM (JACM), 62(6):47, 2015.
23 Shlomo Hoory, Nathan Linial, and Avi Wigderson. Expander graphs and their applications.
Bulletin of the American Mathematical Society, 43(4):439–561, 2006.
24 Richard M. Karp, Christian Schindelhauer, Scott Shenker, and Berthold Vöcking. Randomized Rumor Spreading. In 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pages 565–574, 2000. doi: 10.1109/SFCS.2000.892324.
25 Konstantinos Panagiotou, Xavier Pérez-Giménez, Thomas Sauerwald, and He Sun. Randomized Rumour Spreading: The Effect of the Network Topology.
Combinatorics, Probability & Computing, 24(2):457–479, 2015. doi:10.1017/S0963548314000194.
26 Konstantinos Panagiotou and Leo Speidel. Asynchronous rumor spreading on random graphs.
Algorithmica, 78(3):968–989, 2017.
27 Vojtěch Rödl and Mathias Schacht. Regularity lemmas for graphs. In Fete of combinatorics and computer science, pages 287–325. Springer, 2010.
28 Benny Sudakov and Van H. Vu. Local resilience of graphs. Random Struct. Algorithms, 33(4):409–433, 2008. doi:10.1002/rsa.20235.
ESA 2019 |
14182 | https://www.quora.com/How-do-I-solve-identities-questions-in-class-10-trigonometry-I-try-my-best-to-understand-but-I-just-cant-I-dont-know-what-to-do-when-and-where-like-solving-LHS-and-then-RHS-how-will-I-know | Something went wrong. Wait a moment and try again.
Trigonometric Expressions
Solving Problems
Maths Class 10
Exam Questions
Mathematical Identities
Trigonometric Functions
5
How do I solve identities questions in class 10 trigonometry? I try my best to understand but I just can't. I don't know what to do when and where, like solving LHS and then RHS, how will I know?
Dodie Cowan
Former Professor of Mathematics at Polk State College (2004–2015)
·
Author has 2.2K answers and 1.3M answer views
·
5y
It is somewhat of a general question, especially since the answer is not the same in all cases. You are being asked to prove that a statement is an identity (always true) and that involves showing that the LHS=the RHS. There are a few hints that I can give you, but you should know at this point that the approach is not the same in all cases, and that is, no doubt, why you are frustrated. The best advice I can give you is PRACTICE.
Since the approach is different depending on the situation, being exposed to as many different situations as possible and trying to work them out is the best advice.
It is somewhat of a general question, especially since the answer is not the same in all cases. You are being asked to prove that a statement is an identity (always true) and that involves showing that the LHS=the RHS. There are a few hints that I can give you, but you should know at this point that the approach is not the same in all cases, and that is, no doubt, why you are frustrated. The best advice I can give you is PRACTICE.
Since the approach is different depending on the situation, being exposed to as many different situations as possible and trying to work them out is the best advice. PRACTICE, PRACTICE, PRACTICE!
Here are some approaches:
Begin with one side and work on rearranging it and combining it to simplify it as much as you can. When you can’t do any more, go to the other side and work to rearrange and simplify it.
You should try to use definitions of the trig functions or one of the Pythagorean identities to assist you in your simplifications. This requires that you be VERY familiar with the definitions you have been taught, so that you recognize them when you see them. When you have sum and difference formulas for the trig functions, they also become an important part of your tool box.
If you cannot see any better way to simplify the expressions, try changing both sides so that they are in terms of just sines and cosines. Sometimes the simplification becomes more apparent when they are both in those terms.
Related questions
How can I solve trigonometric identities easily? I m finding it very difficult.
I am unable to understand trigonometry of class 10. what should I do so it can become easier for me to understand it?
How do I solve questions based on trigonometric identities in Class 10? I do not understand how to start solving the questions.
What's the best way to understand and study trigonometry in Class 10?
Which trigonometric identity is toughest to solve for 10th class student?
Dean Rubine
25 years as a student, a few more as a professor
·
Author has 10.6K answers and 23.7M answer views
·
5y
Trig Identities are like crossword puzzles; some people love them, some people hate them, and they’re mostly useless. Like with crossword puzzles there’s a bunch of trivia to memorize (at least with trig you can look it up) and the only way to really get better is to practice.
There’s not really a set procedure beyond trying things and pushing those symbols around until you see the answer. If you work for a while and don’t get an answer, try substituting in some common angles and make sure the identity is actually true for them. A counterexample is even better than a proof.
Most trig identities
Trig Identities are like crossword puzzles; some people love them, some people hate them, and they’re mostly useless. Like with crossword puzzles there’s a bunch of trivia to memorize (at least with trig you can look it up) and the only way to really get better is to practice.
There’s not really a set procedure beyond trying things and pushing those symbols around until you see the answer. If you work for a while and don’t get an answer, try substituting in some common angles and make sure the identity is actually true for them. A counterexample is even better than a proof.
Most trig identities are done by starting from the more complicated looking side, turning the trig functions into sines and cosines, applying known trig identities and simplifying according to the usual rules, hopefully arriving at the other side. It really helps to be good at algebra — that’s often where students have their difficulties. For complicated ones it’s often best to work on sub-expressions and then put it all together.
The hardest parts are knowing the available identities to apply and choosing the most helpful one. Here are some rules of thumb.
The most common identity to apply is the trig Pythagorean Theorem:
cos2x+sin2x=1
The sum angle formulas are probably second most common.
cos(x+y)=cosxcosy−sinxsiny
sin(x+y)=sinxcosy+cosxsiny
There are a whole bunch of formulas derived from these that you should also know, the main ones being the double angle formulas:
cos(2x)=cos2x−sin2x=2cos2x−1=1−2sin2x
sin(2x)=2sinxcosx
Note there are three versions of the cosine double angle formula, all useful. Picking the correct one appropriate to your problem is a bit of an art.
There are also the difference angle formulas, and the sum of sines, and the sum of cosines, all useful to know, but they can be derived from sum angle as needed.
One pro tip is to prefer cosine forms over sine forms, all else equal.
Let’s do a random one to end this. I’ll type “trig identity” into Quora search and do the first one that comes up.
How do I prove this trig identity
sina+sin3a+sin5acosa+cos3a+cos5a=tan3a
It couldn’t have been an easy one, could it? OK, this is real life, sort of. The left side is more complicated, we start there.
We have multiple angle forms crying out for an identity. We see trig functions of a,3a and 5a. Let’s try sum angle on 3a±2a.
That’s the voice of experience; 5a is unusual, 2a and 3a much more common. 3a appears in the problem, so we head toward known ground.
cos(3a+2a)=cos3acos2a−sin3asin2a
cos(3a−2a)=cos3acos2a+sin3asin2a
Adding,
cos5a+cosa=2cos3acos2a
OK, that seems like progress, let’s do the same for sine.
sin(3a+2a)=sin3acos2a+cos3asin2a
sin(3a−2a)=sin3acos2a−cos3asin2a
sin5a+sina=2sin3acos2a
OK, let’s see where we are,
sina+sin3a+sin5acosa+cos3a+cos5a
=2sin3acos2a+sin3a2cos3acos2a+cos3a
=sin3a(2cos2a+1)cos3a(2cos2a+1)
=sin3acos3a
=tan3a✓
Well that was pretty simple once we took the correct first step. It’s experience or trial and error that gets that first step, so practice, practice, practice.
Assistant
Bot
·
1y
Understanding trigonometric identities can be challenging, but with the right approach, you can improve your skills. Here’s a step-by-step guide to help you navigate through identities questions in Class 10 trigonometry:
Understand Basic Trigonometric Identities
Familiarize yourself with the fundamental identities, as they form the basis for solving more complex identities. Here are some key ones:
Pythagorean Identities:
sin2θ+cos2θ=1
1+tan2θ=sec2θ
1+cot2θ=csc2θ
Reciprocal Identities:
sinθ=1cscθ
\cos \theta = \frac{
Understanding trigonometric identities can be challenging, but with the right approach, you can improve your skills. Here’s a step-by-step guide to help you navigate through identities questions in Class 10 trigonometry:
Understand Basic Trigonometric Identities
Familiarize yourself with the fundamental identities, as they form the basis for solving more complex identities. Here are some key ones:
Pythagorean Identities:
sin2θ+cos2θ=1
1+tan2θ=sec2θ
1+cot2θ=csc2θ
Reciprocal Identities:
sinθ=1cscθ
cosθ=1secθ
tanθ=1cotθ
Quotient Identities:
tanθ=sinθcosθ
cotθ=cosθsinθ
Choose a Side to Start
When proving an identity, you can start with either the Left-Hand Side (LHS) or the Right-Hand Side (RHS). Here are some tips:
Start with the more complicated side: If one side looks more complex than the other, start there. This often helps in simplifying it down to the simpler side.
Look for opportunities to simplify: Use algebraic manipulation, such as factoring, expanding, or combining fractions.
Transformations and Simplifications
Use Basic Identities: Substitute known identities where applicable.
Convert to Sine and Cosine: Sometimes, converting everything to sine and cosine can make it easier to see how the two sides relate.
Common Techniques
Factoring: If you see a quadratic form, try factoring it.
Multiplying by Conjugates: This can help eliminate complex fractions.
Common Denominators: When dealing with fractions, finding a common denominator can simplify the expression.
Practice Examples
Try solving some common identities. For example:
Example 1:
Prove: sin2x+cos2x=1
Solution:
- Start with LHS: sin2x+cos2x
- Recognize this is a fundamental identity, so LHS = RHS.
Example 2:
Prove: 1−cos2xsin2x=1
Solution:
- Start with LHS: 1−cos2xsin2x
- Use the Pythagorean identity sin2x=1−cos2x.
- Substitute to get sin2xsin2x=1, which is RHS.
Practice, Practice, Practice
The more you practice, the better you’ll become. Use textbooks, online resources, and past exam papers to find various identity problems to work on.
Seek Help When Needed
If you’re still struggling, consider asking a teacher or a peer for help. Sometimes a different explanation can make things click.
Summary
To solve trigonometric identities, start with familiar identities, choose a side to simplify, use algebraic manipulation, and practice regularly. With time and effort, you will gain confidence in solving these problems!
Chinmay Karlekar
University student
·
Author has 65 answers and 124.7K answer views
·
6y
Originally Answered: How can I solve trigonometric identities-based questions more easily in class 10?
·
I agree that remembering trigonometric identities can be a bit difficult.
What you should do is read the identities over and over. Find striking features or tricks to remember them as you do so.
Alongside this, get a NCERT textbook and solve questions from it. Do not take help of the readymade solutions while doing this. Consult a teacher for problems you can't solve.
With practice you will be able to know which identities are applicable for which type of questions. The questions will seem easy then.
Note: Your own board book problems will also be quite sufficient. I suggested NCERT because it is
I agree that remembering trigonometric identities can be a bit difficult.
What you should do is read the identities over and over. Find striking features or tricks to remember them as you do so.
Alongside this, get a NCERT textbook and solve questions from it. Do not take help of the readymade solutions while doing this. Consult a teacher for problems you can't solve.
With practice you will be able to know which identities are applicable for which type of questions. The questions will seem easy then.
Note: Your own board book problems will also be quite sufficient. I suggested NCERT because it is one of the best and has numerous questions.
Class 10 trigonometric identities are way easier than higher secondary. So relax and follow the above steps. All will be great.
Hope this helps.
Related questions
Can you provide the solution of trigonometry class 10?
Which is the best book of maths for 11 and 12 CBSE?
Which is the most difficult question of trigonometric proving for class 10?
How do I master trigonometric identity questions for class 10?
How much time does it take to learn JEE maths from scratch? I am in 11th end and haven’t studied a word. Which chapters should I start now if I am preparing for the JEE 2022?
Sangha
Software Engineer at PubMatic (2021–present)
·
Author has 263 answers and 609.1K answer views
·
8y
Originally Answered: How do I solve questions based on trigonometric identities in Class 10? I do not understand how to start solving the questions.
·
See in class 10 there are 3 main identities sometimes the reciprocal of the function helps.
The game is between them only .
Try to memorize all these first.
Then if want to prove two equation : one has cos sin and on other side there is tan sec cot or cosec , then change all the terms in tan cot expression to sin and cos sometimes this gives you answer directly .
Sometimes you may have to rationalize or use algebraic identities such as (a^2 - b^2) or something like that.
You can also solve both the equation simultaneously and bring them to one conclusion.
Hope it helps….. and doubts you can send me
See in class 10 there are 3 main identities sometimes the reciprocal of the function helps.
The game is between them only .
Try to memorize all these first.
Then if want to prove two equation : one has cos sin and on other side there is tan sec cot or cosec , then change all the terms in tan cot expression to sin and cos sometimes this gives you answer directly .
Sometimes you may have to rationalize or use algebraic identities such as (a^2 - b^2) or something like that.
You can also solve both the equation simultaneously and bring them to one conclusion.
Hope it helps….. and doubts you can send me questions.
Promoted by The Penny Hoarder
Lisa Dawson
Finance Writer at The Penny Hoarder
·
Updated Sep 16
What's some brutally honest advice that everyone should know?
Here’s the thing: I wish I had known these money secrets sooner. They’ve helped so many people save hundreds, secure their family’s future, and grow their bank accounts—myself included.
And honestly? Putting them to use was way easier than I expected. I bet you can knock out at least three or four of these right now—yes, even from your phone. Don’t wait like I did.
Cancel Your Car Insurance
You might not even realize it, but your car insurance company is probably overcharging you. In fact, they’re kind of counting on you not noticing. Luckily, this problem is easy to fix.
Don’t waste your time
Here’s the thing: I wish I had known these money secrets sooner. They’ve helped so many people save hundreds, secure their family’s future, and grow their bank accounts—myself included.
And honestly? Putting them to use was way easier than I expected. I bet you can knock out at least three or four of these right now—yes, even from your phone. Don’t wait like I did.
Cancel Your Car Insurance
You might not even realize it, but your car insurance company is probably overcharging you. In fact, they’re kind of counting on you not noticing. Luckily, this problem is easy to fix.
Don’t waste your time browsing insurance sites for a better deal. A company calledInsurify shows you all your options at once — people who do this save up to $996 per year.
If you tell them a bit about yourself and your vehicle, they’ll send you personalized quotes so you can compare them and find the best one for you.
Tired of overpaying for car insurance? It takes just five minutes to compare your options with Insurify andsee how much you could save on car insurance.
Ask This Company to Get a Big Chunk of Your Debt Forgiven
A company calledNational Debt Relief could convince your lenders to simply get rid of a big chunk of what you owe. No bankruptcy, no loans — you don’t even need to have good credit.
If you owe at least $10,000 in unsecured debt (credit card debt, personal loans, medical bills, etc.), National Debt Relief’s experts will build you a monthly payment plan. As your payments add up, they negotiate with your creditors to reduce the amount you owe. You then pay off the rest in a lump sum.
On average, you could become debt-free within 24 to 48 months. It takes less than a minute to sign up and see how much debt you could get rid of.
Set Up Direct Deposit — Pocket $300
When you set up direct deposit withSoFi Checking and Savings (Member FDIC), they’ll put up to $300 straight into your account. No… really. Just a nice little bonus for making a smart switch.
Why switch? With SoFi, you can earn up to 3.80% APY on savings and 0.50% on checking, plus a 0.20% APY boost for your first 6 months when you set up direct deposit or keep $5K in your account. That’s up to 4.00% APY total. Way better than letting your balance chill at 0.40% APY.
There’s no fees. No gotchas.Make the move to SoFi and get paid to upgrade your finances.
You Can Become a Real Estate Investor for as Little as $10
Take a look at some of the world’s wealthiest people. What do they have in common? Many invest in large private real estate deals. And here’s the thing: There’s no reason you can’t, too — for as little as $10.
An investment called the Fundrise Flagship Fund lets you get started in the world of real estate by giving you access to a low-cost, diversified portfolio of private real estate. The best part? You don’t have to be the landlord. The Flagship Fund does all the heavy lifting.
With an initial investment as low as $10, your money will be invested in the Fund, which already owns more than $1 billion worth of real estate around the country, from apartment complexes to the thriving housing rental market to larger last-mile e-commerce logistics centers.
Want to invest more? Many investors choose to invest $1,000 or more. This is a Fund that can fit any type of investor’s needs. Once invested, you can track your performance from your phone and watch as properties are acquired, improved, and operated. As properties generate cash flow, you could earn money through quarterly dividend payments. And over time, you could earn money off the potential appreciation of the properties.
So if you want to get started in the world of real-estate investing, it takes just a few minutes tosign up and create an account with the Fundrise Flagship Fund.
This is a paid advertisement. Carefully consider the investment objectives, risks, charges and expenses of the Fundrise Real Estate Fund before investing. This and other information can be found in the Fund’s prospectus. Read them carefully before investing.
Cut Your Phone Bill to $15/Month
Want a full year of doomscrolling, streaming, and “you still there?” texts, without the bloated price tag? Right now, Mint Mobile is offering unlimited talk, text, and data for just $15/month when you sign up for a 12-month plan.
Not ready for a whole year-long thing? Mint’s 3-month plans (including unlimited) are also just $15/month, so you can test the waters commitment-free.
It’s BYOE (bring your own everything), which means you keep your phone, your number, and your dignity. Plus, you’ll get perks like free mobile hotspot, scam call screening, and coverage on the nation’s largest 5G network.
Snag Mint Mobile’s $15 unlimited deal before it’s gone.
Get Up to $50,000 From This Company
Need a little extra cash to pay off credit card debt, remodel your house or to buy a big purchase?
We found a company willing to help.
Here’s how it works: If your credit score is at least 620, AmONE can help you borrow up to $50,000 (no collateral needed) with fixed rates starting at 6.40% and terms from 6 to 144 months.
AmONE won’t make you stand in line or call a bank. And if you’re worried you won’t qualify, it’s free tocheck online. It takes just two minutes, and it could save you thousands of dollars.
Totally worth it.
Get Paid $225/Month While Watching Movie Previews
If we told you that you could get paid while watching videos on your computer, you’d probably laugh.
It’s too good to be true, right?
But we’re serious. By signing up for a free account with InboxDollars, you could add up to $225 a month to your pocket. They’ll send you short surveys every day, which you can fill out while you watch someone bake brownies or catch up on the latest Kardashian drama.
No, InboxDollars won’t replace your full-time job, but it’s something easy you can do while you’re already on the couch tonight, wasting time on your phone.
Unlike other sites, InboxDollars pays you in cash — no points or gift cards. It’s already paid its users more than $56 million.
Signing up takes about one minute, and you’ll immediately receive a $5 bonus to get you started.
Earn $1000/Month by Reviewing Games and Products You Love
Okay, real talk—everything is crazy expensive right now, and let’s be honest, we could all use a little extra cash. But who has time for a second job?
Here’s the good news. You’re already playing games on your phone to kill time, relax, or just zone out. So why not make some extra cash while you’re at it?
WithKashKick, you can actually get paid to play. No weird surveys, no endless ads, just real money for playing games you’d probably be playing anyway. Some people are even making over $1,000 a month just doing this!
Oh, and here’s a little pro tip: If you wanna cash out even faster, spending $2 on an in-app purchase to skip levels can help you hit your first $50+ payout way quicker.
Once you’ve got $10, you can cash out instantly through PayPal—no waiting around, just straight-up money in your account.
Seriously, you’re already playing—might as well make some money while you’re at it.Sign up for KashKick and start earning now!
Dip Bhattacharya
M.S + Ed D in Mathematics & Secondary Math Education, Clarion University Of Pennsylvania (Graduated 1982)
·
Author has 3.1K answers and 2M answer views
·
5y
Other people have written well on this , I agree with them 100% on Practice. You should also remember ( with reason ) as many identities as possible , so that you could use them when needed.
How may ways can you write 1
1 = sin^2 A + Cos^2 A
1 = Sec^A - tan^2 A
1 = Cosec^2 A - cot^2A
1 = SinA Cosec A
1 = tanA cotA
1 = cosA secA and more
Srishti Singhal
6y
Originally Answered: How can I solve trigonometric identities-based questions more easily in class 10?
·
Okay. So, I believe you are an Indian (according to your name). And since I am from India too I have recently developed this habit of studying online so I would suggest you that too. There's this youtube channel called “Dear Sir” they have almost all the topics of mathematics explained really well. Though the teacher is a little funny but his teaching techniques are amazing. And he explains in both the languages Hindi as well as English. So I would suggest you to give it a shot. It's the most affordable and easy way for everyone trying to learn something.
Loads of love
Sponsored by Morgan & Morgan, P.A.
How do you know if you qualify for a claim?
We’ve helped hundreds of thousands of people with their injury claims. Do you have a case?
Koushik Jhade
Studied at FIITJEE, Bhopal
·
Author has 136 answers and 135.6K answer views
·
4y
Related
What are the important formulas of trigonometry for class 11?
Co-function identities
:
sin(90°−x) = cos x
cos(90°−x) = sin x
tan(90°−x) = cot x
cot(90°−x) = tan x
sec(90°−x) = cosec x
cosec(90°−x) = sec x
Periodicity identities
:
sin (π/2 – A) = cos A & cos (π/2 – A) = sin A
sin (π/2 + A) = cos A & cos (π/2 + A) = – sin A
sin (3π/2 – A) = – cos A & cos (3π/2 – A) = – sin A
sin (3π/2 + A) = – cos A & cos (3π/2 + A) = sin A
sin (π – A) = sin A & cos (π – A) = – cos A
sin (π + A) = – sin A & cos (π + A) = – cos A
sin (2π – A) = – sin A & cos (2π – A) = cos A
sin (2π + A) = sin A & cos (2π + A) = cos A
Sum & Difference Identities:
sin(x+y) = sin(x)cos(y)+cos(x)sin(y)
cos(x+y) =
Co-function identities:
sin(90°−x) = cos x
cos(90°−x) = sin x
tan(90°−x) = cot x
cot(90°−x) = tan x
sec(90°−x) = cosec x
cosec(90°−x) = sec x
Periodicity identities:
sin (π/2 – A) = cos A & cos (π/2 – A) = sin A
sin (π/2 + A) = cos A & cos (π/2 + A) = – sin A
sin (3π/2 – A) = – cos A & cos (3π/2 – A) = – sin A
sin (3π/2 + A) = – cos A & cos (3π/2 + A) = sin A
sin (π – A) = sin A & cos (π – A) = – cos A
sin (π + A) = – sin A & cos (π + A) = – cos A
sin (2π – A) = – sin A & cos (2π – A) = cos A
sin (2π + A) = sin A & cos (2π + A) = cos A
Sum & Difference Identities:
sin(x+y) = sin(x)cos(y)+cos(x)sin(y)
cos(x+y) = cos(x)cos(y)–sin(x)sin(y)
tan(x+y) = (tan x + tan y)/ (1−tan x •tan y)
sin(x–y) = sin(x)cos(y)–cos(x)sin(y)
cos(x–y) = cos(x)cos(y) + sin(x)sin(y)
tan(x−y) = (tan x–tan y)/ (1+tan x • tan y)
Double Angle Identities:
sin(2x) = 2sin(x) • cos(x) = [2tan x/(1+tan2 x)]
cos(2x) = cos2(x)–sin2(x) = [(1-tan2 x)/(1+tan2 x)]
cos(2x) = 2cos2(x)−1 = 1–2sin2(x)
tan(2x) = [2tan(x)]/ [1−tan2(x)]
sec (2x) = sec2 x/(2-sec2 x)
cosec (2x) = (sec x. cosec x)/2
Triple Angle Identities:
Sin 3x = 3sin x – 4sin3x
Cos 3x = 4cos3x-3cos x
Tan 3x = [3tanx-tan3x]/[1-3tan2x]
Product identities:
sinx⋅cosy=[sin(x+y)+sin(x−y)]/2
cosx⋅cosy=[cos(x+y)+cos(x−y)]/2
sinx⋅siny=[cos(x−y)−cos(x+y)]/2
Sum to Product Identities:
sinx+siny=2sin([x+y]/2)cos([x−y]/2)
sinx−siny=2cos([x+y]/2)sin([x−y]/2)
cosx+cosy=2cos([x+y]/2)cos([x−y]/2)
cosx−cosy=−2sin([x+y]/2)sin([x−y]/2)
Here you go. All the formulae.
Please do upvote. It took a lot of time to write.
Paramjeet Singh
Reader and an Avid Writer
·
Author has 1.3K answers and 853.6K answer views
·
5y
Trigonometry is a Chapter Which Needs Very Much Practice
Same Thing had Happened with me that I did not Know Solving LHS and RHS
But this Doubt Can be Cleared by Practice Only
Also Watch Some Youtube Videos
Do NCERT then Move to RD Sharma
Best of Luck!
Promoted by Webflow
Metis Chan
Works at Webflow
·
Feb 4
Which HTML editor is the best for web development?
With the various HTML editors available today there are several considerations to keep in mind when deciding on which is the right fit for your company including ease of use, SEO controls, high performance hosting, flexible content management tools and scalability. Webflow offers all those features and allows you to experience the power of code – without writing it.
You can take control of HTML5, CSS3, and JavaScript in a completely visual canvas — and let Webflow translate your design into clean, semantic code that’s ready to publish to the web, or hand off to developers.
If you prefer more cus
With the various HTML editors available today there are several considerations to keep in mind when deciding on which is the right fit for your company including ease of use, SEO controls, high performance hosting, flexible content management tools and scalability. Webflow offers all those features and allows you to experience the power of code – without writing it.
You can take control of HTML5, CSS3, and JavaScript in a completely visual canvas — and let Webflow translate your design into clean, semantic code that’s ready to publish to the web, or hand off to developers.
If you prefer more customization you can also expand the power of Webflow by adding custom code on the page, in the , or before the of any page.
Trusted by 200,000+ leading organizations – Get started for free today!
Get started for free today!
Soumen Paul
Studied at TRM Public School Modinagar (Graduated 2019)
·
6y
Originally Answered: How do I master trigonometric identity questions for class 10?
·
Its good you are concerned about this,
For trigonometry identity, all you need is practice and all the general identities should be on your tip first.
If you can do R.S Agarwal for trigo, you will surely score full in that topic in boards exam too.
Thanks.
Wowbhaiya
NIT aspirant
·
6y
Originally Answered: How do I solve questions related to trigonometric identities? I need some tips so that I can prepare for class 10 board exams.
·
First be calm and read the question twice
Then copy it down
Think which method will be applicable in your mind
Solve the sum mentaly and write down the correct method
Dean Rubine
Been doing high school math since high school, circa 1975
·
Author has 10.6K answers and 23.7M answer views
·
2y
Related
How do you build intuition for dealing with trig identities such as double angle identities? I know how to apply them, but how can I really understand them?
You have to turn them from trigonometry to algebra, and ultimately, arithmetic.
The cosine double angle formula has three forms; of particular interest is the one that takes as input a cosine, and outputs a cosine. It lets us talk about angles without actually having to compute them, which is good, because computationally they can usually only be approximated.
cos2t=cos2t−sin2t=1−2sin2t=2cos2t−1
The Chebyshev Polynomials of the First Kind, Tn(x), satisfy cosnt=Tn(cost). They’re the multiple angle formulas that input and output cosines. From \cos 2t = 2 \cos ^
You have to turn them from trigonometry to algebra, and ultimately, arithmetic.
The cosine double angle formula has three forms; of particular interest is the one that takes as input a cosine, and outputs a cosine. It lets us talk about angles without actually having to compute them, which is good, because computationally they can usually only be approximated.
cos2t=cos2t−sin2t=1−2sin2t=2cos2t−1
The Chebyshev Polynomials of the First Kind, Tn(x), satisfy cosnt=Tn(cost). They’re the multiple angle formulas that input and output cosines. From cos2t=2cos2t−1 we write
T2(x)=2x2−1
From cos0t=1 and cos1t=cost we can back up and write
T0(x)=1,T1(x)=x
We can continue to turn trig into algebra by determining the iteration that lets us compute any cosine multiple angle formula as a polynomial. It’s pretty straightforward:
cos((n−1)t)=cos(nt−t)=cosntcost+sinntsint
cos((n+1)t)=cos(nt+t)=cosntcost−sinntsint
cos((n−1)t)+cos((n+1)t)=2cosntcost
cos((n+1)t)=2costcosnt−cos((n−1)t)
Tn+1(cost)=2costTn(cost)−Tn−1(cost)
Tn+1(x)=2xTn(x)−Tn−1(x)
That’s the machine we need to calculate any multiple angle formula. Iterate this:
T0(x)=1,T1(x)=x,Tn+1(x)=2xTn(x)−Tn−1(x)
T2(x)=2xT1(x)−T0(x)=2x2−1✓
T3(x)=2xT2(x)−T1(x)=2x(2x2−1)−x=4x3−3x
That says cos3t=4cos3t−3cost, which is true.
T4(x)=2xT3(x)−T2(x)=2x(4x3−3x)−(2x2−1)=8x4−8x2+1
That says cos4t=8cos4t−8cos2t+1.
Since cos((mn)t)=cos(m(nt)) we have
T(mn)(x)=Tm(Tn(x))
Let’s verify for m=n=2.
T4(x)=T2(T2(x))=T2(2x2−1)−1=2(2x2−1)2−1=2(4x4−4x2+1)−1=8x4−8x2+1✓
That’s getting deep, but we can go deeper, into the arithmetic of complex numbers. We all know multiplying complex numbers adds their angles. So squaring a complex number doubles its angle.
It’s incredible to me that long before cosines and √−1 and even algebra, Euclid knew how to square a complex number, and knew that by doing so, he’d knew it would turn a right triangle with natural legs (but not necessarily a natural hypotenuse) into a right triangle with natural legs and a natural hypotenuse, i.e. it would generate Pythagorean Triples. He almost discovered that if an angle has a rational tangent, twice the angle has a rational sine and cosine, even though he didn’t know about trigonometry, complex multiplication, or that his recipe for Triples was doubling an angle.
Euclid’s recipe for Primitive Pythagorean Triples says to choose coprime natural numbers m>n, with m−n odd, then
a=m2−n2,b=2mn,c=m2+n2
is a Primitive Pythagorean Triple, and all such Triples are of this form. Primitive means a,b and c have no common factors, which implies pairwise they have no common factors.
What Euclid is doing is squaring a Gaussian Integer, a complex number whose parts are integers:
(m+ni)2=(m2−n2)+2mni,|(m+ni)2|=m2+n2
Of course
(|m+ni|2)2=|(m+ni)2|2
(|m+ni|2)2=|(m2−n2)+2mni|2
(m2+n2)2=(m2−n2)2+(2mn)2
c2=a2+b2✓
If we get Pythagorean Triples by squaring natural legged right triangles, we should be able to “take the square root” of Pythagorean Triples to get natural legged right triangles.
In fact we should be able to factor each triple two different way, by considering half of each acute angle.
Let’s go the other way and just start squaring small Gaussian Integers.
(2+i)2=3+4i
Right away we discover that twice the small acute angle in the right triangle with legs 2 and 1 is the large acute angle in the 3/4/5 right triangles. Informally, squaring the 2x1 right triangle gives the 3/4/5 right triangle. Let’s move on.
(3+i)2=8+6i=2(4+3i)
Here we didn’t get a primitive triple, but we did learn something, that twice the smallest angle in the 3x1 right triangle is the smallest angle in the 3/4/5 triangle.
New facts about our old friend, the 3/4/5 right triangle. We’re getting a bit deep now.
What’s the relation between our two square rooted right triangles 2x1 and 3x1, each of which contributes to the 3/4/5 triple? If twice their angles add to 90∘, their angles must add to 45∘. I call them isoplementary because their angles add to the isosceles right triangle angle.
As arithmetic, that manifests as:
(2+i)(3+i)=5+5i=5(1+i)
Equal positive real and imaginary part, multiple of 1+i, that’s a 45∘ angle for sure.
By the same token, if we know the right triangle corresponding to half of one of the angles in a Pythagorean Triple, we can just subtract it from 45∘, by multiplying its conjugate by 1+i to compute is isoplement.
(1+i)(2−i)=3+i
(1+i)(3−i)=4+2i=2(2+i)
Cool. More than 500 years after Euclid started squaring complex numbers, squaring right triangles, Diophantus figured out how to multiply right triangles. He was trying to create a hypotenuse shared by four different Pythagorean Triples. He started with the two smallest triples, 4+3i and 12+5i in modern lingo and essentially discovered:
|4+3i|2|12+5i|2=|13(4+3i)|2=|5(12+5i)|2=|(4+3i)(12+5i)|2=|(4+3i)(12−5i)|2
652=522+392=602+252=332+562=632+162
We can go deeper still. If we want a more algebraic trigonometry, with polynomial equations rather than circular functions and transcendental quantities, we have to rethink the basic units.
Let A and B be two points, with coordinates in some space. We want to explore the algebraic replacement for the distance between our two points, let’s call it Q(A,B). Reasonable properties to expect are:
Q(A,A)=0 and Q(A,B)=Q(B,A)
The first property lets us say if Q(A,B)=0, then A=B, and vice versa, and the second tells us Q isn’t signed.
If we want to keep things algebraic, the first really says Q(A,B) is a function of a vector quantity, Q(B−A), a function which gives zero when given the null vector.
The second property tells us an initial guess Q(B−A)=B−A is too simple, but something like Q(B−A)=(B−A)2 would work.
What does it mean to square the difference of two points? Here’s where we appeal to the Pythagorean Theorem. The squaring we do is the squared magnitude: |B−A|2. That’s misleading language; this is the fundamental quantity, the replacement for length. We’ll call it quadrance. It’s typically the sum of squared differences of components. If we have the usual components, in 3D for example,
Q(A,B)=(Bx−Ax)2+(By−Ay)2+(Bz−Az)2
It’s the usual thing we would write down, notably without the square root. We get Q(A,A)=0 and Q(A,B)=Q(B,A) as required. For a more general formulation, a vector is the difference between two points and this is the dot product of a vector with itself:
Q(A,B)=(B−A)⋅(B−A)
So we use the squares of lengths instead of lengths. What do we use instead of angles? Quadrance measures the separation between points. What measures the separation between crossing lines?
We can proceed as before. Let l and m be two crossing lines; we can give equations for the lines or two points on the line, or just let l and m be the vector direction of their respective lines. The separation s(l,m) should satisfy
s(l,l)=0,s(l,m)=s(m,l)
Since we’re only using the vectors for their direction, we require another property. Scaling vectors shouldn’t matter; for nonzero scalars t,u,
s(tl,um)=s(l,m)
The dot product is at least commutative as required. But it’s backwards: a dot product of zero indicates perpendicular lines, which is the maximum possible separation between crossing lines. We want to use zero for lines in the same direction. Also the dot product is bilinear, scaling as we scale either vector input.
We can try to cancel out the scaling by dividing by the magnitude of the vector. But we want to avoid magnitude because it requires a square root we don’t like. So the best we can do is divide by squared magnitude, which we’ve already seen as the self dot product, the quadrance, This means we have to square the dot product before normalizing by both quadrances:
(l⋅m)2(l⋅l)(m⋅m)
This quantity doesn’t change when scale or swap l or m, but it isn’t zero when l=m, it’s 1. It’s zero when l⊥m. That’s opposite of what we want, but the fix is easy,
s(l,m)=1−(l⋅m)2(l⋅l)(m⋅m)
There we go, we have an algebraic replacement for angle called spread. The spread between two directions that are the same is zero, and between two directions at right angles is one. In between, you might want to show that the spread is the squared sine between the vectors, even though we’ve developed it without any reference to circular functions.
We can develop triangle geometry; let’s take triangle abc, quadrances A,B,C, opposing spreads a,b,c.
The Pythagorean Theorem corresponds to a spread of one, say c=1. Precisely then, quite simply,
C=A+B
That’s the case when the quadrances add, a right triangle. A degenerate triangle, vertices three collinear points, is when the lengths add. What’s the relation between the quadrances? This is an awesome problem to try before reading on.
We’re talking about collinearity without specifying betweenness, something like
±√A±√B±√C=0
for some combination of signs. We hate square roots, so we square them away,
±√A±√B=±√C
A±2√A√B+B=C
A+B−C=±2√A√B
(A+B−C)2=4AB
That’s called the Triple Quad Formula, true precisely when A,B,C are the quadrances between three collinear points.
What’s the analogous statement for spreads? We can take the sides of a triangle and move one parallel to itself so we have three lines crossing at a point; each pair forming a spread a,b,c and we want to know the relationship between them. I won’t work it out; the answer is the Triple Spread Formula,
(a+b−c)2=4ab(1−c)
That’s the replacement for the sum of the triangle angles being 180∘, but also the replacement for the sum angle formula and the difference angle formula. The equivalent ± form is something like
±θa±θb±θc=180∘k, integer k
but again, we’ve set this all up without any reference to angle measure.
The remaining laws are analogous to the Law of Cosines and the Law of Sines. In fact, the Cross Law is the only one we really need; it’s fun to try to prove it, I’ll just state it:
(A+B−C)2=4AB(1−c)
The Spread Law follows from this; it’s
aA=bB=cC
There we go, the laws of Trigonometry with the transcendentals removed.
Let’s look at the multiple angle formulas in this context. For double angle we have three crossing lines forming three spreads, two of which are equal, let’s call them a,a, and b. (These are the same formulas we’d get for an isosceles triangle.) From the Triple Spread Formula,
(a+b−a)2=4ab(1−a)
b2=4a(1−a)b
If we’re interested in the double angle formula we can cancel the factor b, which would otherwise lead to solution b=0, the difference of a and a.
b=4a(1−a)
That’s the true double angle formula, no circular functions involved. If we define the spread polynomials Sn(x) loosely as sin2nt=Sn(sin2t) (we should really do it without resorting to circular functions) we see S0(x)=0, S1(x)=x, S2(x)=4x(1−x). Can we get the recursion? We cheat and start from where we left off with Chebyshev, putting in 2t for t,
cos((n+1)2t)=2cos2tcos2nt−cos((n−1)2t) and cos2t=1−2sin2t
1−2sin2((n+1)t)=2(1−2sin2t)(1−2sin2nt)−(1−2sin2((n−1)t))
Letting x=sin2t,
1−2Sn+1(x)=2(1−2x)(1−2Sn(x))−(1−2Sn−1(x))
1−2Sn+1(x)=2−4x−4Sn(x)+8xSn(x)−1+2Sn−1(x)
−1+2Sn+1(x)=−2+4x+4Sn(x)−8xSn(x)+1−2Sn−1(x)
2Sn+1(x)=4x+4Sn(x)−8xSn(x)−2Sn−1(x)
Sn+1(x)=2(1−2x)Sn(x)−Sn−1(x)+2x
Wow. Let’s try
S2(x)=2(1−2x)S1(x)−S0(x)+2x =2(1−2x)x−2(0)+2x=4x−4x2=4x(1−x)✓
One cool thing is the spread polynomials factor in a way the Chebyshev polynomials don’t, but I better get back to work.
Jitendra Dayma
Love the mathematics
·
8y
Originally Answered: How do I solve questions based on trigonometric identities in Class 10? I do not understand how to start solving the questions.
·
Learn all the identities given in book
Do the solved questions on identities and understand the starting of their solving pattern.
Now practice and practice more questions.
Related questions
How can I solve trigonometric identities easily? I m finding it very difficult.
I am unable to understand trigonometry of class 10. what should I do so it can become easier for me to understand it?
How do I solve questions based on trigonometric identities in Class 10? I do not understand how to start solving the questions.
What's the best way to understand and study trigonometry in Class 10?
Which trigonometric identity is toughest to solve for 10th class student?
Can you provide the solution of trigonometry class 10?
Which is the best book of maths for 11 and 12 CBSE?
Which is the most difficult question of trigonometric proving for class 10?
How do I master trigonometric identity questions for class 10?
How much time does it take to learn JEE maths from scratch? I am in 11th end and haven’t studied a word. Which chapters should I start now if I am preparing for the JEE 2022?
How do I remember the maths trigonometry formulas in 10th class?
Is 10th class trigonometry tough?
Which question is the most difficult question in the history of the IIT-JEE?
What is a plan to cover the whole trigonometry in a week in class 10?
Which test is harder, the SAT or the JEE Advanced?
About
·
Careers
·
Privacy
·
Terms
·
Contact
·
Languages
·
Your Ad Choices
·
Press
·
© Quora, Inc. 2025 |
14183 | https://link.springer.com/chapter/10.1007/978-1-4612-2138-8_1 | Advertisement
Geometry and Trigonometry
704 Accesses
Abstract
Given two points A and B, if one rotates B around A through 60° to a point B’, then the triangle ABB’ is equilateral. A consequence of this result is the following property of the equilateral triangles, which was noticed by the Romanian mathematician D. Pompeiu in 1936. Pompeiu’s theorem is a simple fact, part of classical plane geometry. Surprisingly, it was discovered neither by Euler in the eighteenth century nor by Steinitz in the nineteenth.
This is a preview of subscription content, log in via an institution
to check access.
Access this chapter
Subscribe and save
Buy Now
Tax calculation will be finalised at checkout
Purchases are for personal use only
Institutional subscriptions
Preview
Unable to display preview. Download preview
PDF.
Unable to display preview. Download preview
PDF.
Explore related subjects
Author information
Authors and Affiliations
American Mathematics Competitions, University of Nebraska, Lincoln, NE, 68588-0658, USA
Titu Andreescu (Professor)
Department of Mathematics, University of Michigan, Ann Arbor, MI, 48109, USA
Răzvan Gelca
Search author on:PubMed Google Scholar
Search author on:PubMed Google Scholar
Rights and permissions
Reprints and permissions
Copyright information
© 2000 Birkhäuser Boston
About this chapter
Cite this chapter
Andreescu, T., Gelca, R. (2000). Geometry and Trigonometry.
In: Mathematical Olympiad Challenges. Birkhäuser Boston.
Download citation
DOI:
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-4155-9
Online ISBN: 978-1-4612-2138-8
eBook Packages: Springer Book Archive
Share this chapter
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Publish with us
Policies and ethics
Access this chapter
Subscribe and save
Buy Now
Tax calculation will be finalised at checkout
Purchases are for personal use only
Institutional subscriptions
Search
Navigation
Discover content
Publish with us
Products and services
Our brands
3.235.62.137
Not affiliated
© 2025 Springer Nature |
14184 | https://www.wyzant.com/resources/answers/761810/solve-for-0-360-tan-1 | Solve for 0≤θ<360 : tanθ=−1 . | Wyzant Ask An Expert
Log inSign up
Find A Tutor
Search For Tutors
Request A Tutor
Online Tutoring
How It Works
For Students
FAQ
What Customers Say
Resources
Ask An Expert
Search Questions
Ask a Question
Wyzant Blog
Start Tutoring
Apply Now
About Tutors Jobs
Find Tutoring Jobs
How It Works For Tutors
FAQ
About Us
About Us
Careers
Contact Us
All Questions
Search for a Question
Find an Online Tutor Now
Ask a Question for Free
Login
WYZANT TUTORING
Log in
Sign up
Find A Tutor
Search For Tutors
Request A Tutor
Online Tutoring
How It Works
For Students
FAQ
What Customers Say
Resources
Ask An Expert
Search Questions
Ask a Question
Wyzant Blog
Start Tutoring
Apply Now
About Tutors Jobs
Find Tutoring Jobs
How It Works For Tutors
FAQ
About Us
About Us
Careers
Contact Us
Subject
ZIP
Search
SearchFind an Online Tutor NowAsk
Ask a Question For Free
Login
MathPrecalculusTrigonometry
Khoa N.
asked • 05/13/20
Solve for 0≤θ<360 : tanθ=−1 .
How do i do this question?
Follow •1
Add comment
More
Report
1 Expert Answer
Best Newest Oldest
By:
MONA S.answered • 05/13/20
Tutor
4.9(1,592)
Academic Coach & Educator
About this tutor›
About this tutor›
tan x=sinx/cosx
and tan x is negative in the second and fourth quadrants.
tan x=1 for 45 degrees so tan x=-1 in the second quadrant 135 degrees and the fourth quadrant= 315 degrees
Upvote • 0Downvote
Add comment
More
Report
Still looking for help? Get the right answer, fast.
Ask a question for free
Get a free answer to a quick problem.
Most questions answered within 4 hours.
OR
Find an Online Tutor Now
Choose an expert and meet online. No packages or subscriptions, pay only for the time you need.
¢€£¥‰µ·•§¶ß‹›«»<>≤≥–—¯‾¤¦¨¡¿ˆ˜°−±÷⁄׃∫∑∞√∼≅≈≠≡∈∉∋∏∧∨¬∩∪∂∀∃∅∇∗∝∠´¸ª º†‡À Á Â Ã Ä Å Æ Ç È É Ê Ë Ì Í Î Ï Ð Ñ Ò Ó Ô Õ Ö Ø Œ Š Ù Ú Û Ü Ý Ÿ Þ à á â ã ä å æ ç è é ê ë ì í î ï ð ñ ò ó ô õ ö ø œ š ù ú û ü ý þ ÿ Α Β Γ Δ Ε Ζ Η Θ Ι Κ Λ Μ Ν Ξ Ο Π Ρ Σ Τ Υ Φ Χ Ψ Ω α β γ δ ε ζ η θ ι κ λ μ ν ξ ο π ρ ς σ τ υ φ χ ψ ω ℵ ϖ ℜ ϒ℘ℑ←↑→↓↔↵⇐⇑⇒⇓⇔∴⊂⊃⊄⊆⊇⊕⊗⊥⋅⌈⌉⌊⌋〈〉◊
RELATED TOPICS
Algebra 1Algebra 2CalculusGeometryPhysicsPrealgebraStatisticsProbabilityElementary MathAlgebra...Word ProblemPre CalculusMath HelpMath QuestionMath EquationsPrecalculus HomeworkMathematicsMath Word ProblemMath ProblemMath Help For College
RELATED QUESTIONS
##### what are all the common multiples of 12 and 15
Answers · 10
##### need to know how to do this problem
Answers · 8
##### what are methods used to measure ingredients and their units of measure
Answers · 8
##### how do you multiply money
Answers · 6
##### spimlify 4x-(2-3x)-5
Answers · 18
RECOMMENDED TUTORS
Jia L. 5(1,972)
Caleb C. 5.0(318)
David W. 4.9(233)
See more tutors
find an online tutor
Precalculus tutors
Calculus tutors
Multivariable Calculus tutors
Algebra tutors
College Algebra tutors
Algebra 2 tutors
Geometry tutors
Algebra 1 tutors
Download our free app
A link to the app was sent to your phone.
Please provide a valid phone number.
App StoreGoogle Play
##### Get to know us
About Us
Contact Us
FAQ
Reviews
Safety
Security
In the News
##### Learn with us
Find a Tutor
Request a Tutor
Online Tutoring
Learning Resources
Blog
Tell Us What You Think
##### Work with us
Careers at Wyzant
Apply to Tutor
Tutor Job Board
Affiliates
Download our free app
App StoreGoogle Play
Let’s keep in touch
Need more help?
Learn more about how it works
##### Tutors by Subject
Algebra Tutors
Calculus Tutors
Chemistry Tutors
Computer Tutors
Elementary Tutors
English Tutors
Geometry Tutors
Language Tutors
Math Tutors
Music Lessons
Physics Tutors
Reading Tutors
SAT Tutors
Science Tutors
Spanish Tutors
Statistics Tutors
Test Prep Tutors
Writing Tutors
##### Tutors by Location
Atlanta Tutors
Boston Tutors
Brooklyn Tutors
Chicago Tutors
Dallas Tutors
Denver Tutors
Detroit Tutors
Houston Tutors
Los Angeles Tutors
Miami Tutors
New York City Tutors
Orange County Tutors
Philadelphia Tutors
Phoenix Tutors
San Francisco Tutors
Seattle Tutors
San Diego Tutors
Washington, DC Tutors
Making educational experiences better for everyone.
##### IXL Comprehensive K-12 personalized learning
##### Rosetta Stone Immersive learning for 25 languages
##### Education.com 35,000 worksheets, games, and lesson plans
##### TPT Marketplace for millions of educator-created resources
##### Vocabulary.com Adaptive learning for English vocabulary
##### ABCya Fun educational games for kids
##### SpanishDictionary.com Spanish-English dictionary, translator, and learning
##### Inglés.com Diccionario inglés-español, traductor y sitio de aprendizaje
##### Emmersion Fast and accurate language certification
SitemapTerms of UsePrivacy Policy
© 2005 - 2025 Wyzant, Inc, a division of IXL Learning - All Rights Reserved
Privacy Preference Center
Your Privacy
Strictly Necessary Cookies
Performance Cookies
Functional Cookies
Targeting Cookies
Your Privacy
When you visit any website, it may store or retrieve information on your browser, mostly in the form of cookies. This information might be about you, your preferences or your device and is mostly used to make the site work as you expect it to. The information does not usually directly identify you, but it can give you a more personalized web experience. Because we respect your right to privacy, you can choose not to allow some types of cookies. Click on the different category headings to find out more and change our default settings. However, blocking some types of cookies may impact your experience of the site and the services we are able to offer.
Strictly Necessary Cookies
Always Active
These cookies are necessary for the website to function and cannot be switched off in our systems. They are usually only set in response to actions made by you which amount to a request for services, such as setting your privacy preferences, logging in or filling in forms. You can set your browser to block or alert you about these cookies, but some parts of the site will not then work. These cookies do not store any personally identifiable information.
Performance Cookies
[x] Performance Cookies
These cookies allow us to count visits and traffic sources so we can measure and improve the performance of our site. They help us to know which pages are the most and least popular and see how visitors move around the site. All information these cookies collect is aggregated and therefore anonymous. If you do not allow these cookies we will not know when you have visited our site, and will not be able to monitor its performance.
Functional Cookies
[x] Functional Cookies
These cookies enable the website to provide enhanced functionality and personalisation. They may be set by us or by third party providers whose services we have added to our pages. If you do not allow these cookies then some or all of these services may not function properly.
Targeting Cookies
[x] Targeting Cookies
These cookies may be set through our site by our advertising partners. They may be used by those companies to build a profile of your interests and show you relevant adverts on other sites. They do not store directly personal information, but are based on uniquely identifying your browser and internet device. If you do not allow these cookies, you will experience less targeted advertising.
Cookie List
Consent Leg.Interest
[x] checkbox label label
[x] checkbox label label
[x] checkbox label label
Clear
[x] checkbox label label
Apply Cancel
Confirm My Choices
Allow All |
14185 | https://en.wikipedia.org/wiki/Singular_point_of_a_curve | Singular point of a curve - Wikipedia
Jump to content
[x] Main menu
Main menu
move to sidebar hide
Navigation
Main page
Contents
Current events
Random article
About Wikipedia
Contact us
Contribute
Help
Learn to edit
Community portal
Recent changes
Upload file
Special pages
Search
Search
[x] Appearance
Donate
Create account
Log in
[x] Personal tools
Donate
Create account
Log in
Pages for logged out editors learn more
Contributions
Talk
Contents
move to sidebar hide
(Top)
1 Algebraic curves in the planeToggle Algebraic curves in the plane subsection
1.1 Regular points
1.2 Double points
1.2.1 Crunodes
1.2.2 Acnodes
1.2.3 Cusps
1.2.4 Further classification
1.3 Multiple points
2 Parametric curves
3 Types of singular points
4 See also
5 References
[x] Toggle the table of contents
Singular point of a curve
[x] 15 languages
Чӑвашла
Español
Esperanto
Français
Հայերեն
Hrvatski
Italiano
日本語
Polski
Română
Русский
Slovenščina
Svenska
Українська
中文
Edit links
Article
Talk
[x] English
Read
Edit
View history
[x] Tools
Tools
move to sidebar hide
Actions
Read
Edit
View history
General
What links here
Related changes
Upload file
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Print/export
Download as PDF
Printable version
In other projects
Wikidata item
Appearance
move to sidebar hide
From Wikipedia, the free encyclopedia
Point on a curve not given by a smooth embedding of a parameter
In geometry, a singular point on a curve is one where the curve is not given by a smooth embedding of a parameter. The precise definition of a singular point depends on the type of curve being studied.
Algebraic curves in the plane
[edit]
Algebraic curves in the plane may be defined as the set of points (x, y) satisfying an equation of the form f(x,y)=0,{\displaystyle f(x,y)=0,} where f is a polynomial function f:R 2→R.{\displaystyle f:\mathbb {R} ^{2}\to \mathbb {R} .} If f is expanded as f=a 0+b 0 x+b 1 y+c 0 x 2+2 c 1 x y+c 2 y 2+⋯{\displaystyle f=a_{0}+b_{0}x+b_{1}y+c_{0}x^{2}+2c_{1}xy+c_{2}y^{2}+\cdots } If the origin (0, 0) is on the curve then a 0 = 0. If b 1 ≠ 0 then the implicit function theorem guarantees there is a smooth function h so that the curve has the form y = h(x) near the origin. Similarly, if b 0 ≠ 0 then there is a smooth function k so that the curve has the form x = k(y) near the origin. In either case, there is a smooth map from R{\displaystyle \mathbb {R} } to the plane which defines the curve in the neighborhood of the origin. Note that at the origin b 0=∂f∂x,b 1=∂f∂y,{\displaystyle b_{0}={\frac {\partial f}{\partial x}},\;b_{1}={\frac {\partial f}{\partial y}},} so the curve is non-singular or regular at the origin if at least one of the partial derivatives of f is non-zero. The singular points are those points on the curve where both partial derivatives vanish, f(x,y)=∂f∂x=∂f∂y=0.{\displaystyle f(x,y)={\frac {\partial f}{\partial x}}={\frac {\partial f}{\partial y}}=0.}
Regular points
[edit]
Assume the curve passes through the origin and write y=m x.{\displaystyle y=mx.} Then f can be written f=(b 0+m b 1)x+(c 0+2 m c 1+c 2 m 2)x 2+⋯.{\displaystyle f=(b_{0}+mb_{1})x+(c_{0}+2mc_{1}+c_{2}m^{2})x^{2}+\cdots .} If b 0+m b 1{\displaystyle b_{0}+mb_{1}} is not 0 then f = 0 has a solution of multiplicity 1 at x = 0 and the origin is a point of single contact with line y=m x.{\displaystyle y=mx.} If b 0+m b 1=0{\displaystyle b_{0}+mb_{1}=0} then f = 0 has a solution of multiplicity 2 or higher and the line y=m x,{\displaystyle y=mx,} or b 0 x+b 1 y=0,{\displaystyle b_{0}x+b_{1}y=0,} is tangent to the curve. In this case, if c 0+2 m c 1+c 2 m 2{\displaystyle c_{0}+2mc_{1}+c_{2}m^{2}} is not 0 then the curve has a point of double contact with y=m x.{\displaystyle y=mx.} If the coefficient of x 2, c 0+2 m c 1+c 2 m 2,{\displaystyle c_{0}+2mc_{1}+c_{2}m^{2},} is 0 but the coefficient of x 3 is not then the origin is a point of inflection of the curve. If the coefficients of x 2 and x 3 are both 0 then the origin is called point of undulation of the curve. This analysis can be applied to any point on the curve by translating the coordinate axes so that the origin is at the given point.
Double points
[edit]
Three limaçons illustrating the types of double point. When converted to Cartesian coordinates as (x 2+y 2−x)2=(1.5)2(x 2+y 2),{\displaystyle (x^{2}+y^{2}-x)^{2}=(1.5)^{2}(x^{2}+y^{2}),} the left curve acquires an acnode at the origin, which is an isolated point in the plane. The central curve, the cardioid, has a cusp at the origin. The right curve has a crunode at the origin and the curve crosses itself to form a loop.
If b 0 and b 1 are both 0 in the above expansion, but at least one of c 0, c 1, c 2 is not 0 then the origin is called a double point of the curve. Again putting y=m x,{\displaystyle y=mx,}f can be written f=(c 0+2 m c 1+c 2 m 2)x 2+(d 0+3 m d 1+3 m 2 d 2+d 3 m 3)x 3+⋯.{\displaystyle f=(c_{0}+2mc_{1}+c_{2}m^{2})x^{2}+(d_{0}+3md_{1}+3m^{2}d_{2}+d_{3}m^{3})x^{3}+\cdots .} Double points can be classified according to the solutions of c 0+2 m c 1+m 2 c 2=0.{\displaystyle c_{0}+2mc_{1}+m^{2}c_{2}=0.}
Crunodes
[edit]
Main article: Crunode
If c 0+2 m c 1+m 2 c 2=0{\displaystyle c_{0}+2mc_{1}+m^{2}c_{2}=0} has two real solutions for m, that is if c 0 c 2−c 1 2<0,{\displaystyle c_{0}c_{2}-c_{1}^{2}<0,} then the origin is called a crunode. The curve in this case crosses itself at the origin and has two distinct tangents corresponding to the two solutions of c 0+2 m c 1+m 2 c 2=0.{\displaystyle c_{0}+2mc_{1}+m^{2}c_{2}=0.} The function f has a saddle point at the origin in this case.
Acnodes
[edit]
Main article: Acnode
If c 0+2 m c 1+m 2 c 2=0{\displaystyle c_{0}+2mc_{1}+m^{2}c_{2}=0} has no real solutions for m, that is if c 0 c 2−c 1 2>0,{\displaystyle c_{0}c_{2}-c_{1}^{2}>0,} then the origin is called an acnode. In the real plane the origin is an isolated point on the curve; however when considered as a complex curve the origin is not isolated and has two imaginary tangents corresponding to the two complex solutions of c 0+2 m c 1+m 2 c 2=0.{\displaystyle c_{0}+2mc_{1}+m^{2}c_{2}=0.} The function f has a local extremum at the origin in this case.
Cusps
[edit]
Main article: Cusp (singularity)
If c 0+2 m c 1+m 2 c 2=0{\displaystyle c_{0}+2mc_{1}+m^{2}c_{2}=0} has a single solution of multiplicity 2 for m, that is if c 0 c 2−c 1 2=0,{\displaystyle c_{0}c_{2}-c_{1}^{2}=0,} then the origin is called a cusp. The curve in this case changes direction at the origin creating a sharp point. The curve has a single tangent at the origin which may be considered as two coincident tangents.
Further classification
[edit]
The term node is used to indicate either a crunode or an acnode, in other words a double point which is not a cusp. The number of nodes and the number of cusps on a curve are two of the invariants used in the Plücker formulas.
If one of the solutions of c 0+2 m c 1+m 2 c 2=0{\displaystyle c_{0}+2mc_{1}+m^{2}c_{2}=0} is also a solution of d 0+3 m d 1+3 m 2 d 2+m 3 d 3=0,{\displaystyle d_{0}+3md_{1}+3m^{2}d_{2}+m^{3}d_{3}=0,} then the corresponding branch of the curve has a point of inflection at the origin. In this case the origin is called a flecnode. If both tangents have this property, so c 0+2 m c 1+m 2 c 2{\displaystyle c_{0}+2mc_{1}+m^{2}c_{2}} is a factor of d 0+3 m d 1+3 m 2 d 2+m 3 d 3,{\displaystyle d_{0}+3md_{1}+3m^{2}d_{2}+m^{3}d_{3},} then the origin is called a biflecnode.
Multiple points
[edit]
A curve with a triple point at the origin: x(t) = sin(2 t) + cos(t), y(t) = sin(t) + cos(2 t)
In general, if all the terms of degree less than k are 0, and at least one term of degree k is not 0 in f, then curve is said to have a multiple point of order k or a k-ple point. The curve will have, in general, k tangents at the origin though some of these tangents may be imaginary.
Parametric curves
[edit]
A parameterized curve in R 2{\displaystyle \mathbb {R} ^{2}} is defined as the image of a function g:R→R 2,{\displaystyle g:\mathbb {R} \to \mathbb {R} ^{2},}g(t)=(g 1(t),g 2(t)).{\displaystyle g(t)=(g_{1}(t),g_{2}(t)).} The singular points are those points where d g 1 d t=d g 2 d t=0.{\displaystyle {\frac {dg_{1}}{dt}}={\frac {dg_{2}}{dt}}=0.}
A cusp in the semicubical parabolay 2=x 3{\displaystyle y^{2}=x^{3}}
Many curves can be defined in either fashion, but the two definitions may not agree. For example, the cusp can be defined on an algebraic curve, x 3−y 2=0,{\displaystyle x^{3}-y^{2}=0,} or on a parametrised curve, g(t)=(t 2,t 3).{\displaystyle g(t)=(t^{2},t^{3}).} Both definitions give a singular point at the origin. However, a node such as that of y 2−x 3−x 2=0{\displaystyle y^{2}-x^{3}-x^{2}=0} at the origin is a singularity of the curve considered as an algebraic curve, but if we parameterize it as g(t)=(t 2−1,t(t 2−1)),{\displaystyle g(t)=(t^{2}-1,t(t^{2}-1)),} then g′(t){\displaystyle g'(t)} never vanishes, and hence the node is not a singularity of the parameterized curve as defined above.
Care needs to be taken when choosing a parameterization. For instance the straight line y = 0 can be parameterised by g(t)=(t 3,0),{\displaystyle g(t)=(t^{3},0),} which has a singularity at the origin. When parametrised by g(t)=(t,0),{\displaystyle g(t)=(t,0),} it is nonsingular. Hence, it is technically more correct to discuss singular points of a smooth mapping here rather than a singular point of a curve.
The above definitions can be extended to cover implicit curves which are defined as the zero set f−1(0){\displaystyle f^{-1}(0)} of a smooth function, and it is not necessary just to consider algebraic varieties. The definitions can be extended to cover curves in higher dimensions.
A theorem of Hassler Whitney states
Theorem— Any closed set in R n{\displaystyle \mathbb {R} ^{n}} occurs as the solution set of f−1(0){\displaystyle f^{-1}(0)} for some smooth function f:R n→R.{\displaystyle f:\mathbb {R} ^{n}\to \mathbb {R} .}
Any parameterized curve can also be defined as an implicit curve, and the classification of singular points of curves can be studied as a classification of singular points of an algebraic variety.
Types of singular points
[edit]
Some of the possible singularities are:
An isolated point: x 2+y 2=0,{\displaystyle x^{2}+y^{2}=0,} an acnode
Two lines crossing: x 2−y 2=0,{\displaystyle x^{2}-y^{2}=0,} a crunode
A cusp: x 3−y 2=0,{\displaystyle x^{3}-y^{2}=0,} also called a spinode
A tacnode: x 4−y 2=0{\displaystyle x^{4}-y^{2}=0}
A rhamphoid cusp: x 5−y 2=0.{\displaystyle x^{5}-y^{2}=0.}
See also
[edit]
Singular point of an algebraic variety
Singularity theory
Morse theory
References
[edit]
^Hilton Chapter II §1
^Hilton Chapter II §2
^Hilton Chapter II §3
^Th. Bröcker, Differentiable Germs and Catastrophes, London Mathematical Society. Lecture Notes 17. Cambridge, (1975)
^Bruce and Giblin, Curves and singularities, (1984, 1992) ISBN0-521-41985-9, ISBN0-521-42999-4 (paperback)
Hilton, Harold (1920). "Chapter II: Singular Points". Plane Algebraic Curves. Oxford.
| v t e Topics in algebraic curves |
| Rational curves | Five points determine a conic Projective line Rational normal curve Riemann sphere Twisted cubic |
| Elliptic curves | | Analytic theory | Elliptic function Elliptic integral Fundamental pair of periods Modular form | | Arithmetic theory | Counting points on elliptic curves Division polynomials Hasse's theorem on elliptic curves Mazur's torsion theorem Modular elliptic curve Modularity theorem Mordell–Weil theorem Nagell–Lutz theorem Supersingular elliptic curve Schoof's algorithm Schoof–Elkies–Atkin algorithm | | Applications | Elliptic curve cryptography Elliptic curve primality | |
| Higher genus | De Franchis theorem Faltings's theorem Hurwitz's automorphisms theorem Hurwitz surface Hyperelliptic curve |
| Plane curves | AF+BG theorem Bézout's theorem Bitangent Cayley–Bacharach theorem Conic section Cramer's paradox Cubic plane curve Fermat curve Genus–degree formula Hilbert's sixteenth problem Nagata's conjecture on curves Plücker formula Quartic plane curve Real plane curve |
| Riemann surfaces | Belyi's theorem Bring's curve Bolza surface Compact Riemann surface Dessin d'enfant Differential of the first kind Klein quartic Riemann's existence theorem Riemann–Roch theorem Teichmüller space Torelli theorem |
| Constructions | Dual curve Polar curve Smooth completion |
| Structure of curves | | Divisors on curves | Abel–Jacobi map Brill–Noether theory Clifford's theorem on special divisors Gonality of an algebraic curve Jacobian variety Riemann–Roch theorem Weierstrass point Weil reciprocity law | | Moduli | ELSV formula Gromov–Witten invariant Hodge bundle Moduli of algebraic curves Stable curve | | Morphisms | Hasse–Witt matrix Riemann–Hurwitz formula Prym variety Weber's theorem (Algebraic curves) | | Singularities | A k singularity Acnode Crunode Cusp Delta invariant Tacnode | | Vector bundles | Birkhoff–Grothendieck theorem Stable vector bundle Vector bundles on algebraic curves | |
Retrieved from "
Categories:
Curves
Algebraic curves
Singularity theory
Hidden categories:
Articles with short description
Short description is different from Wikidata
This page was last edited on 13 December 2023, at 01:05(UTC).
Text is available under the Creative Commons Attribution-ShareAlike 4.0 License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.
Privacy policy
About Wikipedia
Disclaimers
Contact Wikipedia
Code of Conduct
Developers
Statistics
Cookie statement
Mobile view
Search
Search
[x] Toggle the table of contents
Singular point of a curve
15 languagesAdd topic |
14186 | https://math.stackexchange.com/questions/180830/conjugate-of-exponential-imaginary-number | Conjugate of exponential imaginary number - Mathematics Stack Exchange
Join Mathematics
By clicking “Sign up”, you agree to our terms of service and acknowledge you have read our privacy policy.
Sign up with Google
OR
Email
Password
Sign up
Already have an account? Log in
Skip to main content
Stack Exchange Network
Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Visit Stack Exchange
Loading…
Tour Start here for a quick overview of the site
Help Center Detailed answers to any questions you might have
Meta Discuss the workings and policies of this site
About Us Learn more about Stack Overflow the company, and our products
current community
Mathematics helpchat
Mathematics Meta
your communities
Sign up or log in to customize your list.
more stack exchange communities
company blog
Log in
Sign up
Home
Questions
Unanswered
AI Assist Labs
Tags
Chat
Users
Teams
Ask questions, find answers and collaborate at work with Stack Overflow for Teams.
Try Teams for freeExplore Teams
3. Teams
4. Ask questions, find answers and collaborate at work with Stack Overflow for Teams. Explore Teams
Teams
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
Learn more about Teams
Hang on, you can't upvote just yet.
You'll need to complete a few actions and gain 15 reputation points before being able to upvote. Upvoting indicates when questions and answers are useful. What's reputation and how do I get it?
Instead, you can save this post to reference later.
Save this post for later Not now
Thanks for your vote!
You now have 5 free votes weekly.
Free votes
count toward the total vote score
does not give reputation to the author
Continue to help good content that is interesting, well-researched, and useful, rise to the top! To gain full voting privileges, earn reputation.
Got it!Go to help center to learn more
Conjugate of exponential imaginary number
Ask Question
Asked 13 years, 1 month ago
Modified11 years, 9 months ago
Viewed 96k times
This question shows research effort; it is useful and clear
18
Save this question.
Show activity on this post.
The conjugate of e−i w t e−i w t is e i w t e i w t.
Then, what would be the conjugate of e i w t e i w t? Would it be e−i w t e−i w t?
Also, for |e i w t|2|e i w t|2, what would the value look like?
complex-numbers
exponential-function
Share
Share a link to this question
Copy linkCC BY-SA 3.0
Cite
Follow
Follow this question to receive notifications
edited Jul 24, 2013 at 20:52
user67258
asked Aug 9, 2012 at 21:07
Takshmia AlonsoTakshmia Alonso
205 1 1 gold badge 2 2 silver badges 5 5 bronze badges
5
Your first formula is correct only if w t w t is real...Morgan Sherman –Morgan Sherman 2012-08-09 21:09:53 +00:00 Commented Aug 9, 2012 at 21:09
What are w,t w,t? Real, complex...?DonAntonio –DonAntonio 2012-08-09 21:10:04 +00:00 Commented Aug 9, 2012 at 21:10
Also, "linear-algebra" is not a good tag for this question (try instead something like complex-variables).Morgan Sherman –Morgan Sherman 2012-08-09 21:12:00 +00:00 Commented Aug 9, 2012 at 21:12
Given the first, sure.André Nicolas –André Nicolas 2012-08-09 21:13:03 +00:00 Commented Aug 9, 2012 at 21:13
1 In general e z¯¯¯¯¯=e z¯e z¯=e z¯ for all z∈C z∈C.Mikko Korhonen –Mikko Korhonen 2012-08-09 21:28:59 +00:00 Commented Aug 9, 2012 at 21:28
Add a comment|
1 Answer 1
Sorted by: Reset to default
This answer is useful
23
Save this answer.
Show activity on this post.
Complex conjugation is an automorphism of order 2, meaning z¯¯¯¯¯¯=z,∀z∈C z¯¯=z,∀z∈C , so if the conjugate of e−i w t e−i w t is e i w t e i w t , then the conjugate of the latter is the former.
Also, writing the trigonometric version of e i x,x∈R e i x,x∈R , you can check at once that |e i x|=1,∀x∈R|e i x|=1,∀x∈R
Share
Share a link to this answer
Copy linkCC BY-SA 3.0
Cite
Follow
Follow this answer to receive notifications
answered Aug 9, 2012 at 21:13
DonAntonioDonAntonio
215k 19 19 gold badges 143 143 silver badges 291 291 bronze badges
Add a comment|
You must log in to answer this question.
Start asking to get answers
Find the answer to your question by asking.
Ask question
Explore related questions
complex-numbers
exponential-function
See similar questions with these tags.
Featured on Meta
Introducing a new proactive anti-spam measure
Spevacus has joined us as a Community Manager
stackoverflow.ai - rebuilt for attribution
Community Asks Sprint Announcement - September 2025
Report this ad
Related
2What is the general definition of the conjugate of a multiple-component number?
0Is 0 i 0 i defined number and what is it value where i :is unitary imaginary part?
3Prove conjugate of imaginary number
0Conjugate replacement principle?
23Must imaginary roots come in conjugate pairs?
2The complex conjugate of a complex function.
2How to represent a sum of exponentials as one exponential
1Complex conjugate doubts
0Solving Complex Quadratics containing Conjugate Imaginary Numbers
Hot Network Questions
Do sum of natural numbers and sum of their squares represent uniquely the summands?
Vampires defend Earth from Aliens
Suggestions for plotting function of two variables and a parameter with a constraint in the form of an equation
ConTeXt: Unnecessary space in \setupheadertext
Another way to draw RegionDifference of a cylinder and Cuboid
Proof of every Highly Abundant Number greater than 3 is Even
Why does LaTeX convert inline Python code (range(N-2)) into -NoValue-?
Countable and uncountable "flavour": chocolate-flavoured protein is protein with chocolate flavour or protein has chocolate flavour
What NBA rule caused officials to reset the game clock to 0.3 seconds when a spectator caught the ball with 0.1 seconds left?
What is the feature between the Attendant Call and Ground Call push buttons on a B737 overhead panel?
Does a Linux console change color when it crashes?
An odd question
Calculating the node voltage
Checking model assumptions at cluster level vs global level?
Overfilled my oil
Is it safe to route top layer traces under header pins, SMD IC?
How many color maps are there in PBR texturing besides Color Map, Roughness Map, Displacement Map, and Ambient Occlusion Map in Blender?
Can a cleric gain the intended benefit from the Extra Spell feat?
Why do universities push for high impact journal publications?
The rule of necessitation seems utterly unreasonable
With line sustain pedal markings, do I release the pedal at the beginning or end of the last note?
Non-degeneracy of wedge product in cohomology
Lingering odor presumably from bad chicken
Repetition is the mother of learning
more hot questions
Question feed
Subscribe to RSS
Question feed
To subscribe to this RSS feed, copy and paste this URL into your RSS reader.
Why are you flagging this comment?
It contains harassment, bigotry or abuse.
This comment attacks a person or group. Learn more in our Code of Conduct.
It's unfriendly or unkind.
This comment is rude or condescending. Learn more in our Code of Conduct.
Not needed.
This comment is not relevant to the post.
Enter at least 6 characters
Something else.
A problem not listed above. Try to be as specific as possible.
Enter at least 6 characters
Flag comment Cancel
You have 0 flags left today
Mathematics
Tour
Help
Chat
Contact
Feedback
Company
Stack Overflow
Teams
Advertising
Talent
About
Press
Legal
Privacy Policy
Terms of Service
Your Privacy Choices
Cookie Policy
Stack Exchange Network
Technology
Culture & recreation
Life & arts
Science
Professional
Business
API
Data
Blog
Facebook
Twitter
LinkedIn
Instagram
Site design / logo © 2025 Stack Exchange Inc; user contributions licensed under CC BY-SA. rev 2025.9.26.34547
By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.
Accept all cookies Necessary cookies only
Customize settings
Cookie Consent Preference Center
When you visit any of our websites, it may store or retrieve information on your browser, mostly in the form of cookies. This information might be about you, your preferences, or your device and is mostly used to make the site work as you expect it to. The information does not usually directly identify you, but it can give you a more personalized experience. Because we respect your right to privacy, you can choose not to allow some types of cookies. Click on the different category headings to find out more and manage your preferences. Please note, blocking some types of cookies may impact your experience of the site and the services we are able to offer.
Cookie Policy
Accept all cookies
Manage Consent Preferences
Strictly Necessary Cookies
Always Active
These cookies are necessary for the website to function and cannot be switched off in our systems. They are usually only set in response to actions made by you which amount to a request for services, such as setting your privacy preferences, logging in or filling in forms. You can set your browser to block or alert you about these cookies, but some parts of the site will not then work. These cookies do not store any personally identifiable information.
Cookies Details
Performance Cookies
[x] Performance Cookies
These cookies allow us to count visits and traffic sources so we can measure and improve the performance of our site. They help us to know which pages are the most and least popular and see how visitors move around the site. All information these cookies collect is aggregated and therefore anonymous. If you do not allow these cookies we will not know when you have visited our site, and will not be able to monitor its performance.
Cookies Details
Functional Cookies
[x] Functional Cookies
These cookies enable the website to provide enhanced functionality and personalisation. They may be set by us or by third party providers whose services we have added to our pages. If you do not allow these cookies then some or all of these services may not function properly.
Cookies Details
Targeting Cookies
[x] Targeting Cookies
These cookies are used to make advertising messages more relevant to you and may be set through our site by us or by our advertising partners. They may be used to build a profile of your interests and show you relevant advertising on our site or on other sites. They do not store directly personal information, but are based on uniquely identifying your browser and internet device.
Cookies Details
Cookie List
Clear
[x] checkbox label label
Apply Cancel
Consent Leg.Interest
[x] checkbox label label
[x] checkbox label label
[x] checkbox label label
Necessary cookies only Confirm my choices |
14187 | https://stackoverflow.com/questions/57562865/minimum-number-of-rectangular-regions-to-fill-a-grid | Stack Overflow
About
For Teams
Stack Overflow for Teams Where developers & technologists share private knowledge with coworkers
Advertising Reach devs & technologists worldwide about your product, service or employer brand
Knowledge Solutions Data licensing offering for businesses to build and improve AI tools and models
Labs The future of collective knowledge sharing
About the company Visit the blog
Collectives¢ on Stack Overflow
Find centralized, trusted content and collaborate around the technologies you use most.
Learn more about Collectives
Teams
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
Learn more about Teams
minimum number of rectangular regions to fill a grid
Ask Question
Asked
Modified 6 years, 1 month ago
Viewed 2k times
10
Suppose we have a grid and we want to paint rectangular regions on it using the smallest number of colors possible, one for each region.
There are some cells that are already painted black and cannot be painted over:
Is there a polynomial algorithm to solve this problem?
After testing, I found out that the solution for this case is 9 (because we need 9 different colors to paint the minimum number of regions to fill the whole grid):
The greedy approach seems to work well: just search for the rectangle with biggest (white) area and paint it, repeating this until there's nothing else to be painted, but I didn't measure the complexity or the correctness.
algorithm
geometry
Share
Improve this question
edited Aug 19, 2019 at 19:38
DanielDaniel
asked Aug 19, 2019 at 19:29
DanielDaniel
7,79099 gold badges3737 silver badges107107 bronze badges
8
6
I don't know whether or not such an algorithm exists, but the greedy approach ain't it. Example
Khuldraeseth na'Barya
– Khuldraeseth na'Barya
2019-08-19 19:57:04 +00:00
Commented Aug 19, 2019 at 19:57
3
@Ripi2 There is no relationship between this question and the four color theorem.
btilly
– btilly
2019-08-19 21:21:23 +00:00
Commented Aug 19, 2019 at 21:21
3
@btilly isn't this the known problem of minimal rectilinear partitioning? (A la math.unl.edu/~s-dstolee1/Presentations/Sto08-MinRectPart.pdf)
גלעד ברקן
– גלעד ברקן
2019-08-20 00:55:10 +00:00
Commented Aug 20, 2019 at 0:55
1
The solution is not unique
Reblochon Masque
– Reblochon Masque
2019-08-20 02:30:50 +00:00
Commented Aug 20, 2019 at 2:30
1
@×××¢×××¨×§× I believe that you're right, and the algorithms referred to in there answer this as a yes - there is a polynomial algorithm.
btilly
– btilly
2019-08-20 03:54:13 +00:00
Commented Aug 20, 2019 at 3:54
| Show 3 more comments
1 Answer 1
Reset to default
5
Here are a few observations that can simplify this problem in specific cases. First of all, adjacent identical rows and columns can be reduced to one row or column without changing the required number of regions, to form a simplified grid:
A simplified grid where no row or column is divided into more than two uncoloured parts (i.e. has two or more seperate black cells), has an optimal solution which can be found by using the rows or columns as regions (depending on whether the width or height of the grid is greater):
The number of regions is then minimum(width, height) + number of black cells.
If a border row or column in a simplified grid contains no black cells, then using it as a region is always the optimal solution; adding some parts of it to other regions would require at least one additional region to be made in the border row or column (depending on the number of black cells in the adjacent row or column):
This means that the grid can be further simplified by removing border rows and columns with no black cells, and adding the number of removed regions to the region count:
Similarly, if one or more border cells are isolated by a black cell in the adjacent row or column, all the connected uncoloured neighbouring cells can be regarded as one region:
At each point you can go back to previous rules; e.g. after the right- and left-most columns have been turned into regions in the example above, we are left with the grid below, which can be simplified with the first rule, because the bottom two rows are identical:
Collapsing identical adjacent rows or columns can also be applied locally to isolated parts of the grid. The example below has no identical adjacent rows, but the center part is isolated, so there rows 3 to 6 can be collapsed:
And on the left row 3 and 4 can be collapsed locally, and on the right rows 5 and 6, so we end up with the situation in the third image above. These collapsed cells then act as one.
Once you can't find any further simplifications using the rules above, and you want to check every possible division of (part of) a grid, a first step could be to list the maximum rectangle sizes that can be made with the corresponding cell as their top left corner; for the simplified 6x7 grid in the first example above that would be:
COL.1 COL.2 COL.3 COL.4 COL.5 COL.6 ROW 1 [6x1, 3x3, 1x7] [5x1, 2x3] [4x1, 1x7] [3x1] [2x5] [1x7] ROW 2 [3x2, 1x6] [2x2] [1x6] [] [2x4] [1x6] ROW 3 [6x1, 1x5] [5x1] [4x3, 2x5] [3x3, 1x5] [2x3] [1x5] ROW 4 [1x4] [] [4x2, 2x4] [3x2, 1x4] [2x2] [1x4] ROW 5 [6x1, 4x3] [5x1, 3x3] [4x1, 2x3] [3x1, 1x3] [2x1] [1x3] ROW 6 [4x2] [3x2] [2x2] [1x2] [] [1x2] ROW 7 [6x1] [5x1] [4x1] [3x1] [2x1] [1x1]
You can then use these maximum sizes to generate every option for each cell; e.g. for cell (1,1) they would be:
6x1, 5x1, 4x1, 3x3, 3x2, 3x1, 2x3, 2x2, 2x1, 1x7, 1x6, 1x5, 1x4, 1x3, 1x2, 1x1
(Some rectangle sizes in the list can be skipped; e.g. it never makes sense to use the 3x1-sized region without adding the fourth isolated cell to get 4x1.)
After choosing an option, you would skip the cells which are covered by the rectangle you've chosen and try each option for the next cell, and so on...
Running this on large grids will lead to huge numbers op options. However, at each point you can go back to checking whether the simplification rules can help.
To see that a greedy algorithm, which selects the largest rectangles first, cannot guarantee an optimal solution, consider the example below. Selecting the 2x2 square in the middle would lead to a solution with 5 regions, while several solutions with only 4 regions exist.
Share
Improve this answer
edited Aug 20, 2019 at 21:06
answered Aug 20, 2019 at 3:18
m69 ''snarky and unwelcoming''m69 ''snarky and unwelcoming''
12.4k33 gold badges3636 silver badges6161 bronze badges
4 Comments
Daniel
Daniel
Great idea on simplifying the grid. I got curious, @Khuldraeseth na'Barya gave a counter-example of greedy algorithm correctness, but matter of fact, if you simplify his counter-example, it works. Would greedy still be an option (painting largest white areas first) taking your simplification to the table?
m69 ''snarky and unwelcoming''
m69 ''snarky and unwelcoming''
@Daniel You've accepted my answer rather quickly. Are the grids you'll be using this on a special case that is completely solved by the simplifications, like e.g. no two black cells in the same row or column? (Indeed, that counter example is solved by the isolated border cell rule; and no, afaik a greedy approach cannot guarantee an optimal solution.)
Daniel
Daniel
I applied that simplification to the 10 cases I had and then greedy, it worked fine. I'm still figuring out a counter-example though.
m69 ''snarky and unwelcoming''
m69 ''snarky and unwelcoming''
@Daniel I also added a counter-example for a greedy approach.
Start asking to get answers
Find the answer to your question by asking.
Ask question
Explore related questions
algorithm
geometry
See similar questions with these tags.
The Overflow Blog
The history and future of software development (part 1)
Getting Backstage in front of a shifting dev experience
Featured on Meta
Spevacus has joined us as a Community Manager
Introducing a new proactive anti-spam measure
New and improved coding challenges
New comment UI experiment graduation
Policy: Generative AI (e.g., ChatGPT) is banned
Linked
Algorithm to fill arbitrary marked/selected tiles on a square grid with the smallest number of rectangles?
Related
1 Finding Room for a Shape on a Grid
Grid algorithm puzzle
3 Grid packing algorithm
2 How to compute the minimum number of rectangles required to cover occupied cells in a grid?
Minimum number of rectangles in shape made from rectangles?
Filling a polygon with maximum number of grid squares
3 Connect areas on a grid
0 Minimum number of square Grids in a Rectangular Grid[JAVA]
Minimum rectangles required to cover a given rectangular area
2 Non-Disjunct Rectangle Edge Covering for 2D Squares on a Grid
Hot Network Questions
Is it ok to place components "inside" the PCB
Is it possible that heinous sins result in a hellish life as a person, NOT always animal birth?
Origin of Australian slang exclamation "struth" meaning greatly surprised
How long would it take for me to get all the items in Bongo Cat?
Implications of using a stream cipher as KDF
How do trees drop their leaves?
Another way to draw RegionDifference of a cylinder and Cuboid
Does the mind blank spell prevent someone from creating a simulacrum of a creature using wish?
Proof of every Highly Abundant Number greater than 3 is Even
What can be said?
Suggestions for plotting function of two variables and a parameter with a constraint in the form of an equation
Numbers Interpreted in Smallest Valid Base
Why is the fiber product in the definition of a Segal spaces a homotopy fiber product?
Copy command with cs names
Is there a specific term to describe someone who is religious but does not necessarily believe everything that their religion teaches, and uses logic?
Can I go in the edit mode and by pressing A select all, then press U for Smart UV Project for that table, After PBR texturing is done?
Can a GeoTIFF have 2 separate NoData values?
What happens if you miss cruise ship deadline at private island?
Any knowledge on biodegradable lubes, greases and degreasers and how they perform long term?
Why include unadjusted estimates in a study when reporting adjusted estimates?
Why do universities push for high impact journal publications?
Is existence always locational?
Change default Firefox open file directory
I'm having a hard time intuiting throttle position to engine rpm consistency between gears -- why do cars behave in this observed way?
more hot questions
Question feed |
14188 | https://www.quora.com/Let-x-y-in-real-numbers-Define-x-y-iff-x-y-is-an-integer-How-do-you-show-that-is-an-equivalence-relation | Something went wrong. Wait a moment and try again.
Properties of Relation
The Real Numbers
Proofs (mathematics)
Set Theory
Real Number System
Equivalence Relations
5
Let x, y in real numbers. Define x ~ y iff x-y is an integer. How do you show that ~ is an equivalence relation?
Henry Smith
Studied at Kenyon College
·
Upvoted by
David Joyce
, Ph.D. Mathematics, University of Pennsylvania (1979) and
Kevin Shenoy
, M.Sc. Mathematics, The Maharaja Sayajirao University of Baroda (2022) · Author has 4.7K answers and 16.6M answer views
·
11y
First, you need to show that ∼ is reflexive; for all x∈R, x−x=0∈Z, so this is true.
Next, we need to show that the relationship is symmetric. Suppose x∼y. Then x−y=n for some integer n. −n is also an integer, and −n=−(x−y)=y−x, so y∼x.
Finally, we need to show that ∼ is transitive. Let x∼y and y∼z. Then x−y=n and y−z=k for some integers n and k. Then n+k=(x−y)+(y−z)=x−z. n+k is an integer, so x∼z.
Therefore, ∼ is an equivalence relation.
Finding out what the equivalence classes look like is easy. Consider that, for any x∼25, x−
First, you need to show that ∼ is reflexive; for all x∈R, x−x=0∈Z, so this is true.
Next, we need to show that the relationship is symmetric. Suppose x∼y. Then x−y=n for some integer n. −n is also an integer, and −n=−(x−y)=y−x, so y∼x.
Finally, we need to show that ∼ is transitive. Let x∼y and y∼z. Then x−y=n and y−z=k for some integers n and k. Then n+k=(x−y)+(y−z)=x−z. n+k is an integer, so x∼z.
Therefore, ∼ is an equivalence relation.
Finding out what the equivalence classes look like is easy. Consider that, for any x∼25, x−25=n for some integer n, so x=25+n. Note that x∼25 for all integers n. Therefore, the equivalence class of 25 is:
={25+n|n∈Z}
Similarly, the equivalence class of 1 can be constructed, but since n→n+1 is a bijection on the integers:
=Z
MyMathYourMath
PhD in Pure Mathematics, University of Houston (Graduated 2024)
·
Author has 1.7K answers and 376.4K answer views
·
3y
We need to show its reflexive, symmetric, and transitive.
(1) reflexive : x∼x because x−x=0∈Z thus it’s reflexive.
(2) symmetric: assume x∼y then x−y is an integer say n, then −n is also an integer thus
−n=−(x−y)=y−x⇒y∼x
and we have symmetry.
(3) for transitive suppose x∼y,y∼z
then adding them shows x−y+y−z=x−z∈Z thus x∼z as needed as we have transitivity.
Gary Crenshaw
BAM! Math'd.
·
Upvoted by
David Joyce
, Ph.D. Mathematics, University of Pennsylvania (1979) and
Erik Bergland
, PhD Mathematics, Brown University (2024) · Author has 223 answers and 601.7K answer views
·
5y
Related
Who can prove that ~ is an equivalence relation, where ~ is the relation in R defined by a~ b iff a - b is an integer?
You can!
Remember that an equivalence relation is one that satisfies three properties:
Reflexivity: for all a, a∼a.
Symmetricity: for all a and b, if a∼b then b∼a.
Transitivity: if a∼b and b∼c, then a∼c.
With that in mind, answer these questions:
For any a, what is a−a? How does that prove the relation is reflexive?
If a∼b, then what can you say about a−b? How can you use that to reason about b−a, and how does that prove symmetricity?
If a∼b and b∼c, what does this tell you about a−b and b−c, respectively? How can you use that to reason about a−c, and why does this
You can!
Remember that an equivalence relation is one that satisfies three properties:
Reflexivity: for all a, a∼a.
Symmetricity: for all a and b, if a∼b then b∼a.
Transitivity: if a∼b and b∼c, then a∼c.
With that in mind, answer these questions:
For any a, what is a−a? How does that prove the relation is reflexive?
If a∼b, then what can you say about a−b? How can you use that to reason about b−a, and how does that prove symmetricity?
If a∼b and b∼c, what does this tell you about a−b and b−c, respectively? How can you use that to reason about a−c, and why does this complete our proof?
(Hint: what is ?)
Related questions
Let
be the relation on the set
real numbers defined by
iff
is an integer. Is it possible to have
and
, but
?
Let x,y in natural numbers. Define x~y iff xy is a square of an integer. How will we show that this is a transitive relation?
Let x,y be in Z (integer). Define x~y if and only if 5| (2x+3y). How do you show that ~ is an equivalence relation?
Consider the set S=Z (integers), where x~y if and only if 2| (x + y). Show that ~ is an equivalence relation and find its equivalence classes. Can someone explain the answer to me clearly?
Let R be a relation on Z defined by R= {(a,b):a-b is an integer. How can you show that R is an equivalence relation?
Nathan Hannon
Ph. D. in Mathematics, University of California, Davis (Graduated 2021)
·
Author has 2K answers and 3.6M answer views
·
3y
Let be a group and let be a normal subgroup of . Then the left cosets of are also its right cosets, and the cosets of form a partition of . Furthermore, for , we have , so if and only if is the equivalence relation associated with the partition of by the cosets of . This also lets us define an operation on the cosets of by and construct the quotient group .
Since contains and is closed under addition and additive inverses, it is a subgroup of , and it is
Let be a group and let be a normal subgroup of . Then the left cosets of are also its right cosets, and the cosets of form a partition of . Furthermore, for , we have , so if and only if is the equivalence relation associated with the partition of by the cosets of . This also lets us define an operation on the cosets of by and construct the quotient group .
Since contains and is closed under addition and additive inverses, it is a subgroup of , and it is normal because is abelian.
Promoted by The Penny Hoarder
Lisa Dawson
Finance Writer at The Penny Hoarder
·
Updated Sep 16
What's some brutally honest advice that everyone should know?
Here’s the thing: I wish I had known these money secrets sooner. They’ve helped so many people save hundreds, secure their family’s future, and grow their bank accounts—myself included.
And honestly? Putting them to use was way easier than I expected. I bet you can knock out at least three or four of these right now—yes, even from your phone. Don’t wait like I did.
Cancel Your Car Insurance
You might not even realize it, but your car insurance company is probably overcharging you. In fact, they’re kind of counting on you not noticing. Luckily, this problem is easy to fix.
Don’t waste your time
Here’s the thing: I wish I had known these money secrets sooner. They’ve helped so many people save hundreds, secure their family’s future, and grow their bank accounts—myself included.
And honestly? Putting them to use was way easier than I expected. I bet you can knock out at least three or four of these right now—yes, even from your phone. Don’t wait like I did.
Cancel Your Car Insurance
You might not even realize it, but your car insurance company is probably overcharging you. In fact, they’re kind of counting on you not noticing. Luckily, this problem is easy to fix.
Don’t waste your time browsing insurance sites for a better deal. A company calledInsurify shows you all your options at once — people who do this save up to $996 per year.
If you tell them a bit about yourself and your vehicle, they’ll send you personalized quotes so you can compare them and find the best one for you.
Tired of overpaying for car insurance? It takes just five minutes to compare your options with Insurify andsee how much you could save on car insurance.
Ask This Company to Get a Big Chunk of Your Debt Forgiven
A company calledNational Debt Relief could convince your lenders to simply get rid of a big chunk of what you owe. No bankruptcy, no loans — you don’t even need to have good credit.
If you owe at least $10,000 in unsecured debt (credit card debt, personal loans, medical bills, etc.), National Debt Relief’s experts will build you a monthly payment plan. As your payments add up, they negotiate with your creditors to reduce the amount you owe. You then pay off the rest in a lump sum.
On average, you could become debt-free within 24 to 48 months. It takes less than a minute to sign up and see how much debt you could get rid of.
Set Up Direct Deposit — Pocket $300
When you set up direct deposit withSoFi Checking and Savings (Member FDIC), they’ll put up to $300 straight into your account. No… really. Just a nice little bonus for making a smart switch.
Why switch? With SoFi, you can earn up to 3.80% APY on savings and 0.50% on checking, plus a 0.20% APY boost for your first 6 months when you set up direct deposit or keep $5K in your account. That’s up to 4.00% APY total. Way better than letting your balance chill at 0.40% APY.
There’s no fees. No gotchas.Make the move to SoFi and get paid to upgrade your finances.
You Can Become a Real Estate Investor for as Little as $10
Take a look at some of the world’s wealthiest people. What do they have in common? Many invest in large private real estate deals. And here’s the thing: There’s no reason you can’t, too — for as little as $10.
An investment called the Fundrise Flagship Fund lets you get started in the world of real estate by giving you access to a low-cost, diversified portfolio of private real estate. The best part? You don’t have to be the landlord. The Flagship Fund does all the heavy lifting.
With an initial investment as low as $10, your money will be invested in the Fund, which already owns more than $1 billion worth of real estate around the country, from apartment complexes to the thriving housing rental market to larger last-mile e-commerce logistics centers.
Want to invest more? Many investors choose to invest $1,000 or more. This is a Fund that can fit any type of investor’s needs. Once invested, you can track your performance from your phone and watch as properties are acquired, improved, and operated. As properties generate cash flow, you could earn money through quarterly dividend payments. And over time, you could earn money off the potential appreciation of the properties.
So if you want to get started in the world of real-estate investing, it takes just a few minutes tosign up and create an account with the Fundrise Flagship Fund.
This is a paid advertisement. Carefully consider the investment objectives, risks, charges and expenses of the Fundrise Real Estate Fund before investing. This and other information can be found in the Fund’s prospectus. Read them carefully before investing.
Cut Your Phone Bill to $15/Month
Want a full year of doomscrolling, streaming, and “you still there?” texts, without the bloated price tag? Right now, Mint Mobile is offering unlimited talk, text, and data for just $15/month when you sign up for a 12-month plan.
Not ready for a whole year-long thing? Mint’s 3-month plans (including unlimited) are also just $15/month, so you can test the waters commitment-free.
It’s BYOE (bring your own everything), which means you keep your phone, your number, and your dignity. Plus, you’ll get perks like free mobile hotspot, scam call screening, and coverage on the nation’s largest 5G network.
Snag Mint Mobile’s $15 unlimited deal before it’s gone.
Get Up to $50,000 From This Company
Need a little extra cash to pay off credit card debt, remodel your house or to buy a big purchase?
We found a company willing to help.
Here’s how it works: If your credit score is at least 620, AmONE can help you borrow up to $50,000 (no collateral needed) with fixed rates starting at 6.40% and terms from 6 to 144 months.
AmONE won’t make you stand in line or call a bank. And if you’re worried you won’t qualify, it’s free tocheck online. It takes just two minutes, and it could save you thousands of dollars.
Totally worth it.
Get Paid $225/Month While Watching Movie Previews
If we told you that you could get paid while watching videos on your computer, you’d probably laugh.
It’s too good to be true, right?
But we’re serious. By signing up for a free account with InboxDollars, you could add up to $225 a month to your pocket. They’ll send you short surveys every day, which you can fill out while you watch someone bake brownies or catch up on the latest Kardashian drama.
No, InboxDollars won’t replace your full-time job, but it’s something easy you can do while you’re already on the couch tonight, wasting time on your phone.
Unlike other sites, InboxDollars pays you in cash — no points or gift cards. It’s already paid its users more than $56 million.
Signing up takes about one minute, and you’ll immediately receive a $5 bonus to get you started.
Earn $1000/Month by Reviewing Games and Products You Love
Okay, real talk—everything is crazy expensive right now, and let’s be honest, we could all use a little extra cash. But who has time for a second job?
Here’s the good news. You’re already playing games on your phone to kill time, relax, or just zone out. So why not make some extra cash while you’re at it?
WithKashKick, you can actually get paid to play. No weird surveys, no endless ads, just real money for playing games you’d probably be playing anyway. Some people are even making over $1,000 a month just doing this!
Oh, and here’s a little pro tip: If you wanna cash out even faster, spending $2 on an in-app purchase to skip levels can help you hit your first $50+ payout way quicker.
Once you’ve got $10, you can cash out instantly through PayPal—no waiting around, just straight-up money in your account.
Seriously, you’re already playing—might as well make some money while you’re at it.Sign up for KashKick and start earning now!
Assistant
Bot
·
1y
To show that the relation
~
defined by
x ~ y iff x-y is an integer
is an equivalence relation, we need to verify that it satisfies the following three properties:
Reflexivity: For all
x
in the real numbers,
x ~ x
.
Symmetry: For all
x
and
y
in the real numbers, if
x ~ y
, then
y ~ x
.
Transitivity: For all
x
,
y
, and
z
in the real numbers, if
x ~ y
and
y ~ z
, then
x ~ z
.
Proof:
Reflexivity: Let
x
be any real number. By the definition of
~
, we have
x - x = 0
, which is an integer. Therefore,
x ~ x
, and the relation
~
is reflexive.
Symmetry: Let
x
and
y
be any real numbers such that
x ~ y
. By the definitio
To show that the relation
~
defined by
x ~ y iff x-y is an integer
is an equivalence relation, we need to verify that it satisfies the following three properties:
Reflexivity: For all
x
in the real numbers,
x ~ x
.
Symmetry: For all
x
and
y
in the real numbers, if
x ~ y
, then
y ~ x
.
Transitivity: For all
x
,
y
, and
z
in the real numbers, if
x ~ y
and
y ~ z
, then
x ~ z
.
Proof:
Reflexivity: Let
x
be any real number. By the definition of
~
, we have
x - x = 0
, which is an integer. Therefore,
x ~ x
, and the relation
~
is reflexive.
Symmetry: Let
x
and
y
be any real numbers such that
x ~ y
. By the definition of
~
,
x - y
is an integer. This means that
y - x = -(x - y)
is also an integer. Therefore,
y ~ x
, and the relation
~
is symmetric.
Transitivity: Let
x
,
y
, and
z
be any real numbers such that
x ~ y
and
y ~ z
. By the definition of
~
,
x - y
and
y - z
are both integers. Then,
(x - y) + (y - z) = x - z
is also an integer. Therefore,
x ~ z
, and the relation
~
is transitive.
Since the relation
~
satisfies all three properties (reflexivity, symmetry, and transitivity), it is an equivalence relation.
Robert Telarket
Studied Mathematics (college major) (Graduated 1971)
·
Author has 1.5K answers and 1.1M answer views
·
Updated 3y
x - x = 0(an integer) => x ~ x(Reflexivity).
If x - y = m(an integer), then x ~ y.
y - x = -m(an integer) => y ~ x(Symmetry).
If x - y = m(an integer), then x ~ y.
If y - z = n(an integer), then y ~ z.
We have x - z = (m + n)(an integer) => x ~ z.
x ~ y and y ~ z => x ~ z(Transitivity).
Therefore ~ is an equivalence relation.
Related questions
How do you show that the relation R on the set of integers Z is defined as xRy (x-y) even numbers are equivalent relations?
How can you show that S= {(x,y): x-y is even} is an equivalence relation in Z?
How do I define a relation R on Z as xRy if and only if x^2 + y^2 is even? How do I prove that R is an equivalence relation?
How can you show that the following relation is equivalence relation: on r , x~y iff [x] = [y] is an integer, where [x] denotes the greatest integer?
Let Q be the set of Rational numbers & R be the relation in Q defined by R = {(x, y) : 1 + x y > 0}. How do you prove that R is reflexive & symmetric but not transitive?
Jordan Roth
majoring in physics.
·
11y
Related
Let x,y be in Z (integer). Define x~y if and only if 5| (2x+3y). How do you show that ~ is an equivalence relation?
An equivalence relation is a relation which is reflexive, symmetric, and transitive.
[math]\sim[/math] is reflexive if, for all [math]x \in Z[/math], [math]x \sim x[/math]. So, does [math]5 | ( 2x + 3x )[/math] for all [math]x \in Z[/math]?
[math]\sim[/math] is symmetric if, for all [math]x , y \in Z[/math], [math]x \sim y[/math] implies [math]y \sim x[/math]. So, assuming that [math]5 | (2x + 3y)[/math], does [math]5 | (2y + 3x)[/math], where [math]x , y \in Z[/math]?
[math]\sim[/math] is transitive if, for all [math]x , y , z \in Z[/math], [math]x \sim y[/math] and [math]y \sim z[/math] implies that [math]x \sim z[/math]. So, assuming that [math]5 | (2x + 3y)[/math] and [math]5 | (2y + 3z)[/math], does [math]5 | (2x + 3z)[/math], where [math]x , y , z \in Z[/math]?
If you're having issues with a specific part of the proof (or the background), let me/people kn
An equivalence relation is a relation which is reflexive, symmetric, and transitive.
[math]\sim[/math] is reflexive if, for all [math]x \in Z[/math], [math]x \sim x[/math]. So, does [math]5 | ( 2x + 3x )[/math] for all [math]x \in Z[/math]?
[math]\sim[/math] is symmetric if, for all [math]x , y \in Z[/math], [math]x \sim y[/math] implies [math]y \sim x[/math]. So, assuming that [math]5 | (2x + 3y)[/math], does [math]5 | (2y + 3x)[/math], where [math]x , y \in Z[/math]?
[math]\sim[/math] is transitive if, for all [math]x , y , z \in Z[/math], [math]x \sim y[/math] and [math]y \sim z[/math] implies that [math]x \sim z[/math]. So, assuming that [math]5 | (2x + 3y)[/math] and [math]5 | (2y + 3z)[/math], does [math]5 | (2x + 3z)[/math], where [math]x , y , z \in Z[/math]?
If you're having issues with a specific part of the proof (or the background), let me/people know.
In general, adding equations together tends to help (but don't beg the question).
Sponsored by CDW Corporation
How well do your distributed teams work together?
Enable seamless and secure communication for everyone with Cisco collaboration solutions from CDW.
Brian Sittinger
PhD in Mathematics, University of California, Santa Barbara (Graduated 2006)
·
Upvoted by
Aditya Garg
, M.Sc. Mathematics, Indian Institute of Technology, Delhi (2013) and
Hoosain Ebrahim
, BSc Mathematics & Mathematical Statistics (2021) · Author has 8.5K answers and 21.1M answer views
·
Updated 5y
Related
If
[math]x[/math]
be a real number such that
[math]x^{2014}-x^{2004}[/math]
and
[math]x^{2009}-x^{2004}[/math]
are both integers, then how do you show that
[math]x[/math]
is an integer?
Suppose that both [math]x^{2014} - x^{2004}[/math] and [math]x^{2009} - x^{2004}[/math] are integers.
By factoring, we see that this forces
[math]\displaystyle \frac{x^{2014} - x^{2004}}{x^{2009} - x^{2004}} = \frac{x^{2004} (x^{10} - 1)}{x^{2004} (x^5 - 1)} = x^5 + 1 \tag{}[/math]
to be a rational number. Thus, [math]x^5[/math] is a rational number.
Moreover, since [math]x^{2009} - x^{2004} = x^{2004} (x^5 - 1)[/math], this in turn implies that [math]x^{2004}[/math] is also a rational number. Next, since [math]x^{2004} = (x^5)^{400} \cdot x^4[/math], we conclude that [math]x^4 [/math]is a rational as well, and since [math]x^5[/math] and [math]x^4[/math] are rationals, their quotient [math]x[/math] is also a rational number.
We write [math]x =[/math]
Suppose that both [math]x^{2014} - x^{2004}[/math] and [math]x^{2009} - x^{2004}[/math] are integers.
By factoring, we see that this forces
[math]\displaystyle \frac{x^{2014} - x^{2004}}{x^{2009} - x^{2004}} = \frac{x^{2004} (x^{10} - 1)}{x^{2004} (x^5 - 1)} = x^5 + 1 \tag{}[/math]
to be a rational number. Thus, [math]x^5[/math] is a rational number.
Moreover, since [math]x^{2009} - x^{2004} = x^{2004} (x^5 - 1)[/math], this in turn implies that [math]x^{2004}[/math] is also a rational number. Next, since [math]x^{2004} = (x^5)^{400} \cdot x^4[/math], we conclude that [math]x^4 [/math]is a rational as well, and since [math]x^5[/math] and [math]x^4[/math] are rationals, their quotient [math]x[/math] is also a rational number.
We write [math]x = \frac{m}{n}[/math] for some integers [math]m[/math] and [math]n[/math], where [math]n > 0[/math] and [math]\gcd(m, n) = 1[/math]. In order to show that [math]x[/math] is indeed an integer, we need to show that [math]n \geq 2[/math] leads to a contradiction.
Substituting this into [math]x^{2009} - x^{2004}[/math] yields
[math]\begin{align} x^{2009} - x^{2004} &= x^{2004} (x - 1)(x^4 + x^3 + x^2 + x + 1)\ &= \displaystyle \frac{m^{2004}}{n^{2009}} (m - n)(m^4 + m^3 n + m^2 n^2 + mn^3 + n^4). \end{align} \tag{}[/math]
Observe that the last two factors are not divisible by [math]n[/math], because each factor has exactly one term only in [math]m[/math], and [math]\gcd(m, n) = 1[/math]. Moreover, [math]m^{2004}[/math] is not divisible by [math]n[/math] as well. Hence, this would imply that [math]x^{2009} - x^{2004}[/math] is not an integer if [math]n \geq 2[/math], yielding the desired contradiction.
Therefore, [math]n = 1[/math] and we conclude that [math]x[/math] is an integer.
Amitabha Tripathi
have been teaching Discrete Mathematics for almost 40 years
·
Author has 4.7K answers and 13.9M answer views
·
1y
Related
How can you show that the following relation is equivalence relation: on r , x~y iff [x] = [y] is an integer, where [x] denotes the greatest integer?
An equivalence relation [math]\mathcal R[/math] on a set [math]S[/math] is one which is
[math]\bullet[/math] reflexive: [math]x \,\mathcal R\, x[/math] for each [math]x \in S[/math];
[math]\bullet[/math] symmetric: [math]x \,\mathcal R\, y[/math] implies [math]y \,\mathcal R\, x[/math] with [math]x,y \in S[/math];
[math]\bullet[/math] transitive: [math]x \,\mathcal R\, y[/math] and [math]y \,\mathcal R\, z[/math] imply [math]x \,\mathcal R\, z[/math] with [math]x, y, z \in S[/math].
Now apply this to the set of real numbers: [math]S=\mathbb R[/math] and the relation [math]\mathcal R[/math] given by
[math]x \,\mathcal R\, y[/math] if and only if [math]\lfloor x \rfloor = \lfloor y \rfloor[/math] with [math]x,y \in \mathbb R[/math].
Sponsored by CDW Corporation
Want document workflows to be more productive?
The new Acrobat Studio turns documents into dynamic workspaces. Adobe and CDW deliver AI for business.
B.L. Srivastava
Lives in Kanpur, Uttar Pradesh, India (1972–present)
·
Author has 7.6K answers and 8.1M answer views
·
3y
Related
If R1 is the relation on the set of integers defined by R1 = {(x, y) | x - y is divisible by 11, for x, y in the set of integers}. to find if it is an equivalence relation and also determining it's equivalence class?
In the set of integers Z, a relation R₁ is defined as ; R₁= {(x, y) : (x-y) is divisible by 11 } for x, y belonging to Z . Now, observe the following;
(I) for each x ∈ Z, as (x-x) = 0 which is clearly divisible by 11, therefore R₁ is reflexive.
(II) if (x, y) ∈ R₁ ==> (x - y) is divisible by 11 i.e. (x - y) = 11 k for some integer k , then this ==> (y - x) = 11(-k), as k is an integer so is -k ==> (
In the set of integers Z, a relation R₁ is defined as ; R₁= {(x, y) : (x-y) is divisible by 11 } for x, y belonging to Z . Now, observe the following;
(I) for each x ∈ Z, as (x-x) = 0 which is clearly divisible by 11, therefore R₁ is reflexive.
(II) if (x, y) ∈ R₁ ==> (x - y) is divisible by 11 i.e. (x - y) = 11 k for some integer k , then this ==> (y - x) = 11(-k), as k is an integer so is -k ==> (y, x) ∈ R₁ ==> R₁ is symmetric.
(III) let (x, y) ∈ R₁ ==> (x - y) = 11k for some integer k, next assume that (y, z)∈ R₁ ==> (y -z) = 11k’ for some integer k’ then these two together implies : (x - z) = {(x-y) + (y-z)} = 11(k+k’) = 11 k” ==> (x-z) is divisible by 11 ==> (x, z) ∈ R₁, therefore R₁ is transitive.
Hence...
Comlan Amouwotor
Studied at Catholic University of West Africa
·
Author has 132 answers and 323.2K answer views
·
8y
Related
What are x and y if (x^y) = (y^x), where x and y are positive integers and x <> y?
Real values such that [math]x^y = y^x[/math] also verify the condition [math]x\ln{y} = y\ln{x}[/math] which is the same as [math]\dfrac{\ln{x}}{x} = \dfrac{\ln{y}}{y}.[/math]
So the real numbers looked for, let us call them [math]a[/math] and [math]b[/math], are those such that [math]f(x) = \dfrac{\ln{x}}{x}[/math] has the same value on [math]a[/math] and [math]b[/math] ([math]a[/math] and [math]b[/math] being distinct). Now let us study the variations of [math]f[/math].
On its domain, the derivative of this function is:
[math]f^{\prime}(x) = \dfrac{1}{x^2}(1 - \ln{x})[/math]
which is clearly positive on math[/math] and negative on math[/math] (where [math]e[/math] is the Euler’s number also called Napier’s Constant).
Ergo, [math]f[/math] is increasing on math[/math], crosses the [math]x[/math]-axi
Real values such that [math]x^y = y^x[/math] also verify the condition [math]x\ln{y} = y\ln{x}[/math] which is the same as [math]\dfrac{\ln{x}}{x} = \dfrac{\ln{y}}{y}.[/math]
So the real numbers looked for, let us call them [math]a[/math] and [math]b[/math], are those such that [math]f(x) = \dfrac{\ln{x}}{x}[/math] has the same value on [math]a[/math] and [math]b[/math] ([math]a[/math] and [math]b[/math] being distinct). Now let us study the variations of [math]f[/math].
On its domain, the derivative of this function is:
[math]f^{\prime}(x) = \dfrac{1}{x^2}(1 - \ln{x})[/math]
which is clearly positive on math[/math] and negative on math[/math] (where [math]e[/math] is the Euler’s number also called Napier’s Constant).
Ergo, [math]f[/math] is increasing on math[/math], crosses the [math]x[/math]-axis at [math]x=1[/math], then realizes a maximum at [math]x = e[/math] whereat [math]f(e) = \frac{1}{e}[/math] and finally decreases on math[/math] tending to zero as [math]x[/math] grows bigger and bigger.
See the graph I plotted using Python numpy+matplotlib.pyplot:
So for every [math]a[/math] on (and only on) math[/math], there will always be a unique [math]b[/math] such that [math]b \neq a[/math] and [math]f(a) = f(b)[/math] and if we consider that [math]a \lt b[/math], then we must have [math]a \lt e \lt b.[/math]
Thus there are infinitely many such couples of real numbers but since we are looking for integers then we have only one choice for [math]a[/math] because [math]2[/math] is the only integer such that [math]1 \lt a \lt e[/math] ([math]e \approx 2.71828182[/math]). So here is the only possibility: [math]a = 2.[/math]
Thence, it is easy check that [math]b = 4[/math] is the integer such that [math]a^b = b^a[/math]. And it is the only one.
B.L. Srivastava
Author has 7.6K answers and 8.1M answer views
·
5y
Related
How do you show that the relation R on the set of integers Z is defined as xRy (x-y) even numbers are equivalent relations?
On the set of integers Z, a relation R is defined as ; xRy iff (x-y) is an even number. For this relation, we see that ;
(I) for each x € Z , xRx as (x-x) = 0 is an even number. (Reflexivity)
(II) let xRy ==> (x-y) is an even number so is the number (y-x) .(Symmetricity)
(III) let xRy then (x-y) is an even number, suppose yRz then (y-z) is an even number. Therefore, (x-y)-(y-z) = (x-z) is even number
On the set of integers Z, a relation R is defined as ; xRy iff (x-y) is an even number. For this relation, we see that ;
(I) for each x € Z , xRx as (x-x) = 0 is an even number. (Reflexivity)
(II) let xRy ==> (x-y) is an even number so is the number (y-x) .(Symmetricity)
(III) let xRy then (x-y) is an even number, suppose yRz then (y-z) is an even number. Therefore, (x-y)-(y-z) = (x-z) is even number, showing that xRz . (Transitivity).
Dean Rubine
Former Faculty at Carnegie Mellon School Of Computer Science (1991–1994)
·
Upvoted by
Terry Moore
, M.Sc. Mathematics, University of Southampton (1968) · Author has 10.6K answers and 23.6M answer views
·
5y
Related
How would you define ~ on RxR (real numbers) with (x,y) R (u,v) as 3x - y = 3u -y? How would you show that ~ is an equivalent relation to RxR?
I answered something similar a day or two ago but it wasn’t this clear and I must have misunderstood. Anyway let’s try again. I’ll fix the typos in the question without further comment.
We define math \sim (u,v)[/math] precisely when [math]3x-y=3u-v[/math]
Theorem: ~ is a equivalence relation
Reflexivity. Show math\sim(x,y)[/math]
[math]3x-y = 3x -y[/math] so that’s true. [math] \quad\checkmark[/math]
Symmetry. Show math\sim(u,v)[/math] implies math\sim(x,y)[/math]
We have [math]3x-y=3u-v[/math] so of course [math]3u-v=3x-y[/math] so math\sim(x,y) \quad\checkmark[/math]
Transitivity. Show math\sim(u,v)[/math] and math\sim(p,q)[/math] implies math\sim(p,q)[/math]
We know [math]3x-y=3u-v[/math] and [math]3u-v=3p-q[/math] so [math]3x-y=3p-q[/math]
I answered something similar a day or two ago but it wasn’t this clear and I must have misunderstood. Anyway let’s try again. I’ll fix the typos in the question without further comment.
We define math \sim (u,v)[/math] precisely when [math]3x-y=3u-v[/math]
Theorem: ~ is a equivalence relation
Proof.
Reflexivity. Show math\sim(x,y)[/math]
[math]3x-y = 3x -y[/math] so that’s true. [math] \quad\checkmark[/math]
Symmetry. Show math\sim(u,v)[/math] implies math\sim(x,y)[/math]
We have [math]3x-y=3u-v[/math] so of course [math]3u-v=3x-y[/math] so math\sim(x,y) \quad\checkmark[/math]
Transitivity. Show math\sim(u,v)[/math] and math\sim(p,q)[/math] implies math\sim(p,q)[/math]
We know [math]3x-y=3u-v[/math] and [math]3u-v=3p-q[/math] so [math]3x-y=3p-q[/math] so math\sim(p,q) \quad\checkmark[/math]
We’ve shown reflexivity, symmetry and transitivity so we have an equivalence relation.
Related questions
Let
be the relation on the set
real numbers defined by
iff
is an integer. Is it possible to have
and
, but
?
Let x,y in natural numbers. Define x~y iff xy is a square of an integer. How will we show that this is a transitive relation?
Let x,y be in Z (integer). Define x~y if and only if 5| (2x+3y). How do you show that ~ is an equivalence relation?
Consider the set S=Z (integers), where x~y if and only if 2| (x + y). Show that ~ is an equivalence relation and find its equivalence classes. Can someone explain the answer to me clearly?
Let R be a relation on Z defined by R= {(a,b):a-b is an integer. How can you show that R is an equivalence relation?
How do you show that the relation R on the set of integers Z is defined as xRy (x-y) even numbers are equivalent relations?
How can you show that S= {(x,y): x-y is even} is an equivalence relation in Z?
How do I define a relation R on Z as xRy if and only if x^2 + y^2 is even? How do I prove that R is an equivalence relation?
How can you show that the following relation is equivalence relation: on r , x~y iff [x] = [y] is an integer, where [x] denotes the greatest integer?
Let Q be the set of Rational numbers & R be the relation in Q defined by R = {(x, y) : 1 + x y > 0}. How do you prove that R is reflexive & symmetric but not transitive?
If n is an integer greater than or equal to 3 and x is a real number so that {x} = {x^2} = {x^n}, where {x} means the fractional part, {x} = x-floor(x), then how do I prove that x is an integer?
Suppose A is the set composed of all ordered pairs of positive integers. Let R be the relation defined on A there (a,b) R (c,d) means that a+d=b+c. How do you prove that R is an equivalence relation?
When is (x-y) /(x+y) an integer?
If x ∈ Z then does it follow that x² ∈ Z as well? (Where Z is the set of all integer numbers)
Let A = {2, 3, 4} and B = {6, 8, 10} and define a relation R from A to B as follows (x,y) ∈ R means that y/x is an integer. Which of the following is true?
About
·
Careers
·
Privacy
·
Terms
·
Contact
·
Languages
·
Your Ad Choices
·
Press
·
© Quora, Inc. 2025 |
14189 | https://mathcentral.quora.com/How-can-we-prove-that-math-sin-left-dfrac-pi-4-theta-right-sin-left-dfrac-pi-4-theta-right-dfrac-1 | How can we prove that[math]\sin\left(\dfrac{\pi}{4} - \theta\right)\sin\left(\dfrac{\pi}{4} + \theta\right) = \dfrac{1}{2}\cos 2\theta\,?[/math] - Math Central - Quora
Something went wrong. Wait a moment and try again.
Try again
Skip to content
Skip to search
Sign In
Math Central
Mathematics is the "Language of the universe"
Follow
·
125.5K 125.5K
How can we prove that sin(π 4−θ)sin(π 4+θ)=1 2 cos 2 θ?sin(π 4−θ)sin(π 4+θ)=1 2 cos2 θ?
Answer
Request
Follow
2 Answers
Sort
Recommended
Lai Johnny
M. Phil in Mathematics Major, The Chinese University of Hong Kong (Graduated 1985)
·5y
sin(π 4−θ)sin(π 4+θ)sin(π 4−θ)sin(π 4+θ)
=(sin π 4 cos θ−sin θ cos π 4)(sin π 4 cos θ+sin θ cos π 4)=(sinπ 4 cosθ−sinθ cosπ 4)(sinπ 4 cosθ+sinθ cosπ 4)
=1√2(cos θ−sin θ)1√2(cos θ+sin θ)=1 2(cosθ−sinθ)1 2(cosθ+sinθ)
=1 2(cos 2 θ−sin 2 θ)=1 2(cos 2θ−sin 2θ)
=cos(2 θ)2=cos(2 θ)2
Mohammad Afzaal Butt
B.Sc in Mathematics&Physics, Islamia College Gujranwala (Graduated 1977)
·5y
left hand side left hand side
sin(π 4−θ)sin(π 4+θ)sin(π 4−θ)sin(π 4+θ)
=−1 2[−2 sin(π 4−θ)sin(π 4+θ)]=−1 2[−2 sin(π 4−θ)sin(π 4+θ)]
=−1 2[cos(π 4−θ+π 4+θ)−cos(π 4−θ−π 4−θ)]=−1 2[cos(π 4−θ+π 4+θ)−cos(π 4−θ−π 4−θ)]
=−1 2[cos π 2−cos(−2 θ)]=−1 2[cosπ 2−cos(−2 θ)]
=−1 2(0−cos 2 θ)=−1 2(0−cos2 θ)
=1 2 cos θ=Right hand side=1 2 cosθ=Right hand side
Related questions
What is the general integral Z(x,y) of the PDE x(y+Z) Zx + Z (Z - y) Zy = y(y-Z)?
Can you find the general integral of the PDE (2xy-1) zₓ + (z-2x^2) zᵧ = 2 (x-yz)?
How do I solve the partial differential equation (D²-2DD'-15D'²) z=12xy?
How do you graph the equation y=-4x^2?
What are the intercepts and then use them to graph the equation 2y=-18+9x?
How do we prove that ∫1 0 ln(1+x 2)x√x 2−1 d x=−i(a r c s i n h 2(1))?∫0 1 ln(1+x 2)x x 2−1 d x=−i(a r c s i n h 2(1))?
How do we evaluate the integral ∫π 0 x cos x 1+sin 2 x d x?∫0 π x cosx 1+sin 2x d x?
How do we evaluate the integral ∫2 π 0 x 2 sin x 8+sin 2 x d x?∫0 2 π x 2 sinx 8+sin 2x d x?
How do we evaluate the integral ∫∞0 x 4(x 4−x 2+1)4 d x?∫0∞x 4(x 4−x 2+1)4 d x?
A can company charges a $3 flat rate in addition to $1.50 per mile the domain of this function is The range of this function is?
Agatha put $775 into a simple interest bearing account at a rate of 2.4% for 8 years. Her friend Dominic invested the same amount into an account that is compounded quarterly at the same rate for 6 years?
Jeff has $28.75. He purchased three cookies that cost $1.50 each, five newspapers that each cost $0.50, five flowers for $1.25 each, and used the remainder of the cash on a pair of sunglasses. How much were the sunglasses?
When a factory operates from 6 AM to 6 PM, its total fuel consumption varies according to the formula f(t) = 0.91 - 0.110.4 + 12, where t is the time in hours after 6 AM and f() is the number of barre?
Cooper designs a photo album that he is going to give his parents as a gift. He created 15 pages of the album in June. He designed 1/10 of the album in August. He finishes the remaining 3/5 just in time for his parent's anniversary in November?
The following scatterplot relates the life expectancy of animals to their heart rate. Ignoring humans (which are labeled "Man" in the scatterplot), which two conclusions can be made from the scatterplot?
About · Careers · Privacy · Terms · Contact · Languages · Your Ad Choices · Press ·
© Quora, Inc. 2025 |
14190 | https://news.qq.com/rain/a/20241014A08GC600 | 别以为你会数数，千亿之后怎么数，你知道吗？_腾讯新闻
别以为你会数数，千亿之后怎么数，你知道吗？
丽丽xyz
2024-10-14 20:00 发布于 河南 育儿领域创作者
一、数 穷进之
如今咱们用的计数方式，其实在古代叫“数穷进之”——是古代沿袭下来的一种计数方式。
“数穷进之”什么意思呢，就是用更小的单位来表示大的单位，每个小单位只用一次，没有用的了再进到下一个单位。
比如，
万级有：万、十万、百万、千万。
亿级有：亿、十亿、百亿、千亿、万亿（用个、十、百、千、万这些更小的单位来表示亿）。
表示尽了，再进入下一个单位【兆】——再用，（个）兆、十兆、百兆、千兆、万兆、亿兆——用尽了，到下一个单位【京】。
依此类推。
我们的计数单位有：亿、兆、京、垓、姊、穰、沟、涧、正、载。
看这些字，沟、涧、垓，带有农耕文明的印记，我们以前是一个中央集权的国家，涉及土地和税收等，需要计很大的数。
所以咱们的计数单位很多。
二、单位不等于量级
亿、兆、京、垓、姊、穰、沟、涧、正、载，这些属于单位，不属于量级，如今是4位一个量级，量级之间差的是4次方。
比如个级，有个、十、百、千，4位。
个是10^0=1（10的0次方）。
万级，有万、十万、百万、千万。
万是10^4=10000（10的4次方）。
也就是个级和万级差4次方。
再往上就到了亿级。
亿级有亿、十亿、百亿、千亿，4位。
1亿是10^8，也就是1后面有8个0，跟万级差4次方（小学4年级就会学到这里，下图是课本，北师大版）。
这种计数方式是以万为基础的，叫“万万进之”。
也就是后一个级数是前一个级数的一万倍。
万万进之有很多理解方式，这里只说其中一种，因为我国朝代不同，地域文化不同，有很多流变。我们说的这种也是现在通用的一种方式。
万级是个级的一万倍。
亿级是万级的一万倍。
所以，以前我们说：我们有4万万同胞，也就是4亿=4万的一万倍=4×10^8=40000x10000
话说回来，继续顺延的话，万亿级是亿级的万倍，兆是万亿的万倍。
没错，这里不要糊涂，到了千亿，亿级就结束了，因为已经4位了，万亿属于一个单独的级数，叫万亿级。
万亿级包括：万亿、十万亿、百万亿、千万亿。10个千万亿进位成一万万亿（记住，始终是十进制），一万万亿就是一兆。
也就是说1万万亿等于1兆.后一个量级是前一个量级的1万倍。
接着是兆、十兆、百兆、千兆，4位了，切换下一个级数——万兆。
万兆级：万兆、十万兆、百万兆、千万兆。
之后是亿兆，亿兆包括：亿兆、十亿兆、百亿兆、千亿兆——4位，切换下一个级数——万亿兆。
万亿兆包含4个位数：万亿兆、十万亿兆、百万亿兆、千万亿兆。
之后是京。
……
发现没有：
亿——亿、十亿、百亿、千亿。
万亿——万亿、十万亿、百万亿、千万亿。
兆——兆、十兆、百兆、千兆。
万兆——万兆、十万兆、百万兆、千万兆。
亿兆包括：亿兆、十亿兆、百亿兆、千亿兆——4位，切换下一个级数——万亿兆。
万亿兆——万亿兆、十万亿兆、百万亿兆、千万亿兆。
每个量级4个位。
每个单位都被前面的单位穷尽——数穷进之。
等于说，把数穷进之和万万进之结合了一下，不把“兆、京、涧”这些单位单纯的当级数。
我们平时在新闻里会看到说“这是一个“万亿级的产业”，“将产生亿兆的能量”——这些都是量级。
三、局限
这样的计数虽然非常有规律，但不跟国际接轨，也容易让人糊涂——不知道你糊涂不糊涂，我写的时候都有点晕了。
所以，通常到了千亿之后，我们的计算就直接用次方了。
10的多少次方，直接参与运算，而不是叫多少亿兆。
可以说大数在小学阶段，就出现在了4年级上册，没有过多涉及。
也只教孩子数到千亿。
再往上其实单位和量级是比较混乱的，大部分人都容易搞混。
比如京，要穷尽之前的单位，就是：
京、十京、百京、千京；
万京、十万京、百万京、千万京；
亿京、十亿京、百亿京、千亿京；
到了万亿京又有十万亿京，百万亿京，千万亿京；
之后再是兆京，接着十兆京、百兆京、千兆京；
再来，万兆京、十万兆京、百万兆京、千万兆京；
亿兆京，十亿兆京、百亿兆京，千亿兆京；
万亿兆京，十万亿兆京、百万亿兆京、千万亿兆京——好，到现在才进位猜到1垓。
……
眩晕症犯了。
在英语世界里，他们类似于【千千进之】。
比如：
thousand=1000=10³
million=1000000=10^6
billion=1000000000=10^9
trillion=1000000000000=10^12
看明白了吗，后一个单位是前一个单位的1000倍。
所以写的时候，它们会3个位数一个逗号，而我们是4个位数一个逗号（有时候也不点逗号，就是分开。你可以看输入银行卡，我们的习惯就是4位数一个间隔）。
在这方面我们也在跟国际接轨，因为我们引入的单位千米、千克、吨，都是以千为进率的。
所以，通常到千亿之后都用次方，不然就有些混乱了——在读数方面很麻烦。
我的理解是小学生学量级、大数，就是感知一下大数，为下一步抽象的10的次方引入做铺垫，但这个铺垫是不是最好的方式，我不好说。
上面这张图是《小学教材中的大道理》中的一页，里面有讲到跟国际接轨。
也有说百万为兆，这是西方传过来后，我们的翻译，牵扯到信息字节等计算，很容易和数字单位和量级搞混。
因此：
在计数系统中，如果孩子问，就跟他们说4位一个量级，千亿后的量级是万亿级，之后太麻烦了，直接用次方表示。
如果孩子大了，想了解一下大数量级，倒可以看看相关内容，不过这些都不是我们计数的主流了——我认为次方最为方便。
这就是我的一点看法了，有什么的不对的，欢迎留言分享。 |
14191 | https://brightchamps.com/en-us/math/algebra/graphing-linear-equations | Table Of Contents
Summarize this article:
ChatGPT
Perplexity
Last updated on September 26, 2025
Graphing Linear Equations
Linear equations are algebraic equations in which the highest degree of the variable is 1. Graphing a linear equation involves a visual representation of the equation on a graph. In this article, we will learn how to graph linear equations.
What is Graphing Linear Equations?
Graphing linear equations means plotting them on a coordinate plane, where every point on the line represents a solution to the equation. Linear equations have the highest degree of 1 and are written in the form y = mx + b, also known as the y-intercept form. The graph of a linear equation with one or two variables is always a straight line, and every point on the line represents a solution of the equation.
The point where the line crosses the x-axis is called the x-intercept, and the point where it crosses the y-axis is called the y-intercept.
How to Represent Linear Equations Graphically?
Graphing a linear equation involves the process of finding its solutions and displaying them on the coordinate plane. Usually, two points (x, y) are used to plot the graph. Follow these steps to plot linear equations:
Graphing Linear Equations in Two Variables
A linear equation in two variables has the form ax + by = c or in the slope-intercept form (y = mx + b), where x and y are variables and a, b, and c are real numbers. To graph a linear equation in two variables, follow these steps:
Real-World Applications of Graphing Linear Equations
Learning to graph linear equations helps students solve problems practically. It is used to track expenses, predict profits, and analyze scientific data. Let’s learn some applications of graphing linear equations.
Common Mistakes and How to Avoid Them in Graphing Linear Equations
Students often make mistakes while graphing linear equations. In this section, we will discuss some common mistakes and find ways to avoid them.
Students often make mistakes while graphing linear equations. In this section, we will discuss some common mistakes and find ways to avoid them.
Mistake 1
Incorrectly identifying the slope
Incorrectly identifying the slope
Students often misread the slope in the equation y = mx + b. For example, in the equation y = 3x + 2, students often think the slope is 2 instead of 3. To avoid this error, always remember that in y = mx + b, m is the slope and b is the y-intercept.
Students often misread the slope in the equation y = mx + b. For example, in the equation y = 3x + 2, students often think the slope is 2 instead of 3. To avoid this error, always remember that in y = mx + b, m is the slope and b is the y-intercept.
Mistake 2
Misinterpreting equations in standard form
Misinterpreting equations in standard form
Students sometimes graph the linear equation in the standard form, Ax + By = C, but it can lead to errors, as they may misidentify the slope or the intercepts on the graph. For example, in the equation 2x + 3y = 6, students often misinterpret 2 as slope and 3 as y-intercept; it is wrong. So, always convert the equation in standard form to slope-intercept form before graphing it.
Students sometimes graph the linear equation in the standard form, Ax + By = C, but it can lead to errors, as they may misidentify the slope or the intercepts on the graph. For example, in the equation 2x + 3y = 6, students often misinterpret 2 as slope and 3 as y-intercept; it is wrong. So, always convert the equation in standard form to slope-intercept form before graphing it.
Mistake 3
Plotting the y-intercept on the x-axis
Plotting the y-intercept on the x-axis
Plotting the y-intercept on the x-axis is a common mistake students make when plotting the linear equation. For example, in y = 2x + 3, students plot the point (3, 0) instead of (0, 3), thinking it is the y-intercept. To avoid this error, always remember that the y-intercept is the point where the graph crosses the y-axis and where the value of x is 0.
Plotting the y-intercept on the x-axis is a common mistake students make when plotting the linear equation. For example, in y = 2x + 3, students plot the point (3, 0) instead of (0, 3), thinking it is the y-intercept. To avoid this error, always remember that the y-intercept is the point where the graph crosses the y-axis and where the value of x is 0.
Mistake 4
Confusing x and y coordinates
Confusing x and y coordinates
When plotting the graph, students confuse x and y coordinates, for example, for points (-2, 4), students sometimes confuse x and y coordinates. For example, for the point (-2, 4), they may incorrectly plot it as (-4, 2). To avoid this error, always remember that the first value (x) is the x-coordinate and the second value (y) is the y-coordinate.
When plotting the graph, students confuse x and y coordinates, for example, for points (-2, 4), students sometimes confuse x and y coordinates. For example, for the point (-2, 4), they may incorrectly plot it as (-4, 2). To avoid this error, always remember that the first value (x) is the x-coordinate and the second value (y) is the y-coordinate.
Mistake 5
Not labeling the axes
Not labeling the axes
When plotting the linear equations, students sometimes forget to label the axes. To avoid this, make sure to label both the axes (x-axis and y-axis) and the scale on the graph.
When plotting the linear equations, students sometimes forget to label the axes. To avoid this, make sure to label both the axes (x-axis and y-axis) and the scale on the graph.
Solved Examples on Graphing Linear Equations
Problem 1
A line passes through the y-axis at 1 and has a slope of 2. What is the graph of this line?
na
na
Explanation
Given, slope (m) = 2
y-intercept (b) = 1
In slope-intercept form, it can be written as y = 2x + 1
From y-intercept (0, 1), use slope 2 (go up 2, right 1), to get (1, 3).
Given, slope (m) = 2
y-intercept (b) = 1
In slope-intercept form, it can be written as y = 2x + 1
From y-intercept (0, 1), use slope 2 (go up 2, right 1), to get (1, 3).
Problem 2
Plot the graph of the equation, 2x + y = 8
na
na
Explanation
Given,
2x + y = 8
y = -2x + 8
Finding the value of y
x
y = -2x + 8
0
y = -2(0) + 8 = 8
2
y = -2(2) + 8 = 4
4
y = -2(4) + 8 = 0
Plot the points (0, 8), (2, 4), and (4, 0) and connect them.
Given,
2x + y = 8
y = -2x + 8
Finding the value of y
x
y = -2x + 8
0
y = -2(0) + 8 = 8
2
y = -2(2) + 8 = 4
4
y = -2(4) + 8 = 0
Plot the points (0, 8), (2, 4), and (4, 0) and connect them.
Problem 3
Plot the graph of the equation, 15x - 5y = 25
na
na
Explanation
Finding the value of y to plot the graph,
15x - 5y = 25
-5y = 25 - 15x
Dividing the equation by -5:
y = -5 + 3x
y = 3x - 5
Finding the value of y
x
y = 3x - 5
0
y = 3(0) - 5 = -5
1
y = 3(1) - 5 = -2
2
y = 3(2) - 5 = 1
So, here the points are (0, -5), (1, -2), (2, 6)
Plotting the graph with these points.
Finding the value of y to plot the graph,
15x - 5y = 25
-5y = 25 - 15x
Dividing the equation by -5:
y = -5 + 3x
y = 3x - 5
Finding the value of y
x
y = 3x - 5
0
y = 3(0) - 5 = -5
1
y = 3(1) - 5 = -2
2
y = 3(2) - 5 = 1
So, here the points are (0, -5), (1, -2), (2, 6)
Plotting the graph with these points.
Problem 4
Plot the graph of the following equation: x = 7,Plot the graph y = -2x
na
,na
na
,na
Explanation
Here, the value of x is always 7; to plot x = 7, we draw a vertical line through (7, y).
Here, the points are (7, 0), (7, 2), (7, -3).
In y = -2x, the slope is -2 and the y-intercept is 0. For y = -2x:
x = -1 → y = 2,
x = 0 → y = 0,
x = 1 → y = -2.
Here, the points are (-1, 2), (0, 0), (1, -2) Plotting the graph through the points
Here, the value of x is always 7; to plot x = 7, we draw a vertical line through (7, y).
Here, the points are (7, 0), (7, 2), (7, -3).
In y = -2x, the slope is -2 and the y-intercept is 0. For y = -2x:
Here, the points are (-1, 2), (0, 0), (1, -2) Plotting the graph through the points
FAQs on Graphing Linear Equations
1.What is a linear equation?
The equation that forms a straight line is a linear equation, where the highest degree is 1.
The equation that forms a straight line is a linear equation, where the highest degree is 1.
2.What is the y-intercept?
The y-intercept is the point where the graph passes through the y-axis.
The y-intercept is the point where the graph passes through the y-axis.
3.What is the slope-intercept form?
The slope-intercept form of a linear equation is: y = mx + b.
The slope-intercept form of a linear equation is: y = mx + b.
4.Can a linear equation have a vertical or horizontal line?
Yes, the linear equation can have a vertical or horizontal line, based on its form.
Yes, the linear equation can have a vertical or horizontal line, based on its form.
5.How do you find the y-intercept of a graph?
To find the y-intercept of a graph, identify the points where the line passes through the y-axis; the coordinates of the point are (0, b).
To find the y-intercept of a graph, identify the points where the line passes through the y-axis; the coordinates of the point are (0, b).
6.How does learning Algebra help students in United States make better decisions in daily life?
Algebra teaches kids in United States to analyze information and predict outcomes, helping them in decisions like saving money, planning schedules, or solving problems.
7.How can cultural or local activities in United States support learning Algebra topics such as Graphing Linear Equations ?
Traditional games, sports, or market activities popular in United States can be used to demonstrate Algebra concepts like Graphing Linear Equations , linking learning with familiar experiences.
8.How do technology and digital tools in United States support learning Algebra and Graphing Linear Equations ?
At BrightChamps in United States, we encourage students to use apps and interactive software to demonstrate Algebra’s Graphing Linear Equations , allowing students to experiment with problems and see instant feedback for better understanding.
9.Does learning Algebra support future career opportunities for students in United States?
Yes, understanding Algebra helps students in United States develop critical thinking and problem-solving skills, which are essential in careers like engineering, finance, data science, and more.
Explore More algebra
Important Math Links IconPrevious to Graphing Linear Equations
Important Math Links IconNext to Graphing Linear Equations
Jaskaran Singh Saluja
About the Author
Jaskaran Singh Saluja is a math wizard with nearly three years of experience as a math teacher. His expertise is in algebra, so he can make algebra classes interesting by turning tricky equations into simple puzzles.
Fun Fact
: He loves to play the quiz with kids through algebra to make kids love it. |
14192 | https://www.youtube.com/watch?v=M_fTdDx8IlY | Computing π: Machin-like formula
Oscar Veliz
12800 subscribers
101 likes
Description
3555 views
Posted: 14 Mar 2020
Machin-like formulae are used to find many decimal places of pi, although why they work can seem confusing. This lesson shows how the Taylor Series of arctangent is used to compute π, and the power of combining it with Machin's approach, as well as covering the history of Gregory, Leibniz, Euler, and Machin. Example code:
Chapters
00:00 - Intro
00:11 - Taylor Series
00:20 - Unit Circle & Solve for π
00:57 - Gregory
01:07 - Gregory-Leibniz Series
01:33 - Leibniz
02:27 - arctan(1)
02:48 - Moving a
03:40 - Increasing n
04:11 - Getting Close
04:44 - Nearer to zero
05:07 - Adding arctangents example
05:28 - Arctangent Trick
05:51 - Euler
06:06 - Euler's Equation for π
06:26 - Deriving Euler's Equation
07:00 - Machin intro
07:15 - Machin-like formula
08:00 - John Machin
08:22 - Demo Code & Story Time
09:40 - 10,000 digits of π
10:08 - Beckmann's thoughts on higher digits
10:27 - Oscar's Notes
11:00 - Thank You
Suggested Viewing:
Origin of Taylor Series -
Newton Fractals -
Reference Links:
"James Gregory Tercentenary memorial volume" -
"A History of Pi" by Petr Beckmann
Leibniz's π paper -
"On the Leibnizian quadrature of the circle" -
"The Discovery of the Series Formula for π by Leibniz, Gregory and Nilakantha" -
"How Euler Did Even More" by C. Edward Sandifer
Euler's π paper E705 -
"John Machin and Robert Simson on Inverse-tangent Series for π"
"Synopsis palmariorum matheseos" by William Jones -
CLISP source code for π -
pi #PiDay #π
12 comments
Transcript:
Intro Happy Pi Day Internet! This is Oscar Veliz
in this video we're gonna focus on how to compute Pi using Machin-like formula
I'll go over the history and explain why these approaches work Taylor Series I'll assume that you have some familiarity
with Taylor Series if you need a refresher check out my video Origin of
Taylor series let's start as all pi videos do with the
unit circle Unit Circle & Solve for π specifically the Radian PI over 4 giving
you the point square root of 2 over 2 for the x and y
this means our cosine of PI over 4 is square root 2 over 2 as is our sine to
find our tangent of that angle we simply take sine over cosine which in this case
would be 1 therefore we take the inverse tangent of both sides known as the
arctangent this means that PI over 4 is equal to the arctangent of 1 multiply
both sides by 4 and we get PI now all we need is a way to compute the arctangent this book should look familiar to those
who saw my Taylor series video here Gregory James Gregory gives us that Taylor
series for the arctangent and for a lot of this video I'm gonna
keep referring to a history pi by Petr Gregory-Leibniz Series Beckmann which is an excellent read
that I highly recommend Beckmann writes: "Gregory discovered the series for the arctanget in 1671 reporting the discover in a letter [the one I showed earlier] without derivation Leibniz found the series for
arctangent and a special case for pi in 1674 and published it in 1682 and the
series for pi is sometimes called the Leibniz series"
I then went looking for that 1682 Leibniz paper and came across these two
references by Horvath and Roy Horvath cites the original paper which I then
tracked down it's written in Latin by Leibniz
looking through it you can see that series for pi Roy writes "the discovery of the
infinite series for pi was Leibniz's first great achievement he communicated
his result to Huygens who congratulated him saying that this
remarkable property of the circle will be celebrated among mathematicians
forever even Isaac Newton praised Leibniz's discovery" in a letter Newton
wrote "Leibniz method for obtaining convergent series is certainly very
elegant and they would have sufficiently revealed the genius of its author even
if he had written nothing else" but what a difference a few years will make Roy
also describes how Nilakantha and Madhava also figured out this arctangent series
here's our ninth order Taylor series for arctan(1) the arctangent let's see how close it is
at one here there is quite a noticeable gap
between our Taylor series at one and the actual PI over four if you were to
multiply this by four that gap would only increase let's talk about a few
strategies we can do to fix this Moving a there are two variables that can change
in a Taylor series one is number of terms n, the other is where we center
our series then in this case let's change our value for a to be 1 here our Taylor series is much more
accurate at one let's zoom in for our function of arctangent centered
around the point one what what our Taylor series actually look like here's
our generic form let's plug 1 everywhere we have a, giving us this form
now let's evaluate that function that one
we can eliminate these terms since one minus one is zero all we're left with is the
function that one giving us pi over four that would mean our Taylor series for
figuring out PI uses PI let's try another approach Increasing n the other variable that we can change is
n here's what happens when we increase n if we take our Taylor series and
evaluate it at one and multiply it by four we're still a ways off from pi in fact
it's gonna take a lot of iterations to get us even close
Beckmann writes: "it is unthinkable that Getting Close Gregory should have overlooked the
obvious case of substituting X equal to one in his series more likely not
consider an important because its convergence a concept also introduced by
Gregory was too slow" Beckman goes on to say "the Gregory-Leibniz series was practically useless for his convergence was so slow that 300
terms were insufficient to obtain even two decimal places De Lany found that to
obtain 100 decimal places the number of necessary terms would be no less than 10^50" not all hope is lost though Nearer to zero recall our point a the further away we
get from a the less accurate our Taylor series will be for example 1/3 is pretty
accurate down to maybe the twelfth decimal place 1/2 is also pretty close
only off in those last three it's only at one where we're very far off hold on
do you notice something strange if you Adding arctangents example take the arctangent of 1/3 and add it to
the arctangent of a 1/2 you get the arctangent of 1 let's try that with our Taylor series indeed adding these terms gives us a number
pretty close to the arctangent of 1 multiplying it by 4 and we get a number
close to PI mind blown Arctangent Trick when we're summing arctangent angles
this equation is true that's because when our sum is between negative PI over
two and PI over two this equation holds as an example let's plug in our
numerators of one and our denominators of three and two this means that our arctangent is equal to 5 over 5 also known as the arctangent of 1 which
is PI over 4 Euler for more context let's turn to how
Euler did even more where the author makes a reference to E705 this paper
where Euler explains how he solved her PI notice the reference to Leibniz Euler's Equation for π they are quite a few arctangent sums in
that paper including 1/2 plus 1/3 giving PI over 4 and then multiplying both
sides by 4 to get pi he also includes a sum for 1/2 and a sum for 1/3 as well as
one for 2/11 giving finally this equation for pi let's dive deeper
starting with the arctangent one you can Deriving Euler's Equation break that up into 1/3 and 1/2
the 1/2 can be broken up into a 1/7 and 1/3 we can break up 1/3 also
into 1/7 and 2/11 you still have that 1/3 on the right side which we can
break up again and we can also break up 2/11 into 1/7 plus 3/79 you
do the same with our other term then if we add up all the leaves we come up with
this summation and combine them to come up with this equation for PI over four
multiply both sides by four and we get this equation for pi Machin intro Beckmann again "using Machin's stratagem in
the form [Euler's equation] and evaluating these two terms Euler calculated PI to
20 decimal places in one hour" but what's a Machin stratagem recall our
arctangent summation we can rewrite it Machin-like formula as well a summation a Machin-like
formula is a summation of arctangents for pi
such as 1/3 plus 1/2 or 2 1/2's minus 1/7 or Euler's formula more formally
we can represent it like this the coefficient C in front is some positive
integer usually four our other values for C are positive or negative integers for
example 20, 8, -1 they're the coefficients in front of our arctangents finally our fraction a over b are some ratio positive integers less
than 1 usually assume that none of these values are 0
the paper John Martin and Robert Simson John Machin on inverse tangent series our PI makes
reference to this paper by William Jones wherein he gives the first hundred
decimal digits for pi "as computed by the accurate and ready pen of the truly
ingenious Mr. John Machin" here's the equation that Machin used Demo Code & Story Time longtime fans of this channel will know
that I provide a lot of code and documentation to accompany each of these
videos I usually don't talk about the development process but in this case it
bears mentioning the first step is to decide on a language in my case I
require that I needed to change the precision very easily and that it had to
have support for rational data types as well as being pretty speedy compiled
preferably I ended up settling on CLISP which has its own built in PI constant
and my arctangent function ended about being 8 lines of code long then using
333 bits for the mantissa I was able to gain about 100 decimal digits of pi it
required about 75 terms per arctangent and in order to match the built in pi
this took about 0.063 seconds I then raised the mantissa which
required raising the number of terms in order to get this to match actual pi I
noticed was that the built-in Pi still matched the actual pi I raise the mantissa and the same thing happen again it turns out that after looking at the
source code for CLISP their pi constant isn't actually constant here's an
example of me running my program for ten thousand digits of pi 10,000 digits of π this took a little over three minutes to
run on my old hardware and if you're curious the 10,000 digit of pi is eight
when I compared it to the built in PI that took only over two seconds to run
using the Brent-Salamin formula but that's a topic for another video here's one final parting quote from
Beckmann "the digits beyond the first few Beckmann's thoughts on higher digits decimal places are of no practical or
scientific value four decimal places are sufficient for the design of the finest
engines ten decimal places would be sufficient to obtain the circumference
of the earth within a fraction of an inch [assuming the earth was a perfect
sphere]" Oscar's Notes before you click away I do recommend
that you read "A history of Pi" by Petr Beckmann and recall that pi can be
computed using 4arctan(1) with Taylor series that you'll
have a better precision when you get closer to zero and when you have a
larger value for n the Machin-like formula is also used to sum those arctangents and there are many other pi finding methods out there this is just
one of the more commonly used ones and it works quite well example code that I
used will be hosted on github thank you for watching this special Pi
Day themed video I don't think I'm gonna Thank You make this an annual thing but if there
are other PI finding methods that you would like for me to cover definitely
let me know and again thank you for watching |
14193 | https://www.reddit.com/r/calculus/comments/qghoxh/compilation_of_common_calculus_mistakes/ | Compilation of Common Calculus Mistakes : r/calculus
Skip to main contentCompilation of Common Calculus Mistakes : r/calculus
Open menu Open navigationGo to Reddit Home
r/calculus A chip A close button
Log InLog in to Reddit
Expand user menu Open settings menu
Go to calculus
r/calculus
r/calculus
Welcome to r/calculus - a space for learning calculus and related disciplines. Remember to read the rules before posting and flair your posts appropriately.
165K Members Online
•4 yr. ago
VTutorLive
Compilation of Common Calculus Mistakes
Differential Calculus
So one of my students recently made the classic mistake of plugging in a value of x before taking the derivative. For example:
f(x) = x 3
f(1) = 1
f'(1) = 0
I remember making some mistake like this when I was taking Calc for the first time, so I knew where they were coming from. But it provoked me to think about other common mistakes that first time students tend to make, and I'm now trying to brainstorm a compilation of issues for my students. I'm not an experienced teacher, just a hobbyist, so I'm trying to draw from my own memory plus any suggestions. Here's what I've come up with so far:
Forgetting product rule/chain rule - this can sometimes be indicative of a larger conceptual mistake but including it here because it just happens so often
Chain rule for trig power functions in particular - e.g. d/dx cos 2 x , I think there's just some natural mental friction against seeing a sin multiplied by a cos, or a subconscious expectation of the derivative looking like sin 2 x
Division rule for derivatives - this is personal preference rather than an actual mistake but I find it easier to use product rule with a negative exponent than the division rule in almost every circumstance, to the point where I consider the division rule a pointless risk for making an error.
Forgetting the dy/dx in implicit differentiation - Really another version of chain rule, but happens frequently enough.
Not simplifying before taking a derivative - I remember this happening often when trying to calculate 2nd/3rd/higher order derivatives. You'd have x's cancelling with 1/x, and you would definitely want to simplify as much as possible at each step so you aren't overusing the product rule. Again not technically a mistake, but it's good practice to avoid computational errors.
Plugging in h=0 in limits that would result in an undefined fraction - too often, students jump the gun and assume this means that the limit does not exist rather than trying to find workarounds to resolve the limit
Integrating 1/x to x 0 instead of ln(x)
Forgetting the integration constant C
Attempting to "evaluate" v during uv integration by parts for definite integrals
Displacement vs distance travelled
I'd be interested in other suggestions - I barely remember what it's like to learn this for the first time. This is more focused on Calc 1 than 2 for now, but suggestions from either are welcome.
Read more
Share
New to Reddit?
Create your account and connect with a world of communities.
Continue with Email
Continue With Phone Number
By continuing, you agree to ourUser Agreementand acknowledge that you understand thePrivacy Policy.
Public
Anyone can view, post, and comment to this community
Top Posts
Reddit reReddit: Top posts of October 26, 2021
Reddit reReddit: Top posts of October 2021
Reddit reReddit: Top posts of 2021
Reddit RulesPrivacy PolicyUser AgreementAccessibilityReddit, Inc. © 2025. All rights reserved.
Expand Navigation Collapse Navigation
TOPICS
Internet Culture (Viral)
Amazing
Animals & Pets
Cringe & Facepalm
Funny
Interesting
Memes
Oddly Satisfying
Reddit Meta
Wholesome & Heartwarming
Games
Action Games
Adventure Games
Esports
Gaming Consoles & Gear
Gaming News & Discussion
Mobile Games
Other Games
Role-Playing Games
Simulation Games
Sports & Racing Games
Strategy Games
Tabletop Games
Q&As
Q&As
Stories & Confessions
Technology
3D Printing
Artificial Intelligence & Machine Learning
Computers & Hardware
Consumer Electronics
DIY Electronics
Programming
Software & Apps
Streaming Services
Tech News & Discussion
Virtual & Augmented Reality
Pop Culture
Celebrities
Creators & Influencers
Generations & Nostalgia
Podcasts
Streamers
Tarot & Astrology
Movies & TV
Action Movies & Series
Animated Movies & Series
Comedy Movies & Series
Crime, Mystery, & Thriller Movies & Series
Documentary Movies & Series
Drama Movies & Series
Fantasy Movies & Series
Horror Movies & Series
Movie News & Discussion
Reality TV
Romance Movies & Series
Sci-Fi Movies & Series
Superhero Movies & Series
TV News & Discussion
RESOURCES
About Reddit
Advertise
Reddit Pro BETA
Help
Blog
Careers
Press
Communities
Best of Reddit
Top Translated Posts
Topics |
14194 | https://www.youtube.com/watch?v=sEphJavmZG8 | Maximize This Tricky Algebraic Expression Using AM-GM! | Math Olympiad Challenge
Chan Lye Lee
5330 subscribers
18 likes
Description
207 views
Posted: 7 Jul 2025
In this video, we explore a beautiful inequality problem involving the expression
$$
(6xy - y^4 - 2z^2)(6yz - z^4 - 2x)(6zx - x^4 - 2y^2)
$$
for positive real numbers $x, y, z$.
By using symmetry and the AM-GM inequality, we derive the maximum value of this expression step-by-step, with clear explanation and justification.
This is a great example of how clever algebraic manipulation and inequality techniques come together in Olympiad-style mathematics.
✅ Suitable for math Olympiad training, advanced high school students, and anyone who loves problem-solving!
Don’t forget to like, comment, and subscribe for more problem-solving videos.
8 comments
Transcript:
Let x, y, and zed be positive real numbers. We are asked to find the maximum value of the expression 6 xy - y ^ of 4 - 2 z ^ 2 6 y z - z the^ of 4 - 2x 6 e x - x ^ 4 - 2 y^ 2 We let capital j be this entire product. Suppose x = y = z. Then the expression becomes j = 6x^2 - x ^ 4 - 2x^2 all cubed. This simplifies to 4x^2 - x ^ 4 all cubed. Now factor as 4 - x^2 - 2 raised to the^ of 3. This is maximized when x^2 = 2. Therefore j is less than or equal to 4 cubed which is 4 cubed 64. But does this give the actual maximum value of J? [Music] Let's confirm by bounding each factor. Let's consider the first term 6xy - y to the power of 4 - 2 z^ 2. What is the upper bound? We want to show that 6 xy - y to the^ of 4 - 2 z ^ 2 is less than or equal to 4 x cubed / y z ^ 2. Rewriting this is equivalent to y ^ 4 + 2 z^ 2 + 4 x cub / y z ^ 2 is greater than or equal to 6xy. Now apply the amg inequality to the three terms. y ^ 4 2 z ^ 2 and 4x cub / y z ^ 2 by amg the sum is greater than or equal to 3 the cube roo of y to the^ 4 2 z ^ 2 4x cubed over y z ^ 2. This simplifies to 3 the cube roo of 8 x cub y cubed which equ= 6 x y. Therefore the inequality is valid and we conclude 6 xy - y ^ of 4 - 2 z ^ 2 is less than or equal to 4x cubed / y z ^ 2. We now apply similar bounds to the other two factors. The second factor 6 y zus z to the power of 4 - 2x is less than or equal to 4 y cubed / zx^2. The third factor 6 zx - x ^ 4 - 2 y^ 2 is less than or equal to 4 zub / x y^2. So j is less than or equal to the product of 4x cubed over y z^2 4 y cubed over zx^2 and 4 z cub x y^2 multiply all three together numerator 4 4 4 is 64 xub yub zub denominator y z ^ 2 zx^2 x y^2 which is xub y z cubed so the product becomes 64 xub yub zcub over x cub y z cubed which is simply 64. Therefore j is less than or equal to 64. Now equality holds in the amg inequality if and only if all three terms are equal. That is y ^ 4 = 2 z ^2 = 4 x cubed / y z ^ 2 and so on. Solving this system gives x = y = z = 2. Substituting into the original expression confirms j= 64. Thanks for watching. If you enjoyed this problem and learned something new, don't forget to like, comment, and subscribe. See you in the next video. [Music] |
14195 | https://www.expii.com/t/symmetry-of-an-object-1059 | Expii
Symmetry of an Object - Expii
Reflectional symmetry means that an object will look exactly the same if it's reflected across a line of symmetry. Rotational symmetry means that an object will look exactly the same if it's rotated the right amount.
Explanations (2)
Daniel Liu
Text
11
Symmetry is the property of self-similarness of a geometric object (it can also be thought of as a rigid motion that maps a geometric object to itself). For example, let us look at the square:
Notice that if we flip the square along any of the marked axis, then it will retain the same shape. Therefore, the lines are called the axes of symmetry. These lines show the symmetry that this square has; specifically, it is its reflectional symmetry.
90∘
180∘
270∘
360∘
In addition, we can rotate the square along its center 90∘, 180∘, 270∘, or 360∘ with it still looking the same. This is another type of symmetry, known as rotational symmetry.
Symmetry can be found in other shapes too. Take the above regular pentagon for example. The colored lines are the Reflectional Axes of Symmetry for the pentagon.
However, some shapes do not have any axes of symmetry. Take a scalene triangle (No equal sides) for example:
There are no axes of symmetry for this triangle. Therefore, this shape is called Asymmetric.
Report
Share
11
Like
Related Lessons
Properties of Congruent Triangles
Altitudes and Perpendiculars
Congruence Is Reflexive, Symmetric, and Transitive
Midpoints and Segment Bisectors
View All Related Lessons
Christine
Text
2
Examples: Reflection and Rotation Symmetry
We talk about symmetry quite often in everyday life. Its mathematical difference is not that different. Here, we make a distinction between reflection and rotation symmetry.
Reflection Symmetry
Reflection symmetry is closest to the meaning of symmetry when we talk about it in everyday life.
We see symmetry everywhere:
a glass
Inside of the church
The mathematical definition of reflection symmetry is that the image is identical across a line of symmetry.
There is also a lot of symmetry in art! Kerry James Marshall is an American painter who explores race and being black in America. A couple of his work makes use of a line of symmetry.
Rotation Symmetry
Instead of a line of symmetry, rotation symmetry is when the image is identical through rotation by a partial turn. For example:
Some shapes or objects are symmetrical in both ways. For example, a slice of lemon.
Now, try the question below!
shape 1
shape 2
Report
Share
2
Like
You've reached the end
How can we improve?
General
Bug
Feature
Send Feedback |
14196 | https://artofproblemsolving.com/wiki/index.php/Inequality?srsltid=AfmBOoq24oCggeBTq0F0DCQJeQHPS6GAlskit1Hr6GdudrRwLmrzfl94 | Art of Problem Solving
Inequality - AoPS Wiki
Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical CampusVisit the Virtual Campus
Sign In
Register
online school
Class ScheduleRecommendationsOlympiad CoursesFree Sessions
books tore
AoPS CurriculumBeast AcademyOnline BooksRecommendationsOther Books & GearAll ProductsGift Certificates
community
ForumsContestsSearchHelp
resources
math training & toolsAlcumusVideosFor the Win!MATHCOUNTS TrainerAoPS Practice ContestsAoPS WikiLaTeX TeXeRMIT PRIMES/CrowdMathKeep LearningAll Ten
contests on aopsPractice Math ContestsUSABO
newsAoPS BlogWebinars
view all 0
Sign In
Register
AoPS Wiki
ResourcesAops Wiki Inequality
Page
ArticleDiscussionView sourceHistory
Toolbox
Recent changesRandom pageHelpWhat links hereSpecial pages
Search
Inequality
The subject of mathematical inequalities is tied closely with optimization methods. While most of the subject of inequalities is often left out of the ordinary educational track, they are common in mathematics Olympiads.
Contents
[hide]
1 Overview
2 Solving Inequalities
2.1 Linear Inequalities
2.2 Polynomial Inequalities
2.3 Rational Inequalities
3 Complete Inequalities
4 List of Theorems
4.1 Introductory
4.2 Advanced
5 Problems
5.1 Introductory
5.2 Intermediate
5.3 Olympiad
6 Resources
6.1 Books
6.1.1 Intermediate
6.1.2 Olympiad
6.2 Articles
6.2.1 Olympiad
6.3 Classes
6.3.1 Olympiad
7 See also
Overview
Inequalities are arguably a branch of elementary algebra, and relate slightly to number theory. They deal with relations of variables denoted by four signs: .
For two numbers and :
if is greater than , that is, is positive.
if is smaller than , that is, is negative.
if is greater than or equal to , that is, is nonnegative.
if is less than or equal to , that is, is nonpositive.
Note that if and only if , , and vice versa. The same applies to the latter two signs: if and only if , , and vice versa.
Some properties of inequalities are:
If , then , where .
If , then , where .
If , then , where .
Solving Inequalities
In general, when solving inequalities, same quantities can be added or subtracted without changing the inequality sign, much like equations. However, when multiplying, dividing, or square rooting, we have to watch the sign. In particular, notice that although , we must have . In particular, when multiplying or dividing by negative quantities, we have to flip the sign. Complications can arise when the value multiplied can have varying signs depending on the variable.
We also have to be careful about the boundaries of the solutions. In the example , the value does not satisfy the inequality because the inequality is strict. However, in the example , the value satisfies the inequality because the inequality is nonstrict.
Solutions can be written in interval notation. Closed bounds use square brackets, while open bounds (and bounds at infinity) use parentheses. For instance, ![Image 49: $x \in 3,6)$ means .
Linear Inequalities
Linear inequalities can be solved much like linear equations to get implicit restrictions upon a variable. However, when multiplying/dividing both sides by negative numbers, we have to flip the sign.
Polynomial Inequalities
The first part of solving polynomial inequalities is much like solving polynomial equations -- bringing all the terms to one side and finding the roots.
Afterward, we have to consider bounds. We're comparing the sign of the polynomial with different inputs, so we could imagine a rough graph of the polynomial and how it passes through zeroes (since passing through zeroes could change the sign). Then we can find the appropriate bounds of the inequality.
Rational Inequalities
A more complex example is .
Here is a common mistake: The problem here is that we multiplied by as one of the last steps. We also kept the inequality sign in the same direction. However, we don't know if the quantity is negative or not; we can't assume that it is positive for all real . Thus, we may have to reverse the direction of the inequality sign if we are multiplying by a negative number. But, we don't know if the quantity is negative either.
A correct solution would be to move everything to the left side of the inequality, and form a common denominator. Then, it will be simple to find the solutions to the inequality by considering the sign (negativeness or positiveness) of the fraction as varies. We will start with an intuitive solution, and then a rule can be built for solving general fractional inequalities. To make things easier, we test positive integers. makes a good starting point, but does not solve the inequality. Nor does . Therefore, these two aren't solutions. Then we begin to test numbers such as , , and so on. All of these work. In fact, it's not difficult to see that the fraction will remain positive as gets larger and larger. But just where does , which causes a negative fraction at and , begin to cause a positive fraction? We can't just assume that is the switching point; this solution is not simply limited to integers. The numerator and denominator are big hints. Specifically, we examine that when (the numerator), then the fraction is , and begins to be positive for all higher values of . Solving the equation reveals that is the turning point. After more of this type of work, we realize that brings about division by , so it certainly isn't a solution. However, it also tells us that any value of that is less than brings about a fraction that has a negative numerator and denominator, resulting in a positive fraction and thus satisfying the inequality. No value between and (except itself) seems to be a solution. Therefore, we conclude that the solutions are the intervals ![Image 78: $(-\infty,-5)\cup\frac{3}{2},+\infty)$.
For the sake of better notation, define the "x-intercept" of a fractional inequality to be those values of that cause the numerator and/or the denominator to be .To develop a method for quicker solutions of fractional inequalities, we can simply consider the "x-intercepts" of the numerator and denominator. We graph them on the number line. Then, in every region of the number line, we test one point to see if the whole region is part of the solution. For example, in the example problem above, we see that we only had to test one value such as in the region , as well as one value in the region ![Image 83: $(-\infty,-5]$]( and ![Image 84: $\frac{3}{2},+\infty)$; then we see which regions are part of the solution set. This does indeed give the complete solution set.
One must be careful about the boundaries of the solutions. In the example problem, the value was a solution only because the inequality was nonstrict. Also, the value was not a solution because it would bring about division by . Similarly, any "x-intercept" of the numerator is a solution if and only if the inequality is nonstrict, and every "x-intercept" of the denominator is never a solution because we cannot divide by .
Complete Inequalities
A inequality that is true for all real numbers or for all positive numbers (or even for all complex numbers) is sometimes called a complete inequality. An example for real numbers is the so-called Trivial Inequality, which states that for any real , . Most inequalities of this type are only for positive numbers, and this type of inequality often has extremely clever problems and applications.
List of Theorems
Here are some of the more useful inequality theorems, as well as general inequality topics.
Introductory
Arithmetic Mean-Geometric Mean Inequality
Cauchy-Schwarz Inequality
Titu's Lemma
Chebyshev's Inequality
Geometric inequalities
Jensen's Inequality
Nesbitt's Inequality
Rearrangement Inequality
Power mean inequality
Triangle Inequality
Trivial inequality
Schur's Inequality
Advanced
Aczel's Inequality
Callebaut's Inequality
Carleman's Inequality
Hölder's inequality
Radon's Inequality
Homogenization
Isoperimetric inequalities
Maclaurin's Inequality
Muirhead's Inequality
Minkowski Inequality
Newton's Inequality
Ptolemy's Inequality
Can someone fix that Ptolemy's is in Advanced?
Problems
Introductory
Practice Problems on Alcumus
Inequalities (Prealgebra)
Solving Linear Inequalities (Algebra)
Quadratic Inequalities (Algebra)
Basic Rational Function Equations and Inequalities (Intermediate Algebra)
A tennis player computes her win ratio by dividing the number of matches she has won by the total number of matches she has played. At the start of a weekend, her win ratio is exactly . During the weekend, she plays four matches, winning three and losing one. At the end of the weekend, her win ratio is greater than . What's the largest number of matches she could've won before the weekend began? (1992 AIME Problems/Problem 3)
Intermediate
Practice Problems on Alcumus
Quadratic Inequalities (Algebra)
Advanced Rational Function Equations and Inequalities (Intermediate Algebra)
General Inequality Skills (Intermediate Algebra)
Advanced Inequalities (Intermediate Algebra)
Given that , and show that . (weblog_entry.php?t=172070 Source)
Olympiad
See also Category:Olympiad Inequality Problems
Let be positive real numbers. Prove that (2001 IMO Problems/Problem 2)
Resources
Books
Intermediate
Introduction to Inequalities
Geometric Inequalities
Olympiad
Advanced Olympiad Inequalities: Algebraic & Geometric Olympiad Inequalities by Alijadallah Belabess.
The Cauchy-Schwarz Master Class: An Introduction to the Art of Mathematical Inequalities by J. Michael Steele.
Problem Solving Strategies by Arthur Engel contains significant material on inequalities.
Inequalities by G. H. Hardy, J. E. Littlewood, G. Pólya.
Articles
Olympiad
Inequalities by MIT Professor Kiran Kedlaya.
Inequalities by IMO gold medalist Thomas Mildorf.
Classes
Olympiad
The Worldwide Online Olympiad Training Program is designed to help students learn to tackle mathematical Olympiad problems in topics such as inequalities.
See also
Mathematics competitions
Math books
Retrieved from "
Categories:
Algebra
Inequalities
Art of Problem Solving is an
ACS WASC Accredited School
aops programs
AoPS Online
Beast Academy
AoPS Academy
About
About AoPS
Our Team
Our History
Jobs
AoPS Blog
Site Info
Terms
Privacy
Contact Us
follow us
Subscribe for news and updates
© 2025 AoPS Incorporated
© 2025 Art of Problem Solving
About Us•Contact Us•Terms•Privacy
Copyright © 2025 Art of Problem Solving
Something appears to not have loaded correctly.
Click to refresh. |
14197 | https://www.chegg.com/homework-help/questions-and-answers/begin-taylor-series-cos-x-1-x-2-2-x-4-4-x-6-6--mimic-euler-s-work-e-equate-infinite-sum-in-q11781059 | Solved Begin with the Taylor series cos(x) = 1 - x^2/2! + | Chegg.com
Skip to main content
Books
Rent/Buy
Read
Return
Sell
Study
Tasks
Homework help
Understand a topic
Writing & citations
Tools
Expert Q&A
Math Solver
Citations
Plagiarism checker
Grammar checker
Expert proofreading
Career
For educators
Help
Sign in
Paste
Copy
Cut
Options
Upload Image
Math Mode
÷
≤
≥
o
π
∞
∩
∪
√
∫
Math
Math
Geometry
Physics
Greek Alphabet
Math
Other Math
Other Math questions and answers
Begin with the Taylor series cos(x) = 1 - x^2/2! + x^4/4! - x^6/6! +... and mimic Euler's work (i.e., equate this infinite sum with an infinite product) to derive the sum of the reciprocals of the squares of odd integers: 1+ 1/9 + '/25 + 1/49 + 1/81 +... = pi^2/8. 2. Now use this result to get a different way to prove our great theorem: 1 + 1/4 + 1/9 + 1/16
Your solution’s ready to go!
Our expert help has broken down your problem into an easy-to-learn solution you can count on.
See Answer See Answer See Answer done loading
Question: Begin with the Taylor series cos(x) = 1 - x^2/2! + x^4/4! - x^6/6! +... and mimic Euler's work (i.e., equate this infinite sum with an infinite product) to derive the sum of the reciprocals of the squares of odd integers: 1+ 1/9 + '/25 + 1/49 + 1/81 +... = pi^2/8. 2. Now use this result to get a different way to prove our great theorem: 1 + 1/4 + 1/9 + 1/16
I just need help with number 5 please Show transcribed image text
There are 2 steps to solve this one.Solution Share Share Share done loading Copy link Step 1 Certainly, let's work on problem number 5:
To show that
2 View the full answer Step 2 UnlockAnswer Unlock Previous questionNext question
Transcribed image text:
Begin with the Taylor series cos(x) = 1 - x^2/2! + x^4/4! - x^6/6! +... and mimic Euler's work (i.e., equate this infinite sum with an infinite product) to derive the sum of the reciprocals of the squares of odd integers: 1+ 1/9 + '/25 + 1/49 + 1/81 +... = pi^2/8. 2. Now use this result to get a different way to prove our great theorem: 1 + 1/4 + 1/9 + 1/16 + 1/25 +... = pi^2/6. 3. Use these facts to evaluate 1/4 + 1/16 + 1/36 + 1/64 +... 4. Now evaluate the alternating (plus minus plus minus) series 1 - 1/4 + 1/9 - 1/16 + 1/25 +... 5. Use the product expansion of cos(x) from problem 1 above, and a smart choice for x to show that squareroot2 = 2 middot 2 middot 6 middot 6 middot 10 middot 10 middot 14 middot 14.../1 middot 3 middot 5 middot 7 middot 9 middot 11 middot 13 middot 15...
Not the question you’re looking for?
Post any question and get expert help quickly.
Start learning
Chegg Products & Services
Chegg Study Help
Citation Generator
Grammar Checker
Math Solver
Mobile Apps
Plagiarism Checker
Chegg Perks
Company
Company
About Chegg
Chegg For Good
Advertise with us
Investor Relations
Jobs
Join Our Affiliate Program
Media Center
Chegg Network
Chegg Network
Busuu
Citation Machine
EasyBib
Mathway
Customer Service
Customer Service
Give Us Feedback
Customer Service
Manage Subscription
Educators
Educators
Academic Integrity
Honor Shield
Institute of Digital Learning
© 2003-2025 Chegg Inc. All rights reserved.
Cookie NoticeYour Privacy ChoicesDo Not Sell My Personal InformationGeneral PoliciesPrivacy PolicyHonor CodeIP Rights
Do Not Sell My Personal Information
When you visit our website, we store cookies on your browser to collect information. The information collected might relate to you, your preferences or your device, and is mostly used to make the site work as you expect it to and to provide a more personalized web experience. However, you can choose not to allow certain types of cookies, which may impact your experience of the site and the services we are able to offer. Click on the different category headings to find out more and change our default settings according to your preference. You cannot opt-out of our First Party Strictly Necessary Cookies as they are deployed in order to ensure the proper functioning of our website (such as prompting the cookie banner and remembering your settings, to log into your account, to redirect you when you log out, etc.). For more information about the First and Third Party Cookies used please follow this link.
More information
Allow All
Manage Consent Preferences
Strictly Necessary Cookies
Always Active
These cookies are necessary for the website to function and cannot be switched off in our systems. They are usually only set in response to actions made by you which amount to a request for services, such as setting your privacy preferences, logging in or filling in forms. You can set your browser to block or alert you about these cookies, but some parts of the site will not then work. These cookies do not store any personally identifiable information.
Functional Cookies
[x] Functional Cookies
These cookies enable the website to provide enhanced functionality and personalisation. They may be set by us or by third party providers whose services we have added to our pages. If you do not allow these cookies then some or all of these services may not function properly.
Performance Cookies
[x] Performance Cookies
These cookies allow us to count visits and traffic sources so we can measure and improve the performance of our site. They help us to know which pages are the most and least popular and see how visitors move around the site. All information these cookies collect is aggregated and therefore anonymous. If you do not allow these cookies we will not know when you have visited our site, and will not be able to monitor its performance.
Sale of Personal Data
[x] Sale of Personal Data
Under the California Consumer Privacy Act, you have the right to opt-out of the sale of your personal information to third parties. These cookies collect information for analytics and to personalize your experience with targeted ads. You may exercise your right to opt out of the sale of personal information by using this toggle switch. If you opt out we will not be able to offer you personalised ads and will not hand over your personal information to any third parties. Additionally, you may contact our legal department for further clarification about your rights as a California consumer by using this Exercise My Rights link.
If you have enabled privacy controls on your browser (such as a plugin), we have to take that as a valid request to opt-out. Therefore we would not be able to track your activity through the web. This may affect our ability to personalize ads according to your preferences.
Targeting Cookies
[x] Switch Label label
These cookies may be set through our site by our advertising partners. They may be used by those companies to build a profile of your interests and show you relevant adverts on other sites. They do not store directly personal information, but are based on uniquely identifying your browser and internet device. If you do not allow these cookies, you will experience less targeted advertising.
Cookie List
Clear
[x] checkbox label label
Apply Cancel
Consent Leg.Interest
[x] checkbox label label
[x] checkbox label label
[x] checkbox label label
Reject All Confirm My Choices |
14198 | https://mathgptpro.com/article/en/the-most-accurate-determinant-calculator | Ultimate Guide - The Most Accurate Determinant Calculator of 2025
HomeProductCareerContact
Try Now
HomeProductCareerContactTry Now
The Most Accurate Determinant Calculator of 2025
Guest Blog by
Andrew C.
Our definitive guide to the most accurate determinant calculators of 2025. We’ve analyzed top tools based on criteria similar to how experts assess other complex models, from risk calculators in medicine to risk matrices in safety assessments. We evaluated precision, symbolic vs. numeric capabilities, and robustness to identify the leading tools for students, engineers, and scientists seeking the highest level of accuracy for their matrix calculations.
What Makes a Determinant Calculator 'Accurate'?
When discussing the 'most accurate' determinant calculator, it's important to understand that for standard matrices, any correctly implemented algorithm will yield the mathematically correct determinant. The 'accuracy' often refers more to: 1. Precision: How floating-point numbers are handled, especially for very large matrices where tiny errors can accumulate. 2. Symbolic vs. Numeric: Whether it can provide an exact symbolic answer (e.g., in terms of variables) or only a numerical approximation. 3. Robustness: How well it handles edge cases, ill-conditioned matrices, or very large dimensions. The top tools are those that are widely trusted, highly optimized, and offer a range of capabilities beyond just determinants.
Mathos AI
Mathos AI (aka MathGPTPro) is an AI-powered math solver and one of the most accurate determinant calculators, designed to help users solve complex matrix problems with high precision.
Rating:4.9
Santa Clara, California, USA
Learn More
Mathos AI (2025): The Most Accurate AI Determinant Calculator
In recent tests, Mathos AI outperforms leading frontier models, delivering up to 17% higher accuracy. Whether you're solving questions related to algebra, calculus, or complex equations involving determinants, Mathos is the top choice for both students and teachers seeking precision and step-by-step understanding.
Pros
Delivers up to 17% higher accuracy than other leading models
Provides personalized, step-by-step guidance for complex calculations
Handles a wide range of math topics including algebra and calculus
Cons
A newer brand still building equity against established academic software
Primarily focused on math, physics, and chemistry, not a general computation engine
Who They're For
Students and educators needing high-accuracy solutions with explanations
Users looking for an intuitive, AI-driven tool for matrix algebra
Why We Love Them
Leverages advanced AI to combine top-tier accuracy with educational support
Wolfram Alpha
Wolfram Alpha is an incredibly powerful online tool that leverages the Mathematica engine, renowned for its symbolic capabilities and high-precision arithmetic for determinant calculations.
Rating:4.9
Wolfram Research
Wolfram Alpha
Computational Knowledge Engine
Wolfram Alpha (2025): Leader in Symbolic & High-Precision Calculation
Wolfram Alpha and its underlying engine, Mathematica, are a comprehensive system for technical computing. For determinants, it can handle both numerical and symbolic matrices, providing exact results whenever possible, making it a top choice for academic and research purposes.
Pros
Exceptional accuracy with arbitrary-precision arithmetic
Computes determinants of matrices with variables (symbolic calculation)
Provides step-by-step solutions for learning (Pro version)
Cons
Full capabilities (Mathematica) come with a significant licensing cost
Free version has limitations and requires an internet connection
Who They're For
Academics and researchers needing exact symbolic answers
Users who need quick, reliable online calculations via natural language
Why We Love Them
Its ability to provide exact algebraic expressions for determinants is unparalleled
MATLAB
MATLAB (Matrix Laboratory) is the industry-standard platform for numerical computation, offering highly optimized and reliable determinant calculations for large numerical matrices.
Rating:4.8
MathWorks
MATLAB
Numerical Computing Environment
MATLAB (2025): The Industry Standard for Numerical Computation
Widely used in engineering, science, and finance, MATLAB's core strength is its highly optimized matrix operations. Its det() function is built for speed and accuracy, making it a go-to for professional and academic settings.
Pros
Highly optimized for speed and accuracy with large numerical matrices
Industry standard with robust, well-tested algorithms
Extensive toolboxes for specialized engineering and scientific applications
Cons
Proprietary software with a high licensing cost
Primarily focused on numerical computation, less ideal for symbolic determinants
Who They're For
Engineers, scientists, and finance professionals
Academics working with large numerical datasets
Why We Love Them
Its performance and reliability for large-scale numerical matrix operations are unmatched
NumPy / SciPy
NumPy and SciPy are foundational open-source Python libraries for scientific computing, providing a powerful and free solution for accurate determinant calculations.
Rating:4.7
Open-Source Community
NumPy / SciPy
Open-Source Python Libraries
NumPy / SciPy (2025): The Best Open-Source Solution
The numpy.linalg.det() function is the go-to for determinant calculations in Python. Backed by a massive community, these libraries offer performance comparable to commercial tools for numerical operations, all within the flexible Python ecosystem.
Pros
Completely free and open-source, making it highly accessible
High-performance numerical operations written in C or Fortran
Integrates seamlessly into the vast Python data science ecosystem
Cons
Requires familiarity with Python programming
Lacks a built-in graphical user interface for direct input
Who They're For
Data scientists, developers, and researchers using Python
Users who need a flexible, programmable, and free solution
Why We Love Them
It democratizes high-performance scientific computing for everyone
Maple
Maple is a leading commercial software for symbolic and numeric computation, excelling at deriving exact determinant expressions for matrices with variables.
Rating:4.7
Maplesoft
Maple
Symbolic and Numeric Software
Maple (2025): Powerful Symbolic Computation with an Intuitive Interface
Similar in scope to Mathematica, Maple is a top choice for its strong symbolic manipulation capabilities. It provides robust numerical tools and is often praised for its user-friendly, document-centric interface.
Pros
Excellent at computing exact, symbolic determinants
Offers detailed step-by-step solutions for educational purposes
Intuitive user interface for creating and presenting mathematical work
Cons
Commercial software with a significant licensing cost
Less common in some pure numerical engineering fields compared to MATLAB
Who They're For
Students and educators who value step-by-step explanations
Mathematicians and researchers focused on symbolic derivation
Why We Love Them
It combines powerful symbolic computation with a user-friendly, educational approach
Determinant Calculator Comparison
| Number | Agency | Location | Services | Target Audience | Pros |
--- --- |
| 1 | Mathos AI | Santa Clara, California, USA | AI-powered determinant calculator with step-by-step tutoring | Students, Educators | Combines top-tier accuracy with AI-driven educational support |
| 2 | Wolfram Alpha | Wolfram Research | High-precision symbolic and numeric determinant calculation | Academics, Researchers | Unparalleled ability to provide exact algebraic expressions |
| 3 | MATLAB | MathWorks | Industry-standard numerical computation for large matrices | Engineers, Scientists | Unmatched performance for large-scale numerical operations |
| 4 | NumPy / SciPy | Open-Source Community | Free, open-source libraries for scientific computing in Python | Developers, Data Scientists | Democratizes high-performance scientific computing |
| 5 | Maple | Maplesoft | Symbolic computation with a user-friendly, educational interface | Students, Mathematicians | Combines powerful symbolic math with an educational approach |
Frequently Asked Questions
Which determinant calculators made it into our top five picks?
Our top five picks for 2025 are Mathos AI, Wolfram Alpha, MATLAB, NumPy/SciPy, and Maple. Each of these platforms was chosen for its exceptional accuracy, precision, robustness, and ability to serve different user needs—from AI-powered learning to professional-grade symbolic and numerical computation.
What criteria did we use when ranking these determinant calculators?
We evaluated each tool based on the key nuances of 'accuracy': precision in handling floating-point numbers for large matrices, the ability to perform symbolic versus numeric calculations, and robustness in handling ill-conditioned or edge-case matrices. We also considered ease of use, performance, and overall value.
Why did we select these platforms as the best in 2025?
These calculators were chosen because they represent the best in their respective categories. They provide a powerful blend of reliable computation and user-focused features. Whether you need an AI tutor (Mathos AI), exact symbolic answers (Wolfram Alpha, Maple), an industry-standard numerical engine (MATLAB), or a free, flexible programming library (NumPy/SciPy), these tools are trusted for their accuracy and effectiveness.
Which determinant calculator is best for step-by-step solutions?
For learning the process, Mathos AI is a top choice due to its AI-driven, personalized step-by-step explanations. Wolfram Alpha (with a Pro subscription) and Maple are also excellent, as they have built-in features to show the detailed steps of a determinant calculation, such as cofactor expansion or row reduction, which is invaluable for students.
Similar Topics
The Most Accurate 2s Complement CalculatorThe Most Accurate System Of Equations CalculatorThe Best Compound Interest CalculatorThe Best Personal Finance Solver CalculatorThe Most Accurate Binary CalculatorThe Most Accurate Percent ErrorTop 5 Interval Of Convergence CalculatorThe Best Exponent CalculatorThe Most Accurate Slope Intercept Form CalculatorTop 5 Trigonometry CalculatorThe Best Graphing CalculatorThe Most Accurate Determinant CalculatorTop 5 Inverse Laplace CalculatorThe Most Accurate Sig FigsThe Most Accurate Vector CalculatorThe Most Accurate Word Problem SolverTop 5 SolvelyThe Most Accurate Partial Derivative CalculatorThe Most Accurate Tangent Line CalculatorTop 5 Synthetic Division CalculatorTop 5 Substitution CalculatorThe Most Accurate Partial Fraction Decomposition CalculatorThe Most Accurate Fractions CalculatorThe Most Accurate Inequality CalculatorTop 5 Lcd CalculatorTop 5 How To Calculate VelocityTop 5 Inflection Point CalculatorThe Best Loan Payment CalculatorThe Most Accurate Decimal CalculatorThe Most Accurate Radical CalculatorThe Best Statistics SolverThe Most Accurate Eigenvalue CalculatorThe Best Long Division CalculatorTop 5 Point Slope Form CalculatorThe Best Finance Solver And CalculatorThe Best Equation SolverThe Most Accurate Implicit Differentiation CalculatorThe Most Accurate Function CalculatorThe Most Accurate Solve For XThe Most Accurate Statistics CalculatorThe Best Mortgage Calculator SolverThe Best Engineering SolverThe Most Accurate Gcf CalculatorThe Best Simplify CalculatorThe Best Algebra CalculatorThe Best Matrix CalculatorThe Best Limit CalculatorThe Most Accurate Convergence CalculatorThe Best Physics Solver CalculatorTop 5 Chemistry Calculator |
14199 | https://metricunitconversion.globefeed.com/Area_Conversion_Table.asp | AREA CONVERSION TABLE
This is an online area conversion table which provides conversion factors
between various commonly used units of area measurement. It consists of
following common area units: square centimeter (cm2), square meter (m2), hectare (ha), square kilometer (km2), square inch (in2), square feet/foot (ft2), square yard (yd2), square mile (mi2) and acre (ac).
Area Conversion Table of Common Area Units
| | | | | | | | | | |
--- --- --- --- --- |
| | square centimeter (cm2) | square meter (m2) | hectare (ha) | square kilometer (km2) | square inch (in2) | square foot/feet (ft2) | square yard (yd2) | square mile (mi2) | acre (ac) |
| 1 square centimeter (cm2) | 1 | 0.0001 | 0.00000001 | 0.0000000001 | 0.15500031000062 | 0.001076391041671 | 0.00011959900463011 | 0.000000000038610215854781 | 0.000000024710538146717 |
| 1 square meter (m2) | 10000 | 1 | 0.0001 | 0.000001 | 1550.0031000062 | 10.76391041671 | 1.1959900463011 | 0.00000038610215854781 | 0.00024710538146717 |
| 1 hectare (ha) | 100000000 | 10000 | 1 | 0.01 | 15500031.000062 | 107639.1041671 | 11959.900463011 | 0.0038610215854781 | 2.4710538146717 |
| 1 square kilometer (km2) | 10000000000 | 1000000 | 100 | 1 | 1550003100.0062 | 10763910.41671 | 1195990.0463011 | 0.38610215854781 | 247.10538146717 |
| 1 square inch (in2) | 6.4516 | 0.00064516 | 0.000000064516 | 0.00000000064516 | 1 | 0.0069444444444444 | 0.0007716049382716 | 0.00000000024909766860871 | 0.00000015942250790736 |
| 1 square foot/feet (ft2) | 929.0304 | 0.09290304 | 0.000009290304 | 0.00000009290304 | 144 | 1 | 0.11111111111111 | 0.000000035870064279654 | 0.000022956841138659 |
| 1 square yard (yd2) | 8361.2736 | 0.83612736 | 0.000083612736 | 0.00000083612736 | 1296 | 9 | 1 | 0.00000032283057851688 | 0.00020661157024793 |
| 1 square mile (mi2) | 25899881103 | 2589988.1103 | 258.99881103 | 2.5899881103 | 4014489599.9442 | 27878399.999612 | 3097599.9999569 | 1 | 639.9999999911 |
| 1 acre (ac) | 40468564.224 | 4046.8564224 | 0.40468564224 | 0.0040468564224 | 6272640 | 43560 | 4840 | 0.0015625000000217 | 1 |
Using Area Conversion Table
To use this Area Conversion Table, please consider to have a look at the
examples bellow,
Value in the cell of 4 th row and 3 rd column of the area conversion table is
This means 1 hectare = 10000 square meter.
Value in the cell of 10 th row and 7 th column of the area conversion table is
This means 1 acre = 43560 square feet.
Note:
All area conversion factors are not exact and some of them are rounded to limit the number of digits. Also the area
conversion factor for same area unit may vary based on the country, customery and
context of use. |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.