Sciweavers

7189 search results - page 177 / 1438
» Connecting Design with Code
Sort
View
CORR
2007
Springer
60views Education» more  CORR 2007»
15 years 3 months ago
On Minimal Tree Realizations of Linear Codes
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization,...
Navin Kashyap
VTC
2006
IEEE
15 years 9 months ago
IQ Space Frequency Time Codes for MIMO-OFDM Systems
Abstract: In this paper, we study concatenated coding for MIMOOFDM systems. The proposed concatenated system achieves full spatial and frequency diversity at much lower complexity ...
Samir Al-Ghadhban, R. Michael Buehrer, Brian D. Wo...
ASPDAC
2011
ACM
157views Hardware» more  ASPDAC 2011»
14 years 7 months ago
Facilitating unreachable code diagnosis and debugging
— Code coverage is a popular method to find design bugs and verification loopholes. However, once a piece of code is determined to be unreachable, diagnosing the cause of the p...
Hong-Zu Chou, Kai-Hui Chang, Sy-Yen Kuo
CASES
2008
ACM
15 years 5 months ago
Efficient code caching to improve performance and energy consumption for java applications
Java applications rely on Just-In-Time (JIT) compilers or adaptive compilers to generate and optimize binary code at runtime to boost performance. In conventional Java Virtual Mac...
Yu Sun, Wei Zhang
COMPGEOM
2006
ACM
15 years 9 months ago
Optimal succinct representations of planar maps
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
Luca Castelli Aleardi, Olivier Devillers, Gilles S...