Sciweavers

462 search results - page 21 / 93
» Symbolic Bounded Synthesis
Sort
View
TCOM
2010
80views more  TCOM 2010»
15 years 7 days ago
Near optimal training sequences for low complexity symbol timing estimation in MIMO systems
—Training sequences for data-aided timing estimation in multi-input multi-output systems are designed. It is observed that for low complexity implementation, the sequences must n...
Ketan Rajawat, Ajit K. Chaturvedi
127
Voted
CODES
2005
IEEE
15 years 7 months ago
Conflict analysis in multiprocess synthesis for optimized system integration
This paper presents a novel approach for multiprocess synthesis supporting well-tailored module integration at system level. The goal is to extend the local scope of existing arch...
Oliver Bringmann, Wolfgang Rosenstiel, Axel Sieben...
123
Voted
DAC
2012
ACM
13 years 4 months ago
A metric for layout-friendly microarchitecture optimization in high-level synthesis
In this work we address the problem of managing interconnect timing in high-level synthesis by generating a layoutfriendly microarchitecture. A metric called spreading score is pr...
Jason Cong, Bin Liu
126
Voted
PLDI
2004
ACM
15 years 7 months ago
Symbolic pointer analysis revisited
Pointer analysis is a critical problem in optimizing compiler, parallelizing compiler, software engineering and most recently, hardware synthesis. While recent efforts have sugges...
Jianwen Zhu, Silvian Calman
GECCO
2008
Springer
175views Optimization» more  GECCO 2008»
15 years 2 months ago
Using differential evolution for symbolic regression and numerical constant creation
One problem that has plagued Genetic Programming (GP) and its derivatives is numerical constant creation. Given a mathematical formula expressed as a tree structure, the leaf node...
Brian M. Cerny, Peter C. Nelson, Chi Zhou