Mumbai University · Final Year Electronics and Telecommunication Engineering · Rev-2019 'C' Scheme
Efficient Architectures for DSP Algorithms
ECCDLO7011 · Department Optional Course 3 · Semester VII · 3 credits · Internal tests 20 (average of two) + end-semester 80
End-semester paper (3 hours): Six questions of 20 marks; Q1 is compulsory and you answer four. Each module's share of the paper follows its lecture hours.
One of the Department Optional Course 3 options.
Module 1: DSP Systems
6 hoursTypical DSP algorithms and their graphical representation; signal flow, data flow and dependence graphs; high-level transformation; the critical path.
Examined in the 80-mark end-semester paper (about 15% of it, by lecture hours); the class tests cover what has been taught by then
- DSP algorithms and their graphical representation
- Signal flow, data flow and dependence graphs
- Critical path and high-level transformations
Module 2: Algorithm to Architecture Mapping
7 hoursN-bit incrementers, decrementers and complementers; pipelining and parallel processing; optimised circuits for common functions.
Examined in the 80-mark end-semester paper (about 18% of it, by lecture hours); the class tests cover what has been taught by then
- Incrementer, decrementer and complementer design
- Pipelining and parallel processing
Module 3: Efficient Adders
7 hoursVariable-block and delay-optimised carry look-ahead adders; carry select, conditional sum and Ling adders; prefix and parallel prefix adders; running-average circuits.
Examined in the 80-mark end-semester paper (about 18% of it, by lecture hours); the class tests cover what has been taught by then
- Carry look-ahead and variable block adders
- Carry select and conditional sum adders
- Prefix and parallel prefix adders
Module 4: Efficient Multipliers
7 hoursArray, signed and unsigned multipliers; Booth and Baugh–Wooley multipliers; squaring circuits; reconfigurable constant multipliers.
Examined in the 80-mark end-semester paper (about 18% of it, by lecture hours); the class tests cover what has been taught by then
- Array multipliers
- Booth and Baugh–Wooley multipliers
- Squaring circuits and constant multipliers
Module 5: DSP Architecture Design
6 hoursIEEE 754 floating-point arithmetic; CORDIC; FFT and FIR filter architectures.
Examined in the 80-mark end-semester paper (about 15% of it, by lecture hours); the class tests cover what has been taught by then
- IEEE 754 floating-point arithmetic
- CORDIC architecture
- FFT and FIR filter architectures
Module 6: Machine Learning Hardware
6 hoursSoftware and co-design optimisations; pruning; systolic-array convolution; RTL for sum of differences; energy-efficient neural network accelerators.
Examined in the 80-mark end-semester paper (about 15% of it, by lecture hours); the class tests cover what has been taught by then
- Hardware for machine learning: pruning and co-design
- Systolic array convolution
- Energy-efficient neural network accelerators
Module contents are summarised from the official Mumbai University syllabus . AiCanCode.org is not affiliated with the University of Mumbai.