Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

AAECC
2006
Springer

favoriteEmaildiscussreport

74views Algorithms» more AAECC 2006»

Nested Codes for Constrained Memory and for Dirty Paper

13 years 10 months ago

Nested Codes for Constrained Memory and for Dirty Paper

Download www.ii.uib.no

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 some classes of constrained memories, and we explore the binary so-called nested codes, which are used for ecient coding and error-correction on such channels and memories.

Hans Georg Schaathun, Gérard D. Cohen

Real-time Traffic

AAECC 2006 | Algorithms | Dirty Paper | Dirty Paper Coding | So-called Nested Codes |

claim paper

Related Content

» Analysis and Design of Dirty Paper Coding by Transformation of Noise

» An FPGA Implementation of Dirty Paper Precoder

» Memory mapped ECC lowcost error protection for last level caches

» NePalTM design and implementation of nested parallelism for transactional memory systems

» Leveraging parallel nesting in transactional memory

» Automatic code generation for executing tiled nested loops onto parallel architectures

» Studying StorageRecomputation Tradeoffs in MemoryConstrained Embedded Processing

» Supporting nested transactional memory in logTM

» Access PatternBased Code Compression for MemoryConstrained Embedded Systems

Post Info
More Details (n/a)

Added	13 Jun 2010
Updated	13 Jun 2010
Type	Conference
Year	2006
Where	AAECC
Authors	Hans Georg Schaathun, Gérard D. Cohen

Comments (0)