A New Joint Source-Channel Coding Scheme Based on Nested Lattice Codes

Yang, Zheng; Zhao, Shancheng; Ma, Xiao; Bai, Baoming

doi:10.1109/lcomm.2012.031912.120151

Cited by 7 publications

(4 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to provide error resilient source transmission, a vast number of schemes are proposed in literature under the category of joint source-channel coding (JSCC) [10][11][12][13][14][15][16][17][18]. A comprehensive survey of such schemes aiming towards robust transmission of images can be found in [19][20][21][22][23][24] and references therein.…”

Section: Introductionmentioning

confidence: 99%

Efficient Quantization with Linear Index Coding for Deep‐Space Images

Mahmood

Wang

Huang

2018

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Due to inevitable propagation delay involved in deep-space communication systems, very high cost is associated with the retransmission of erroneous segments. Quantization with linear index coding (QLIC) scheme is known to provide compression along with robust transmission of deep-space images, and thus the likelihood of retransmissions is significantly reduced. This paper aims to improve its spectral efficiency as well as robustness. First, multiple quantization refinement levels per transmitted source block of QLIC are proposed to increase spectral efficiency. Then, iterative multipass decoding is introduced to jointly decode the subsource symbol-planes. It achieves better PSNR of the reconstructed image as compared to the baseline one-pass decoding approach of QLIC.

show abstract

Section: Introductionmentioning

confidence: 99%

Efficient Quantization with Linear Index Coding for Deep‐Space Images

Mahmood

Wang

Huang

2018

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

show abstract

“…• BMST-RUN codes can be defined over signal sets of any size, such as 3-ary pulse amplitude modulation (3-PAM) and 5-PAM, which can be useful to transmit real samples directly [20].…”

Section: Introductionmentioning

confidence: 99%

Block Markov Superposition Transmission of RUN Codes

Liang

Bai

2016

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

In this paper, we propose a simple procedure to construct (decodable) good codes with any given alphabet (of moderate size) for any given (rational) code rate to achieve any given target error performance (of interest) over additive white Gaussian noise (AWGN) channels. We start with constructing codes over groups for any given code rates. This can be done in an extremely simple way if we ignore the error performance requirement for the time being. Actually, this can be satisfied by repetition (R) codes and uncoded (UN) transmission along with time-sharing technique. The resulting codes are simply referred to as RUN codes for convenience. The encoding/decoding algorithms for RUN codes are almost trivial. In addition, the performance can be easily analyzed. It is not difficult to imagine that a RUN code usually performs far away from the corresponding Shannon limit. Fortunately, the performance can be improved as required by spatially coupling the RUN codes via block Markov superposition transmission (BMST), resulting in the BMST-RUN codes. Simulation results show that the BMST-RUN codes perform well (within one dB away from Shannon limits) for a wide range of code rates and outperform the BMST with bit-interleaved coded modulation (BMST-BICM) scheme.

show abstract

“…One simple but inefficient approach to this issue is to add redundant bits intentionally in the entropy coding stage to detect the erroneous bits or to prevent error propagation. In [21], a different approach was proposed based on the concatenation of VQ and systematic rateless LDPC codes over groups. A scheme similar to that of [21] was proposed in [22] for image transmission in deep-space applications.…”

Section: Introductionmentioning

confidence: 99%

“…In [21], a different approach was proposed based on the concatenation of VQ and systematic rateless LDPC codes over groups. A scheme similar to that of [21] was proposed in [22] for image transmission in deep-space applications.…”

Section: Introductionmentioning

confidence: 99%

Partially Block Markov Superposition Transmission of a Gaussian Source With Nested Lattice Codes

Zhao

2016

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

This paper studies the transmission of Gaussian sources through additive white Gaussian noise (AWGN) channels in bandwidth expansion regime, i.e., the channel bandwidth is greater than the source bandwidth. To mitigate the error propagation phenomenon of conventional digital transmission schemes, we propose in this paper a new capacity-approaching joint source channel coding (JSCC) scheme based on partially block Markov superposition transmission (BMST) of nested lattice codes. In the proposed scheme, first, the Gaussian source sequence is discretized by a lattice-based quantizer, resulting in a sequence of lattice points. Second, these lattice points are encoded by a short systematic group code.Third, the coded sequence is partitioned into blocks of equal length and then transmitted in the BMST manner. Main characteristics of the proposed JSCC scheme include: 1) Entropy coding is not used explicitly. 2) Only parity-check sequence is superimposed, hence, termed partially BMST (PBMST). This is different from the original BMST. To show the superior performance of the proposed scheme, we present extensive simulation results which show that the proposed scheme performs within 1.0 dB of the Shannon limits. Hence, the proposed scheme provides an attractive candidate for transmission of Gaussian sources. Index TermsGaussian sources, joint source channel coding, nested lattice codes, partially block Markov superposition transmission.Shancheng Zhao is with the College

show abstract

A New Joint Source-Channel Coding Scheme Based on Nested Lattice Codes

Cited by 7 publications

References 16 publications

Efficient Quantization with Linear Index Coding for Deep‐Space Images

Efficient Quantization with Linear Index Coding for Deep‐Space Images

Block Markov Superposition Transmission of RUN Codes

Partially Block Markov Superposition Transmission of a Gaussian Source With Nested Lattice Codes

Contact Info

Product

Resources

About