Efficient allocation of power of two terms in FIR digital filter design using tabu search

Traferro, S.; Capparelli, F.; Piazza, Francesco; Uncini, Aurelio

doi:10.1109/iscas.1999.778872

Cited by 19 publications

(10 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It has been successfully used for various system-level design problems, such as yield maximization problems [Alippi et al 2003], FIR filter design [Traferro et al 1999], mapping and scheduling of task graphs on SoCs [Wild et al 2003], and latency-area tradeoffs for NoCs [Cardoso et al 2005]. Several researchers have compared tabu search with other optimization heuristics, such as simulated annealing and genetic algorithms and shown the superiority of tabu search with regard to optimization time and quality of results [Hajji et al 2002;Wild et al 2003;Pierre and Houeto 2002;Krishnamachari and Wicker 2000;Eles et al 1997].…”

Section: The Tabu Search Based Heuristicmentioning

confidence: 99%

Task mapping and priority assignment for soft real-time applications under deadline miss ratio constraints

Manolache

Eles

Peng

2008

ACM Trans. Embed. Comput. Syst.

View full text Add to dashboard Cite

Both analysis and design optimisation of real-time systems has predominantly concentrated on considering hard real-time constraints. For a large class of applications, however, this is both unrealistic and leads to unnecessarily expensive implementations. This paper addresses the problem of task priority assignment and task mapping in the context of multiprocessor applications with stochastic execution times and in the presence of constraints on the percentage of missed deadlines. We propose a design space exploration strategy together with a fast method for system performance analysis. Experiments emphasize the efficiency of the proposed analysis method and optimisation heuristic in generating high-quality implementations of soft real-time systems with stochastic task execution times and constraints on deadline miss ratios. Manolache, S., Eles, P., and Peng, Z. 2008. Task mapping and priority assignment for soft realtime applications under deadline miss ratio constraints.

show abstract

Section: The Tabu Search Based Heuristicmentioning

confidence: 99%

Task mapping and priority assignment for soft real-time applications under deadline miss ratio constraints

Manolache

Eles

Peng

2008

ACM Trans. Embed. Comput. Syst.

View full text Add to dashboard Cite

show abstract

“…Coefficient truncation subsequently appeared in other fields like speech processing [5] and control [6]. Several methods have been proposed for coefficient truncation: exhaustive search over possible truncated coefficients [3], successive truncation of coefficients and reoptimization over remaining ones [4], [7], local bivariate search around the scaled and truncated coefficients [8], tree-traversal techniques for truncated coefficients organized in a tree according to their complexity [9], [10], coefficient quantization using information-theoretic bounds [11], weighted least-squares [12], simulated annealing [13], [14], genetic algorithms [15]- [17], Tabu search [18], design of optimal filter realizations that minimize coefficient complexity [13]. Other approaches have formulated the problem as a nonlinear discrete optimization problem [19], or have used integer programming techniques [20]- [22].…”

Section: W E Consider a Discrete-time Filter Defined By Its Transfer mentioning

confidence: 99%

Filter Design With Low Complexity Coefficients

Skaf¹,

Boyd²

2008

IEEE Trans. Signal Process.

View full text Add to dashboard Cite

Abstract-We introduce a heuristic for designing filters that have low complexity coefficients, as measured by the total number of nonzeros digits in the binary or canonic signed digit (CSD) representations of the filter coefficients, while still meeting a set of design specifications, such as limits on frequency response magnitude, phase, and group delay. Numerical examples show that the method is able to attain very low complexity designs with only modest relaxation of the specifications.

show abstract

“…Tabu Search is a heuristic introduced by Glover (19) . It has been successfully used for various system level design problems, such as yield maximisation problems, (20) FIR filter design, (21) mapping and scheduling of task graphs on SoCs, (22) and latency-area trade-offs for NoCs. (23) Several researchers have compared Tabu Search with other optimisation heuristics, such as Simulated Annealing and Genetic Algorithms and shown the superiority of Tabu Search with regard to optimisation time and quality of results (22,(24)(25)(26)(27) .…”

Section: Selection Of Communication Supportsmentioning

confidence: 99%

Fault-aware Communication Mapping for NoCs with Guaranteed Latency

Manolache

Eles

Peng

2007

Int J Parallel Prog

View full text Add to dashboard Cite

As feature sizes shrink, transient failures of on-chip network links become a critical problem. At the same time, many applications require guarantees on both message arrival probability and response time. We address the problem of transient link failures by means of temporally and spatially redundant transmission of messages, such that designer-imposed message arrival probabilities are guaranteed. Response time minimisation is achieved by a heuristic that statically assigns multiple copies of each message to network links, intelligently combining temporal and spatial redundancy. Concerns regarding energy consumption are addressed in two ways. First, we reduce the total amount of transmitted messages, and, second, we minimise the application response time such that the resulted time slack can be exploited for energy savings through voltage reduction. The advantages of the proposed approach are guaranteed message arrival probability and guaranteed worst case application response time.

show abstract

Efficient allocation of power of two terms in FIR digital filter design using tabu search

Cited by 19 publications

References 7 publications

Task mapping and priority assignment for soft real-time applications under deadline miss ratio constraints

Task mapping and priority assignment for soft real-time applications under deadline miss ratio constraints

Filter Design With Low Complexity Coefficients

Fault-aware Communication Mapping for NoCs with Guaranteed Latency

Contact Info

Product

Resources

About