Multi-Class Source-Channel Coding

@article{Bocharova2016MultiClassSC,
  title={Multi-Class Source-Channel Coding},
  author={Irina E. Bocharova and Albert Guill{\'e}n i F{\`a}bregas and Boris D. Kudryashov and Alfonso Martinez and Adri{\`a} Tauste Campo and Gonzalo Vazquez-Vilar},
  journal={IEEE Transactions on Information Theory},
  year={2016},
  volume={62},
  pages={5093-5104}
}
This paper studies an almost-lossless source-channel coding scheme in which source messages are assigned to different classes and encoded with a channel code that depends on the class index. The code performance is analyzed by means of random-coding error exponents and validated by simulation of a low-complexity implementation using existing source and channel codes. While each class code can be seen as a concatenation of a source code and a channel code, the overall performance improves on… 

Figures and Tables from this paper

Second-order coding rate for m-class source-channel codes

Numerical results for the BSC are obtained and it is shown, empirically, that the second-order coding rate of source-channel codes with m levels of UMP approaches the optimal joint source- channel coding rate as m grows.

Joint source channel coding with MC-CDMA in capacity approach

  • Surajit DekaK. K. Sarma
  • Business, Computer Science
    2017 4th International Conference on Signal Processing and Integrated Networks (SPIN)
  • 2017
Through integrity check and receiver control mechanism, the system is able to subscribe to a desired broadcast session and result in a capacity which is nearly equals to the upper bound of the ratio CH where C is the channel capacity and H is the entropy of the source.

Joint Source Channel Coding with MIMO MC-CDMA for Efficient Communication

  • Surajit DekaK. K. Sarma
  • Business
    2019 2nd International Conference on Innovations in Electronics, Signal Processing and Communication (IESC)
  • 2019
This paper analyzes the performance of MC-CDMA techniques with JSCC in 2*2 MIMO set-up which reduce the data loss during recovery and increase the channel capacity.

Source coding with side information for binary memoryless sources

In this paper, we study a classical problem of source coding with side information available at the decoder. This problem is known as the Wyner-Ahlswede-Korner (WAK) problem. Nowadays, the interest

Error Probability Bounds for Gaussian Channels Under Maximal and Average Power Constraints

New lower bounds are presented for the minimum error probability of codes satisfying maximal and average power constraints, tighter than previous results in the finite blocklength regime, and yield a better understanding on the structure of good codes under an average power limitation.

Joint Optimization of Protograph LDPC Code Pair for Joint Source and Channel Coding

An optimal design criterion of this double protograph low-density parity-check code based on an extended curve-fitting algorithm is proposed and a joint optimization procedure which searches for both the optimal decoding threshold and the optimal code pair is presented.

References

SHOWING 1-10 OF 40 REFERENCES

Source-channel coding with multiple classes

The performance of this source-channel coding scheme in which source messages are assigned to classes and encoded using a channel code that depends on the class index is studied and validated by simulation of a low-complexity implementation using existing source and channel codes.

Low-complexity fixed-to-fixed joint source-channel coding

A low-complexity implementation with two quasi-cyclic LDPC codes with belief-propagation decoding achieves a better frame error rate than optimized separate coding and the coding gain obtained by simulation is consistent with the theoretical gain.

A Derivation of the Source-Channel Error Exponent Using Nonidentical Product Distributions

For discrete memoryless systems, two optimally chosen classes and product distributions are found to be sufficient to attain the sphere-packing exponent in those cases where it is tight.

The dispersion of joint source-channel coding

  • Da WangA. IngberY. Kochman
  • Computer Science
    2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2011
In this work we investigate the behavior of the distortion threshold that can be guaranteed in joint source-channel coding, to within a prescribed excess-distortion probability. We show that the gap

The turbo principle in joint source channel decoding of variable length codes

  • J. HagenauerR. Bauer
  • Computer Science, Business
    Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)
  • 2001
The turbo principle can be extended to a communication scheme where a variable length code is used for data compression followed by a channel code to protect the data against channel errors.

Joint Source and Channel Coding

It is shown that in general there is an inherent and significant loss of optimality if a joint source/channel linear encoder is used when the goal is relaxed to reproduction of the source within some specified non-negligible distortion.

Source-controlled channel decoding

  • J. Hagenauer
  • Computer Science
    Proceedings of 1994 IEEE International Symposium on Information Theory
  • 1994
It is shown that soft-outputs and bit correlations can be converted into a priori values for the next frame and used by a modified Viterbi algorithm, the APRI-SOVA, used by the mobile GSM coding scheme and PCM transmission schemes.

Joint Source and Channel Coding

A double low-density parity-check (LDPC) code for JSC coding is proposed and its limiting performance is analyzed by using extrinsic information transfer (EXIT) chart approximations.

On mismatched unequal message protection for finite block length joint source-channel coding

A finite block length bound is derived that characterizes the performance of a JSCC constructed from a UMP code not perfectly matched to the source and is evaluated for a binary memoryless source transmitted over a binary symmetric channel.

Joint source/channel coding and MAP decoding of arithmetic codes

A novel maximum a posteriori (MAP) estimation approach is employed for error correction of arithmetic codes with a forbidden symbol, which improves the performance in terms of error correction with respect to a separated source and channel coding approach based on convolutional codes.