Doctoral Program
- Overview
- Admission Requirements
- Rules Applicable to all Graduate Students
- Requirements for the Doctoral Degree
- Syllabus for the Written Part of the Ph.D. Qualifying Examination
Overview
The requirements for the Ph.D. and Eng.Sc.D. degrees are identical. Both require a dissertation based on the candidate’s original research, conducted under the supervision of a faculty member. The work may be theoretical or experimental or both. Students who wish to become candidates for the doctoral degree in electrical engineering have the option of applying for admission to the Eng.Sc.D. program or the Ph.D. program. Students who elect the Eng.Sc.D. degree register in the School of Engineering and Applied Science; those who elect the Ph.D. degree register in the Graduate School of Arts and Sciences. Doctoral candidates must obtain a minimum of 60 points of formal course credit beyond the bachelor’s degree. A master’s degree from an accredited institution may be accepted as equivalent to 30 points. A minimum of 30 points beyond the master’s degree must be earned while in residence in the doctoral program.
For application information click here.
back to topAdmission Requirements
1. General Remarks
Admission as a graduate student generally requires a bachelor
of science degree. Most graduate students in the Department
of Electrical Engineering have, as undergraduates, majored in
electrical engineering, physics, or mathematics. Outstanding
students with a bachelor's degree in other fields of science
and engineering may also be admitted as graduate students. Usually,
however, they will be required to remove certain undergraduate
deficiencies without gaining credit toward the advanced degree.
All applicants for the M.S., Ph.D., and Eng.Sc.D. degrees, including
Columbia undergraduates, are required to take the graduate record
examination (GRE) general test. The application deadline is
December 15 for students who wish to be considered for financial
aid. Only completed applications will be considered. All students
must have a satisfactory command of the English language. Students
whose native language is not English are required to submit
results of the Test of English as a Foreign Language (TOEFL)
with their application. Students who score below 550 on the
TOEFL will not be admitted. Students whose native language is
not English must pass the English Language Test given by the
American Language Program (ALP) at Columbia before they graduate.
An arrangement to take the test must be made with the ALP in
505 Lewisohn Hall (tel: 212-854-3584) to make an appointment.
Usually results are available three days following the test. Candidates
for the M.S. degree must reach level 8 and candidates for the
doctoral degree must reach level 10 before they defend their
thesis. Students failing to reach those levels on the placement
examination will usually be required to register for an English
course.
2. Classification of Graduate Students
Students are admitted under the following classifications:
- M.S. Candidate
- M.S. Doctoral-Track Candidate
- Ph.D. Candidate
- Eng.Sc.D. Candidate
- Professional-Degree Candidate
- Matriculated Special Student
- One-Time Special Student
3. M.S. Doctoral-Track Candidates
Exceptionally qualified students may be admitted to M.S.
doctoral-track candidacy directly after receiving the B.S. degree.
These students may gain admission to the doctoral program upon
satisfactory completion of the requirements for the M.S. degree,
although a formal application (without new reference letters) must
be approved by their adviser. The usual practice for potential
doctoral degree candidates is, however, to apply for doctoral
candidacy after completing the requirements for the M.S. degree.
4. Doctoral Degree (Ph.D. and Eng.Sc.D.)
The basic requirement is a master's degree in engineering,
science, or mathematics with a superb record. It is very difficult to
meet all doctoral-degree requirements by evening attendance only.
Rules Applicable to all Graduate Students
1. Academic Regulations and Requirements
- 1-4 points. No minimum requirement on average
- 5 points 1.00
- 6 points 1.25
- 7 points 1.50
- 8 points 1.75
- 9 points + 2.00
- Students must enroll for R credit at the time of registration. They cannot change to R credit at a later time without special permission from the dean, which is not easily granted.
- A course which has been taken for R credit may not be repeated for examination credit.
- The privilege of auditing courses is granted to two kinds of regular degree candidates: Those who in any term are registered for 15 points or more or those who have completed their course requirements for the doctorate and are registered for full-time research.
- Application is made at the registrar's office during the change of program period (Monday through Friday following registration).
Requirements for the Doctoral Degree
- Beginning with the semester immediately following the one in which the minimum point requirements of Part 1 are completed, the candidate must register continuously for EE E9800 (3, 6, 9, or 12 points) until 12 points have been accumulated.
- Registration for EE E9800 at times other than as prescribed in (a) is not allowed except by written permission of the dean.
- No part of the credit for EE E9800 may be counted toward the minimum requirements stated in Part 1. These credits are in addition to the required 30 credits of course and research work.
- Continuous registration is required to maintain enrollment in any degree program. Continuous registration refers to the autumn and spring semesters, but not the summer session. Failure to register will result in withdrawal from the program. If a student completes the 9800 requirement and has not yet completed the thesis requirements he or she may opt to take ELEN E9900 for 0 points until the dissertation is complete. ELEN E9800 and E9900 courses are for DES students only. Ph.D. students should not register for these courses at any time.
- Courses used to satisfy the 30-point minimum beyond the M.S. degree will usually be at the 6000 level or higher.
- Not more than 6 points of seminar.
- At
most 12 points of doctoral research (ELEN E9001, E9002, E9011, E9012,
E6001, and E6002) may be credited toward the degree. However, in
exceptional cases, in recognition of a student's advanced standing and
professional proficiency, this 12-point limitation may be waived at the
discretion of the chair of the doctoral committee.
- Breadth of knowledge
- Understanding of fundamentals
- Ability to do research
The exam is based only on topics typically covered in undergraduate classes, but the types of questions asked in it assume graduate level maturity in terms of thinking ability and initiative. The examination consists of 18 problems, three from each of the following six areas:
- Circuits and Electronics
- Signals, Systems, and Communications
- Solid-State Devices and Electromagnetics
- Digital Computing Systems
- Networking
- Systems Biology
No calculators will be allowed into the written examination.
Students who want to take the qualifying exam must file the required form by November 30. If they already have identified an adviser who is tentatively willing to supervise their research, they should indicate his/her name on the form. However, having a research adviser is not a requirement for taking the D.Q.E.; in many instances a research adviser will be identified after a student has passed the examination.
- A minimum of 30 points beyond the M.S. must have been taken
- Six residence units (R.U.s) must have been completed; two of these are awarded for the M.S. degree and four are accumulated while the student is a Ph.D. degree candidate
- The research proposal examination must have been passed
- If the student did not get his/her machelor degree in a country where English is the native language he/she must take the American Language Examination and reach Level 10.
- The research must be unclassified.
- The dissertation must represent the student's own efforts.
- The employer must have full cognizance that the student is using company facilities and possibly company time to carry out doctoral research.
- The employer must have no objections to the publication of results.
- Supervisory committee members must be free to visit the location where the research is being conducted whenever they wish to do so.
- The student must be prepared to consult with his/her thesis adviser on the campus as often as two half-days per week, if the adviser so requires.
- At the time the research program is submitted for approval, the student must obtain a letter from a responsive member of his/her firm, addressed to the chair of the doctoral committee, stating that the company will abide by the conditions set forth in this section.
Syllabus for the Written Part of the Ph.D. Qualifying Examination
- Resistors, capacitors, inductors, ideal transformers, independent sources, dependent sources and operational amplifiers
- Charge, current, voltage, and power
- Kirchhoff's voltage and current laws
- Node and mesh analysis
- Analysis of RL, RC and RLC circuits (up to second order) using differential equations
- Natural and forced response
- Linearity and superposition; Thevenin and Norton equivalents
- Phasor analysis
- Transfer functions, the complex plane, poles and zeros
- Frequency response and Bode plots
- Resonant circuits
- Diodes and diode circuits
- MOS and bipolar transistor characteristics
- Basic logic gate circuits (CMOS, TTL, ECL)
- Noise margins, logic delay, rise and fall times, fanin and fanout
- Circuits for latches and flip-flops
- Transient response of logic gate circuits
- Small-signal equivalent circuits for diodes and transistors
- Single-transistor amplifiers and differential pairs, and their dc bias analysis, large-signal analysis, small-signal analysis and frequency response
-
Circuits using operational amplifiers
- Continuous-time and discrete-time systems
- Linear time-invariant systems
- Convolution
- Fourier series
- Continuous-time Fourier transform
- Discrete-time Fourier transform
- Filters and difference and differential equations
- One-sided and two-sided Laplace transforms (including the handling of initial conditions)
- One-sided and two-sided z-transforms (including the handling of initial conditions)
- Time and frequency characteristics of linear time-invariant systems
- Frequency domain analysis
- Transfer function
- Sampling theorem
- Frequency response, Bode plots
- Filtering, allpass, minimum-phase, linear phase systems
- Linear feedback systems
- Stability
- Gain and phase margin
- State-space analysis of continuous-time and discrete-time systems
- Analysis of basic communication systems
- Amplitude modulation
- Pulse amplitude modulations (PAM), pulse code modulation (PCM)
- Demodulation/detection
- Multiplexing signals: time division multiplexing (TDM), frequency division multiplexing (FDM)
- Elementary probability, sample spaces
- Discrete and continuous random variables
- Distribution functions (Bernoulli, Poisson, geometric, binomial, normal, exponential)
- Conditional probability and Bayes's formula
- Independent events and random variables
- Expectation, conditional expectation
- Covariance, variance, correlation
- Electronic classification of solids: metals, semiconductors, insulators
- Density-of-states, Fermi-Dirac distribution function, quasi-Fermi levels
- Donors and acceptors, electrons and holes, majority and minority carrier
- Drift and diffusion, fundamental transport equations
- Recombination and generation
- P-N junctions: I-V characteristics and small-signal models, breakdown
- Bipolar junction transistors: Basic structure and operation, I-V characteristics and small-signal models
- MOS devices: C-V characteristics of MOS capacitors, accumulation, depletion, inversion, threshold voltage, I-V characteristics, and small-signal models
- Fundamental fabrication processes: photolithography, oxidation, epitaxy, diffusion, ion implantation
- Electric and magnetic fields
- Gauss, Coulomb, Ampere, Biot-Savart laws
- Electromotive force; magnetomotive force
- Current, current density, conservation of charge
- Current element; dipole
- Ohm's law, conductivity, electric power density
- Faraday's law, Maxwell's equations
- Transmission lines; wave propagation
- Standing waves; impedance matching
- Poynting theorem: real, complex
- Plane waves; polarization: linear, circular
-
Snell's laws
- Elementary logic design
- Digital coding, parity, error correction
- Switching functions, truth tables, boolean algebra.
- Logic gates, canonical forms, K-maps and 2-level logic minimization
- Digital building blocks
- Decoders, multiplexers, encoders, logic arrays, read-only memory
- Latches, flip-flops, setup and hold times
- Registers, shift registers, counters, register files, read-write memories
- State machine design
- Synchronous and asynchronous systems, sequential systems
- State transition diagrams, finite-state machines, state minimization
- Computer architecture
- Data paths and control, busses, bit slices, register transfer language
- Microcode, microprogrammed controllers, hardwired controllers
- Instruction set architecture, assembly language, CPU, main memory, cache, I/O, interrupts
- Fundamental data structures and algorithms
- Arrays, linked lists, stacks, hash tables, queues, trees
- Sorting, searching, storage management
- Software engineering and operating systems concepts
-
Basic programming and use of compilers/interpreters; operator precedence, naming,
control structures, nesting and scope, definition of new data structures; subroutines,
iteration, recursion, exception handling; virtual memory, processor scheduling,
process management, interprocess communication, device management, file systems
- Basic probability and combinatorics
- Bernoulli and Poisson processes
- Binomial, geometric, exponential distributions
- Error detecting and correcting codes
- 1D and 2D parity check codes
- CRC check codes
- Hamming codes
- Multiple access resolution protocols
- ALOHA
- Slotted ALOHA / round-based methods
- Carrier sensing MAC protocols
- CDMA
- Routing and spanning tree algorithms
- Minimum spanning tree
- Dijkstra's algorithm
- Bellman-Ford / distance-vector algorithms
- Reliable transfer protocols
- Alternating-bit protocol
- Selective repeat
- Go-back-n
- Finite state methods
- Congestion and flow control
- Fluid models of congestion collapse
- Flow control (application of Little's law)
- AIMD adaptive congestion control
- Queueing and fairness
- FIFO queuing (M/M/k/n queueing systems)
- Round-robin
- Virtual clock
- (Weighted) fair queueing
- Markov model representations of queueing systems
- Max-min fairness
- Network analysis
- Little's law
- Kleinrock's independence approximation
- Biomolecular sequence alignment
- Building of phylogenetic trees
- Gene prediction
- Biomolecular structure prediction
- Analysis of microarray data
- Modeling of biomolecular networks
- Hodgkin-Huxley neuron
- Reduced Hodgkin-Huxley models
- Integrate-and-fire neuron
- Stimulus representation and the neural code
- Algorithms for stimulus recovery
- Synaptic plasticity and learning algorithms
- Computation by excitatory and inhibitory networks
