1. Understanding computer arithmetic circuits, performing classical algebraic as well as DSP computations. The CORDIC method, which rejects multiplications from DSP computations, is also introduced.
2. The understanding of the architecture, functioning and programming of ROM/PROM, UV-EPROM, EEPROM and flash-EPROM memories, and their implementation for the design of computer arithmetic circuits.
3. A particular attention has been made for arithmetic circuits performing computations in Finite Fields, including telecommunication coding and cryptography circuits.
Course Content (Syllabus)
● Computer Arithmetic Circuits. Addition, subtraction, multiplication, division, exponentiation, square root computation, in direct and 2's-complement as well as in fixed-point and floating point arithmetic's. The decomposition of large arithmetic units. ● ROM/PROM, UV-, EE-, and flash-EPROM memories. The technologies, architectures and programming. Arithmetic circuits by PROMs. ● Generation of trigonometric functions. The circuits for sin(φ), cos(φ), tg(φ) and their decomposition to interconnected smaller ones. ● Multiplication of algebraic matrices. ● Classical DSP circuits. 1-D and 2-D digital filters and Fourier transform circuits. ● The CORDIC method for DSP circuits, replacing multiplications by shifts and additions. ● Introduction to Finite Fields. and their corresponding adders/subtractors, multi-pliers and dividers. ● Circuits for telecommunication coding and cryptography. (Reed-Solo-mon, BCH, Convolutional, Viterbi, Turbo, DES, AES, RSA, etc.).
Laboratory works: 1-3. Measurements on arithmetic circuits. 4. Programming x-PROM memories and design (by programming) of a PROM binary multiplier. 5-6. Coding and cryptographic circuits.