Efficient implementation of a filter

Abstract

A Finite Impulse Response (FIR) filter is implemented in software on a general purpose processor in a manner which reduces the number of memory accesses as compared to conventional methods. In particular, an efficient implementation for a general purpose processor having a substantial number of registers includes inner and outer loop code which together make K⁡[(L1+L2L1⁢L2)⁢N+L2L1+1]memory accesses and KN multiply-accumulates, where L1 is the number of output vector elements computed during each pass through the outer loop and where L2 is the number of taps per output vector element computed during each pass through the inner loop. The efficient implementation exploits L1+2L2 general purpose registers. For an embodiment in which L1=L2=8, inner and outer loop code make K⁡(N4+2)memory accesses, which for filter implementations with large numbers of taps, approaches a 4× reduction in the number of memory accesses as compared to conventional methods.

Description

BACKGROUND OF THE INVENTION

1. Field of the Invention

This invention relates to software implementations of discrete time filters, and in particular to software implementations of a Finite Impulse Response (FIR) filter on a general purpose processor.

2. Description of the Relevant Art

Traditional implementations of discrete time filters for signal processing applications have used a custom Digital Signal Processor (DSP) instruction to implement an N-tap filter. Such a DSP instruction is executed to perform a multiply-accumulate operation and to shift the delay line in a single cycle (assuming the delay line is entirely in zero-wait state memory or on-chip). For example, on a T1320C50 DSP, a finite impulse response (FIR) filter is implemented by successive evaluations of an MACD instruction, each evaluation computing an element, y n , of the filtered signal vector, i.e., of the output vector, y[K], such that: $$ y n = ∑ i = 0 N - 1 ⁢   ⁢ j l ⁢ x n - i ( 1 )

where h[N] is the N-tap filter coefficient vector and x[K] is an input signal vector.

Unfortunately, for many portable device applications such as Personal Digital Assistants (PDAs), portable computers, and cellular phones, power consumption, battery life, and overall mass are important design figures of merit. In addition, very small part counts are desirable for extremely-small, low-cost consumer devices. Signal processing capabilities are desirable in many such portable device applications, for example to provide a modem or other communications interface, for speech recognition, etc. However, traditional DSP implementations of such signal processing capabilities create increased power demands, increase part counts, and because of the power consumption of a discrete DSP, typically require larger heavier batteries.

SUMMARY OF THE INVENTION

An efficient implementation of a Finite Impulse Response (FIR) filter on a general purpose processor allows a discrete Digital Signal Processor (DSP), together with the cost, size, weight, and power implications thereof, to be eliminated in device configurations (such as communications device configurations) requiring signal processing functionality and digital filter structures. In particular, an efficient implementation of an FIR in accordance with the present invention allows a single general purpose processor (e.g., any of a variety of processors including MIPS R3000, R4000, and R5000 processors, processors conforming to the Sparc, PowerPC, Alpha, PA-RISC, or x86 processor architectures, etc.) to execute instructions encoded in a machine readable media to provide not only application-level functionality, but also the underlying signal processing functionality and digital filter structures for a communications device implementation. Of course, multiprocessor embodiments (i.e., embodiments including multiple general-purpose processors) which similarly eliminate a DSP are also possible. In one embodiment in accordance with the present invention, an FIR filter implementation on a general purpose processor provides digital filter structures for a software implementation of a V.34 modem without use of a DSP.

In general, a general purpose processor provides an instruction set architecture for loading data to and storing data from general purpose registers, for performing logical and scalar arithmetic operations on such data, and providing instruction sequence control. Application programs, as well as operating systems and device drivers, are typically executed on such a general purpose processor. In contrast, a digital signal processor is optimized for vector operations on vector data, typically residing in large memory arrays or special purpose register blocks, and is not well suited to the demands of application programs or operating system implementations. Instead, a digital signal processor typically provides a vector multiply-accumulate operation which exploits highly-optimized vector addressing facilities. In contrast, a general purpose processor provides neither a vector multiply-accumulate operation nor vector addressing facilities necessary for computing a y n th element and shifting through vector data in a single cycle. Instead, an N-tap filter implemented in a straightforward manner for execution on a general purpose processor computes each output vector element using 2N reads from memory to processor registers, N multiply-accumulates, and one write to memory. To calculate K elements, such an N-tap filter implementation makes K(2N+1) memory accesses and KN multiply-accumulates. For each multiply-accumulate, more than two memory access are required.

