Efficient implementation of composite length fast FIR filtering on the "ADSP-2100"

Zergaïnoh, A.; Duhamel, Pierre; Vidal, J.

doi:10.1109/icassp.1994.389990

Cited by 4 publications

(5 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This problem was already pointed out in previous papers (see [7]), in which the algorithm was restricted to a single decomposition due to these constraints. A particular attention was devoted to this difficulty (see [9], [lo]). In order to keep as much as possible the improvement brought by the reduction of the arithmetic complexity of these composite algorithms without exceeding too many resources available on DSP's, we suggest an optimal data memory organization based on the proposed one given in1 [9], [lo].…”

Section: Methodology For An Efficient Address Generationmentioning

confidence: 99%

“…A particular attention was devoted to this difficulty (see [9], [lo]). In order to keep as much as possible the improvement brought by the reduction of the arithmetic complexity of these composite algorithms without exceeding too many resources available on DSP's, we suggest an optimal data memory organization based on the proposed one given in1 [9], [lo]. The basic idea, as shown in [9], consists in defining one delay line for ordering data and one array for storing fixed FIR sub-fiiters coefficients in such a way that 6(N + 1)I1.,, m, pointers registers are simplified to only two.…”

Section: Methodology For An Efficient Address Generationmentioning

confidence: 99%

“…These algorithms, break the computation of a length L FIR filter, into several sub-filters of length L'< L , in such a way that the arithmetic complexity decreases (see [5]). An efficient implementation of these algorithms was proposed in [9] and [lo]. The paper is organised as follows: Section 2 presents a brief description of fundamentals set of fast FIR filtering algorithms that have been studied extensively in [5], [6].…”

Section: T~q D~c~~~~mentioning

confidence: 99%

“…The geineral short length FIR filtering algorithm denoted by F ( N , , N I ) , ..., F ( N n , N , ) is ccomposed of several modules (see [9]). The first one consists of the combination of the pre-processing parts of the various F ( N i , N , ) that are used.…”

Section: Short Length Fir Filtering Ailgorithmsmentioning

confidence: 99%

“…In this paper, we extend the Generator Code (GC) provided in [9], [lo]. We propose a unify tool for exploiting the existing structure.…”

Section: Efficient Code Generatormentioning

confidence: 99%

See 4 more Smart Citations