Sciweavers

61 search results - page 1 / 13
» Nested Codes for Constrained Memory and for Dirty Paper
Sort
View
AAECC
2006
Springer
74views Algorithms» more  AAECC 2006»
13 years 11 months ago
Nested Codes for Constrained Memory and for Dirty Paper
Abstract Dirty paper coding are relevant for wireless networks, multiuser channels, and digital watermarking. We show that the problem of dirty paper is essentially equivalent to s...
Hans Georg Schaathun, Gérard D. Cohen
VTC
2007
IEEE
106views Communications» more  VTC 2007»
13 years 11 months ago
Analysis and Design of Dirty Paper Coding by Transformation of Noise
— We design a coding scheme for Costa’s dirty paper coding (DPC) [6] using a channel and a shaping code. We show that by transforming the channel noise distribution the DPC cha...
Young-Seung Lee, Sae-Young Chung
ICC
2007
IEEE
114views Communications» more  ICC 2007»
13 years 11 months ago
An FPGA Implementation of Dirty Paper Precoder
—Dirty paper code (DPC) can be used in a number of communication network applications; broadcast channels, multiuser interference channels and ISI channels to name a few. We stud...
Pankaj Bhagawat, Weihuang Wang, Momin Uppal, Gwan ...
ISCA
2009
IEEE
148views Hardware» more  ISCA 2009»
13 years 12 months ago
Memory mapped ECC: low-cost error protection for last level caches
This paper presents a novel technique, Memory Mapped ECC, which reduces the cost of providing error correction for SRAM caches. It is important to limit such overheads as processo...
Doe Hyun Yoon, Mattan Erez
PPOPP
2009
ACM
14 years 50 min ago
NePalTM: design and implementation of nested parallelism for transactional memory systems
Abstract. Transactional memory (TM) promises to simplify construction of parallel applications by allowing programmers to reason about interactions between concurrently executing c...
Haris Volos, Adam Welc, Ali-Reza Adl-Tabatabai, Ta...