نتایج جستجو برای: fixedpoint

تعداد نتایج: 180  

2004
Abdelsalam Heddaya Kihong Park

For communication-intensive parallel applications, the max imum degree of concurrency achievable i s limited by the communication throughput made available by the network. In previous work [lo], we showed experimentally that the performance of certain parallel applications running o n a workstation network can be improved significantly if a congestion control protocol i s used t o enhance netwo...

2003
Behzad Akbarpour Sofiène Tahar

SystemC is a new C-based system level design language whose ultimate objective is to enable System-on-a-Chip (SoC) design and verification. Fixed-point design based on the SystemC data types is rapidly becoming the standard for optimizing DSP systems. In this paper, we propose to create a formalization of SystemC fixed-point arithmetic in the HOL theorem proving environment. The SystemC fixedpo...

2015
Jingfei Jiang Rongdong Hu Fei Zhang Yong Dou

The Sparse Coding (SC) model has been proved to be among the best neural networks which are mainly used in unsupervised feature learning for many applications. Running a sparse coding algorithm is a time-consuming task due to its large scale and processing characteristics, which naturally leads to investigating FPGA acceleration. Fixed-point arithmetic can be used when implementing SC in FPGAs ...

2013
Susmit Jha Sanjit A. Seshia

In this paper, we present an automated technique swati: Synthesizing Wordlengths Automatically Using Testing and Induction, which uses a combination of Nelder-Mead optimization based testing, and induction from examples to automatically synthesize optimal fixedpoint implementation of numerical routines. The design of numerical software is commonly done using floating-point arithmetic in design-...

Journal: :CoRR 2014
Adrian J. Chung Kathryn Cobden Mark Jervis Martin Langhammer Bogdan Pasca

In order for FPGAs to be successful outside traditional markets, tools which enable software programmers to achieve high levels of system performance while abstracting away the FPGA-specific details are needed. DSPB Builder Advanced (DSPBA) is one such tool. DSPBA provides model-based design environment using Matlab’s Simulink frontend that decouples the fully-algorithmic design description fro...

2006
Roberto Costantini Luciano Sbaiz Sabine Süsstrunk

Videos representing smoke, flames, flowing water, moving grass, and so on, show a periodic repetition of some basic pattern. The periodicity is not perfect, since each video frame is actually different from the others, but it is enough to perceive a certain regularity, so that these videos are referred as to dynamic textures. Recently, one method based on linear dynamic system theory was propos...

2009
Eduardo Pinheiro Octavian Postolache Pedro Girão

− Many studies have been developed aiming to improve digital filters realizations, recurring to intricate structures and analysing the error ́s behaviour. The work presented in this paper analyses the feasibility of fixedpoint implementation of classical IIR notch filters (Butterworth, Chebyshev, Bessel and elliptic), and also the effect of the quality factor and normalized cut-off frequency in ...

2009
Dilian Gurov Marieke Huisman

There is an intimate link between program structure and behaviour. Exploiting this link to phrase program correctness problems in terms of the structural properties of a program graph rather than in terms of its unfoldings is a useful strategy for making analyses more tractable. The present paper presents a characterisation of behavioural program properties through sets of structural properties...

2007
M. Möller

A new generalization of the flux-corrected transport (FCT) methodology to implicit finite element discretizations is proposed. The underlying high-order scheme is supposed to be unconditionally stable and produce time-accurate solutions to evolutionary convection problems. Its nonoscillatory low-order counterpart is constructed by means of mass lumping followed by elimination of negative off-di...

Journal: :Queueing Syst. 2011
Carl Graham Philippe Robert

A Markovian model of the evolution of intermittent connections of various classes in a communication network is established and investigated. Any connection evolves in a way which depends only on its class and the state of the network, in particular as to the route it uses among a subset of the network nodes. It can be either active (ON) when it is transmitting data along its route, or idle (OF...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید