Mthimkhuluramasimong
On this page, you find all documents, package deals, and flashcards offered by seller mthimkhuluramasimong.
- 34
- 0
- 1
Community
- Followers
- Following
35 items
Counters
Counters are circuits or networks which count pulses. It is important to define a few terms used in describing various circuits or 
networks. A sequential circuit is said to be a Moore machine or Moore network if its output is a direct function of its present 
state only and not of its input.
- Package deal
- Class notes
- • 26 pages •
Counters are circuits or networks which count pulses. It is important to define a few terms used in describing various circuits or 
networks. A sequential circuit is said to be a Moore machine or Moore network if its output is a direct function of its present 
state only and not of its input.
Registers
A register is collection of binary storage cells capable of holding binary information. Since flip-flops are memory elements 
capable of storing binary information, so a group of flip-flops working together constitute a register. To form an n-bit register, n flip-flops are required. Registers comprise of flip-flops and may contain 
combinational circuits.
- Package deal
- Class notes
- • 27 pages •
A register is collection of binary storage cells capable of holding binary information. Since flip-flops are memory elements 
capable of storing binary information, so a group of flip-flops working together constitute a register. To form an n-bit register, n flip-flops are required. Registers comprise of flip-flops and may contain 
combinational circuits.
Real World Design
For more complex combinational problems with a larger number of inputs, one can resort to the use of a minimization algorithm, such as Quine-McCluskey. 
In practice however most designs are implemented using programmable Ics.
- Package deal
- Class notes
- • 9 pages •
For more complex combinational problems with a larger number of inputs, one can resort to the use of a minimization algorithm, such as Quine-McCluskey. 
In practice however most designs are implemented using programmable Ics.
Karnaugh Maps
A prime implicant of a logic function is a normal product term 
that cannot be reduced further, obtained from the circled 1s. 
A minimal sum is a sum of prime implicants.
- Package deal
- Class notes
- • 12 pages •
A prime implicant of a logic function is a normal product term 
that cannot be reduced further, obtained from the circled 1s. 
A minimal sum is a sum of prime implicants.
real world design
Real World Design 
For more complex combinational problems with a larger number of inputs, one can resort to the use of aminimization algorithm, such as Quine-McCluskey.
- Package deal
- Class notes
- • 15 pages •
Real World Design 
For more complex combinational problems with a larger number of inputs, one can resort to the use of aminimization algorithm, such as Quine-McCluskey.
Attenuation Constant
Derivation of Transmission Lines Equations 
 Second-order transmission line Equations 
 General Solutions of Transmission line Equations 
 Propagation Constant 
 Attenuation Constant 
 Phase Constant
- Class notes
- • 9 pages •
Derivation of Transmission Lines Equations 
 Second-order transmission line Equations 
 General Solutions of Transmission line Equations 
 Propagation Constant 
 Attenuation Constant 
 Phase Constant
Second-order transmission line Equations
Derivation of Transmission Lines Equations 
 Second-order transmission line Equations 
 General Solutions of Transmission line Equations 
 Propagation Constant 
 Attenuation Constant 
 Phase Constant
- Class notes
- • 8 pages •
Derivation of Transmission Lines Equations 
 Second-order transmission line Equations 
 General Solutions of Transmission line Equations 
 Propagation Constant 
 Attenuation Constant 
 Phase Constant
Propagation Constant
Derivation of Transmission Lines Equations 
 Second-order transmission line Equations 
 General Solutions of Transmission line Equations 
 Propagation Constant 
 Attenuation Constant 
 Phase Constant
- Class notes
- • 14 pages •
Derivation of Transmission Lines Equations 
 Second-order transmission line Equations 
 General Solutions of Transmission line Equations 
 Propagation Constant 
 Attenuation Constant 
 Phase Constant
transmission line
Derivation of Transmission Lines Equations 
 Second-order transmission line Equations 
 General Solutions of Transmission line Equations 
 Propagation Constant 
 Attenuation Constant 
 Phase Constan
- Class notes
- • 17 pages •
Derivation of Transmission Lines Equations 
 Second-order transmission line Equations 
 General Solutions of Transmission line Equations 
 Propagation Constant 
 Attenuation Constant 
 Phase Constan
Simplifying Binary Representation
Simplifying Binary Representation 
Asthemagnitudeofnumbersincrease,binaryrepresentationbecomescumbersome.Base2isanaturalsystemforbinarymachineslikecomputersbutistediousforhumans. 
Inordertoreadbinarynumberseasilyweusebase8(octalnumbersystem)andbase16(hexadecimal). 
Sincebinary,octalandhexadecimalnumbershavemultiple-of-2bases,conversionfromonenumbersystemtotheotherissimple.Inconversiontooctal,justgroupbinarydigitsinto3sstartingfromthebinarypointtotheleftandtotheright.Thenconverteachgroupintotheco...
- Package deal
- Class notes
- • 22 pages •
Simplifying Binary Representation 
Asthemagnitudeofnumbersincrease,binaryrepresentationbecomescumbersome.Base2isanaturalsystemforbinarymachineslikecomputersbutistediousforhumans. 
Inordertoreadbinarynumberseasilyweusebase8(octalnumbersystem)andbase16(hexadecimal). 
Sincebinary,octalandhexadecimalnumbershavemultiple-of-2bases,conversionfromonenumbersystemtotheotherissimple.Inconversiontooctal,justgroupbinarydigitsinto3sstartingfromthebinarypointtotheleftandtotheright.Thenconverteachgroupintotheco...