Design of high-speed multiplierless filters using a nonrecursive signed common subexpression algorithm

Martínez-Peiró, Marcos; Boemo, Eduardo; Wanhammar, Lars

doi:10.1109/tcsii.2002.1013866

Cited by 162 publications

(57 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We also tested the algorithms on a set of FIR filters, and the results are tabulated in Table 5. We compared our methods with the delay aware subexpression elimination methods proposed by [8], which was the only other method that performed such an optimization. Their method can only be applied to single variable systems such as the transposed form of the FIR filters, and they assure delay optimality by restricting their common subexpressions to be only non-recursive.…”

Section: Experiments With the Delay Aware Algorithmmentioning

confidence: 99%

“…Most of the earlier works for finding common subexpressions in systems involving constant multiplications were based on finding common digit patterns in the set of constants multiplying a single variable [1][2][3][4][5][6][7][8][9]. These methods are good enough for optimizing systems where only single variable optimizations are required, such as the transformed form of FIR digital filters.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Algebraic Methods for Optimizing Constant Multiplications in Linear Systems

Hosangadi

Fallah

Kastner

2007

J VLSI Sign Process Syst Sign Im

View full text Add to dashboard Cite

Abstract. Constant multiplications can be efficiently implemented in hardware by converting them into a sequence of nested additions and shift operations. They can be optimized further by finding common subexpressions among these operations. In this work, we present algebraic methods for eliminating common subexpressions. Algebraic techniques are established in multi-level logic synthesis for the minimization of the number of literals and hence gates to implement Boolean logic. In this work we use the concepts of two of these methods, namely rectangle covering and fast extract (FX) and adapt them to the problem of optimizing linear arithmetic expressions. The main advantage of using such methods is that we can optimize systems consisting of multiple variables, which is not possible using the conventional optimization techniques. Our optimizations are aimed at reducing the area and power consumption of the hardware, and experimental results show up to 30.3% improvement in the number of operations over conventional techniques. Synthesis and simulation results show up to 30% area reduction and up to 27% power reduction. We also modified our algorithm to perform delay aware optimization, where we perform common subexpression elimination such that the delay is not exceeded beyond a particular value.

show abstract

Section: Experiments With the Delay Aware Algorithmmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Algebraic Methods for Optimizing Constant Multiplications in Linear Systems

Hosangadi

Fallah

Kastner

2007

J VLSI Sign Process Syst Sign Im

View full text Add to dashboard Cite

show abstract

“…1024-point FFT) then poor layout regularity may result from complex wiring of sub-expressions from taps large distances apart in the data vector. Indeed a recent paper has shown that choosing such sub-expressions can result in a speed reduction and greater power consumption [7]. It is therefore sensible to divide each N -point dot product into N/r sub rpoint dot product chunks, where r < N and r ∈ Z Z, and optimise each chunk independently.…”

Section: Ppstmentioning

confidence: 99%

Optimisation of Constant Matrix Multiplication Operation Hardware Using a Genetic Algorithm

Kinane

Mureşan

O’Connor

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The efficient design of multiplierless implementations of constant matrix multipliers is challenged by the huge solution search spaces even for small scale problems. Previous approaches tend to use hillclimbing algorithms risking sub-optimal results. The three-stage algorithm proposed in this paper partitions the global constant matrix multiplier into its constituent dot products, and all possible solutions are derived for each dot product in the first two stages. The third stage leverages the effective search capability of genetic programming to search for global solutions created by combining dot product partial solutions. A bonus feature of the algorithm is that the modelling is amenable to hardware acceleration. Another bonus feature is a search space reduction early exit mechanism, made possible by the way the algorithm is modelled. Results show an improvement on state of the art algorithms with future potential for even greater savings.

show abstract

“…In [1][2][3][4][5][6], various approaches have been proposed to reduce the area by replacing the multiplications with minimal hard-wired shifts, adders, and subtractors. The quantization effects of coefficients and round-off noise in multiplication have been analyzed in [7] and [8], respectively.…”

Section: Introductionmentioning

confidence: 99%

Multipath Pipelined Polyphase Structures for FIR Interpolation and Decimation in MIMO OFDM Systems

Zhang

Zhou

2011

ISRN Signal Processing

View full text Add to dashboard Cite

The combination of multiple-input multiple-output (MIMO) signal processing with orthogonal frequency-division multiplexing (OFDM) technique is one favored solution in wireless communication systems for enhancing data rate. However, the computational complexity is also linear increased with the number of data streams. Generally, multiple finite impulse response (FIR) interpolations and decimations are added to solve the multiple data streams in a MIMO OFDM system, which cause a large increase in the hardware cost. In this paper, two multipath pipelined polyphase structures for FIR interpolation and decimation to efficiently deal with the simultaneous multiple data streams are proposed. According to the proposed structures, M simultaneous data streams can be supported in the M-component polyphase interpolation or decimation with only one set of computation units. Implementation examples show that up to 56% reduction of silicon area can be obtained over the traditional polyphase structures.

show abstract

Design of high-speed multiplierless filters using a nonrecursive signed common subexpression algorithm

Cited by 162 publications

References 13 publications

Algebraic Methods for Optimizing Constant Multiplications in Linear Systems

Algebraic Methods for Optimizing Constant Multiplications in Linear Systems

Optimisation of Constant Matrix Multiplication Operation Hardware Using a Genetic Algorithm

Multipath Pipelined Polyphase Structures for FIR Interpolation and Decimation in MIMO OFDM Systems

Contact Info

Product

Resources

About