نتایج جستجو برای: slepian

تعداد نتایج: 437  

2001
Qian Zhao Michelle Effros

A multiple access source code (MASC) is a source code designed for the following network configuration: a pair of correlated information sequences {Xi}lm_, and {x}lm_, is drawn i.i.d. according to joint probability mass function (p.m.f.) p ( z , y); the encoder for each source operates without knowledge of the other source; the decoder jointly decodes the encoded bit streams from both sources. ...

Journal: :CoRR 2007
Marco Grangetto Enrico Magli Gabriella Olmo

Distributed source coding schemes are typically based on the use of channels codes as source codes. In this paper we propose a new paradigm, termed “distributed arithmetic coding”, which exploits the fact that arithmetic codes are good source as well as channel codes. In particular, we propose a distributed binary arithmetic coder for Slepian-Wolf coding with decoder side information, along wit...

Journal: :CoRR 2010
Bingbing Zheng Ling-ge Jiang Chen He Qingchuan Wang

A three terminal relay system with binary erasure channel (BEC) was considered, in which a source forwarded information to a destination with a relay’s ”assistance”. The nested LDGM (Low-density generator-matrix) -LDPC (lowdensity parity-check) was designed to realize Compress-andforward (CF) at the relay. LDGM coding compressed the received signals losslessly and LDPC realized the binning for ...

Journal: :IEEE Transactions on Information Theory 2005

Journal: :IEEE Transactions on Communications 2013

Journal: :IEEE Trans. Information Theory 2010
Jayanth Nayak Ertem Tuncel Deniz Gündüz

This paper addresses lossy transmission of a common source over a broadcast channel when there is correlated side information at the receivers, with emphasis on the quadratic Gaussian and binary Hamming cases. A digital scheme that combines ideas from the lossless version of the problem, i.e., Slepian-Wolf coding over broadcast channels, and dirty paper coding, is presented and analyzed. This s...

Journal: :IEEE Transactions on Communications 2010

2001
Tomohiko Uyematsu

|Universal coding problem for the system of Slepian and Wolf (the SW-system) has rst been investigated by Csisz ar and Korner. They considered the correlated memoryless sources, and established a universally attainable error exponent as a function of rate pair (R1;R2) that is positive whenever (R1; R2) is an inner point of the admissible rate region of the SW-system, which is speci ed dependin...

2004
Thomas Zemen Christoph F. Mecklenbräuker Joachim Wehinger Ralf R. Müller

We propose an iterative receiver for a multi-carrier (MC) code division multiple access (CDMA) system in the uplink for users moving at vehicular speed. MC-CDMA is based on orthogonal frequency division multiplexing (OFDM), thus time-variant channel estimation can be performed for every subcarrier independently. The variation of a subcarrier over the duration of a data block is upper bounded by...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید