Implementation of Digital Signal Processing (191210950)

Instructors

• Sabih Gerez: Lectures.

General Information

• The course is scheduled in the second semester (third quarter). The series of lectures for the academic year 2016-2017 will start on February 6, 2017 at 13:45. The location is HT 700A.
• A Blackboard page for this course exists for the distribution of a small part of the study material. Most of the material for the course can be directly accessed from the current (open) page. The method to access Blackboard is registration via Osiris (students of the University of Twente should know how to register).

Schedule 2016-2017

A yellow background color for the slide release date either means that the version for the current academic year is available (when the date mentions 2017) or that the slides have not been updated for the current academic year. A pink background means that only last year's slides are available for the moment.

Compulsory Material

[And98]

Andraka, R., A Survey of CORDIC Algorithms for FPGA-Based Computers, 6th International Symposium on Field Programmable Gate Arrays, Monterey, CA., pp 191-200, (1998). Online copy (only in UT domain).

[Aks14]

Aksoy, L., P. Flores and J. Monteiro, A Tutorial on Multiplierless Design of FIR Filters: Algorithms and Architectures, Circuits, Systems and Signal Processing, Vol. 33(6), pp 1689-1719, (2014). Online copy (only in UT domain).

[Anj11]

Anjum, O, T. Ahonen, F. Garzia, J. Nurmi, C. Brunelli and H. Berg, State-of-the-Art Baseband DSP Platforms for Software-Defined Radio: A Survey, EURASIP Journal on Wireless Communication and Networking, Vol. 2011(5). Online copy.

[Bha00]

Bhattacharyya, S.S., R. Leupers and P. Marwedel, Software Synthesis and Code Generation for Signal Processing Systems, IEEE Transactions on Circuits and Systems---II, Analog and Digital Signal Processing, Vol. 47(9), (September 2000). Online copy (only in UT domain).

Caption of Figure 6: last subscript of y should be n-1 instead of n.

Right column of Page 856: Read Figure 9(b) where 9(a) is mentioned and vice versa.

Contents of Figure 17: In order to be consistent with next figures, rewrite "x = a - b" and "y = a - b + c * d".

[Bou08]

Bouganis, C.S. and G.A. Constantinides, Synthesis of DSP Algorithms from Infinite Precision Specifications, In: P. Coussy and A. Morawiec (Eds.), High-Level Synthesis, From Algorithm to Digital Circuit, Springer, pp 197-214, (2008). Online copy (only in UT domain).

Those interested in a detailed analysis of the probability density function of the truncation error after multiplication can consult the followin non-compulsory paper:

Ahmadi, A. and M. Zwolinski, Fixed-Point Multiplication: A Probabilistic Bit-Pattern View, Microelectronics Reliability, Vol. 51(4), pp 790-796, (April 2011). Online copy (only in UT domain).

You can skip Seciton 11.3 (2D FIR filters).

Page 203, halfway bottom paragraph: twice add a minus sign to 2's exponent (so 2**n should become 2**-n).

Page 204, Equation 11.10: the "close" parenthesis with exponent 2 should move to the end of the equation.

[Chi12]

Chiueh, T.D., P.Y. Tsai, I.W. Lai, Baseband Receiver Design for Wireless MIMO-OFDM Communications, Second Edition, IEEE, Wiley and Sons Singapore, (2012). Online copy of Chapter 9 (only in UT domain).

[Ger98]

Gerez, S.H., S.M. Heemstra de Groot, E.R. Bonsma and M.J.M. Heijligers, Overlapped Scheduling Techniques for High-Level Synthesis and Multiprocessor Realizations of DSP Algorithms, In: J.C. Lopez, R. Hermida and W. Geisselhardt (Eds.), Advanced Techniques for Embedded System Design and Test, Kluwer Academic Publishers, Boston, pp 125-150, (1998). Available from the Restricted Matter section in Blackboard.

You can skip Section 6.5.3 on the efficient computation of the iteration-period bound.

[Ger99]

Gerez, S.H., High-Level Synthesis (Chapter 12) in Algorithms for VLSI Design Automation, John Wiley and Sons, Chichester, (1999). Available from the Restricted Matter section in Blackboard.

You can skip Section 12.4.3 on force-directed scheduling.

[Goo05]

Goossens, G., D. Lanneer and P. Dytrych, Design of Low Power Processor Cores using a Retargetable Tool Flow, In: C. Piguet (Ed.), Low-Power Electronics Design, CRC Press, Boca Raton, (2005).

[He98]

He, S. and M. Torkelson, Designing Pipeline FFT Processor for OFDM (De)modulation, URSI International Symposium on Signals, Systems and Electronics, ISSSE'98, pp. 257-262, (1998). Online copy (only in UT domain).

[Hew00]

Hewlitt, R.M. and E.S. Swartzlander, Canonical Signed Digit Representation for FIR Digital Filters, IEEE Workshop on Signal Processing Systems, SiPS 2000, Lafayette, LA, pp 416-426, (2000). Online copy (only in UT domain).

[Hof07]

Hofstra, K.L. and S.H. Gerez, Arx: A Toolset for the Efficient Simulation and Direct Synthesis of High-Performance Signal Processing Algorithms, International Conference on High Performance Embedded Architectures and Compilers, Ghent, Belgium, (January 2007). Online copy.

[Kot03]

