Sciweavers

363 search results - page 7 / 73
» Code Generation for Polynomial Multiplication
Sort
View
ICC
2008
IEEE
14 years 1 months ago
Repeat Accumulate code Division Multiple Access and its Hybrid Detection
— In this paper, we propose the novel concept of Repeat Accumulate Code Division Multiple Access (RA-CDMA), which employs unique, user-specific channel code generator matrices (...
Rong Zhang, Lei Xu, Sheng Chen, Lajos Hanzo
CC
2008
Springer
123views System Software» more  CC 2008»
13 years 9 months ago
Automatic Transformation of Bit-Level C Code to Support Multiple Equivalent Data Layouts
Portable low-level C programs must often support multiple equivalent in-memory layouts of data, due to the byte or bit order of the compiler, architecture, or external data formats...
Marius Nita, Dan Grossman
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 7 months ago
Generating Random Graphs with Large Girth
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...
Mohsen Bayati, Andrea Montanari, Amin Saberi
ICCAD
2004
IEEE
121views Hardware» more  ICCAD 2004»
14 years 4 months ago
Factoring and eliminating common subexpressions in polynomial expressions
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...
Anup Hosangadi, Farzan Fallah, Ryan Kastner
HYBRID
2010
Springer
14 years 2 months ago
Automatic invariant generation for hybrid systems using ideal fixed points
We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differentia...
Sriram Sankaranarayanan