It has been discovered that a Finite Impulse Response (FIR) filter can be implemented in software on a general purpose processor in a manner which reduces the number of memory accesses. In particular, an efficient implementation for a general purpose processor having a substantial number of registers includes inner and outer loop code which together make $$ K ⁡ [ ( L 1 + L 2 L 1 ⁢ L 2 ) ⁢ N + L 2 L 1 + 1 ]

memory accesses and KN multiply-accumulates, where L 1 is the number of output vector elements computed during each pass through the outer loop and where L 2 is the number of taps per output vector element computed during each pass through the inner loop. The efficient implementation exploits L 1 +2L 2 general purpose registers. For an exemplary embodiment wherein L 1 =L 2 =8, i.e., using 24 general purpose registers, inner and outer loop code make $$ K ⁡ ( N 4 + 2 )

memory accesses, which for filter implementations with large numbers of taps, approaches a 4× reduction in the number of memory accesses.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention may be better understood, and its numerous objects, features, and advantages made apparent to persons of ordinary skill in the art by referencing the accompanying drawings.

FIG. 1 is a flow chart of an implementation of a Finite Impulse Response (FIR) filter, in accordance with an exemplary embodiment of the present invention, for execution on a processor.

FIG. 2 is a data flow diagram for a multiply accumulate step of an implementation of a Finite Impulse Response (FIR) filter for execution on system including a processor with general purpose registers and a memory, in accordance with an exemplary embodiment of the present invention.

FIG. 3 is a functional block diagram depicting functional modules and data flows for a software implementation of a modem incorporating instantiations of a Finite Impulse Response (FIR) filter implemented in accordance with an exemplary embodiment ooze present invention.

FIG. 4 is a block diagram of an exemplary Personal Digital Assistant (PDA) system embodiment including a general purpose processor, registers, and memory for executing a software implementation of a modem including an implementation of a Finite Impulse Response (FIR) filter in accordance with an exemplary embodiment of the present invention.

The use of the same reference symbols in different drawings indicates similar or identical items.

DESCRIPTION OF THE PREFERRED EMBODIMENT(S)

An N-tap filter implemented as software for execution on a general purpose processor computes each output vector element using 2N reads from memory to processor registers, N multiply-accumulates, and one write to memory. To calculate K elements, such an N-tap filter implementation includes K(2N+1) memory accesses and KN multiply-accumulates. For each multiply-accumulate, more than two memory access are required.

In contrast, an improved software implementation of the N-tap filter reduces the number of memory accesses. Referring to FIG. 1 , the improved software implementation includes an inner loop 120 and an outer loop 110 which together include $$ K ⁡ [ ( L 1 + L 2 L 1 ⁢ L 2 ) ⁢ N + L 2 L 1 + 1 ]

memory accesses and KN multiply-accumulates, where L 1 is the number of output vector elements computed during each pass through outer loop 120 and where L 2 is the number of taps per output vector element computed during each pass through inner loop 110 . The improved software implementation efficiently exploits L 1 +2L 2 general purpose registers and significantly reduces the number of memory accesses performed. In particular, for an exemplary embodiment wherein L 1 =L 2 =8, i.e., using 24 general purpose registers, inner and outer loop code make $$ K ⁡ ( N 4 + 2 )

memory accesses, which for filter implementations with large numbers of taps, approaches a 4× reduction in the number of memory accesses.