Kotteri, K.A., A.E. Bell and J.E. Carletta, Quantized FIR Filter Design Using Compensating Zeros, IEEE Signal Processing Magazine, pp 60-67, (November 2003). Online copy (only in UT domain).

Optional text!

[Lan02]

Langlois, J.M.P., D. Al-Khalili and R.J. Inkol, Polyphase Filter Approach for High Performance, FPGA-Based Quadrature Demodulation, Journal of VLSI Signal Processing, Vol. 32, pp 237-254, (2002). Online copy (only in UT domain).

[Loe00]

Loehning, M., T. Hentschel and G. Fettweis, Digital Down Conversion in Software Radio Terminals, 10th European Signal Processing Conference, EUSIPCO 2000, pp 1517-1520, (2000). Online copy.

[Par95]

Parhi, K.K., High-Level Algorithm and Architecture Transformations for DSP Synthesis, Journal of VLSI Signal Processing, Vol. 9, pp 121-143, (1995). Online copy (only in UT domain).

You can skip Sections 6 (folding) and 8 (relaxed look-ahead).

Comments on Figure 6. The issue is that unfolding can improve the processor utilization. The explanation in the paper is not correct.

The schedule shown in Figure 6(b) is rate optimal i.e. it repeats at the iteration-period bound (T0min) value of 3. In this period, the total of the computations to be performed is 9 (4 operations of 2 and 1 of 1) time units. The lower bound on the number of processors is 3 (=9/3). However, this bound cannot be met. The reason is that the schedule needs to repeat every 3 time units. This means that a separate processor is necessary for each of the operations A to D that take two time units (a processor that would execute two of them would require an iteration period of 4). One has an average processor utilization of 75% (9/12).

Figure 6(c) shows a schedule of the graph after 2-unfolding. The unfolded graph contains 2 iterations of the original graph. This schedule is also rate optimal which means that the 2 iterations are executed in 6 time units. The optimal number of processor in this situation would be again 3 (=18/6). There now exists a schedule that reaches 100% processor utilization (the available 6 time units per processor can now be filled optimally with operations of 2 time units).

In Figure 6(b), the operations A0, B0, C0, D0 and E0 belong to one iteration. The schedule has an iteration period of 3 (A1 starts 3 time units after A0, etc.) a latency of 7 (output on E0) and a span of 8 (end of D0).

In Figure 6(c), the operations A0/A1, B0/B1, C0/C1, D0/D1 and E0/E1 belong to one iteration. The schedule has an iteration period of 6 (A2 starts 6 time units after A0, etc.) and a latency and span of 12 (output on E1).

Comments on Figure 9(a). According to me, two inequalities are incorrect: r(A2) - r(M1) <= 2 and r(M4) - r(A3) <= -1.

[Par09]

Park, H.W., H. Oh and S. Ha, Multiprocessor SoC Design Methods and Tools, IEEE Signal Processing Magazine, pp. 72-79, (November 2009). Online copy (only in UT domain).

[Vai90]

Vaidyanathan, P.P., Multirate Digital Filters, Filter Banks, Polyphase Networks, and Applications: A Tutorial, Proceedings of the IEEE, Vol. 78(1), pp 56-93, (January 1990). Online copy (only in UT domain).

Optional text.

[Vor07]

Voronenko, Y. and M. Pueschel, Multiplierless Multiple Constant Multiplication, ACM Transactions on Algorithms, Vol. 3(2), (May 2007). Online copy (only in UT domain).

Only study Section 1 (until page 6); the rest is optional.

Examination and Projects

Acronym	Title	Max. points	Nominal Load	Start after lecture of
PRE	Preparatory Exercise (no marks)	0	10 hours	February 6, 2017
TRA	Data-Flow Transformations	10	17 hours	February 27, 2017
SCH	Scheduling, Designing in Arx and Verification by Means of Co-simulation	10	17 hours	March 6, 2017
GFS	The GFSK Receiver	30	56 hours	March 20, 2017

Important: Please do not keep System Studio, Davis, etc. running when not necessary due to the limited number of available licenses. Check also for background processes that may continue to run and stop those as explained below.

Session cleanup: Before you log out, after closing System Studio, please check that all your simulations have properly terminated (in rare cases, stray processes continue running in the background). Command clean-up-ccss (to be typed at the shell prompt) will take care of this.

When ready with all projects, you should provide me (Sabih Gerez) with a hardcopy of the reports and arrange for an appointment to discuss them. Bring me all reports at once, in hardcopy (one hardcopy per team); do not send me individual reports unless you are stuck and want an advice. Send me as well the reports in PDF by e-mail. I use the electronic versions for back-up purposes, to zoom in to details that are not very clear in print, etc.

The mark will be based on the reports and the defense of your work in an oral examination session. The mark is basically the sum of points obtained for the projects divided by 5:

The performance at the oral exam can lead to a correction of at most one point up or down. In principle, the two members of a project team will receive the same mark unless there are strong indications of differences in performance.

The course needs to be terminated within the quarter in which it is taught. As an exceptional case, two extra weeks are available for academic year 2016-2017 which means that the deadline to deliver your work is Monday morning May 8, 2017. I will be at my office between 9:30 and 13:00. When you come to deliver your work, we will directly make an appointment for the closing oral session.

Links

• My list of books on different aspects of VLSI design including VLSI for signal processing.