Predicting transistor switching time Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/h989r5400

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • This thesis is a development of two sets of equations predicting the switching times of a saturated transistor. The first set of equations defines the rise, storage, and fall times at a single operating point where the transistor beta, cutoff frequency and collector capacitance are known. The second set of equations is for use with a manufacturers specification sheet describing the transistor parameters and the test conditions of a specified set of switching times. First in this development three common-transistor models for switching conditions are reviewed pointing out their special definitions, approximations and switching equations. Next, the information furnished by manufacturers which is useful in switching circuit design is discussed. In the final section, the two sets of equations are developed using the switching equations of the three transistor-model developments as a base. Also developed to accompany the second set of equations is a set of three graphs from which a constant, determined by the circuit parameters, may be obtained, that multiplied with the specified switching times will yield an approximation to the switching times of the new circuit.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi using Capture Perfect 3.0 on a Canon DR-9050C in PDF format. CVista PdfCompressor 5.0 was used for pdf compression and textual OCR.
Replaces
Additional Information
  • description.provenance : Rejected by Patricia Black(patricia.black@oregonstate.edu), reason: Replace on 2014-06-02T16:07:14Z (GMT)
  • description.provenance : Submitted by Georgeann Booth (gbscannerosu@gmail.com) on 2014-05-31T00:05:45Z No. of bitstreams: 1 RichardsonDennis1964.pdf: 1863503 bytes, checksum: c34006d409ca566e37e1f887c1ffa5b2 (MD5)
  • description.provenance : Approved for entry into archive by Katy Davis(kdscannerosu@gmail.com) on 2014-06-02T16:18:17Z (GMT) No. of bitstreams: 1 RichardsonDennis1964.pdf: 1315269 bytes, checksum: a1cb8db37f3ce3f40c32a52bdee64bb5 (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2014-06-02T15:18:02Z (GMT) No. of bitstreams: 1 RichardsonDennis1964.pdf: 1863503 bytes, checksum: c34006d409ca566e37e1f887c1ffa5b2 (MD5)
  • description.provenance : Made available in DSpace on 2014-06-03T15:51:23Z (GMT). No. of bitstreams: 1 RichardsonDennis1964.pdf: 1315269 bytes, checksum: a1cb8db37f3ce3f40c32a52bdee64bb5 (MD5) Previous issue date: 1963-11-21
  • description.provenance : Submitted by Georgeann Booth (gbscannerosu@gmail.com) on 2014-06-02T16:15:08Z No. of bitstreams: 1 RichardsonDennis1964.pdf: 1315269 bytes, checksum: a1cb8db37f3ce3f40c32a52bdee64bb5 (MD5)
  • description.provenance : Approved for entry into archive by Katy Davis(kdscannerosu@gmail.com) on 2014-06-03T15:51:23Z (GMT) No. of bitstreams: 1 RichardsonDennis1964.pdf: 1315269 bytes, checksum: a1cb8db37f3ce3f40c32a52bdee64bb5 (MD5)

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items