FIG. 1 depicts an exemplary embodiment of a nested loop implementation, including control flows (bold lines) and data flows (fine lines), of an N-tap filter design for a Finite Impulse Response filter (FIR). Outer loop 110 includes K/L 1 iterations to compute K output values of an output signal vector, OUT[K]. During each iteration of outer loop 110 , input registers 140 are loaded with L 2 (of K) respective input values of an input signal vector, D[K], from memory (step 111 ). Output registers 150 store L 1 (of K) respective output values of the output signal vector, OUT[K], and are cleared in step 112 . Inner loop 120 includes N/L 2 iterations to accumulate partial products into output registers 150 storing a subset of output values OUT[(iL 1 ) . . . (iL 1 +L 1 −1)] of the output signal vector OUT[K] where i is the loop index variable for outer loop 110 . The structure of inner loop 120 is described below. Loop index variable j is checked during each pass through inner loop 120 (illustratively, in step 128 ). On inner loop exit (i.e., on j=N/L 2 in the exemplary embodiment of FIG. 1 ), the subset of output values computed by inner loop 120 and accumulated into output registers 150 are stored to memory (step 113 ) and a subsequent iteration (if any) of outer loop 110 is initiated. In the exemplary embodiment of FIG. 1 , outer loop exit is on i=K/L 1 .

Coefficient registers 130 provide storage for L 2 (of N) filter coefficients of a filter coefficient vector C[N]. During each iteration of inner loop 120 (in particular, during step 121 ), coefficient registers 130 are loaded with a subset C[(jL 2 ) . . . (jL 2 +L 2 −1)] of the values from the filter coefficient vector, C[N], from memory. Inner loop 120 includes N/L 2 iterations to accumulate partial products of filter coefficient values and input signal vector values into a subset of output points OUT[(iL 1 ) . . . (iL 1 +L 1 −1])] of the output signal vector OUT[K]. L 2 element subsets of the filter coefficient vector and of the input signal vector are processed during each iteration through inner loop 120 . Inner loop 120 also includes accumulation steps (e.g., accumulation steps 122 , 124 , and 126 ) and input data load steps (e.g., input data load steps 123 , 125 , and 127 ). After each accumulate step, processing of a particular element of the input signal vector, D[K], is complete and the register used for storage of that particular element is available for storage of an as-yet unloaded element of the input signal vector. Each input data load step (e.g., input data load step 123 , 125 , or 127 ) loads a next successive element of the input signal vector into a corresponding input register location (illustratively, input register D 0 141 , D 1 142 , or D L 2 −1 143 ) freed up during the prior accumulation step. During each iteration of inner loop 120 , L 2 partial products are accumulated into L 1 output registers 150 (i.e., into the L 1 output registers OUT 0 151 , OUT 1 152 , . . . OUT L 1 −1 153 ).

FIG. 1 depicts an exemplary N-tap filter implementation 100 where the number of output vector elements computed and input vector elements consumed during each pass through outer loop 110 is L 1 and the number of partial products of input vector elements and filter coefficients accumulated during each pass through inner loop 120 is L 2 . The numbers L 1 and L 2 are independent, although L 1 should be a multiple of L 2 and the quantity (L 1 +2L 2 ) should be less or equal to than the total number of registers allocable to the N-tap filter implementation 100 on a particular processor.

For an embodiment wherein L 1 =L 2 =8, the steps of the N-tap filter implementation of FIG. 1 correspond to the following pseudocode:

