Shannon-kotel-nikov mappings in joint source-channel coding

Hekland, F.; Floor, Pål Anders; Ramstad, T.A.

doi:10.1109/tcomm.2009.0901.070075

Cited by 155 publications

(182 citation statements)

References 22 publications

Supporting

Mentioning

181

Contrasting

Order By: Relevance

“…Next, we compare the baker's map code with optimum performance theoretically attainable (OPTA) and existing analog coding schemes in literature [12][13][14]. OPTA can be obtained by equating the rate distortion function with the channel capacity.…”

Section: Simulation Results and Discussionmentioning

confidence: 99%

“…Vaishampayan and Costa [10] propose a class of analog dynamic systems constructed by first-order derivative equations, which generate algebraic analog codes on torus or sphere. Cai and Modestino [11], Hekland et al [12], and Floor and Ramstad [13] study the design of the Shannon-Kotel'nikov curve. The minimum mean square error decoding schemes for the Shannon-Kotel'nikov analog codes and their modified version combined with hybrid digital signals are discussed in [14,15].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A family of chaotic pure analog coding schemes based on baker’s map function

Liu

et al. 2015

EURASIP J. Adv. Signal Process.

View full text Add to dashboard Cite

This paper considers a family of pure analog coding schemes constructed from dynamic systems which are governed by chaotic functions-baker's map function and its variants. Various decoding methods, including maximum likelihood (ML), minimum mean square error (MMSE), and mixed ML-MMSE decoding algorithms, have been developed for these novel encoding schemes. The proposed mirrored baker's and single-input baker's analog codes perform a balanced protection against the fold error (large distortion) and weak distortion and outperform the classical chaotic analog coding and analog joint source-channel coding schemes in literature. Compared to the conventional digital communication system, where quantization and digital error correction codes are used, the proposed analog coding system has graceful performance evolution, low decoding latency, and no quantization noise. Numerical results show that under the same bandwidth expansion, the proposed analog system outperforms the digital ones over a wide signal-to-noise (SNR) range.

show abstract

Section: Simulation Results and Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A family of chaotic pure analog coding schemes based on baker’s map function

Liu

et al. 2015

EURASIP J. Adv. Signal Process.

View full text Add to dashboard Cite

show abstract

“…Figure 6 presents the resulting performance when either ML or MMSE decoding is applied and three types of encoders are considered: i) spiral-like curves as defined in (1), ii) deformed spiral-like curves (2), which in [10] were shown to present good performance for high SNR and ML decoding, and iii) transformation block (from Laplacian to Gaussian) followed by a spiral-like curve, also proposed in [10]. As explained in section 2.1, the reason for applying this transformation is to take advantage of the good performance that spiral-like curves produce for Gaussian sources.…”

Section: Simulation Resultsmentioning

confidence: 99%

Analog Joint Source Channel Coding Using Space-Filling Curves and MMSE Decoding

Garcia-Frías

Lamarca

2009

2009 Data Compression Conference

View full text Add to dashboard Cite

show abstract

“…Notice that when the encodermodulator tandem is properly designed to ensure that no errors occur during the transmission, the distortion after decoding the received signal is given by the quantization error in (5). In this situation, the distortion observed by a receiver rx that is able to decode the first l layers is ξ rx = D l and, hence, the number of quantization bits for each layer l can be determined from the distortion requirements of each area to satisfy that D l ≤ l .…”

Section: A Digital Layersmentioning

confidence: 99%

Hybrid digital-analog joint source channel coding for broadcast multiresolution communications

Fresnedo

Suárez-Casal

Castedo

et al. 2017

2017 25th European Signal Processing Conference (EUSIPCO)

View full text Add to dashboard Cite

Abstract-Multilayer coding represents an appealing solution for the broadcasting of common data when we want to ensure the receivers decode the signal with different distortion levels depending on the quality of the received signal. In addition, the combination of digital and analog techniques to encode the source data allows to solve the limitation of these approaches when they are applied separately. In this work, we consider a Hybrid Digital-Analog (HDA) multilayer system where the digital layers are employed to satisfy different Quality of Service (QoS) requirements and an analog layer refines the estimates of the source symbols. The resulting scheme provides good performance for different expansion factors and number of layers, and it also presents good scaling for all SNR values.

show abstract

Shannon-kotel-nikov mappings in joint source-channel coding

Cited by 155 publications

References 22 publications

A family of chaotic pure analog coding schemes based on baker’s map function

A family of chaotic pure analog coding schemes based on baker’s map function

Analog Joint Source Channel Coding Using Space-Filling Curves and MMSE Decoding

Hybrid digital-analog joint source channel coding for broadcast multiresolution communications

Contact Info

Product

Resources

About