Master Science in Signal Processing , Computational and Applied Mathemathics - (sig-cam)

The proposal is for an interdisciplinary program leading to an M.S. with thesis. The program will consist of 30 credit hours total, with 24 hours of coursework and 6 hours of directed research.

The program should focus on the following:

  1. Developing technically competent graduates capable of developing and implementing the latest signal, image, and multimedia processing components for telecommunications and multimedia products and services.
  2. Developing graduates capable of performing research (i.e. pursuing the Ph.D.) in either engineering or mathematics.

The program should include the following courses:

From ECE, the required courses are:

  • G5213 Digital Signal Processing
    (Slashlisted with 4213)
    Prerequisite: 3793. Discrete-time linear systems, finite duration impulse response digital filters, infinite impulse response digital filters, finite word length effects, spectral analysis, fast Fourier-transforms, two-dimensional signal processing and applications. No student may earn credit for both 4213 and 5213. (F)
  • G5273 Digital Image Processing
    (Crosslisted with Computer Science 5273)
    Prerequisite: 3793 or permission of instructor. This course covers the theory, methods, and applications of image enhancement, image restoration, image compression, image segmentation, image representation and description, and image recognition and interpretation. (F-even years)
  • G5223 Stochastic Signal Processing
    Prerequisite: 4213 or 5213. Stochastic processes, estimation, spectral analysis, optimal filtering and applications. (Sp)

    From MATH, the required courses are:
  • G5383 Applied Modern Algebra
    Prerequisite: 3333. The theory of error correcting codes, including
    Shannon's theorem, Hamming, Golay, BCH and Reed-Solomon codes. Other topics such as Goppa codes, group codes, cryptography, etc, as time permits. No student may earn credit for both 4383 and 5383. (Sp)
  • G5483 Wavelets
    Prerequisite: Engineering Math 3113 and Linear Algebra 3333, or permission of instructor. Fourier analysis on a finite cyclic group, the group of integers, and on the real line. The matching pursuit algorithm. Poisson summation formula, sampling. Multiresolution analysis, construction of (Daubechies, Meyer, ...) wavelets and filter banks. An introduction to the matlab wavelet toolbox.
  • Topics in Combinatorics
    Currently taught under the course G5693 Topics in Geometry and Combinatorics I. Prerequisite: permission of instructor. May be repeated with permission of instructor; maximum credit 12 hours. Topics may include convexity, combinatorial geometry, graph theory, or Riemannian geometry. (F, Sp, Su)

In addition to these required courses, the student will take 6 credit hours (normally two 3 hour courses) from among the available ECE or MATH electives to complete the 24 credit hours of coursework.

Students from mathematics backgrounds may need to additionally take from ECE the following:

  • ECE 3223, Microprocessor systems
  • ECE 3813, Introduction to electronics

Students from engineering backgrounds may need to additionally take from MATH the following:

  • Math G3333, Linear Algebra I
  • MATH 5113, Topics in applied mathematics

In addition, we should have a requirement/elective for “entrepreneurial” studies. This could take several forms. We have thought of a 1 or 2 hour course, a 3-hour pass/fail elective, or an elective for the terminal M.S. or interested Ph.D. student.

 

University of Oklahoma, Engineering Dean's Office © 2005 | Disclaimer