/* compute L                                                                        1                                                                    =8 output points per iteration */
OUTER_LOOP {
   clear 8 output registers OUT                                                                        0                                                                    ,OUT                                                                        1                                                                    , ... ,OUT                                                                        7                                                                    ;
   load 8 input from memory to registers D                                                                        0                                                                    ,D                                                                        1                                                                    , ... ,D                                                                        7                                                                    ;
   /* compute L                                                                        2                                                                    =8 partial outputs */
   INNER_LOOP {
   load 8 coefficients from memory to registers C                                                                        0                                                                    ,C                                                                        1                                                                    , ... ,C                                                                        7                                                                    ;
   OUT                                                                        0                                                                     += C                                                                        0                                                                    *D                                                                        0                                                                     + C                                                                        1                                                                    *D                                                                        1                                                                     + ... + C                                                                        7                                                                    *D                                                                        7                                                                    ;
   load new input from memory to D                                                                        0                                                                    ;
   OUT                                                                        1                                                                     += C                                                                        0                                                                    *D                                                                        1                                                                     + C                                                                        1                                                                    *D                                                                        2                                                                     + ... + C                                                                        7                                                                    *D                                                                        0                                                                    ;
   load new input from memory to D                                                                        1                                                                    ;
   OUT                                                                        2                                                                     += C                                                                        0                                                                    *D                                                                        2                                                                     + C                                                                        1                                                                    *D                                                                        3                                                                     + ... + C                                                                        7                                                                    *D                                                                        1                                                                    ;
   load new input from memory to D                                                                        2                                                                    ;
   ...
   OUT                                                                        7                                                                     += C                                                                        0                                                                    *D                                                                        7                                                                     + C                                                                        1                                                                    *D                                                                        0                                                                     + ... + C                                                                        7                                                                    *D                                                                        6                                                                    ;
   load new input from memory to D                                                                        7                                                                    ;
   }
   store 8 outputs from registers OUT                                                                        0                                                                    ,OUT                                                                        1                                                                    , ... ,OUT                                                                        7                                                                    ;
}

A variety of source-code, assembly language, and machine language implementations consistent with the above pseudocode will be appreciated by persons of ordinary skill in the art. Alternative embodiments corresponding to different combinations of L 1 and L 2 values will also be appreciated by persons of ordinary skill in the art. Preferably, L 1 and L 2 are chosen so that the total number of general purpose registers allocated to storage of a partial input signal vector, a partial filter coefficient vector, and a partial output signal vector approaches the number of available general purpose registers on a general purpose processor. In an embodiment for execution on a Reduced Instruction Set Computer (RISC) processor providing overlapping register sets, L 1 and L 2 are preferably chosen so that the total number of general purpose registers allocated to storage of the partial input signal, partial filter coefficient, and partial output signal vectors approaches the number of available general purpose registers in a register set.

FIG. 2 depicts the data flows associated with an accumulation step and an input data load step from an iteration of inner loop 120 . In particular, FIG. 2 depicts the data flows associated with the final two steps in each iteration of inner loop 120 (i.e., accumulation step 126 and input data load step 127 , as shown in FIG. 1 ) for an exemplary embodiment in which L 1 =8 and L 2 =8. Inner loop instance 120 a, accumulation step instance 126 a, and input data load step instance 127 a correspond to this exemplary embodiment in which L 1 =8 and L 2 =8. The exemplary embodiment of FIG. 2 exploits twenty-four (24) general purpose registers 210 and is illustrative of the data flows for accumulation step instance 126 a and input data load step instance 127 a. The data flows associated with each of seven other preceding accumulation and input data load steps are analogous and will be appreciated by persons of ordinary skill in the art. In addition, persons of ordinary skill in the art will appreciate modification for alternate selections of L 1 and L 2 values.

Inner loop 120 a code and outer loop 110 code (not shown) each execute on processor 200 , which illustratively includes a general purpose processor with at least 24 general purpose registers 210 . A first group (C 0 131 a, C 1 132 a , . . . C 7 133 a ) of general purpose registers 210 are allocated to storage of a working set of eight (8) filter coefficient values from filter coefficient vector C[N]. A second group (D 0 141 a, D 1 142 a , . . . D 7 143 a ) of general purpose registers 210 are allocated to storage of a working set of eight (8) input values from input signal vector D[K]. A third group (OUT 0 151 a, OUT 1 152 a , . . . OUT 7 153 a ) of general purpose registers 210 are allocated to accumulative storage of partial convolutions for eight (8) output values of output vector C[N]. Initialization of the first group (C 0 131 a, C 1 132 a , . . . C 7 133 a ) and the second group (D 0 141 a, D 1 142 a , . . . D 7 143 a ) of general purpose registers 210 with values from memory, such as memory 220 , is performed in steps 111 (of outer loop 110 ) and 121 (of inner loop 120 ), as indicated in FIG. 1. A third group (OUT 0 151 a, OUT 1 152 a , . . . OUT 7 153 a ) of general purpose registers 210 is cleared in step 112 and stored to memory 220 in step 113 (both of outer loop 110 ).

