Sciweavers

3373 search results - page 184 / 675
» Linear transformations on codes
Sort
View
141
Voted
CORR
2006
Springer
100views Education» more  CORR 2006»
15 years 3 months ago
Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels
This paper describes an efficient implementation of binning for decode-and-forward (DF) in relay channels using lowdensity parity-check (LDPC) codes. Bilayer LDPC codes are devised...
Peyman Razaghi, Wei Yu
143
Voted
CC
2006
Springer
124views System Software» more  CC 2006»
15 years 7 months ago
Polyhedral Code Generation in the Real World
The polyhedral model is known to be a powerful framework to reason about high level loop transformations. Recent developments in optimizing compilers broke some generally accepted ...
Nicolas Vasilache, Cédric Bastoul, Albert C...
120
Voted
PPAM
2007
Springer
15 years 9 months ago
New Data Structures for Matrices and Specialized Inner Kernels: Low Overhead for High Performance
Dense linear algebra codes are often expressed and coded in terms of BLAS calls. This approach, however, achieves suboptimal performance due to the overheads associated to such cal...
José R. Herrero
120
Voted
GECCO
2008
Springer
119views Optimization» more  GECCO 2008»
15 years 4 months ago
Evolutionary synthesis of low-sensitivity equalizers using adjacency matrix representation
An evolutionary synthesis method to design low-sensitivity IIR filters with linear phase in the passband is presented. The method uses a chromosome coding scheme based on the grap...
Leonardo Bruno de Sá, Antonio Carneiro Mesq...
169
Voted
SSC
2007
Springer
192views Cryptology» more  SSC 2007»
15 years 9 months ago
On Boolean Functions Which Are Bent and Negabent
Bent functions f : Fm 2 → F2 achieve largest distance to all linear functions. Equivalently, their spectrum with respect to the Hadamard-Walsh transform is flat (i.e. all spectr...
Matthew G. Parker, Alexander Pott