Sparse approximations for joint source-channel coding

This paper considers the application of sparse approximations in a joint source-channel (JSC) coding framework. The considered JSC coded system employs a real number BCH code on the input signal before the signal is quantized and further processed. Under an impulse channel noise model, the decoding of error is posed as a sparse approximation problem. The orthogonal matching pursuit (OMP) and basis pursuit (BP) algorithms are compared with the syndrome decoding algorithm in terms of mean square reconstruction error. It is seen that, with a Gauss-Markov source and Bernoulli-Gaussian channel noise, the BP outperforms the syndrome decoding and the OMP at higher noise levels. In the case of image transmission with channel bit errors, the BP outperforms the other two decoding algorithms consistently.

[1]  T. Marshall,et al.  Coding of Real-Number Sequences for Error Correction: A Digital Signal Processing Problem , 1984, IEEE J. Sel. Areas Commun..

[2]  Y. C. Pati,et al.  Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.

[3]  Paulo Jorge S. G. Ferreira,et al.  Locating and correcting errors in images , 1997, Proceedings of International Conference on Image Processing.

[4]  Richard E. Blahut.  Algebraic Methods for Signal Processing and Communications Coding , 1991 .

[5]  D. Donoho,et al.  Atomic Decomposition by Basis Pursuit , 2001 .

[6]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[7]  Olivier Rioul,et al.  Spectral interpolation coder for impulse noise cancellation over a binary symetric channel , 2000, 2000 10th European Signal Processing Conference.

[8]  Farrokh Marvasti,et al.  Efficient algorithms for burst error recovery using FFT and other transform kernels , 1999, IEEE Trans. Signal Process..

[9]  Stéphane Mallat,et al.  Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..

[10]  Rolf Johannesson,et al.  Algebraic methods for signal processing and communications coding , 1995 .

[11]  Vivek K. Goyal,et al.  Quantized frame expansions as source-channel codes for erasure channels , 1999, Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096).

[12]  Jean-Jacques Fuchs,et al.  Recovery of exact sparse representations in the presence of bounded noise , 2005, IEEE Transactions on Information Theory.

[13]  Christine Guillemot,et al.  Subspace algorithms for error localization with quantized DFT codes , 2004, IEEE Transactions on Communications.

[14]  Christine Guillemot,et al.  Characterization of a Class of Error Correcting Frames for Robust Signal Transmission over Wireless Communication Channels , 2005, EURASIP J. Adv. Signal Process..

[15]  Jelena Kovacevic,et al.  Quantized frame expansions in a wireless environment , 2002, Proceedings DCC 2002. Data Compression Conference.

[16]  D. Donoho.  For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution , 2006 .