Accumulation step instance 126 a convolves the then-present contents of the first group (C 0 131 a, C 1 132 a , . . . C 7 133 a ) of general purpose registers 210 with the then-present contents of the second group (D 0 141 a, D 1 142 a , . . . D 7 143 a ) of general purpose registers 210 . For the particular accumulate step performed by accumulation step instance 126 a, a partial filter coefficient vector C[(jL 2 ) . . . (jL 2 +L 2 −1)] is a convolved with a partial input signal vector D[(iL 1 +jL 2 −1), (iL 1 +jL 2 ), . . . (iL 1 +jL 2 +L 2 −2)], as follows:

OUT 7 +=C 0 D 7 +C 1 D 0 +C 2 D 1 +C 3 D 2 +C 4 D 3 +C 5 D 4 +C 6 D 5 +C 7 D 6   (2)

where j is the loop index for inner loop 120 a and where C 0 131 a, C 1 132 a , . . . , and C 7 133 a respectively contain elements of the partial filter coefficient vector C[(jL 2 ) . . . (jL 2 +L 2 −1)]. Input registers 140 (i.e., D 7 143 a, D 0 141 a , D 1 142 a , . . . , and D 6 ) respectively contain elements of the partial input signal vector D[(iL 1 +jL 2 −1), (iL 1 +jL 2 ), . . . (L 1 +jL 2 +L 2 −2)] where i is the loop index for outer loop 110 and where elements are stored as shown in Table 1.

TABLE 1
                                 Input Signal
Register                         Vector Element
Input Register D                                                                        0                                                                     141a D[iL                                                                        1                                                                     + jL                                                                        2                                                                    ]
Input Register D                                                                        1                                                                     142a D[iL                                                                        1                                                                     + jL                                                                        2                                                                     + 1]
Input Register D                                                                        2 D[iL                                                                        1                                                                     + jL                                                                        2                                                                     + 2]
Input Register D                                                                        3 D[iL                                                                        1                                                                     + jL                                                                        2                                                                     + 3]
Input Register D                                                                        4 D[iL                                                                        1                                                                     + jL                                                                        2                                                                     + 4]
Input Register D                                                                        5 D[iL                                                                        1                                                                     + jL                                                                        2                                                                     + 5]
Input Register D                                                                        6 D[iL                                                                        1                                                                     + jL                                                                        2                                                                     + 6]
Input Register D                                                                        7                                                                     143a D[iL                                                                        1                                                                     + jL                                                                        2                                                                     − 1]

Input data load step instance 127 a loads the input register D 7 143 a with the next successive element, i.e., D[iL 1 +jL 2 +7], of input signal vector D[K]. In this way, second group (D 0 141 a, D 1 142 a , . . . D 7 143 a ) of general purpose registers 210 is ready for the next pass through inner loop 120 a.

Referring to FIG. 3 , software implementation 300 of a V.34 modem includes transmit and receive data paths. The transmit data path includes encoder 320 , modulator 330 , and pre-emphasis and shaping filter 341 . The receive data path includes receive data module 350 , decoder 360 , demodulator 370 , and receive front end module 380 . A transmit process 396 invokes an external data handler with data for transmission over line 395 . Along the transmit data path, pre-emphasis and shaping filter 341 is implemented using a FIR filter 100 as described above in accordance with FIGS. 1 and 2 . Along the receive data path, echo interpolator 381 , preliminary echo canceller 384 , main echo canceller 371 , and equalizer 373 are also implemented using a FIR filter 100 as described above in accordance with FIGS. 1 and 2 .

