This course provides an introduction to the fundamental principles of computer networks and data communications. Emphasis is given on current technologies and architectures for establishing direct link and packet-switched networks, sharing access to a common communication medium, internetworking and routing, end-to-end flow control, congestion control and recourse allocation, and network security.

Enrollment Requirements

Course Texts

Computer Networks, A Systems Approach, 5th edition, Larry L. Peterson and Bruce S. Davie, Morgan Kaufmann, 2011.

References include:

• Data Networks, 2nd ed., D. Bertsekas, and R. Gallager, Prentice Hall, 1992.
• Computer Networks, 5th ed., A.S. Tanenbaum, and D. Wetherall, Prentice Hall, 2011.
• Computer Networking, A Top-down Approach, 5th ed., J. Kurose and K. Ross, Addison Wesley, 2009.

Assessment

There will be approximately eight weekly homework assignments on the topics covered in class. There will also be one midterm exam, three projects and a final exam.

Typical grading policy: 20% homework, 20% midterm, 30% projects, 30% final exam.

The focus of this course is on embedded system design, synthesis, and optimizations, also known as Electronic System Level (ESL) design. The coverage of ESL design will highlight the methods and challenges in developing embedded systems that require the tight integration of hardware and software components. In other words, the course will provide an under the hood look into how embedded systems (e.g. your smartphone, vehicle electronics) work. The course covers many aspects of embedded systems design, from system-level modeling to dynamic runtime optimizations to a brief overview of real-time software systems. The course also includes an in-depth discussion of the simulation and modeling aspects behind SystemC and transaction-level modeling (TLM), providing a detailed look into delta cycle simulation methods (similar to simulations methods used for Verilog and VHDL simulators).

Enrollment Requirements

ECE 274A, ECE 275, and ECE 576A

This course is an introduction to computer-aided logic design. This is a highly active research area, enabling the design of increasingly complex digital systems. In this course we will mainly focus on three areas: specification, synthesis and optimization. We will look at how to specify functionality at a variety of abstractions, use industry-standard tools to simulate these designs, investigate some of the underlying optimization techniques utilized, as well as develop your own tools. Topics include, but are not limited to: 1) Register-Transfer Level, or RTL, Design, 2) Behavioral Synthesis, 3) Optimization and Tradeoffs of Combinational and Sequential Circuits, 4) Exact and Heuristic Minimization of Two-Level Circuits.

Students will be expected to implement a variety of Verilog and C/C++ projects throughout the semester. While specific programming assignments may change with the course offering, projects typically focus on the implementation of optimization and synthesis methods discussed in class, as well as the RTL design. 

Enrollment Requirements

Course Texts

No textbook is required. The class notes and slides are sourced from the following materials:

• Digital Design, Frank Vahid, John Wiley & Sons, ISBN 0470044373
• Verilog for Digital Design, Frank Vahid and Roman Lysecky, John Wiley & Sons, ISBN 9780470052624
• Logic Synthesis and Verification Algorithms, Gary D. Hachtel and Fabio Somenzi, Springer, ISBN 0387310045
• Logic Minimization Algorithms for VLSI Synthesis, Robert K. Brayton, Gary D. Hathtel, C. McMullen, and Alberto L. Sangiovanni-Vincentelli, Kluwer Academic Publishers, ISBN 0898381649
• Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest, McGraw-Hill, 0070131430
• Synthesis and Optimization of Digital Circuits, Giovanni De Micheli, McGraw-Hill, ISBN 0070163332

Schedule

Assessment

• Exam: 4 (lowest score dropped)
• Project: 4 programming projects
• Participation: 12-15 participation activities (1 dropped)
• Typical grading policy: 55% exams, 40% programming assignments, 5% participation/in-class exercises

Parallel models of computation, data flow, reduction, redi-flow, VLIW, superscalar, super-pipelining, multithreaded processors, multiprocessing, distributed computing, massively parallel systems, novel technologies, fundamentals of optical computing, optical architectures and neural networks.

Enrollment Requirements

Current state of the Internet; multimedia requirements; quality of service in IP networks; RSVP; real-time protocol (RTP); differentiated-services (Diffserv) architecture; traffic control; traffic policing and admission control; burstiness and traffic characterization; flow control; TCP enhancements; fairness and protection; packet scheduling and buffer management; inter-domain routing (BGP protocol); intra-domain routing (OSPF protocol); hierarchical routing; web caching; medium access control in wireless LANs; mobile ad hoc networking (routing and MAC protocols, power control, topology control); addressing schemes and MAC design for sensor networks; and others.

Enrollment Requirements

Course Texts

Class notes will be provided in several parts, which can be purchased from the EES Copy Center in Room 137 of the Harvill Building. Occasionally, notes, supplemental material, homework assignments, quizzes, etc., will be sent by email or will be posted on the class website.

