Documentos de Académico
Documentos de Profesional
Documentos de Cultura
Pipelining is an important technique used in several applications such as digital signal processing (DSP) systems, microprocessors, etc. It originates from the idea of a water pipe with continuous water sent in without waiting for the water in the pipe to come out. Accordingly, it results in speed enhancement for the critical path in most DSP systems. For example, it can either increase the clock speed or reduce the power consumption at the same speed in a DSP system.
Contents
1 Concept 2 Costs and Disadvantages 3 Comparison with Parallel Approaches 4 Pipelining in FIR Filters 5 Pipelining in 1st-Order IIR Filters 6 Other Pipelined DSP Systems 7 Reference
Concept
Conceptually, pipelining puts different function units working in parallel. In computer architectures, it usually represents an implementation technique allowing multiple instructions are overlapped in execution to be parallel. Consider an informal example in the following figure. A function includes three sub-function units (F0, F1 and F2). Assume that there are three tasks (T0, T1 and T2) being operated by these three function units and they can be operated independently. The time for each function unit to complete a task is the same and will occupy a slot in the schedule. In such condition, if we put these three units and tasks in a sequential order, the required time to complete them is five slots.
However, if we pipeline T0 to T2 in parallel, the aggregate time is reduced to three slots, which is smaller than in a sequential order.
en.wikipedia.org/wiki/Pipelining_(DSP_implementation) 1/5
Therefore, it is possible for an adequate pipelined design to achieve significant enhancement on speed.
which is as shown in the following figure. Assume the calculation time for multiplication units is Tm and Ta for add units. The critical path, representing the minimum time required for processing a new sample, is limited by 1 multiplication and 2 add function units. Therefore, the sample period is given by
en.wikipedia.org/wiki/Pipelining_(DSP_implementation)
2/5
However, such structure may not be suitable for the design with the requirement of high speed. To reduce the sampling period, we can introduce extra pipelining registers along the critical data path. Then the structure is partitioned into two stages and the data produced in the first stage will be stored in the introduced registers, delaying one clock to the second stage. The data in first three clocks is recorded in the following table. Under such pipelined structure, the sample period is reduced to .
Then, the output sample y(n) can be computed in terms of the inputs and the output sample y(n- M) such that there are M delay elements in the critical loop. These elements are then used to pipeline the critical loop by M stages so that the
sample rate can be increased by a factor M. Consider the 1st-order IIR filter transfer function
The output y(n) can be computed in terms of the input u(n) and the previous output.
In a straightforward structure to design such function, the sample rate of this recursive filter is restricted by the calculation time of one multiply-add operation. To pipeline such design, we observe that H has a pole at
Therefore, in a 3-stage pipelined equivalent stable filter, the transfer function can be derived by adding poles and zeros at
and is given by
Reference
1. ^ K.K. Parhi, VLSI Digital Signal Processing Systems: Design and Implementation, John Wiley, 1999 2. ^ Slides for VLSI Digital Signal Processing Systems: Design and Implementation John Wiley & Sons, 1999 (ISBN Number: 0-471-24186-5): http://www.ece.umn.edu/users/parhi/slides.html 3. ^ M. R. Ashouri and A. G. Constantinides, "A pipeline fast Walsh Fourier transform," in Proc. IEEE Int. Conf. ASSP Hartford, CT, May 9-11), pp. 515-518, 1977. 4. ^ Fino, B.J.; Algazi, V.R.; , "Parallel and pipeline computation of fast unitary transforms," Electronics Letters , vol.11, no.5, pp.93-94, March 6 1975 5. ^ Tzou, K.-H.; Morgan, N.P.; , "A fast pipelined DFT processor and its programming consideration," Electronic Circuits and Systems, IEE Proceedings G , vol.132, no.6, pp.273-276, December 1985 6. ^ H. L. Gorginsky and G. A. Works, "A pipeline fast Fourier transform," IEEE Trans. Comput., vol. C-19, pp. 10151019, Nov. 1970.
This page was last modified on 5 October 2012 at 04:39. Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. See Terms of use for details. Wikipedia is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.
en.wikipedia.org/wiki/Pipelining_(DSP_implementation)
5/5