Sciweavers

758 search results - page 15 / 152
» Timing Analysis of Optimised Code
Sort
View
WCET
2003
13 years 11 months ago
Fully Automatic, Parametric Worst-Case Execution Time Analysis
Worst-Case Execution Time (WCET) analysis means to compute a safe upper bound to the execution time of a piece of code. Parametric WCET analysis yields symbolic upper bounds: expr...
Björn Lisper
GLOBECOM
2009
IEEE
14 years 1 months ago
Near-Shannon-Limit Linear-Time-Encodable Nonbinary Irregular LDPC Codes
—In this paper, we present a novel method to construct nonbinary irregular LDPC codes whose parity check matrix has only column weights of 2 and t, where t ≥ 3. The constructed...
Jie Huang, Shengli Zhou, Peter Willett
TIT
2008
129views more  TIT 2008»
13 years 9 months ago
Serial Schedules for Belief-Propagation: Analysis of Convergence Time
Abstract--Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation algorithm over the factor graph of the code. In the traditional messa...
Jacob Goldberger, Haggai Kfir
MASCOTS
2007
13 years 11 months ago
PEPA Analysis of MAP Effects in Hierarchical Mobile IPv6
—To overcome the drawbacks of the Mobile IPv6 protocol on handling local mobility management, IETF proposed the HMIPv6 protocol which introduces an intermediate mobility anchor p...
Hao Wang, David I. Laurenson, Jane Hillston
CORR
2007
Springer
63views Education» more  CORR 2007»
13 years 10 months ago
Four-Group Decodable Space-Time Block Codes
— A class of rate-one space-time block codes (STBC) allowing the decoding of transmitted symbols into four groups is recently proposed by Yuen, Guan and Tjhung. This code is call...
Dung Ngoc Dao, Chau Yuen, Chintha Tellambura, Yong...