Several technical articles from the literature will be assigned throughout the semester. Their titles will be announced in class and posted on the class site. Electronic copies of such articles can often be obtained from the UA Digital Library. Material not available in electronic form can be purchased from the EES Copy Center. Papers will be continually assigned throughout the semester.

Other references include:

• IETF RFCs and IEEE standards.
• Selected chapters from various books (copies can be purchased from the EES Copy Center).

Schedule

Course Links

Summary

The goal of this course is to expose students to recent advances in wired and wireless networks, with focus on the architectural and protocol aspects underlying the design and operation of such networks. These aspects include medium access protocols, routing protocols, quality-of-service provisioning, traffic control, flow control, protocols for wireless LANs, ad hoc networks, sensor networks, etc. In the process of learning network architectures and protocols, students will be exposed to various analytical methods that are used in the design and engineering of next-generation networks. They will also use simulations to evaluate the performance of various design concepts.

Assessment

• Homework (mini-projects): 4-6 assignments
• Exams: 1 midterm exam, 1 final exam
• Quizzes: 4-5
• Class participation
• Typical grading policy: 20% midterms, 25% final exam, 25% homework, 20% quizzes, 10% class participation. 

This course aims to provide a strong foundation for students to understand modern computer system architecture and to apply these insights and principles to future computer designs. It provides basic knowledge, fundamental concepts, design techniques and trade-offs, machine structures, technology factors, software implications, and evaluation methods and tools required for understanding and designing modern computer architectures, including multicores, embedded systems and parallel systems.

The course is structured around the three primary building blocks of general-purpose computing systems: processors, memories, and networks.

The first part of the course focuses on the fundamentals of each building block. Topics include processor microcoding and pipelining; cache microarchitecture and optimization; and network topology, routing, and flow control.

The second part goes into more advanced techniques and will enable students to understand how these three building blocks can be integrated to build a modern computing system. Topics include superscalar execution; branch prediction; out-of-order execution; register renaming and memory disambiguation; VLIW, vector and multithreaded processors; memory protection, translation and virtualization; and memory synchronization, consistency and coherence.

The third part addresses parallel computing, including multicore architectures, datacenters and cloud computing, and others.

Graduate-level students will be required to complete a term paper and extra homework.

Enrollment Requirements

Course Texts

Computer Architecture: A Quantitative Approach, J.L. Hennessy and D.A. Patterson, 5th Edition. Morgan Kaufmann Publishers, 2011.

Other reading material will be either presented in class or made available online.

Schedule

Summary

Intended to provide students with an in-depth study of computer architecture and design. Provides a basic knowledge and ability required for understanding and designing standard and novel computer architectures. Topics include design methodologies at various levels, instruction set design, ALU design, memory organization and design, cache design, virtual memories, interleaved memories, associative memories, control organization and design, hardwired control, micro-programmed control, pipelining, superscalar and super-pipelining, RISC design, vector processing, and others.

Assessment

• Homework: 4-6 homework problem sets
• Exams: 2 in-class exams
• Project: 1 semester-long project completed in 3 phases
• Computer usage: Assembly and C programming exercises

Introduction to diffraction and 2-D Fourier optics, geometrical optics, paraxial systems, third-order aberrations, Gaussian beam propagation, optical resonators, polarization, temporal and spatial coherence, optical materials and nonlinear effects, and electro-optic modulators. Applications to holography, optical data storage, optical processing, neural nets, associative memory and optical interconnects.

May be convened with ECE 459. Graduate-level requirements include different exam questions and grading.

Enrollment Requirements

Course Texts

• Robert Guenther, Modern Optics, 2nd Ed., John Wiley, 2015.
• Joseph W. Goodman, Introduction to Fourier Optics, 4th ed., McGraw Hill, 2018.
• Donald C. O’Shea, Elements of Modern Optical Design, John Wiley, 1985.
• John E. Greivenkamp, "Field Guide to: Geometrical Optics", SPIE Press 2004
• Class notes will also be available on the d2L website.

Schedule

Assessment

• Homework: 8-10 assignments
• Project: 1 project
• Quizzes: 5 quizzes
• Exams: 2 midterm exams, 1 final exam
• Typical grading policy: 40% midterms, 20% final exam, 20% quizzes, 20% project

Properties and applications of optoelectronic devices and systems. Topics include radiation sources, detectors and detector circuits, fiber optics, and electro-optical components. Graduate-level requirements include additional homework and a term project.

May be convened with ECE 456.

Enrollment Requirements

Course Texts

A. Yariv, Optical Electronics in Modern Communications, 5th Ed., Oxford University.

Schedule

Assessment

• Homework: ~8 problem sets
• Exams: 2 in-class exams, 1 final exam