FRIDGE: an interactive code generation environment for HW/SW codesign

Willems, M.; Bursgens, V.; Grotker, T.; Meyr, H.

doi:10.1109/icassp.1997.599625

Cited by 26 publications

(28 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Many techniques such as [10] have been proposed in the past to accelerate simulation by efficient code generation. This approach attempts to generate efficient binary for the given system that needs to be simulated such that simulation takes the least possible time.…”

Section: Related Workmentioning

confidence: 99%

Fast performance evaluation of fixed-point systems with un-smooth operators

Parashar¹,

Menard²,

Rocher³

et al. 2010

2010 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)

View full text Add to dashboard Cite

Fixed-point refinement of signal processing systems is an essential step performed before implementation of any signal processing system. Existing analytical techniques to evaluate performance of fixed-point systems are not applicable to the errors due to quantization in the presence of un-smooth operators. Thus, it is inevitable to use simulation to evaluate performance of fixed-point systems in the presence unsmooth operators. This paper proposes a hybrid technique which can be used in place of pure simulation to accelerate the performance evaluation. The principle idea in the proposed hybrid approach is to selectively simulate parts of the system only when un-smooth errors occur but use analytical results otherwise. The acceleration thus obtained reduces the performance evaluation time which can be used to explore a wider word-length design space or speedup the optimization process. This method has been tried on a complex MIMO sphere decoding algorithm and the results obtained show several orders of magnitude improvement in terms of evaluation time.

show abstract

Section: Related Workmentioning

confidence: 99%

Fast performance evaluation of fixed-point systems with un-smooth operators

Parashar¹,

Menard²,

Rocher³

et al. 2010

2010 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)

View full text Add to dashboard Cite

show abstract

“…Such libraries allow specification of fixed-point formats with arbitrary lengths for the purpose of experimentation. While these approaches are useful and have contributed significantly to the development of several fixedpoint design tools [4], [5], the time required for simulation can be very long. Time required for optimization grows with the number of operations in the system (system size), and the results obtained are specific to the input data set provided.…”

mentioning

confidence: 99%

Accelerated Performance Evaluation of Fixed-Point Systems With Un-Smooth Operations

Parashar

Ménard

Sentieys

2014

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

View full text Add to dashboard Cite

Abstract-The problem of accuracy evaluation is one of the most time consuming tasks during the fixed-point refinement process. Analytical techniques based on perturbation theory have been proposed in order to overcome the need for long fixed-point simulation. However, these techniques are not applicable in the presence of certain operations classified as un-smooth operations. In such circumstances, fixed-point simulation should be used. In this paper, an algorithm detailing the hybrid technique which makes use of an analytical accuracy evaluation technique used to accelerate fixed-point simulation is presented. This technique is applicable to signal processing systems with both feed-forward and feedback interconnect topology between its operations. The acceleration obtained as a result of applications of the proposed technique is consistent with fixed-point simulation, while reducing the time taken for fixed-point simulation by several orders of magnitude.

show abstract

“…Furthermore, because of the fact that PCE can reproduce the entire signal distribution, a spectrum of bitwidth/SNR tradeoff can be made depending on the need of the application. This is in contrast to other analytical methods [1,2] where only a single dynamic range can be reported.…”

Section: Bitwidth and Snr Tradeoffmentioning

confidence: 78%

“…A bitwidth/interval propagation method is described in [1,2]. This method propagates the input bitwidth or interval through the whole system to obtain the dynamic range for intermediate variables.…”

Section: Related Workmentioning

confidence: 99%

“…While many advances have been made on this front, the proposed methods have not been able to provide dynamic range information as accurate and as complete as profiling. The accuracy problem can usually be attributed to either no treatment of signal correlation, as in the cases of bitwidth [1,2] or moment propagation method [3], or inadequate treatment of signal correlation, as in the case of affine arithmetic method [4]. The completeness problem relates to the fact that these methods typically produce only value or error bounds instead of signal distribution, thereby limiting the scope of their application.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Dynamic range estimation for nonlinear systems

Wu¹,

Zhu²,

Najm³

IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004.

View full text Add to dashboard Cite

It has been widely recognized that the dynamic range information of an application can be exploited to reduce the datapath bitwidth of either processors or ASICs, and therefore the overall circuit area, delay and power consumption. While recent advances in analytical dynamic range estimation can deliver results accurate enough to account for both spatial and temporal correlation, the reported methods are only valid for linear systems. In this paper, we use a powerful mathematical tool, called polynomial chaos, which enables not only the orthogonal decomposition of random processes, but also the propagation of random processes through nonlinear systems with difficult constructs such as multiplications, divisions and conditionals. We show that when applied to interesting nonlinear applications such as adaptive filters, polynomial filters and rational filters, this method can produce complete, accurate statistics of each internal variable, thereby allowing the synthesis of bitwidth with the desired tradeoff between circuit performance and signal-to-noise ratio.

show abstract

FRIDGE: an interactive code generation environment for HW/SW codesign

Cited by 26 publications

References 2 publications

Fast performance evaluation of fixed-point systems with un-smooth operators

Fast performance evaluation of fixed-point systems with un-smooth operators

Accelerated Performance Evaluation of Fixed-Point Systems With Un-Smooth Operations

Dynamic range estimation for nonlinear systems

Contact Info

Product

Resources

About