In an exemplary embodiment of software implementation 300 of a V.34 modem, pointers to an input signal vector, D[K], to a coefficient vector, C[N], and an output signal vector, OUT[K], are passed to a function, procedure, or method implementing FIR filter 100 . Each of the submodules which are implemented using FIR filter 100 , i.e., shaping filter 341 along the transmit data path and echo interpolator 381 , preliminary echo canceller 384 , main echo canceller 371 , and equalizer 373 along the receive data path, are invoked with input data passed from a predecessor in the respective data path and with coefficient data specific to the particular filter implementation. Both the input data and the filter-specific coefficient data are passed via memory 220 . Suitable filter coefficient vectors are specific to each of the particular filters and will be appreciated by persons of ordinary skill in the art. Certain filter implementations are adaptive and FIR filter 100 is instantiated or invoked with coefficient vectors which are updated to implement each of the respective adaptive filters. Each of the instantiations or invocations of FIR filter 100 code which implement a particular filter along the transmit or receive data path may independently define L 1 and L 2 values for efficient implementation thereof.

Referring now to the transmit data path of software implementation 300 , transmit process 396 supplies a bit stream to a V.34 implementation of encoder 320 . Encoder 320 converts the input bit stream into a baseband sequence of complex symbols which is used as input to modulator 330 . Encoder 320 performs shell mapping, differential encoding, constellation mapping, precoding and 4D trellis encoding, and nonlinear encoding, all as described in respective sections of ITU-T Recommendation V.34, A Modem Operating at Data Signalling Rates of up to 28 800 bits/s for Use on the General Switched Telephone Network and on Leased Point - to - Point 2- Wire Telephone - Type Circuits, dated September, 1994 (previously CCITT Recommendation V.34), which is hereby incorporated herein, in its entirety, by reference. Persons of ordinary skill in the art will recognize variety of alternative implementations of encoder 320 , in accordance with the requirements of ITU-T Recommendation V.34 (hereafter the V.34 recommendation). In addition, persons of ordinary skill in the art will recognize a variety of alternative configurations of encoder 320 suitable to modem implementations in accordance with other communications standards such as V.32, V.32 bis, etc. Returning to the V.34 embodiment of FIG. 3 , encoder 320 :

1. converts the input bit stream into a sequence of mapping frames as described in section 9.3 of the V.34 recommendation, which is incorporated herein by reference;

2. performs shell mapping as described in section 9.4 of the V.34 recommendation, which is incorporated herein by reference;

3. performs differential encoding as described in section 9.5 of the V.34 recommendation, which is incorporated herein by reference;

4. performs constellation mapping as described in section 9.1 of the V.34 recommendation, which is incorporated herein by reference;

5. performs precoding and 4D trellis encoding as described in section 9.6 of the V.34 recommendation, which is incorporated herein by reference; and

6. performs nonlinear encoding as described in section 9.7 of the V.34 recommendation, which is incorporated herein by reference.

A variety of suitable implementations in accordance with the requirements of respective sections of the V.34 recommendation will be appreciated by persons of ordinary skill in the art.

Modulator 330 converts the baseband sequence of complex symbols from the output of the encoder into a passband sequence of real samples. In particular, modulator 330 :

1. multiplies the complex baseband sequence by the carrier frequency; and

2. converts the complex signal to real.

If the spectrum of the modulator output is sufficiently white, it can be used as an input to receiver echo cancellers, such as preliminary echo canceller 384 , described below.

Shaping and pre-emphasis filter 341 provides square-root-of-raised-cosine shaping as well as pre-emphasis filtering specified by section 5.4 of the V.34 recommendation, which is incorporated herein by reference. Raised cosine complex shaping and pre-emphasis filtering are implemented using FIR filters 100 in accordance with FIGS. 1 and 2 . Persons of ordinary skill in the art will appreciate suitable coefficient vector definitions for providing raised cosine complex shaping and pre-emphasis filtering. In the embodiment of FIG. 3 , eleven pre-emphasis characteristics combined with four choices of carrier frequency (relative to symbol rate) result in a total of 44 separate filters definitions. Only one filter is used on any one connection, although other embodiments utilizing more than one filter definitions per connection are also suitable. The output of shaping and pre-emphasis filter 341 is an output of the transmitter portion of software implementation 300 of a V.34 modem and is provided to D/A converter 391 , typically via an I/O channel and codec. D/A converter 391 couples to transmission line 395 .

