To code, or not to code: lossy source-channel communication revisited

Gastpar, Michael; Rimoldi, Bixio; Vetterli, Martin

doi:10.1109/tit.2003.810631

Cited by 448 publications

(378 citation statements)

References 13 publications

Supporting

Mentioning

372

Contrasting

Unclassified

Order By: Relevance

“…Then, dynamic statistical characteristics of this trial and error attempts below the asymptotic boundary will show signatures of criticality: cf. [7,8,22].…”

Section: Criticality and Optimality For Error-correcting Codesmentioning

confidence: 99%

Error-correcting codes and neural networks

Manin

2016

Sel. Math. New Ser.

View full text Add to dashboard Cite

Encoding, transmission and decoding of information are ubiquitous in biology and human history: from DNA transcription to spoken/written languages and languages of sciences. During the last decades, the study of neural networks in brain performing their multiple tasks was providing more and more detailed pictures of (fragments of) this activity. Mathematical models of this multifaceted process led to some fascinating problems about "good codes" in mathematics, engineering, and now biology as well. The notion of "good" or "optimal" codes depends on the technological progress and criteria defining optimality of codes of various types: error-correcting ones, cryptographic ones, noise-resistant ones etc. In this note, I discuss recent suggestions that activity of some neural networks in brain, in particular those responsible for space navigation, can be well approximated by the assumption that these networks produce and use good error-correcting codes. I give mathematical arguments supporting the conjecture that search for optimal codes is built into neural activity and is observable.

show abstract

“…Then, dynamic statistical characteristics of this trial and error attempts below the asymptotic boundary will show signatures of criticality: cf. [7,8,22].…”

Section: Criticality and Optimality For Error-correcting Codesmentioning

confidence: 99%

Error-correcting codes and neural networks

Manin

2016

Sel. Math. New Ser.

View full text Add to dashboard Cite

show abstract

“…This critical observation leads us to conjecture that a deeper connection exists between scheduler design and spectral analysis. The "matching" of sources and channels at the bit/signal level has been considered [50] to optimize performance. Our results indicate that similar matchings between traffic arrivals and the fading process occur at the packet level.…”

Section: ) Empirical Propertiesmentioning

confidence: 99%

Power Efficient Delay Allocation in Multihop Wireless Networks

Rajan

2007

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Abstract-In this paper, we present delay allocation strategies that minimize the total transmit power in a multihop wireless network. The focus is on guaranteeing an end-to-end average delay bound for a single variable-bit-rate flow on a multihop fading channel. We first compute an analytical approximation for the transmit power that is required to send a variable-bit-rate source over a finite-state fading channel. We then use this approximation to derive a low-complexity and near-optimal delay allocation method for multihop networks when the fading processes on the multiple hops are independent. Properties of the optimal delay allocation are also studied; in the special case of a Gaussian network, the optimal delay allocation strategy is completely characterized. The tradeoff between single-hop transmission and multihop transmission is studied under an end-to-end delay constraint.

show abstract

“…For multi-terminal systems, tandem coding is no longer optimal; a joint source-channel coding (JSCC) scheme may be required to achieve optimality. One simple scenario where tandem scheme is suboptimal concerns the broadcast of Gaussian sources over Gaussian channels [1].…”

Section: Introductionmentioning

confidence: 99%

“…For a single Gaussian source sent over a Gaussian broadcast channel with matched source-channel bandwidth, the distortion region is known, and can be realized by a linear scheme [1]. For mismatched source-channel bandwidth, the best known coding schemes are based on JSCC with hybrid signalling [2]- [5].…”

Section: Introductionmentioning

confidence: 99%

Hybrid digital-analog coding for interference broadcast channels

Saleh

Alajaji

Chan

2013

2013 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

Abstract-We consider the transmission of bivariate Gaussian sources (V1, V2) over the two-user Gaussian broadcast channel in the presence of interference that is correlated to the source and known to the transmitter. Each user i is interested in estimating V i . We study hybrid digital-analog (HDA) schemes and analyze the achievable (square-error) distortion region under matched and expansion bandwidth regimes. These schemes require proper combinations of power splitting, bandwidth splitting, rate splitting, Wyner-Ziv and HDA Costa coding. An outer bound on the distortion region is also derived by assuming knowledge of V1 at the second user and full/partial knowledge of the interference at both users. Numerical results show that the HDA schemes outperform tandem and linear schemes and perform close to the derived bound for certain system settings.

show abstract

To code, or not to code: lossy source-channel communication revisited

Cited by 448 publications

References 13 publications

Error-correcting codes and neural networks

Error-correcting codes and neural networks

Power Efficient Delay Allocation in Multihop Wireless Networks

Hybrid digital-analog coding for interference broadcast channels

Contact Info

Product

Resources

About