Referring now to the receive data path of software implementation 300 , receive front end module 380 receives the output of the A/D converter 392 as an input. A/D converter 392 couples to transmission line 395 . Preliminary echo canceller 384 is implemented as a real data/real coefficients adaptive filter using an FIR filter 100 in accordance with FIGS. 1 and 2 . Persons of ordinary skill in the art will appreciate suitable coefficient vector definitions. Preliminary echo canceller 384 receives as an input a white signal from the output of the modulator 330 . Preliminary echo canceller 384 uses a stochastic gradient updating algorithm for adaptation during half duplex of V.34 training and is not updated during data mode. The purpose of this preliminary stage of echo cancellation is to reduce the echo level relative to the receive signal level so that subsequent stages such as clock recovery, signal detection, and automatic gain control (each not shown) will not be affected by the echo. Final echo signal cancellation is performed by main echo canceller 371 at the output of equalizer 373 .

The modem receiver implemented along the receive data path should be to be synchronized with the remote modem signal. An adaptive FIR filter (i.e., an FIR filter implementation 100 in accordance with FIGS. 1 and 2 with an adaptively updated set of filter coefficients) is used to perform the interpolation. Adaptive FIR filters implemented in this manner are used to interpolate the receive signal (at receive signal interpolator 389 ) as well as to interpolate the modulator output (at echo interpolator 381 ) used as input for main echo canceller 371 . The filter coefficients are adjusted based on timing phase and frequency recovered from the remote modem signal. The adaptation algorithm is a two-stage combination of sin(x)/x and linear interpolations.

Referring now to demodulator 370 , a passband phase-splitting adaptive T/3 equalizer 373 is used for channel equalization. The input to equalizer 373 is the output of receive signal interpolator 389 and has a sampling rate of 3T×S. The output of equalizer 373 is downsampled by 3 to symbol rate. Equalizer 373 implemented using FIR filters 100 in accordance with FIGS. 1 and 2 . Persons of ordinary skill in the art will appreciate suitable initial coefficient vector definitions for providing passband phase-splitting adaptive T/3 equalizer 373 .

Passband adaptive T/3 echo canceller 371 is used to subtract residual echo left over from preliminary echo canceller 384 . The echo canceller input is the output signal from modulator 330 synchronized with the remote modem clock. Echo is subtracted at the output of equalizer 373 . Demodulator 370 also converts the passband signal at the output of the equalizer to baseband. Demodulator 370 may optionally contain phase locked loop to compensate for frequency offset and phase jitter on transmission line 395 .

Decoder 360 converts the demodulated complex symbols into a bit stream which is supplied to receiver process 397 . Transmit process 396 receiver process 397 may be the same process. Decoder 360 performs nonlinear decoding, linear prediction, trellis decoding, constellation decoding, shell demapping, and data deframing, all as described in respective sections of the V.34 recommendation, which is incorporated herein by reference. Persons of ordinary skill in the art will recognize variety of alternative implementations of decoder 360 , in accordance with the requirements the V.34 recommendation. In addition, persons of ordinary skill in the art will recognize a variety of alternative configurations of decoder 360 suitable to modem implementations in accordance with other communications standards such as V.32, V.32 bis, etc. Returning to the V.34 embodiment of FIG. 3 , decoder 360 :

1. compensates for the effect of nonlinear encoding by applying inverse nonlinear projection function to the symbols at the output of the demodulator;

2. performs linear prediction implemented as a 4-tap complex FIR filter which uses the same coefficients as the remote modem precoder. The purpose of the linear predictor (not shown), which is implemented as an FIR filter 100 in accordance with FIGS. 1 and 2 , is to whiten the channel noise, thereby reducing the probability of errors;

3. performs the trellis search algorithm to determine, based on the received symbols, the best decoding decision for the current symbol;

4. performs constellation decoding;

5. performs an operation complementary to that performed by shell mapper described above with reference to encoder 320 ; and

6. deframes data to provide a single bit stream which is then passed (after descrambling) to receiver process 397 .

Other Embodiments

FIG. 4 depicts a Personal Digital Assistant (PDA) 400 incorporating a SoftModem library 410 of software modules (illustratively, V.34 SoftModem modules 300 ) for execution on a general purpose processor 420 . In accordance with an embodiment of the present invention, certain of V.34 SoftModem modules 300 are implemented using an FIR filter implementation 100 , as described above. Input signal vectors D[K] and filter coefficient vectors C[N] suitable for providing the various FIR filter implementations of interpolators, phase splitting filters, linear predictors, etc. (which have been described above with reference to FIG. 3 ) are loaded from memory 430 and output signal vectors OUT[K] are stored to memory 430 . In addition, executable instructions implementing SoftModem library 410 (including FIR filter implementation 100 ) and suitable for execution on general purpose processor 420 are also stored in, and loaded from, memory 430 . In a presently preferred embodiment, general purpose processor 420 includes an R3000 RISC microprocessor, although a wide variety of alternative processor implementations are also suitable. General purpose processor 420 includes general purpose registers 210 which are operated on by the executable instructions of FIR filter implementation 100 and includes a DMA channel 421 for interfacing to telecommunication circuits (illustratively, phone line 490 ) via codec 470 and Digital-to-Analog/ Analog-to-Digital (DAA) converter 460 . Of course, memory 430 may include both read/write memory 431 and read only memory 432 and persons of ordinary skill in the art will recognize code portions and data suitable for storage in each. Removable media 480 provides a mechanism for supplying the executable instructions implementing SoftModem library 410 (including FIR filter implementation 100 ) as well as filter coefficient definitions.

While the invention has been described with reference to various embodiments, it will be understood that these embodiments are illustrative and that the scope of the invention is not limited to them. Many variations, modifications, additions, and improvements of the embodiments described are possible. For example, complex inputs and/or complex coefficient can be accommodated to generate complex outputs. FIR filter implementations in accordance with the present invention are suitable for implementation of many other signal processing functions and can be incorporated in a wide variety of devices including modems, answering machines, cellular phones, voice/data compression systems, speech recognition systems, etc. Additionally, structures and functionality presented as hardware in the exemplary embodiment may be implemented as software, firmware, or microcode in alternative embodiments. These and other variations, modifications, additions, and improvements may fall within the scope of the invention as defined in the claims which follow.

Claims

1. A computer program product comprising:instructions executable on a processor as a filter to incrementally load respective portions of input and coefficient vector data into respective first and second sets of registers and to operate thereon to accumulate output vector data, wherein execution of the instructions requires substantially less than two load operations per accumulation operation.

2. A computer program product as in claim 1,wherein the registers number at least 2L1+L2; and wherein an execution ratio of memory access operations, including the load operations, to the accumulation operations approaches (L1+L2L1⁢L2).

3. A computer program product as in claim 1,wherein the registers number at least 24; and wherein an execution ratio of memory access operations, including the load operations, to the accumulation operations approaches a number less than or equal to ¼.

4. A computer program product as in claim 1, whereinthe filter includes N taps; and for K elements of the output vector data, the execution includes: approximately K⁡[(L1+L2L1⁢L2)⁢N+L2L1+1] memory access operations including the load operations; and approximately KN of the accumulation operations.

5. A computer program product as in claim 4,wherein for large numbers N, a ratio of the memory access operations to the accumulation operations approaches (L1+L2L1⁢L2).

6. A computer program product as in claim 5,wherein L1=L2=8; and wherein the ratio approaches ¼.

7. A computer program product as in claim 1,wherein the accumulation operations include multiply accumulate operations; and wherein the filter is a Finite Impulse Response (FIR) filter.

8. A computer program product as in claim 1,wherein the output vector data are accumulated into a third set of registers.

9. A computer program product as in claim 8,wherein the first and second sets of registers number L1; and wherein the third set of registers number L2.

10. A computer program product as in claim 1,wherein the first and second sets of registers number L1.

11. A computer program product as in claim 1,wherein the execution of the instructions on the processor provides an efficient implementation of the filter, without use of a DSP, for one of a personal digital assistant, a portable computer, a modem, mobile phone or other communications device, a modem, a voice or data compression system, a speech recognition system, and a portable device with signal processing functionality.